TSTP Solution File: SWC085-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC085-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:15 EDT 2023
% Result : Unsatisfiable 0.89s 0.60s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 54 ( 21 unt; 7 nHn; 52 RR)
% Number of literals : 115 ( 27 equ; 59 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.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/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause173) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',co1_2) ).
cnf(co1_11,negated_conjecture,
( nil = sk3
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',co1_11) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',co1_9) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause85) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause132) ).
cnf(co1_12,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk3) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',co1_12) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause57) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',co1_7) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause51) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause56) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.N1nenaEccf/E---3.1_16767.p',clause79) ).
cnf(c_0_18,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_8 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
ssList(sk1),
co1_1 ).
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(sk2),
co1_2 ).
cnf(c_0_24,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( nil = sk3
| neq(sk3,nil) ),
co1_11 ).
cnf(c_0_26,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
co1_9 ).
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,
( nil = sk3
| frontsegP(sk4,sk3) ),
co1_12 ).
cnf(c_0_34,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_35,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk3,sk3)
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_36,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_37,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_38,negated_conjecture,
( sk4 = nil
| ~ segmentP(sk3,sk3)
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_27]),c_0_26])]) ).
cnf(c_0_39,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_40,negated_conjecture,
( app(sk3,skaf45(sk4,sk3)) = sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26]),c_0_34])]) ).
cnf(c_0_41,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_42,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26])]) ).
cnf(c_0_43,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_44,negated_conjecture,
( sk4 = nil
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_26])]) ).
cnf(c_0_45,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_26])]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( ~ segmentP(sk3,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_34])]) ).
cnf(c_0_47,negated_conjecture,
( sk4 = nil
| ~ segmentP(sk4,nil) ),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_49,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_50,negated_conjecture,
( ~ segmentP(nil,sk4)
| ~ segmentP(sk4,sk4) ),
inference(rw,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_34])]) ).
cnf(c_0_52,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_30])]) ).
cnf(c_0_53,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_50,c_0_51]),c_0_52]),c_0_51]),c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC085-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:58:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.N1nenaEccf/E---3.1_16767.p
% 0.89/0.60 # Version: 3.1pre001
% 0.89/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.89/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.89/0.60 # Starting sh5l with 300s (1) cores
% 0.89/0.60 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16845 completed with status 0
% 0.89/0.60 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.89/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.60 # No SInE strategy applied
% 0.89/0.60 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.89/0.60 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.89/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.89/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.89/0.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.89/0.60 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.89/0.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.89/0.60 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 16851 completed with status 0
% 0.89/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.89/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.60 # No SInE strategy applied
% 0.89/0.60 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.89/0.60 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.89/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.89/0.60 # Preprocessing time : 0.003 s
% 0.89/0.60 # Presaturation interreduction done
% 0.89/0.60
% 0.89/0.60 # Proof found!
% 0.89/0.60 # SZS status Unsatisfiable
% 0.89/0.60 # SZS output start CNFRefutation
% See solution above
% 0.89/0.60 # Parsed axioms : 197
% 0.89/0.60 # Removed by relevancy pruning/SinE : 0
% 0.89/0.60 # Initial clauses : 197
% 0.89/0.60 # Removed in clause preprocessing : 0
% 0.89/0.60 # Initial clauses in saturation : 197
% 0.89/0.60 # Processed clauses : 1859
% 0.89/0.60 # ...of these trivial : 4
% 0.89/0.60 # ...subsumed : 1070
% 0.89/0.60 # ...remaining for further processing : 785
% 0.89/0.60 # Other redundant clauses eliminated : 176
% 0.89/0.60 # Clauses deleted for lack of memory : 0
% 0.89/0.60 # Backward-subsumed : 15
% 0.89/0.60 # Backward-rewritten : 194
% 0.89/0.60 # Generated clauses : 4594
% 0.89/0.60 # ...of the previous two non-redundant : 4123
% 0.89/0.60 # ...aggressively subsumed : 0
% 0.89/0.60 # Contextual simplify-reflections : 119
% 0.89/0.60 # Paramodulations : 4410
% 0.89/0.60 # Factorizations : 0
% 0.89/0.60 # NegExts : 0
% 0.89/0.60 # Equation resolutions : 185
% 0.89/0.60 # Total rewrite steps : 4880
% 0.89/0.60 # Propositional unsat checks : 0
% 0.89/0.60 # Propositional check models : 0
% 0.89/0.60 # Propositional check unsatisfiable : 0
% 0.89/0.60 # Propositional clauses : 0
% 0.89/0.60 # Propositional clauses after purity: 0
% 0.89/0.60 # Propositional unsat core size : 0
% 0.89/0.60 # Propositional preprocessing time : 0.000
% 0.89/0.60 # Propositional encoding time : 0.000
% 0.89/0.60 # Propositional solver time : 0.000
% 0.89/0.60 # Success case prop preproc time : 0.000
% 0.89/0.60 # Success case prop encoding time : 0.000
% 0.89/0.60 # Success case prop solver time : 0.000
% 0.89/0.60 # Current number of processed clauses : 364
% 0.89/0.60 # Positive orientable unit clauses : 61
% 0.89/0.60 # Positive unorientable unit clauses: 0
% 0.89/0.60 # Negative unit clauses : 2
% 0.89/0.60 # Non-unit-clauses : 301
% 0.89/0.60 # Current number of unprocessed clauses: 2634
% 0.89/0.60 # ...number of literals in the above : 14379
% 0.89/0.60 # Current number of archived formulas : 0
% 0.89/0.60 # Current number of archived clauses : 398
% 0.89/0.60 # Clause-clause subsumption calls (NU) : 40697
% 0.89/0.60 # Rec. Clause-clause subsumption calls : 11673
% 0.89/0.60 # Non-unit clause-clause subsumptions : 1049
% 0.89/0.60 # Unit Clause-clause subsumption calls : 66
% 0.89/0.60 # Rewrite failures with RHS unbound : 0
% 0.89/0.60 # BW rewrite match attempts : 4
% 0.89/0.60 # BW rewrite match successes : 4
% 0.89/0.60 # Condensation attempts : 0
% 0.89/0.60 # Condensation successes : 0
% 0.89/0.60 # Termbank termtop insertions : 83919
% 0.89/0.60
% 0.89/0.60 # -------------------------------------------------
% 0.89/0.60 # User time : 0.127 s
% 0.89/0.60 # System time : 0.011 s
% 0.89/0.60 # Total time : 0.138 s
% 0.89/0.60 # Maximum resident set size: 2112 pages
% 0.89/0.60
% 0.89/0.60 # -------------------------------------------------
% 0.89/0.60 # User time : 0.645 s
% 0.89/0.60 # System time : 0.039 s
% 0.89/0.60 # Total time : 0.683 s
% 0.89/0.60 # Maximum resident set size: 1852 pages
% 0.89/0.60 % E---3.1 exiting
% 0.89/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------