TSTP Solution File: SWC397-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC397-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:58 EDT 2023
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 56 ( 24 unt; 6 nHn; 56 RR)
% Number of literals : 131 ( 28 equ; 76 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_6) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_10) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_5) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',clause71) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_11) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',clause8) ).
cnf(co1_12,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_12) ).
cnf(co1_13,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_13) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',clause120) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',clause140) ).
cnf(co1_14,negated_conjecture,
( app(sk7,cons(sk6,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_14) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',clause161) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',co1_9) ).
cnf(clause175,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',clause175) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p',clause86) ).
cnf(c_0_19,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_10 ).
cnf(c_0_23,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_26,negated_conjecture,
( memberP(nil,sk5)
| sk4 != nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_28,negated_conjecture,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_29,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_30,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_34,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk3
| ~ neq(sk4,nil) ),
co1_13 ).
cnf(c_0_35,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_36,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_38,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_39,negated_conjecture,
( app(sk7,cons(sk6,nil)) = sk4
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_40,negated_conjecture,
( cons(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
( memberP(sk4,X1)
| ~ neq(sk4,nil)
| ~ memberP(sk7,X1)
| ~ ssItem(X1)
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37])]) ).
cnf(c_0_42,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_43,negated_conjecture,
cons(sk6,sk7) = sk3,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_44,negated_conjecture,
( memberP(sk4,X1)
| ~ memberP(sk7,X1)
| ~ ssItem(X1)
| ~ ssList(cons(sk6,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_45,negated_conjecture,
( sk6 = X1
| memberP(sk7,X1)
| ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_36]),c_0_37])]) ).
cnf(c_0_46,negated_conjecture,
~ memberP(sk2,sk5),
co1_9 ).
cnf(c_0_47,negated_conjecture,
( sk6 = X1
| memberP(sk4,X1)
| ~ memberP(sk3,X1)
| ~ ssItem(X1)
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_46,c_0_24]) ).
cnf(c_0_49,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
clause175 ).
cnf(c_0_50,negated_conjecture,
( sk6 = sk5
| ~ ssList(cons(sk6,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_21]),c_0_27])]),c_0_48]) ).
cnf(c_0_51,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_52,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_53,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_36]),c_0_31])]) ).
cnf(c_0_54,negated_conjecture,
~ neq(sk4,nil),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_39]),c_0_53]),c_0_53]),c_0_27]),c_0_30]),c_0_31]),c_0_37])]),c_0_48]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_29]),c_0_30]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC397-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 01:20:42 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.uGp4vH57Pj/E---3.1_3811.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # new_bool_3 with pid 3889 completed with status 0
% 0.15/0.45 # Result found by new_bool_3
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.45 # SAT001_MinMin_p005000_rr_RG with pid 3892 completed with status 0
% 0.15/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.45 # Preprocessing time : 0.003 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Unsatisfiable
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 199
% 0.15/0.45 # Removed by relevancy pruning/SinE : 156
% 0.15/0.45 # Initial clauses : 43
% 0.15/0.45 # Removed in clause preprocessing : 0
% 0.15/0.45 # Initial clauses in saturation : 43
% 0.15/0.45 # Processed clauses : 173
% 0.15/0.45 # ...of these trivial : 2
% 0.15/0.45 # ...subsumed : 33
% 0.15/0.45 # ...remaining for further processing : 138
% 0.15/0.45 # Other redundant clauses eliminated : 10
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 22
% 0.15/0.45 # Backward-rewritten : 12
% 0.15/0.45 # Generated clauses : 286
% 0.15/0.45 # ...of the previous two non-redundant : 234
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 1
% 0.15/0.45 # Paramodulations : 273
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 14
% 0.15/0.45 # Total rewrite steps : 325
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 58
% 0.15/0.45 # Positive orientable unit clauses : 11
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 6
% 0.15/0.45 # Non-unit-clauses : 41
% 0.15/0.45 # Current number of unprocessed clauses: 119
% 0.15/0.45 # ...number of literals in the above : 613
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 75
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 664
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 159
% 0.15/0.45 # Non-unit clause-clause subsumptions : 27
% 0.15/0.45 # Unit Clause-clause subsumption calls : 82
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 4
% 0.15/0.45 # BW rewrite match successes : 4
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 7384
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.012 s
% 0.15/0.45 # System time : 0.003 s
% 0.15/0.45 # Total time : 0.015 s
% 0.15/0.45 # Maximum resident set size: 1936 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.015 s
% 0.15/0.45 # System time : 0.006 s
% 0.15/0.45 # Total time : 0.020 s
% 0.15/0.45 # Maximum resident set size: 1852 pages
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------