TSTP Solution File: SWC357-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC357-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:29:14 EDT 2024
% Result : Unsatisfiable 2.05s 0.77s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 50 ( 23 unt; 6 nHn; 48 RR)
% Number of literals : 111 ( 34 equ; 60 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; 5 con; 0-2 aty)
% Number of variables : 45 ( 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/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_8,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_12,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(c_0_15,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_16,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_15 ).
cnf(c_0_17,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_18,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_19,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_20,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
~ segmentP(sk2,sk1),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_25,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_16]) ).
cnf(c_0_26,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_17 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_18 ).
cnf(c_0_29,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_19 ).
cnf(c_0_30,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk3) ),
co1_10 ).
cnf(c_0_31,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_33,negated_conjecture,
~ segmentP(sk2,sk1),
c_0_24 ).
cnf(c_0_34,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_35,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk3) ),
co1_12 ).
cnf(c_0_36,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_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_37,negated_conjecture,
( app(sk3,skaf45(sk4,sk3)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_38,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_39,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_23]),c_0_21]) ).
cnf(c_0_40,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_34 ).
cnf(c_0_41,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_29,c_0_35]),c_0_31]),c_0_32])]) ).
cnf(c_0_42,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_43,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_36,c_0_37]),c_0_38]),c_0_31])]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( sk3 = nil
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38]),c_0_31])]) ).
cnf(c_0_45,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
~ segmentP(nil,sk3),
inference(rw,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_43])]) ).
cnf(c_0_48,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_27])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC357-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:08:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.52 Running first-order model finding
% 0.20/0.52 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/benchmark/theBenchmark.p
% 2.05/0.77 # Version: 3.1.0
% 2.05/0.77 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.05/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.77 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.05/0.77 # Starting new_bool_3 with 300s (1) cores
% 2.05/0.77 # Starting new_bool_1 with 300s (1) cores
% 2.05/0.77 # Starting sh5l with 300s (1) cores
% 2.05/0.77 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 15375 completed with status 0
% 2.05/0.77 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.05/0.77 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.05/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.77 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.05/0.77 # No SInE strategy applied
% 2.05/0.77 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.05/0.77 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.05/0.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.05/0.77 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.05/0.77 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.05/0.77 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.05/0.77 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.05/0.77 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 15381 completed with status 0
% 2.05/0.77 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 2.05/0.77 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.05/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.77 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.05/0.77 # No SInE strategy applied
% 2.05/0.77 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.05/0.77 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.05/0.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.05/0.77 # Preprocessing time : 0.003 s
% 2.05/0.77 # Presaturation interreduction done
% 2.05/0.77
% 2.05/0.77 # Proof found!
% 2.05/0.77 # SZS status Unsatisfiable
% 2.05/0.77 # SZS output start CNFRefutation
% See solution above
% 2.05/0.77 # Parsed axioms : 197
% 2.05/0.77 # Removed by relevancy pruning/SinE : 0
% 2.05/0.77 # Initial clauses : 197
% 2.05/0.77 # Removed in clause preprocessing : 0
% 2.05/0.77 # Initial clauses in saturation : 197
% 2.05/0.77 # Processed clauses : 2165
% 2.05/0.77 # ...of these trivial : 4
% 2.05/0.77 # ...subsumed : 1319
% 2.05/0.77 # ...remaining for further processing : 842
% 2.05/0.77 # Other redundant clauses eliminated : 189
% 2.05/0.77 # Clauses deleted for lack of memory : 0
% 2.05/0.77 # Backward-subsumed : 18
% 2.05/0.77 # Backward-rewritten : 216
% 2.05/0.77 # Generated clauses : 6388
% 2.05/0.77 # ...of the previous two non-redundant : 5841
% 2.05/0.77 # ...aggressively subsumed : 0
% 2.05/0.77 # Contextual simplify-reflections : 141
% 2.05/0.77 # Paramodulations : 6191
% 2.05/0.77 # Factorizations : 0
% 2.05/0.77 # NegExts : 0
% 2.05/0.77 # Equation resolutions : 198
% 2.05/0.77 # Disequality decompositions : 0
% 2.05/0.77 # Total rewrite steps : 6915
% 2.05/0.77 # ...of those cached : 6737
% 2.05/0.77 # Propositional unsat checks : 0
% 2.05/0.77 # Propositional check models : 0
% 2.05/0.77 # Propositional check unsatisfiable : 0
% 2.05/0.77 # Propositional clauses : 0
% 2.05/0.77 # Propositional clauses after purity: 0
% 2.05/0.77 # Propositional unsat core size : 0
% 2.05/0.77 # Propositional preprocessing time : 0.000
% 2.05/0.77 # Propositional encoding time : 0.000
% 2.05/0.77 # Propositional solver time : 0.000
% 2.05/0.77 # Success case prop preproc time : 0.000
% 2.05/0.77 # Success case prop encoding time : 0.000
% 2.05/0.77 # Success case prop solver time : 0.000
% 2.05/0.77 # Current number of processed clauses : 396
% 2.05/0.77 # Positive orientable unit clauses : 60
% 2.05/0.77 # Positive unorientable unit clauses: 0
% 2.05/0.77 # Negative unit clauses : 2
% 2.05/0.77 # Non-unit-clauses : 334
% 2.05/0.77 # Current number of unprocessed clauses: 4044
% 2.05/0.77 # ...number of literals in the above : 21833
% 2.05/0.77 # Current number of archived formulas : 0
% 2.05/0.77 # Current number of archived clauses : 423
% 2.05/0.77 # Clause-clause subsumption calls (NU) : 47954
% 2.05/0.77 # Rec. Clause-clause subsumption calls : 12975
% 2.05/0.77 # Non-unit clause-clause subsumptions : 1265
% 2.05/0.77 # Unit Clause-clause subsumption calls : 134
% 2.05/0.77 # Rewrite failures with RHS unbound : 0
% 2.05/0.77 # BW rewrite match attempts : 4
% 2.05/0.77 # BW rewrite match successes : 4
% 2.05/0.77 # Condensation attempts : 0
% 2.05/0.77 # Condensation successes : 0
% 2.05/0.77 # Termbank termtop insertions : 119040
% 2.05/0.77 # Search garbage collected termcells : 529
% 2.05/0.77
% 2.05/0.77 # -------------------------------------------------
% 2.05/0.77 # User time : 0.224 s
% 2.05/0.77 # System time : 0.011 s
% 2.05/0.77 # Total time : 0.235 s
% 2.05/0.77 # Maximum resident set size: 2144 pages
% 2.05/0.77
% 2.05/0.77 # -------------------------------------------------
% 2.05/0.77 # User time : 1.093 s
% 2.05/0.77 # System time : 0.051 s
% 2.05/0.77 # Total time : 1.144 s
% 2.05/0.77 # Maximum resident set size: 1896 pages
% 2.05/0.77 % E---3.1 exiting
%------------------------------------------------------------------------------