TSTP Solution File: SWC024-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC024-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:22:39 EDT 2024
% Result : Unsatisfiable 0.20s 0.46s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 21 unt; 4 nHn; 47 RR)
% Number of literals : 107 ( 24 equ; 66 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_13,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(c_0_14,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
( nil = sk4
| nil != sk3 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_18,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_19,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( nil = sk4
| nil != sk3 ),
c_0_17 ).
cnf(c_0_24,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_25,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_27,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_18 ).
cnf(c_0_28,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( neq(nil,nil)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_24 ).
cnf(c_0_33,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_25 ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1) ),
c_0_26 ).
cnf(c_0_35,negated_conjecture,
( X1 = sk3
| neq(sk3,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_37,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_32]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
app(sk3,sk5) = sk4,
co1_10 ).
cnf(c_0_39,negated_conjecture,
ssList(sk5),
co1_9 ).
cnf(c_0_40,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_20]),c_0_16]) ).
cnf(c_0_41,negated_conjecture,
neq(sk3,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
frontsegP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_28])]) ).
cnf(c_0_43,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_44,negated_conjecture,
~ frontsegP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_28])]) ).
cnf(c_0_45,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
c_0_43 ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC024-1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n023.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Sun May 19 03:33:53 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.20/0.44 Running first-order theorem proving
% 0.20/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/benchmark/theBenchmark.p
% 0.20/0.46 # Version: 3.1.0
% 0.20/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.46 # Starting sh5l with 300s (1) cores
% 0.20/0.46 # new_bool_1 with pid 28764 completed with status 0
% 0.20/0.46 # Result found by new_bool_1
% 0.20/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.46 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.20/0.46 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.20/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28766 completed with status 0
% 0.20/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.46 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.20/0.46 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.20/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.46 # Preprocessing time : 0.002 s
% 0.20/0.46 # Presaturation interreduction done
% 0.20/0.46
% 0.20/0.46 # Proof found!
% 0.20/0.46 # SZS status Unsatisfiable
% 0.20/0.46 # SZS output start CNFRefutation
% See solution above
% 0.20/0.46 # Parsed axioms : 198
% 0.20/0.46 # Removed by relevancy pruning/SinE : 150
% 0.20/0.46 # Initial clauses : 48
% 0.20/0.46 # Removed in clause preprocessing : 0
% 0.20/0.46 # Initial clauses in saturation : 48
% 0.20/0.46 # Processed clauses : 140
% 0.20/0.46 # ...of these trivial : 2
% 0.20/0.46 # ...subsumed : 10
% 0.20/0.46 # ...remaining for further processing : 128
% 0.20/0.46 # Other redundant clauses eliminated : 12
% 0.20/0.46 # Clauses deleted for lack of memory : 0
% 0.20/0.46 # Backward-subsumed : 4
% 0.20/0.46 # Backward-rewritten : 0
% 0.20/0.46 # Generated clauses : 175
% 0.20/0.46 # ...of the previous two non-redundant : 143
% 0.20/0.46 # ...aggressively subsumed : 0
% 0.20/0.46 # Contextual simplify-reflections : 1
% 0.20/0.46 # Paramodulations : 158
% 0.20/0.46 # Factorizations : 0
% 0.20/0.46 # NegExts : 0
% 0.20/0.46 # Equation resolutions : 16
% 0.20/0.46 # Disequality decompositions : 0
% 0.20/0.46 # Total rewrite steps : 120
% 0.20/0.46 # ...of those cached : 111
% 0.20/0.46 # Propositional unsat checks : 0
% 0.20/0.46 # Propositional check models : 0
% 0.20/0.46 # Propositional check unsatisfiable : 0
% 0.20/0.46 # Propositional clauses : 0
% 0.20/0.46 # Propositional clauses after purity: 0
% 0.20/0.46 # Propositional unsat core size : 0
% 0.20/0.46 # Propositional preprocessing time : 0.000
% 0.20/0.46 # Propositional encoding time : 0.000
% 0.20/0.46 # Propositional solver time : 0.000
% 0.20/0.46 # Success case prop preproc time : 0.000
% 0.20/0.46 # Success case prop encoding time : 0.000
% 0.20/0.46 # Success case prop solver time : 0.000
% 0.20/0.46 # Current number of processed clauses : 69
% 0.20/0.46 # Positive orientable unit clauses : 16
% 0.20/0.46 # Positive unorientable unit clauses: 0
% 0.20/0.46 # Negative unit clauses : 5
% 0.20/0.46 # Non-unit-clauses : 48
% 0.20/0.46 # Current number of unprocessed clauses: 95
% 0.20/0.46 # ...number of literals in the above : 481
% 0.20/0.46 # Current number of archived formulas : 0
% 0.20/0.46 # Current number of archived clauses : 52
% 0.20/0.46 # Clause-clause subsumption calls (NU) : 1050
% 0.20/0.46 # Rec. Clause-clause subsumption calls : 176
% 0.20/0.46 # Non-unit clause-clause subsumptions : 8
% 0.20/0.46 # Unit Clause-clause subsumption calls : 77
% 0.20/0.46 # Rewrite failures with RHS unbound : 0
% 0.20/0.46 # BW rewrite match attempts : 0
% 0.20/0.46 # BW rewrite match successes : 0
% 0.20/0.46 # Condensation attempts : 0
% 0.20/0.46 # Condensation successes : 0
% 0.20/0.46 # Termbank termtop insertions : 5988
% 0.20/0.46 # Search garbage collected termcells : 915
% 0.20/0.46
% 0.20/0.46 # -------------------------------------------------
% 0.20/0.46 # User time : 0.009 s
% 0.20/0.46 # System time : 0.002 s
% 0.20/0.46 # Total time : 0.010 s
% 0.20/0.46 # Maximum resident set size: 2084 pages
% 0.20/0.46
% 0.20/0.46 # -------------------------------------------------
% 0.20/0.46 # User time : 0.012 s
% 0.20/0.46 # System time : 0.003 s
% 0.20/0.46 # Total time : 0.015 s
% 0.20/0.46 # Maximum resident set size: 1876 pages
% 0.20/0.46 % E---3.1 exiting
% 0.20/0.46 % E exiting
%------------------------------------------------------------------------------