TSTP Solution File: SWC005-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC005-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:40:59 EDT 2023
% Result : Unsatisfiable 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 55 ( 17 unt; 16 nHn; 55 RR)
% Number of literals : 145 ( 53 equ; 85 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1
| ~ neq(X2,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',co1_11) ).
cnf(co1_12,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| tl(sk4) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',co1_2) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',co1_1) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause100) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause75) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause120) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause104) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause76) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause86) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause99) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Ub4uM0Gne/E---3.1_20253.p',clause115) ).
cnf(c_0_17,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
c_0_17 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1
| ~ neq(X2,nil)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_21,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| tl(sk4) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_25,negated_conjecture,
( app(app(X1,X2),X3) != sk4
| app(X1,X3) != sk1
| ~ neq(X2,nil)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19]),c_0_21])]) ).
cnf(c_0_26,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
( tl(sk4) = sk1
| ~ neq(nil,sk4)
| ~ ssList(tl(sk4)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_21])])]) ).
cnf(c_0_30,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_31,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_32,negated_conjecture,
( app(app(nil,X1),sk1) != sk4
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])])]),c_0_28])]) ).
cnf(c_0_33,negated_conjecture,
( tl(sk4) = sk1
| sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27]),c_0_31])]) ).
cnf(c_0_34,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_35,negated_conjecture,
( app(X1,sk1) != sk4
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_26]) ).
cnf(c_0_36,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_37,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_38,negated_conjecture,
( tl(sk4) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
( cons(X1,sk1) != sk4
| ~ neq(cons(X1,nil),nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28])]) ).
cnf(c_0_40,negated_conjecture,
( cons(hd(sk4),sk1) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).
cnf(c_0_41,negated_conjecture,
( sk4 = nil
| ~ neq(cons(hd(sk4),nil),nil)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( cons(hd(sk4),nil) = nil
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_27])]) ).
cnf(c_0_43,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_44,negated_conjecture,
( cons(hd(sk4),nil) = nil
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_31])]) ).
cnf(c_0_45,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_46,negated_conjecture,
( cons(hd(sk4),nil) = nil
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_27])]) ).
cnf(c_0_47,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_48,negated_conjecture,
( cons(hd(sk4),nil) = nil
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_43]),c_0_31])]) ).
cnf(c_0_49,negated_conjecture,
( sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_27])]) ).
cnf(c_0_50,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_51,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_43]),c_0_31])]) ).
cnf(c_0_52,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_53,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_21,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC005-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.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 02:22:52 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.4Ub4uM0Gne/E---3.1_20253.p
% 0.17/0.49 # Version: 3.1pre001
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 20330 completed with status 0
% 0.17/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # No SInE strategy applied
% 0.17/0.49 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.49 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.17/0.49 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.17/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.17/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 20336 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # No SInE strategy applied
% 0.17/0.49 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.49 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.17/0.49 # Preprocessing time : 0.003 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Unsatisfiable
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 197
% 0.17/0.49 # Removed by relevancy pruning/SinE : 0
% 0.17/0.49 # Initial clauses : 197
% 0.17/0.49 # Removed in clause preprocessing : 0
% 0.17/0.49 # Initial clauses in saturation : 197
% 0.17/0.49 # Processed clauses : 474
% 0.17/0.49 # ...of these trivial : 5
% 0.17/0.49 # ...subsumed : 49
% 0.17/0.49 # ...remaining for further processing : 420
% 0.17/0.49 # Other redundant clauses eliminated : 48
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 13
% 0.17/0.49 # Backward-rewritten : 33
% 0.17/0.49 # Generated clauses : 335
% 0.17/0.49 # ...of the previous two non-redundant : 261
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 5
% 0.17/0.49 # Paramodulations : 283
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 53
% 0.17/0.49 # Total rewrite steps : 349
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 164
% 0.17/0.49 # Positive orientable unit clauses : 62
% 0.17/0.49 # Positive unorientable unit clauses: 0
% 0.17/0.49 # Negative unit clauses : 3
% 0.17/0.49 # Non-unit-clauses : 99
% 0.17/0.49 # Current number of unprocessed clauses: 167
% 0.17/0.49 # ...number of literals in the above : 800
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 232
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 10474
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 1546
% 0.17/0.49 # Non-unit clause-clause subsumptions : 61
% 0.17/0.49 # Unit Clause-clause subsumption calls : 63
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 1
% 0.17/0.49 # BW rewrite match successes : 1
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 12009
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.026 s
% 0.17/0.49 # System time : 0.009 s
% 0.17/0.49 # Total time : 0.035 s
% 0.17/0.49 # Maximum resident set size: 2124 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.138 s
% 0.17/0.49 # System time : 0.019 s
% 0.17/0.49 # Total time : 0.158 s
% 0.17/0.49 # Maximum resident set size: 1852 pages
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------