TSTP Solution File: SWC120-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC120-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:39:26 EDT 2023
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of clauses : 63 ( 17 unt; 20 nHn; 63 RR)
% Number of literals : 170 ( 57 equ; 95 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',co1_5) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause173) ).
cnf(co1_11,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',co1_6) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',co1_1) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',co1_2) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause100) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause75) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',co1_12) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause150) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause104) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause76) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause99) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.448rbpMdCd/E---3.1_30652.p',clause115) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_19,negated_conjecture,
neq(sk2,nil),
c_0_18 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_22,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[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,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_29,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| ~ neq(nil,sk4)
| ~ ssList(app(sk1,tl(sk4)))
| ~ ssList(tl(sk4)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24])])])]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_31,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_32,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_33,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[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_34,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| ~ neq(nil,sk4)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_28]),c_0_30])]) ).
cnf(c_0_35,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_36,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_37,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_39,negated_conjecture,
( segmentP(sk4,sk1)
| ~ neq(nil,sk4)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30])]) ).
cnf(c_0_40,negated_conjecture,
( sk4 = nil
| ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( sk4 = nil
| neq(nil,sk4) ),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_42,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_20]),c_0_24])]) ).
cnf(c_0_44,negated_conjecture,
( sk4 = nil
| segmentP(sk4,sk1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( X1 = sk1
| neq(sk1,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_46,negated_conjecture,
( X1 = tl(sk4)
| app(sk1,X1) != sk4
| ~ neq(nil,sk4)
| ~ ssList(tl(sk4))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_30])]) ).
cnf(c_0_47,negated_conjecture,
( sk4 = nil
| ~ neq(sk1,nil) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( sk1 = nil
| neq(sk1,nil) ),
inference(spm,[status(thm)],[c_0_45,c_0_27]) ).
cnf(c_0_49,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_50,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_51,negated_conjecture,
( X1 = tl(sk4)
| sk4 = nil
| app(sk1,X1) != sk4
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_41]),c_0_40]) ).
cnf(c_0_52,negated_conjecture,
( sk1 = nil
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_54,negated_conjecture,
( cons(hd(sk4),tl(sk4)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_49,c_0_36]) ).
cnf(c_0_55,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_50,c_0_36]) ).
cnf(c_0_56,negated_conjecture,
( X1 = tl(sk4)
| sk4 = nil
| app(nil,X1) != sk4
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( sk4 = nil
| tl(sk4) != sk4 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_40]),c_0_55]) ).
cnf(c_0_58,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_59,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_26])]),c_0_36])]),c_0_57]) ).
cnf(c_0_60,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_61,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_24,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC120-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:45:04 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.448rbpMdCd/E---3.1_30652.p
% 0.18/0.51 # Version: 3.1pre001
% 0.18/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 # Starting sh5l with 300s (1) cores
% 0.18/0.51 # new_bool_3 with pid 30731 completed with status 0
% 0.18/0.51 # Result found by new_bool_3
% 0.18/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30734 completed with status 0
% 0.18/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.51 # Preprocessing time : 0.004 s
% 0.18/0.51 # Presaturation interreduction done
% 0.18/0.51
% 0.18/0.51 # Proof found!
% 0.18/0.51 # SZS status Unsatisfiable
% 0.18/0.51 # SZS output start CNFRefutation
% See solution above
% 0.18/0.51 # Parsed axioms : 197
% 0.18/0.51 # Removed by relevancy pruning/SinE : 121
% 0.18/0.51 # Initial clauses : 76
% 0.18/0.51 # Removed in clause preprocessing : 0
% 0.18/0.51 # Initial clauses in saturation : 76
% 0.18/0.51 # Processed clauses : 432
% 0.18/0.51 # ...of these trivial : 5
% 0.18/0.51 # ...subsumed : 106
% 0.18/0.51 # ...remaining for further processing : 321
% 0.18/0.51 # Other redundant clauses eliminated : 18
% 0.18/0.51 # Clauses deleted for lack of memory : 0
% 0.18/0.51 # Backward-subsumed : 20
% 0.18/0.51 # Backward-rewritten : 90
% 0.18/0.51 # Generated clauses : 1069
% 0.18/0.51 # ...of the previous two non-redundant : 990
% 0.18/0.51 # ...aggressively subsumed : 0
% 0.18/0.51 # Contextual simplify-reflections : 44
% 0.18/0.51 # Paramodulations : 1049
% 0.18/0.51 # Factorizations : 0
% 0.18/0.51 # NegExts : 0
% 0.18/0.51 # Equation resolutions : 22
% 0.18/0.51 # Total rewrite steps : 616
% 0.18/0.51 # Propositional unsat checks : 0
% 0.18/0.51 # Propositional check models : 0
% 0.18/0.51 # Propositional check unsatisfiable : 0
% 0.18/0.51 # Propositional clauses : 0
% 0.18/0.51 # Propositional clauses after purity: 0
% 0.18/0.51 # Propositional unsat core size : 0
% 0.18/0.51 # Propositional preprocessing time : 0.000
% 0.18/0.51 # Propositional encoding time : 0.000
% 0.18/0.51 # Propositional solver time : 0.000
% 0.18/0.51 # Success case prop preproc time : 0.000
% 0.18/0.51 # Success case prop encoding time : 0.000
% 0.18/0.51 # Success case prop solver time : 0.000
% 0.18/0.51 # Current number of processed clauses : 135
% 0.18/0.51 # Positive orientable unit clauses : 10
% 0.18/0.51 # Positive unorientable unit clauses: 0
% 0.18/0.51 # Negative unit clauses : 0
% 0.18/0.51 # Non-unit-clauses : 125
% 0.18/0.51 # Current number of unprocessed clauses: 697
% 0.18/0.51 # ...number of literals in the above : 3999
% 0.18/0.51 # Current number of archived formulas : 0
% 0.18/0.51 # Current number of archived clauses : 175
% 0.18/0.51 # Clause-clause subsumption calls (NU) : 11814
% 0.18/0.51 # Rec. Clause-clause subsumption calls : 1765
% 0.18/0.51 # Non-unit clause-clause subsumptions : 170
% 0.18/0.51 # Unit Clause-clause subsumption calls : 190
% 0.18/0.51 # Rewrite failures with RHS unbound : 0
% 0.18/0.51 # BW rewrite match attempts : 1
% 0.18/0.51 # BW rewrite match successes : 1
% 0.18/0.51 # Condensation attempts : 0
% 0.18/0.51 # Condensation successes : 0
% 0.18/0.51 # Termbank termtop insertions : 24590
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.039 s
% 0.18/0.51 # System time : 0.005 s
% 0.18/0.51 # Total time : 0.044 s
% 0.18/0.51 # Maximum resident set size: 2080 pages
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.043 s
% 0.18/0.51 # System time : 0.006 s
% 0.18/0.51 # Total time : 0.049 s
% 0.18/0.51 # Maximum resident set size: 1852 pages
% 0.18/0.51 % E---3.1 exiting
% 0.18/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------