TSTP Solution File: SWC386-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC386-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:42:54 EDT 2023
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 11 unt; 15 nHn; 38 RR)
% Number of literals : 75 ( 36 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_14,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_6) ).
cnf(co1_10,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_10) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_5) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_7) ).
cnf(co1_9,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_9) ).
cnf(co1_15,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_15) ).
cnf(co1_12,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_12) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',clause115) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',clause8) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',co1_8) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p',clause71) ).
cnf(c_0_12,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
co1_14 ).
cnf(c_0_13,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_14,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 ),
co1_10 ).
cnf(c_0_15,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_16,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_17,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_9 ).
cnf(c_0_18,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_15 ).
cnf(c_0_19,negated_conjecture,
( sk2 = nil
| cons(X1,nil) != sk3
| ~ memberP(sk2,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( sk2 = nil
| memberP(sk2,sk5) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( sk2 = nil
| ssItem(sk5) ),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( cons(sk5,nil) = sk3
| sk2 = nil ),
inference(rw,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_12 ).
cnf(c_0_24,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_25,negated_conjecture,
( neq(sk2,nil)
| sk3 != nil ),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_26,negated_conjecture,
sk2 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( sk3 = nil
| memberP(sk2,sk5) ),
inference(rw,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_28,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( neq(nil,nil)
| sk3 != nil ),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,negated_conjecture,
( sk3 = nil
| memberP(nil,sk5) ),
inference(rw,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_8 ).
cnf(c_0_34,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_35,negated_conjecture,
memberP(nil,sk5),
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SWC386-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:57:29 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.yUgUNp3kaI/E---3.1_23520.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # new_bool_3 with pid 23599 completed with status 0
% 0.17/0.48 # Result found by new_bool_3
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48 # SAT001_MinMin_p005000_rr_RG with pid 23603 completed with status 0
% 0.17/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.17/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48 # Preprocessing time : 0.006 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Unsatisfiable
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 201
% 0.17/0.48 # Removed by relevancy pruning/SinE : 156
% 0.17/0.48 # Initial clauses : 45
% 0.17/0.48 # Removed in clause preprocessing : 0
% 0.17/0.48 # Initial clauses in saturation : 45
% 0.17/0.48 # Processed clauses : 87
% 0.17/0.48 # ...of these trivial : 2
% 0.17/0.48 # ...subsumed : 2
% 0.17/0.48 # ...remaining for further processing : 83
% 0.17/0.48 # Other redundant clauses eliminated : 6
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 1
% 0.17/0.48 # Backward-rewritten : 11
% 0.17/0.48 # Generated clauses : 24
% 0.17/0.48 # ...of the previous two non-redundant : 20
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 3
% 0.17/0.48 # Paramodulations : 16
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 6
% 0.17/0.48 # Total rewrite steps : 41
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 20
% 0.17/0.48 # Positive orientable unit clauses : 8
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 1
% 0.17/0.48 # Non-unit-clauses : 11
% 0.17/0.48 # Current number of unprocessed clauses: 19
% 0.17/0.48 # ...number of literals in the above : 84
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 58
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 415
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 92
% 0.17/0.48 # Non-unit clause-clause subsumptions : 5
% 0.17/0.48 # Unit Clause-clause subsumption calls : 6
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 1
% 0.17/0.48 # BW rewrite match successes : 1
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 3106
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.006 s
% 0.17/0.48 # System time : 0.006 s
% 0.17/0.48 # Total time : 0.012 s
% 0.17/0.48 # Maximum resident set size: 1936 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.009 s
% 0.17/0.48 # System time : 0.009 s
% 0.17/0.48 # Total time : 0.018 s
% 0.17/0.48 # Maximum resident set size: 1852 pages
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------