TSTP Solution File: SWC409-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC409-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:43:02 EDT 2023
% Result : Unsatisfiable 1.19s 0.66s
% Output : CNFRefutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of clauses : 64 ( 24 unt; 23 nHn; 64 RR)
% Number of literals : 162 ( 56 equ; 79 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_7) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',clause120) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_5) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',clause104) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',clause76) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',clause157) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',clause75) ).
cnf(co1_9,negated_conjecture,
memberP(sk2,sk5),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',clause8) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',clause140) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_8) ).
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.pS9lZXHZzq/E---3.1_16148.p',clause175) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_6) ).
cnf(co1_10,negated_conjecture,
~ memberP(sk1,sk5),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_10) ).
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.pS9lZXHZzq/E---3.1_16148.p',clause161) ).
cnf(co1_11,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.pS9lZXHZzq/E---3.1_16148.p',co1_11) ).
cnf(c_0_19,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
co1_7 ).
cnf(c_0_20,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_21,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_22,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_23,negated_conjecture,
( app(X1,cons(X2,nil)) = sk3
| cons(X2,X1) != sk4
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_25,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24])]),c_0_25])]) ).
cnf(c_0_27,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_28,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_29,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_30,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25])]) ).
cnf(c_0_31,plain,
( cons(hd(X1),app(tl(X1),X2)) = app(X1,X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_29]),c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk3
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_25])]) ).
cnf(c_0_33,negated_conjecture,
memberP(sk2,sk5),
co1_9 ).
cnf(c_0_34,negated_conjecture,
( app(sk4,cons(hd(sk4),nil)) = cons(hd(sk4),sk3)
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]) ).
cnf(c_0_35,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_36,axiom,
ssList(nil),
clause8 ).
cnf(c_0_37,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_38,negated_conjecture,
memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_39,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_40,negated_conjecture,
( app(sk4,cons(hd(sk4),nil)) = cons(hd(sk4),sk3)
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_41,negated_conjecture,
( memberP(app(sk4,X1),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_25])]) ).
cnf(c_0_42,negated_conjecture,
( app(sk4,cons(hd(sk4),nil)) = cons(hd(sk4),sk3)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_27]),c_0_25])]) ).
cnf(c_0_43,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
clause175 ).
cnf(c_0_44,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_45,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_46,negated_conjecture,
( sk4 = nil
| memberP(cons(hd(sk4),sk3),sk5)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,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_43]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( sk4 = nil
| memberP(cons(hd(sk4),sk3),sk5)
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_35]),c_0_36])]) ).
cnf(c_0_50,negated_conjecture,
~ memberP(sk1,sk5),
co1_10 ).
cnf(c_0_51,negated_conjecture,
( sk4 = nil
| memberP(sk3,hd(sk4))
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_32]),c_0_48]),c_0_36])]) ).
cnf(c_0_52,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_53,negated_conjecture,
( sk4 = nil
| memberP(cons(hd(sk4),sk3),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_27]),c_0_25])]) ).
cnf(c_0_54,negated_conjecture,
~ memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_50,c_0_45]) ).
cnf(c_0_55,negated_conjecture,
( sk4 = nil
| memberP(sk3,hd(sk4))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_27]),c_0_25])]) ).
cnf(c_0_56,negated_conjecture,
( hd(sk4) = sk5
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_39]),c_0_48])]),c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( sk4 = nil
| memberP(sk3,hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_29]),c_0_25])]) ).
cnf(c_0_58,negated_conjecture,
( hd(sk4) = sk5
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_27]),c_0_25])]) ).
cnf(c_0_59,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_11 ).
cnf(c_0_60,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_54]) ).
cnf(c_0_61,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_62,negated_conjecture,
~ memberP(nil,sk5),
inference(rw,[status(thm)],[c_0_54,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_60]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC409-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:21:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 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.pS9lZXHZzq/E---3.1_16148.p
% 1.19/0.66 # Version: 3.1pre001
% 1.19/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.19/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.19/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.19/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.19/0.66 # Starting sh5l with 300s (1) cores
% 1.19/0.66 # sh5l with pid 16276 completed with status 0
% 1.19/0.66 # Result found by sh5l
% 1.19/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.19/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.19/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.19/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.19/0.66 # Starting sh5l with 300s (1) cores
% 1.19/0.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.19/0.66 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.19/0.66 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.19/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 1.19/0.66 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 16286 completed with status 0
% 1.19/0.66 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 1.19/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.19/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.19/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.19/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.19/0.66 # Starting sh5l with 300s (1) cores
% 1.19/0.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.19/0.66 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.19/0.66 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.19/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 1.19/0.66 # Preprocessing time : 0.003 s
% 1.19/0.66 # Presaturation interreduction done
% 1.19/0.66
% 1.19/0.66 # Proof found!
% 1.19/0.66 # SZS status Unsatisfiable
% 1.19/0.66 # SZS output start CNFRefutation
% See solution above
% 1.19/0.66 # Parsed axioms : 196
% 1.19/0.66 # Removed by relevancy pruning/SinE : 37
% 1.19/0.66 # Initial clauses : 159
% 1.19/0.66 # Removed in clause preprocessing : 0
% 1.19/0.66 # Initial clauses in saturation : 159
% 1.19/0.66 # Processed clauses : 1486
% 1.19/0.66 # ...of these trivial : 2
% 1.19/0.66 # ...subsumed : 824
% 1.19/0.66 # ...remaining for further processing : 659
% 1.19/0.66 # Other redundant clauses eliminated : 62
% 1.19/0.66 # Clauses deleted for lack of memory : 0
% 1.19/0.66 # Backward-subsumed : 47
% 1.19/0.66 # Backward-rewritten : 134
% 1.19/0.66 # Generated clauses : 3978
% 1.19/0.66 # ...of the previous two non-redundant : 3671
% 1.19/0.66 # ...aggressively subsumed : 0
% 1.19/0.66 # Contextual simplify-reflections : 101
% 1.19/0.66 # Paramodulations : 3911
% 1.19/0.66 # Factorizations : 0
% 1.19/0.66 # NegExts : 0
% 1.19/0.66 # Equation resolutions : 68
% 1.19/0.66 # Total rewrite steps : 3280
% 1.19/0.66 # Propositional unsat checks : 0
% 1.19/0.66 # Propositional check models : 0
% 1.19/0.66 # Propositional check unsatisfiable : 0
% 1.19/0.66 # Propositional clauses : 0
% 1.19/0.66 # Propositional clauses after purity: 0
% 1.19/0.66 # Propositional unsat core size : 0
% 1.19/0.66 # Propositional preprocessing time : 0.000
% 1.19/0.66 # Propositional encoding time : 0.000
% 1.19/0.66 # Propositional solver time : 0.000
% 1.19/0.66 # Success case prop preproc time : 0.000
% 1.19/0.66 # Success case prop encoding time : 0.000
% 1.19/0.66 # Success case prop solver time : 0.000
% 1.19/0.66 # Current number of processed clauses : 309
% 1.19/0.66 # Positive orientable unit clauses : 52
% 1.19/0.66 # Positive unorientable unit clauses: 0
% 1.19/0.66 # Negative unit clauses : 1
% 1.19/0.66 # Non-unit-clauses : 256
% 1.19/0.66 # Current number of unprocessed clauses: 2430
% 1.19/0.66 # ...number of literals in the above : 13680
% 1.19/0.66 # Current number of archived formulas : 0
% 1.19/0.66 # Current number of archived clauses : 332
% 1.19/0.66 # Clause-clause subsumption calls (NU) : 30509
% 1.19/0.66 # Rec. Clause-clause subsumption calls : 10065
% 1.19/0.66 # Non-unit clause-clause subsumptions : 972
% 1.19/0.66 # Unit Clause-clause subsumption calls : 469
% 1.19/0.66 # Rewrite failures with RHS unbound : 0
% 1.19/0.66 # BW rewrite match attempts : 11
% 1.19/0.66 # BW rewrite match successes : 7
% 1.19/0.66 # Condensation attempts : 0
% 1.19/0.66 # Condensation successes : 0
% 1.19/0.66 # Termbank termtop insertions : 77503
% 1.19/0.66
% 1.19/0.66 # -------------------------------------------------
% 1.19/0.66 # User time : 0.124 s
% 1.19/0.66 # System time : 0.007 s
% 1.19/0.66 # Total time : 0.131 s
% 1.19/0.66 # Maximum resident set size: 2176 pages
% 1.19/0.66
% 1.19/0.66 # -------------------------------------------------
% 1.19/0.66 # User time : 0.127 s
% 1.19/0.66 # System time : 0.010 s
% 1.19/0.66 # Total time : 0.137 s
% 1.19/0.66 # Maximum resident set size: 1864 pages
% 1.19/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------