TSTP Solution File: SWC311-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC311-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:31 EDT 2023
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 51 ( 12 unt; 15 nHn; 51 RR)
% Number of literals : 161 ( 68 equ; 98 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 4 ( 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_8,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',co1_5) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause85) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',co1_2) ).
cnf(co1_9,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',co1_9) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause76) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause75) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause86) ).
cnf(co1_10,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',co1_10) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause120) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause104) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',co1_7) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',clause115) ).
cnf(co1_11,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.Srgf0sFazT/E---3.1_26579.p',co1_11) ).
cnf(c_0_17,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_8 ).
cnf(c_0_18,negated_conjecture,
( sk3 = X1
| tl(sk4) != X2
| hd(sk4) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_17]) ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_22,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| ~ neq(nil,sk2)
| ~ neq(sk2,nil)
| ~ ssItem(hd(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_20])])])])]),c_0_21]) ).
cnf(c_0_23,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_26,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
co1_9 ).
cnf(c_0_27,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil
| ~ ssItem(hd(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_28,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_29,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25])]) ).
cnf(c_0_30,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_31,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil
| ~ ssList(cons(hd(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25])]) ).
cnf(c_0_32,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_33,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil
| ~ ssItem(hd(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24])]) ).
cnf(c_0_34,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
co1_10 ).
cnf(c_0_35,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_25])]) ).
cnf(c_0_36,negated_conjecture,
( sk2 = nil
| app(cons(hd(sk2),nil),tl(sk2)) != sk2
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_38,negated_conjecture,
( sk2 = nil
| cons(hd(sk2),tl(sk2)) != sk2
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_40,negated_conjecture,
( sk2 = nil
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25])]) ).
cnf(c_0_41,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_7 ).
cnf(c_0_42,negated_conjecture,
( sk2 = nil
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_25])]) ).
cnf(c_0_43,negated_conjecture,
( sk1 = nil
| sk2 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_19]),c_0_20]) ).
cnf(c_0_44,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_30]),c_0_25])]) ).
cnf(c_0_45,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_46,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_11 ).
cnf(c_0_47,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_44]),c_0_47])]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC311-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:20:01 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.Srgf0sFazT/E---3.1_26579.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # sh5l with pid 26663 completed with status 0
% 0.20/0.53 # Result found by sh5l
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.53 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.53 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 26671 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.53 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.53 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.20/0.53 # Preprocessing time : 0.003 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Unsatisfiable
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 197
% 0.20/0.53 # Removed by relevancy pruning/SinE : 30
% 0.20/0.53 # Initial clauses : 167
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 167
% 0.20/0.53 # Processed clauses : 337
% 0.20/0.53 # ...of these trivial : 2
% 0.20/0.53 # ...subsumed : 11
% 0.20/0.53 # ...remaining for further processing : 324
% 0.20/0.53 # Other redundant clauses eliminated : 35
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 14
% 0.20/0.53 # Backward-rewritten : 15
% 0.20/0.53 # Generated clauses : 143
% 0.20/0.53 # ...of the previous two non-redundant : 120
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 6
% 0.20/0.53 # Paramodulations : 107
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 40
% 0.20/0.53 # Total rewrite steps : 108
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 115
% 0.20/0.53 # Positive orientable unit clauses : 45
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 0
% 0.20/0.53 # Non-unit-clauses : 70
% 0.20/0.53 # Current number of unprocessed clauses: 109
% 0.20/0.53 # ...number of literals in the above : 563
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 188
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 9188
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 1340
% 0.20/0.53 # Non-unit clause-clause subsumptions : 31
% 0.20/0.53 # Unit Clause-clause subsumption calls : 98
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 2
% 0.20/0.53 # BW rewrite match successes : 2
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 8551
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.028 s
% 0.20/0.53 # System time : 0.004 s
% 0.20/0.53 # Total time : 0.032 s
% 0.20/0.53 # Maximum resident set size: 2188 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.033 s
% 0.20/0.53 # System time : 0.005 s
% 0.20/0.53 # Total time : 0.038 s
% 0.20/0.53 # Maximum resident set size: 1852 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------