TSTP Solution File: SWC415-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC415-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:36 EDT 2024
% Result : Unsatisfiable 0.11s 0.36s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 13 unt; 9 nHn; 35 RR)
% Number of literals : 92 ( 30 equ; 57 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
( ~ ssList(X1)
| tl(sk2) != X1
| sk1 != X1
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| tl(sk4) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_10,negated_conjecture,
( ~ ssList(X1)
| tl(sk2) != X1
| sk1 != X1
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_11,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_12,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| tl(sk4) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssList(X1)
| tl(sk2) != X1
| sk1 != X1
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
c_0_11 ).
cnf(c_0_16,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_17,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_18,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| tl(sk4) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
( tl(sk2) != sk1
| ~ neq(nil,sk2)
| ~ ssList(tl(sk2)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15])])]) ).
cnf(c_0_21,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_23,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_17 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,negated_conjecture,
( ~ neq(nil,sk2)
| ~ ssList(tl(sk2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[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_18,c_0_19]),c_0_14]),c_0_14]),c_0_14]),c_0_15])])]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( sk2 = nil
| ssList(tl(sk2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_28,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( sk2 = nil
| ~ neq(nil,sk2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_27 ).
cnf(c_0_31,negated_conjecture,
sk2 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_22]),c_0_29]) ).
cnf(c_0_32,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_15,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC415-1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n025.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Sun May 19 02:46:52 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.11/0.34 Running first-order model finding
% 0.11/0.34 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/benchmark/theBenchmark.p
% 0.11/0.36 # Version: 3.1.0
% 0.11/0.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.36 # Starting sh5l with 300s (1) cores
% 0.11/0.36 # new_bool_3 with pid 28558 completed with status 0
% 0.11/0.36 # Result found by new_bool_3
% 0.11/0.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.36 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.11/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.11/0.36 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28563 completed with status 0
% 0.11/0.36 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.36 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.11/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.11/0.36 # Preprocessing time : 0.002 s
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36
% 0.11/0.36 # Proof found!
% 0.11/0.36 # SZS status Unsatisfiable
% 0.11/0.36 # SZS output start CNFRefutation
% See solution above
% 0.11/0.36 # Parsed axioms : 197
% 0.11/0.36 # Removed by relevancy pruning/SinE : 129
% 0.11/0.36 # Initial clauses : 68
% 0.11/0.36 # Removed in clause preprocessing : 0
% 0.11/0.36 # Initial clauses in saturation : 68
% 0.11/0.36 # Processed clauses : 158
% 0.11/0.36 # ...of these trivial : 5
% 0.11/0.36 # ...subsumed : 6
% 0.11/0.36 # ...remaining for further processing : 147
% 0.11/0.36 # Other redundant clauses eliminated : 15
% 0.11/0.36 # Clauses deleted for lack of memory : 0
% 0.11/0.36 # Backward-subsumed : 1
% 0.11/0.36 # Backward-rewritten : 21
% 0.11/0.36 # Generated clauses : 192
% 0.11/0.36 # ...of the previous two non-redundant : 183
% 0.11/0.36 # ...aggressively subsumed : 0
% 0.11/0.36 # Contextual simplify-reflections : 2
% 0.11/0.36 # Paramodulations : 174
% 0.11/0.36 # Factorizations : 0
% 0.11/0.36 # NegExts : 0
% 0.11/0.36 # Equation resolutions : 19
% 0.11/0.36 # Disequality decompositions : 0
% 0.11/0.36 # Total rewrite steps : 105
% 0.11/0.36 # ...of those cached : 98
% 0.11/0.36 # Propositional unsat checks : 0
% 0.11/0.36 # Propositional check models : 0
% 0.11/0.36 # Propositional check unsatisfiable : 0
% 0.11/0.36 # Propositional clauses : 0
% 0.11/0.36 # Propositional clauses after purity: 0
% 0.11/0.36 # Propositional unsat core size : 0
% 0.11/0.36 # Propositional preprocessing time : 0.000
% 0.11/0.36 # Propositional encoding time : 0.000
% 0.11/0.36 # Propositional solver time : 0.000
% 0.11/0.36 # Success case prop preproc time : 0.000
% 0.11/0.36 # Success case prop encoding time : 0.000
% 0.11/0.36 # Success case prop solver time : 0.000
% 0.11/0.36 # Current number of processed clauses : 59
% 0.11/0.36 # Positive orientable unit clauses : 9
% 0.11/0.36 # Positive unorientable unit clauses: 0
% 0.11/0.36 # Negative unit clauses : 0
% 0.11/0.36 # Non-unit-clauses : 50
% 0.11/0.36 # Current number of unprocessed clauses: 149
% 0.11/0.36 # ...number of literals in the above : 782
% 0.11/0.36 # Current number of archived formulas : 0
% 0.11/0.36 # Current number of archived clauses : 78
% 0.11/0.36 # Clause-clause subsumption calls (NU) : 1889
% 0.11/0.36 # Rec. Clause-clause subsumption calls : 218
% 0.11/0.36 # Non-unit clause-clause subsumptions : 9
% 0.11/0.36 # Unit Clause-clause subsumption calls : 64
% 0.11/0.36 # Rewrite failures with RHS unbound : 0
% 0.11/0.36 # BW rewrite match attempts : 1
% 0.11/0.36 # BW rewrite match successes : 1
% 0.11/0.36 # Condensation attempts : 0
% 0.11/0.36 # Condensation successes : 0
% 0.11/0.36 # Termbank termtop insertions : 7559
% 0.11/0.36 # Search garbage collected termcells : 868
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.010 s
% 0.11/0.36 # System time : 0.001 s
% 0.11/0.36 # Total time : 0.011 s
% 0.11/0.36 # Maximum resident set size: 2072 pages
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.011 s
% 0.11/0.36 # System time : 0.003 s
% 0.11/0.36 # Total time : 0.015 s
% 0.11/0.36 # Maximum resident set size: 1876 pages
% 0.11/0.36 % E---3.1 exiting
%------------------------------------------------------------------------------