TSTP Solution File: SWC081-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC081-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:41:23 EDT 2023
% Result : Unsatisfiable 0.20s 0.71s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of clauses : 66 ( 21 unt; 22 nHn; 64 RR)
% Number of literals : 147 ( 49 equ; 67 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 : 41 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
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.0bEFVxjtBb/E---3.1_10157.p',clause173) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_5) ).
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',clause85) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',clause132) ).
cnf(co1_16,negated_conjecture,
( frontsegP(sk3,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_16) ).
cnf(co1_10,negated_conjecture,
( ssList(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_10) ).
cnf(co1_15,negated_conjecture,
( frontsegP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_15) ).
cnf(co1_13,negated_conjecture,
( frontsegP(sk3,sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_13) ).
cnf(co1_9,negated_conjecture,
( ssList(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_9) ).
cnf(co1_14,negated_conjecture,
( neq(sk5,nil)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_14) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',clause51) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',clause118) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_7) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',clause115) ).
cnf(co1_11,negated_conjecture,
( neq(sk5,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',co1_11) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p',clause79) ).
cnf(c_0_22,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_23,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_24,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_25,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_26,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_8 ).
cnf(c_0_28,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_22]) ).
cnf(c_0_29,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_32,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_33,negated_conjecture,
( frontsegP(sk3,sk5)
| nil = sk3 ),
co1_16 ).
cnf(c_0_34,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( ssList(sk5)
| nil = sk3 ),
co1_10 ).
cnf(c_0_36,negated_conjecture,
( frontsegP(sk4,sk5)
| nil = sk3 ),
co1_15 ).
cnf(c_0_37,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_38,negated_conjecture,
( frontsegP(sk3,sk5)
| nil = sk4 ),
co1_13 ).
cnf(c_0_39,negated_conjecture,
( ssList(sk5)
| nil = sk4 ),
co1_9 ).
cnf(c_0_40,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_24]),c_0_26]) ).
cnf(c_0_41,negated_conjecture,
( neq(sk5,nil)
| nil = sk3 ),
co1_14 ).
cnf(c_0_42,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_28,c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_43,negated_conjecture,
( app(sk5,skaf45(sk3,sk5)) = sk3
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).
cnf(c_0_44,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_45,negated_conjecture,
( app(sk5,skaf45(sk4,sk5)) = sk4
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_36]),c_0_37])]),c_0_35]) ).
cnf(c_0_46,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_47,negated_conjecture,
( app(sk5,skaf45(sk3,sk5)) = sk3
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_38]),c_0_34])]),c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk3,sk5)
| ~ segmentP(sk4,sk5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_35]) ).
cnf(c_0_49,negated_conjecture,
( sk3 = nil
| segmentP(sk3,sk5) ),
inference(csr,[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_35]) ).
cnf(c_0_50,negated_conjecture,
( sk3 = nil
| segmentP(sk4,sk5) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_45]),c_0_44])]),c_0_35]) ).
cnf(c_0_51,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_52,negated_conjecture,
( sk4 = nil
| sk5 = nil
| sk3 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44])]),c_0_39]) ).
cnf(c_0_53,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_54,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_51,c_0_26]) ).
cnf(c_0_55,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_56,negated_conjecture,
( neq(sk5,nil)
| nil = sk4 ),
co1_11 ).
cnf(c_0_57,negated_conjecture,
( sk5 = nil
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_58,negated_conjecture,
( ~ segmentP(sk3,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_54]),c_0_37])]) ).
cnf(c_0_59,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( sk4 = nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_62,negated_conjecture,
( ~ segmentP(nil,sk4)
| ~ segmentP(sk4,sk4) ),
inference(rw,[status(thm)],[c_0_58,c_0_53]) ).
cnf(c_0_63,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_30])]) ).
cnf(c_0_64,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_61]),c_0_30])]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_63]),c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC081-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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:02:45 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.0bEFVxjtBb/E---3.1_10157.p
% 0.20/0.71 # Version: 3.1pre001
% 0.20/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.71 # Starting sh5l with 300s (1) cores
% 0.20/0.71 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10236 completed with status 0
% 0.20/0.71 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.71 # No SInE strategy applied
% 0.20/0.71 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.71 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.71 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.20/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.71 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/0.71 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.20/0.71 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.20/0.71 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 10242 completed with status 0
% 0.20/0.71 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.20/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.71 # No SInE strategy applied
% 0.20/0.71 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.71 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.71 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.20/0.71 # Preprocessing time : 0.003 s
% 0.20/0.71 # Presaturation interreduction done
% 0.20/0.71
% 0.20/0.71 # Proof found!
% 0.20/0.71 # SZS status Unsatisfiable
% 0.20/0.71 # SZS output start CNFRefutation
% See solution above
% 0.20/0.71 # Parsed axioms : 201
% 0.20/0.71 # Removed by relevancy pruning/SinE : 0
% 0.20/0.71 # Initial clauses : 201
% 0.20/0.71 # Removed in clause preprocessing : 0
% 0.20/0.71 # Initial clauses in saturation : 201
% 0.20/0.71 # Processed clauses : 2216
% 0.20/0.71 # ...of these trivial : 14
% 0.20/0.71 # ...subsumed : 1236
% 0.20/0.71 # ...remaining for further processing : 966
% 0.20/0.71 # Other redundant clauses eliminated : 178
% 0.20/0.71 # Clauses deleted for lack of memory : 0
% 0.20/0.71 # Backward-subsumed : 84
% 0.20/0.71 # Backward-rewritten : 305
% 0.20/0.71 # Generated clauses : 6359
% 0.20/0.71 # ...of the previous two non-redundant : 5898
% 0.20/0.71 # ...aggressively subsumed : 0
% 0.20/0.71 # Contextual simplify-reflections : 279
% 0.20/0.71 # Paramodulations : 6172
% 0.20/0.71 # Factorizations : 0
% 0.20/0.71 # NegExts : 0
% 0.20/0.71 # Equation resolutions : 188
% 0.20/0.71 # Total rewrite steps : 5657
% 0.20/0.71 # Propositional unsat checks : 0
% 0.20/0.71 # Propositional check models : 0
% 0.20/0.71 # Propositional check unsatisfiable : 0
% 0.20/0.71 # Propositional clauses : 0
% 0.20/0.71 # Propositional clauses after purity: 0
% 0.20/0.71 # Propositional unsat core size : 0
% 0.20/0.71 # Propositional preprocessing time : 0.000
% 0.20/0.71 # Propositional encoding time : 0.000
% 0.20/0.71 # Propositional solver time : 0.000
% 0.20/0.71 # Success case prop preproc time : 0.000
% 0.20/0.71 # Success case prop encoding time : 0.000
% 0.20/0.71 # Success case prop solver time : 0.000
% 0.20/0.71 # Current number of processed clauses : 361
% 0.20/0.71 # Positive orientable unit clauses : 61
% 0.20/0.71 # Positive unorientable unit clauses: 0
% 0.20/0.71 # Negative unit clauses : 2
% 0.20/0.71 # Non-unit-clauses : 298
% 0.20/0.71 # Current number of unprocessed clauses: 4052
% 0.20/0.71 # ...number of literals in the above : 24344
% 0.20/0.71 # Current number of archived formulas : 0
% 0.20/0.71 # Current number of archived clauses : 582
% 0.20/0.71 # Clause-clause subsumption calls (NU) : 58552
% 0.20/0.71 # Rec. Clause-clause subsumption calls : 14124
% 0.20/0.71 # Non-unit clause-clause subsumptions : 1356
% 0.20/0.71 # Unit Clause-clause subsumption calls : 184
% 0.20/0.71 # Rewrite failures with RHS unbound : 0
% 0.20/0.71 # BW rewrite match attempts : 4
% 0.20/0.71 # BW rewrite match successes : 4
% 0.20/0.71 # Condensation attempts : 0
% 0.20/0.71 # Condensation successes : 0
% 0.20/0.71 # Termbank termtop insertions : 117753
% 0.20/0.71
% 0.20/0.71 # -------------------------------------------------
% 0.20/0.71 # User time : 0.187 s
% 0.20/0.71 # System time : 0.006 s
% 0.20/0.71 # Total time : 0.193 s
% 0.20/0.71 # Maximum resident set size: 2112 pages
% 0.20/0.71
% 0.20/0.71 # -------------------------------------------------
% 0.20/0.71 # User time : 0.942 s
% 0.20/0.71 # System time : 0.058 s
% 0.20/0.71 # Total time : 1.000 s
% 0.20/0.71 # Maximum resident set size: 1852 pages
% 0.20/0.71 % E---3.1 exiting
%------------------------------------------------------------------------------