TSTP Solution File: SWC354-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC354-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:42:44 EDT 2023
% Result : Unsatisfiable 1.42s 0.67s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of clauses : 65 ( 20 unt; 20 nHn; 63 RR)
% Number of literals : 174 ( 54 equ; 95 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 64 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',co1_2) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause8) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause76) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause86) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause120) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause104) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause85) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause75) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',co1_1) ).
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.c6P0Nfz6Pv/E---3.1_21606.p',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause74) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause132) ).
cnf(co1_12,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',co1_12) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause51) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p',clause115) ).
cnf(c_0_21,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_22,negated_conjecture,
neq(sk2,nil),
c_0_21 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_28,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])])])]) ).
cnf(c_0_29,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[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_33,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_34,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31])]) ).
cnf(c_0_35,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_36,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30])]) ).
cnf(c_0_37,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_38,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
( cons(hd(sk4),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_41,negated_conjecture,
( cons(hd(sk4),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_31])]) ).
cnf(c_0_42,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_43,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_44,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31])]) ).
cnf(c_0_45,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_46,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_42]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_31])]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_49,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_50,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk1)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_51,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_49]) ).
cnf(c_0_52,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_53,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_54,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_45]),c_0_31])]) ).
cnf(c_0_55,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_56,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_51,c_0_52]),c_0_30])]),c_0_43]) ).
cnf(c_0_57,negated_conjecture,
( app(sk1,skaf45(sk4,sk1)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_48]),c_0_31])]) ).
cnf(c_0_58,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_59,negated_conjecture,
~ segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_23]),c_0_26])]) ).
cnf(c_0_60,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_61,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(cn,[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_48])]),c_0_59]) ).
cnf(c_0_62,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_63,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_26,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC354-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Oct 3 01:58:08 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.48 Running first-order model finding
% 0.18/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.c6P0Nfz6Pv/E---3.1_21606.p
% 1.42/0.67 # Version: 3.1pre001
% 1.42/0.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.42/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.42/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.42/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.42/0.67 # Starting sh5l with 300s (1) cores
% 1.42/0.67 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21683 completed with status 0
% 1.42/0.67 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.42/0.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.42/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.42/0.67 # No SInE strategy applied
% 1.42/0.67 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.42/0.67 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.42/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.42/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.42/0.67 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.42/0.67 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.42/0.67 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1.42/0.67 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 21690 completed with status 0
% 1.42/0.67 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 1.42/0.67 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.42/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.67 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.42/0.67 # No SInE strategy applied
% 1.42/0.67 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.42/0.67 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.42/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.42/0.67 # Preprocessing time : 0.002 s
% 1.42/0.67 # Presaturation interreduction done
% 1.42/0.67
% 1.42/0.67 # Proof found!
% 1.42/0.67 # SZS status Unsatisfiable
% 1.42/0.67 # SZS output start CNFRefutation
% See solution above
% 1.42/0.67 # Parsed axioms : 197
% 1.42/0.67 # Removed by relevancy pruning/SinE : 0
% 1.42/0.67 # Initial clauses : 197
% 1.42/0.67 # Removed in clause preprocessing : 0
% 1.42/0.67 # Initial clauses in saturation : 197
% 1.42/0.67 # Processed clauses : 2287
% 1.42/0.67 # ...of these trivial : 7
% 1.42/0.67 # ...subsumed : 1374
% 1.42/0.67 # ...remaining for further processing : 906
% 1.42/0.67 # Other redundant clauses eliminated : 156
% 1.42/0.67 # Clauses deleted for lack of memory : 0
% 1.42/0.67 # Backward-subsumed : 85
% 1.42/0.67 # Backward-rewritten : 239
% 1.42/0.67 # Generated clauses : 7230
% 1.42/0.67 # ...of the previous two non-redundant : 6747
% 1.42/0.67 # ...aggressively subsumed : 0
% 1.42/0.67 # Contextual simplify-reflections : 217
% 1.42/0.67 # Paramodulations : 7067
% 1.42/0.67 # Factorizations : 0
% 1.42/0.67 # NegExts : 0
% 1.42/0.67 # Equation resolutions : 165
% 1.42/0.67 # Total rewrite steps : 6182
% 1.42/0.67 # Propositional unsat checks : 0
% 1.42/0.67 # Propositional check models : 0
% 1.42/0.67 # Propositional check unsatisfiable : 0
% 1.42/0.67 # Propositional clauses : 0
% 1.42/0.67 # Propositional clauses after purity: 0
% 1.42/0.67 # Propositional unsat core size : 0
% 1.42/0.67 # Propositional preprocessing time : 0.000
% 1.42/0.67 # Propositional encoding time : 0.000
% 1.42/0.67 # Propositional solver time : 0.000
% 1.42/0.67 # Success case prop preproc time : 0.000
% 1.42/0.67 # Success case prop encoding time : 0.000
% 1.42/0.67 # Success case prop solver time : 0.000
% 1.42/0.67 # Current number of processed clauses : 372
% 1.42/0.67 # Positive orientable unit clauses : 63
% 1.42/0.67 # Positive unorientable unit clauses: 0
% 1.42/0.67 # Negative unit clauses : 3
% 1.42/0.67 # Non-unit-clauses : 306
% 1.42/0.67 # Current number of unprocessed clauses: 4783
% 1.42/0.67 # ...number of literals in the above : 27161
% 1.42/0.67 # Current number of archived formulas : 0
% 1.42/0.67 # Current number of archived clauses : 510
% 1.42/0.67 # Clause-clause subsumption calls (NU) : 60409
% 1.42/0.67 # Rec. Clause-clause subsumption calls : 20713
% 1.42/0.67 # Non-unit clause-clause subsumptions : 1535
% 1.42/0.67 # Unit Clause-clause subsumption calls : 166
% 1.42/0.67 # Rewrite failures with RHS unbound : 0
% 1.42/0.67 # BW rewrite match attempts : 3
% 1.42/0.67 # BW rewrite match successes : 3
% 1.42/0.67 # Condensation attempts : 0
% 1.42/0.67 # Condensation successes : 0
% 1.42/0.67 # Termbank termtop insertions : 133953
% 1.42/0.67
% 1.42/0.67 # -------------------------------------------------
% 1.42/0.67 # User time : 0.165 s
% 1.42/0.67 # System time : 0.011 s
% 1.42/0.67 # Total time : 0.176 s
% 1.42/0.67 # Maximum resident set size: 2124 pages
% 1.42/0.67
% 1.42/0.67 # -------------------------------------------------
% 1.42/0.67 # User time : 0.821 s
% 1.42/0.67 # System time : 0.057 s
% 1.42/0.67 # Total time : 0.878 s
% 1.42/0.67 # Maximum resident set size: 1852 pages
% 1.42/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------