TSTP Solution File: SWC366-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC366-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:38 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 18 unt; 8 nHn; 45 RR)
% Number of literals : 114 ( 26 equ; 70 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| app(X2,sk3) != X1
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',co1_6) ).
cnf(co1_12,negated_conjecture,
( ~ rearsegP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',co1_12) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',co1_1) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',co1_2) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',clause86) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',clause76) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p',clause115) ).
cnf(c_0_14,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
c_0_14 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| app(X2,sk3) != X1
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( ~ rearsegP(sk2,sk1)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_21,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_22,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_23,negated_conjecture,
( app(cons(hd(sk4),nil),sk1) = sk4
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(app(cons(hd(sk4),nil),sk1))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19])])])])]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| ~ rearsegP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_26,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( app(cons(hd(sk4),nil),sk1) = sk4
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
~ rearsegP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_19])]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_30,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
( ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]),c_0_28]) ).
cnf(c_0_33,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_34,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_35,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_36,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( ~ neq(nil,sk4)
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( sk4 = nil
| neq(nil,sk4) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_40,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_41,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_43,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_19,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC366-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n028.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 01:56:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.1D1Rhlniu4/E---3.1_24342.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 24421 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24424 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.003 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 197
% 0.20/0.52 # Removed by relevancy pruning/SinE : 127
% 0.20/0.52 # Initial clauses : 70
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 70
% 0.20/0.52 # Processed clauses : 167
% 0.20/0.52 # ...of these trivial : 5
% 0.20/0.52 # ...subsumed : 6
% 0.20/0.52 # ...remaining for further processing : 156
% 0.20/0.52 # Other redundant clauses eliminated : 18
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 9
% 0.20/0.52 # Backward-rewritten : 12
% 0.20/0.52 # Generated clauses : 164
% 0.20/0.52 # ...of the previous two non-redundant : 145
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 3
% 0.20/0.52 # Paramodulations : 145
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 22
% 0.20/0.52 # Total rewrite steps : 109
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 64
% 0.20/0.52 # Positive orientable unit clauses : 10
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 53
% 0.20/0.52 # Current number of unprocessed clauses: 108
% 0.20/0.52 # ...number of literals in the above : 578
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 81
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 2086
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 369
% 0.20/0.52 # Non-unit clause-clause subsumptions : 18
% 0.20/0.52 # Unit Clause-clause subsumption calls : 46
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 2
% 0.20/0.52 # BW rewrite match successes : 2
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 6371
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.012 s
% 0.20/0.52 # System time : 0.006 s
% 0.20/0.52 # Total time : 0.018 s
% 0.20/0.52 # Maximum resident set size: 2080 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.016 s
% 0.20/0.52 # System time : 0.008 s
% 0.20/0.52 # Total time : 0.024 s
% 0.20/0.52 # Maximum resident set size: 1848 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------