TSTP Solution File: SWC052-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC052-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:04 EDT 2023
% Result : Unsatisfiable 1.20s 0.66s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of clauses : 64 ( 20 unt; 6 nHn; 62 RR)
% Number of literals : 148 ( 38 equ; 88 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_15,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_15) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_5) ).
cnf(co1_14,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_2) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_6) ).
cnf(co1_12,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_12) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',clause57) ).
cnf(co1_8,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_8) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',clause79) ).
cnf(co1_13,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_13) ).
cnf(co1_11,negated_conjecture,
( frontsegP(sk3,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_11) ).
cnf(co1_9,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_9) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',clause8) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',clause51) ).
cnf(co1_10,negated_conjecture,
( frontsegP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_10) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p',co1_1) ).
cnf(c_0_20,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_15 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_14 ).
cnf(c_0_23,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_24,negated_conjecture,
( sk1 != nil
| ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( neq(sk4,nil)
| sk1 != nil ),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_7 ).
cnf(c_0_28,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_29,negated_conjecture,
( sk1 != nil
| ~ segmentP(sk1,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
( sk1 = nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
co1_12 ).
cnf(c_0_32,negated_conjecture,
( sk4 != nil
| ~ segmentP(nil,sk4)
| ~ segmentP(sk4,sk4) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_34,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
co1_8 ).
cnf(c_0_35,negated_conjecture,
( sk4 = nil
| neq(sk4,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_21]),c_0_21]) ).
cnf(c_0_36,negated_conjecture,
( sk4 != nil
| ~ segmentP(nil,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26])]) ).
cnf(c_0_37,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_38,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_13 ).
cnf(c_0_39,negated_conjecture,
( sk4 = nil
| ssList(sk5) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_26])]) ).
cnf(c_0_41,negated_conjecture,
( frontsegP(sk3,sk5)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_42,negated_conjecture,
( sk4 = nil
| ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_21]),c_0_21]) ).
cnf(c_0_43,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
co1_9 ).
cnf(c_0_44,negated_conjecture,
ssList(sk5),
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_46,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_47,axiom,
ssList(nil),
clause8 ).
cnf(c_0_48,negated_conjecture,
( frontsegP(sk1,sk5)
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_49,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk1,sk5)
| ~ segmentP(sk4,sk5) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_40]) ).
cnf(c_0_50,negated_conjecture,
neq(sk4,nil),
inference(sr,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_51,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_52,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_53,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_54,negated_conjecture,
( sk4 = nil
| frontsegP(sk1,sk5) ),
inference(spm,[status(thm)],[c_0_48,c_0_35]) ).
cnf(c_0_55,negated_conjecture,
( frontsegP(sk4,sk5)
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_56,negated_conjecture,
( ~ segmentP(sk1,sk5)
| ~ segmentP(sk4,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_57,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])])]) ).
cnf(c_0_58,negated_conjecture,
frontsegP(sk1,sk5),
inference(sr,[status(thm)],[c_0_54,c_0_40]) ).
cnf(c_0_59,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_60,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk5) ),
inference(spm,[status(thm)],[c_0_55,c_0_35]) ).
cnf(c_0_61,negated_conjecture,
~ segmentP(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59]),c_0_44])]) ).
cnf(c_0_62,negated_conjecture,
frontsegP(sk4,sk5),
inference(sr,[status(thm)],[c_0_60,c_0_40]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_57]),c_0_62]),c_0_26]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWC052-1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 02:36:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.UuBiBstnYP/E---3.1_22657.p
% 1.20/0.66 # Version: 3.1pre001
% 1.20/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.20/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.20/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.20/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.20/0.66 # Starting sh5l with 300s (1) cores
% 1.20/0.66 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22772 completed with status 0
% 1.20/0.66 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.20/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.20/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.20/0.66 # No SInE strategy applied
% 1.20/0.66 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.20/0.66 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.20/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.20/0.66 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.20/0.66 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.20/0.66 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1.20/0.66 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 22786 completed with status 0
% 1.20/0.66 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 1.20/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.20/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.20/0.66 # No SInE strategy applied
% 1.20/0.66 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.20/0.66 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.20/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.20/0.66 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.20/0.66 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.20/0.66 # Preprocessing time : 0.005 s
% 1.20/0.66
% 1.20/0.66 # Proof found!
% 1.20/0.66 # SZS status Unsatisfiable
% 1.20/0.66 # SZS output start CNFRefutation
% See solution above
% 1.20/0.66 # Parsed axioms : 200
% 1.20/0.66 # Removed by relevancy pruning/SinE : 0
% 1.20/0.66 # Initial clauses : 200
% 1.20/0.66 # Removed in clause preprocessing : 0
% 1.20/0.66 # Initial clauses in saturation : 200
% 1.20/0.66 # Processed clauses : 631
% 1.20/0.66 # ...of these trivial : 13
% 1.20/0.66 # ...subsumed : 119
% 1.20/0.66 # ...remaining for further processing : 499
% 1.20/0.66 # Other redundant clauses eliminated : 40
% 1.20/0.66 # Clauses deleted for lack of memory : 0
% 1.20/0.66 # Backward-subsumed : 24
% 1.20/0.66 # Backward-rewritten : 15
% 1.20/0.66 # Generated clauses : 5385
% 1.20/0.66 # ...of the previous two non-redundant : 5190
% 1.20/0.66 # ...aggressively subsumed : 0
% 1.20/0.66 # Contextual simplify-reflections : 18
% 1.20/0.66 # Paramodulations : 5271
% 1.20/0.66 # Factorizations : 35
% 1.20/0.66 # NegExts : 0
% 1.20/0.66 # Equation resolutions : 73
% 1.20/0.66 # Total rewrite steps : 2219
% 1.20/0.66 # Propositional unsat checks : 0
% 1.20/0.66 # Propositional check models : 0
% 1.20/0.66 # Propositional check unsatisfiable : 0
% 1.20/0.66 # Propositional clauses : 0
% 1.20/0.66 # Propositional clauses after purity: 0
% 1.20/0.66 # Propositional unsat core size : 0
% 1.20/0.66 # Propositional preprocessing time : 0.000
% 1.20/0.66 # Propositional encoding time : 0.000
% 1.20/0.66 # Propositional solver time : 0.000
% 1.20/0.66 # Success case prop preproc time : 0.000
% 1.20/0.66 # Success case prop encoding time : 0.000
% 1.20/0.66 # Success case prop solver time : 0.000
% 1.20/0.66 # Current number of processed clauses : 449
% 1.20/0.66 # Positive orientable unit clauses : 79
% 1.20/0.66 # Positive unorientable unit clauses: 0
% 1.20/0.66 # Negative unit clauses : 11
% 1.20/0.66 # Non-unit-clauses : 359
% 1.20/0.66 # Current number of unprocessed clauses: 4697
% 1.20/0.66 # ...number of literals in the above : 17510
% 1.20/0.66 # Current number of archived formulas : 0
% 1.20/0.66 # Current number of archived clauses : 45
% 1.20/0.66 # Clause-clause subsumption calls (NU) : 15328
% 1.20/0.66 # Rec. Clause-clause subsumption calls : 5747
% 1.20/0.66 # Non-unit clause-clause subsumptions : 97
% 1.20/0.66 # Unit Clause-clause subsumption calls : 1618
% 1.20/0.66 # Rewrite failures with RHS unbound : 0
% 1.20/0.66 # BW rewrite match attempts : 8
% 1.20/0.66 # BW rewrite match successes : 8
% 1.20/0.66 # Condensation attempts : 0
% 1.20/0.66 # Condensation successes : 0
% 1.20/0.66 # Termbank termtop insertions : 89264
% 1.20/0.66
% 1.20/0.66 # -------------------------------------------------
% 1.20/0.66 # User time : 0.121 s
% 1.20/0.66 # System time : 0.014 s
% 1.20/0.66 # Total time : 0.135 s
% 1.20/0.66 # Maximum resident set size: 2112 pages
% 1.20/0.66
% 1.20/0.66 # -------------------------------------------------
% 1.20/0.66 # User time : 0.614 s
% 1.20/0.66 # System time : 0.050 s
% 1.20/0.66 # Total time : 0.663 s
% 1.20/0.66 # Maximum resident set size: 1852 pages
% 1.20/0.66 % E---3.1 exiting
% 1.20/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------