TSTP Solution File: SWC025-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC025-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:40 EDT 2024
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 17 unt; 9 nHn; 40 RR)
% Number of literals : 91 ( 32 equ; 47 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(co1_8,negated_conjecture,
( memberP(sk4,X1)
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
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_10,negated_conjecture,
( nil = sk2
| nil = sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_13,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_9,negated_conjecture,
( memberP(sk3,X1)
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_13,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_14,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_13 ).
cnf(c_0_15,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_16,negated_conjecture,
( memberP(sk4,X1)
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_17,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_15 ).
cnf(c_0_19,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_20,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_21,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
( memberP(sk4,X1)
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
c_0_16 ).
cnf(c_0_24,plain,
( nil = X1
| memberP(X1,skaf83(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( nil = sk2
| nil = sk1 ),
co1_10 ).
cnf(c_0_27,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_28,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_29,negated_conjecture,
( sk3 = nil
| memberP(sk4,skaf83(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
( sk4 = nil
| sk3 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_22]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_32,negated_conjecture,
( memberP(sk3,X1)
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_33,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_28 ).
cnf(c_0_34,negated_conjecture,
( sk3 = nil
| memberP(nil,skaf83(sk3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( memberP(sk3,X1)
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_19])]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_39,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_22]),c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_33]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_42,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_19]),c_0_41])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC025-1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.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 : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 02:59:22 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.17/0.48 # Version: 3.1.0
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 5600 completed with status 0
% 0.17/0.48 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.48 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.48 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.17/0.48 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.17/0.48 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.17/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 5607 completed with status 0
% 0.17/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.48 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.17/0.48 # Preprocessing time : 0.003 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Unsatisfiable
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 198
% 0.17/0.48 # Removed by relevancy pruning/SinE : 0
% 0.17/0.48 # Initial clauses : 198
% 0.17/0.48 # Removed in clause preprocessing : 2
% 0.17/0.48 # Initial clauses in saturation : 196
% 0.17/0.48 # Processed clauses : 427
% 0.17/0.48 # ...of these trivial : 2
% 0.17/0.48 # ...subsumed : 27
% 0.17/0.48 # ...remaining for further processing : 398
% 0.17/0.48 # Other redundant clauses eliminated : 44
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 1
% 0.17/0.48 # Backward-rewritten : 13
% 0.17/0.48 # Generated clauses : 253
% 0.17/0.48 # ...of the previous two non-redundant : 207
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 5
% 0.17/0.48 # Paramodulations : 204
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 49
% 0.17/0.48 # Disequality decompositions : 0
% 0.17/0.48 # Total rewrite steps : 226
% 0.17/0.48 # ...of those cached : 205
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 172
% 0.17/0.48 # Positive orientable unit clauses : 60
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 3
% 0.17/0.48 # Non-unit-clauses : 109
% 0.17/0.48 # Current number of unprocessed clauses: 164
% 0.17/0.48 # ...number of literals in the above : 741
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 203
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 9304
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 1362
% 0.17/0.48 # Non-unit clause-clause subsumptions : 31
% 0.17/0.48 # Unit Clause-clause subsumption calls : 20
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 1
% 0.17/0.48 # BW rewrite match successes : 1
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 12644
% 0.17/0.48 # Search garbage collected termcells : 538
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.026 s
% 0.17/0.48 # System time : 0.006 s
% 0.17/0.48 # Total time : 0.032 s
% 0.17/0.48 # Maximum resident set size: 2144 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.123 s
% 0.17/0.48 # System time : 0.018 s
% 0.17/0.48 # Total time : 0.142 s
% 0.17/0.48 # Maximum resident set size: 1876 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E exiting
%------------------------------------------------------------------------------