TSTP Solution File: SWC065-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC065-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:08 EDT 2023
% Result : Unsatisfiable 0.41s 0.63s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 51 ( 19 unt; 4 nHn; 51 RR)
% Number of literals : 118 ( 43 equ; 68 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_5) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',clause119) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_1) ).
cnf(co1_15,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_2) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',clause73) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',clause8) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',clause57) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',clause172) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',clause74) ).
cnf(co1_13,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_13) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.Wk3dFbiRFy/E---3.1_8598.p',co1_11) ).
cnf(c_0_17,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_21,negated_conjecture,
app(sk1,sk5) = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_23,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_24,negated_conjecture,
( sk5 = nil
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_15 ).
cnf(c_0_26,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_14 ).
cnf(c_0_27,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_28,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_29,negated_conjecture,
( app(sk1,nil) = sk2
| sk2 != nil ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_30,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_31,negated_conjecture,
( sk1 != nil
| ~ segmentP(sk1,sk2)
| ~ segmentP(sk2,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
( sk1 = sk2
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_33,negated_conjecture,
( X1 = sk1
| neq(sk1,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_34,axiom,
ssList(nil),
clause8 ).
cnf(c_0_35,negated_conjecture,
( sk2 != nil
| ~ segmentP(sk2,sk2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_37,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_38,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_39,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_13 ).
cnf(c_0_40,negated_conjecture,
( sk1 = nil
| neq(sk1,nil) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
sk2 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27])]) ).
cnf(c_0_42,plain,
( segmentP(app(X1,X2),X3)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34])]) ).
cnf(c_0_43,negated_conjecture,
( sk1 = nil
| ~ segmentP(sk1,sk1)
| ~ segmentP(sk2,sk1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_23])]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_45,negated_conjecture,
( nil = sk4
| nil != sk3 ),
co1_11 ).
cnf(c_0_46,negated_conjecture,
( sk1 = nil
| ~ segmentP(sk2,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_23])]) ).
cnf(c_0_47,negated_conjecture,
segmentP(sk2,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_23])]) ).
cnf(c_0_48,negated_conjecture,
( sk2 = nil
| sk1 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_19]),c_0_18]) ).
cnf(c_0_49,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWC065-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n014.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Oct 3 01:52:34 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.23/0.55 Running first-order theorem proving
% 0.23/0.55 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.Wk3dFbiRFy/E---3.1_8598.p
% 0.41/0.63 # Version: 3.1pre001
% 0.41/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.41/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.41/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.63 # Starting sh5l with 300s (1) cores
% 0.41/0.63 # new_bool_3 with pid 8717 completed with status 0
% 0.41/0.63 # Result found by new_bool_3
% 0.41/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.41/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.41/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.63 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.41/0.63 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.41/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.41/0.63 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8720 completed with status 0
% 0.41/0.63 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.41/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.41/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.41/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.63 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.41/0.63 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.41/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.41/0.63 # Preprocessing time : 0.005 s
% 0.41/0.63 # Presaturation interreduction done
% 0.41/0.63
% 0.41/0.63 # Proof found!
% 0.41/0.63 # SZS status Unsatisfiable
% 0.41/0.63 # SZS output start CNFRefutation
% See solution above
% 0.41/0.63 # Parsed axioms : 200
% 0.41/0.63 # Removed by relevancy pruning/SinE : 153
% 0.41/0.63 # Initial clauses : 47
% 0.41/0.63 # Removed in clause preprocessing : 0
% 0.41/0.63 # Initial clauses in saturation : 47
% 0.41/0.63 # Processed clauses : 648
% 0.41/0.63 # ...of these trivial : 29
% 0.41/0.63 # ...subsumed : 285
% 0.41/0.63 # ...remaining for further processing : 334
% 0.41/0.63 # Other redundant clauses eliminated : 15
% 0.41/0.63 # Clauses deleted for lack of memory : 0
% 0.41/0.63 # Backward-subsumed : 33
% 0.41/0.63 # Backward-rewritten : 99
% 0.41/0.63 # Generated clauses : 2109
% 0.41/0.63 # ...of the previous two non-redundant : 1937
% 0.41/0.63 # ...aggressively subsumed : 0
% 0.41/0.63 # Contextual simplify-reflections : 29
% 0.41/0.63 # Paramodulations : 2083
% 0.41/0.63 # Factorizations : 0
% 0.41/0.63 # NegExts : 0
% 0.41/0.63 # Equation resolutions : 23
% 0.41/0.63 # Total rewrite steps : 2212
% 0.41/0.63 # Propositional unsat checks : 0
% 0.41/0.63 # Propositional check models : 0
% 0.41/0.63 # Propositional check unsatisfiable : 0
% 0.41/0.63 # Propositional clauses : 0
% 0.41/0.63 # Propositional clauses after purity: 0
% 0.41/0.63 # Propositional unsat core size : 0
% 0.41/0.63 # Propositional preprocessing time : 0.000
% 0.41/0.63 # Propositional encoding time : 0.000
% 0.41/0.63 # Propositional solver time : 0.000
% 0.41/0.63 # Success case prop preproc time : 0.000
% 0.41/0.63 # Success case prop encoding time : 0.000
% 0.41/0.63 # Success case prop solver time : 0.000
% 0.41/0.63 # Current number of processed clauses : 147
% 0.41/0.63 # Positive orientable unit clauses : 16
% 0.41/0.63 # Positive unorientable unit clauses: 0
% 0.41/0.63 # Negative unit clauses : 4
% 0.41/0.63 # Non-unit-clauses : 127
% 0.41/0.63 # Current number of unprocessed clauses: 1277
% 0.41/0.63 # ...number of literals in the above : 7186
% 0.41/0.63 # Current number of archived formulas : 0
% 0.41/0.63 # Current number of archived clauses : 181
% 0.41/0.63 # Clause-clause subsumption calls (NU) : 6856
% 0.41/0.63 # Rec. Clause-clause subsumption calls : 2837
% 0.41/0.63 # Non-unit clause-clause subsumptions : 287
% 0.41/0.63 # Unit Clause-clause subsumption calls : 224
% 0.41/0.63 # Rewrite failures with RHS unbound : 0
% 0.41/0.63 # BW rewrite match attempts : 7
% 0.41/0.63 # BW rewrite match successes : 7
% 0.41/0.63 # Condensation attempts : 0
% 0.41/0.63 # Condensation successes : 0
% 0.41/0.63 # Termbank termtop insertions : 36811
% 0.41/0.63
% 0.41/0.63 # -------------------------------------------------
% 0.41/0.63 # User time : 0.054 s
% 0.41/0.63 # System time : 0.009 s
% 0.41/0.63 # Total time : 0.063 s
% 0.41/0.63 # Maximum resident set size: 1944 pages
% 0.41/0.63
% 0.41/0.63 # -------------------------------------------------
% 0.41/0.63 # User time : 0.057 s
% 0.41/0.63 # System time : 0.013 s
% 0.41/0.63 # Total time : 0.070 s
% 0.41/0.63 # Maximum resident set size: 1852 pages
% 0.41/0.63 % E---3.1 exiting
% 0.41/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------