TSTP Solution File: SWC200-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC200-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:28:17 EDT 2024
% Result : Unsatisfiable 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 14 unt; 3 nHn; 38 RR)
% Number of literals : 88 ( 19 equ; 51 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; 3 con; 0-2 aty)
% Number of variables : 37 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
singletonP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_9,negated_conjecture,
( memberP(sk1,sk5(X1))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5(X1))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_10,negated_conjecture,
( ~ ssItem(X1)
| X1 != sk5(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(c_0_12,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_13,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_14,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_12 ).
cnf(c_0_15,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_13 ).
cnf(c_0_16,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_17,axiom,
ssList(nil),
clause8 ).
cnf(c_0_18,plain,
( skaf44(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_19,negated_conjecture,
singletonP(sk3),
co1_7 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,plain,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_22,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
singletonP(sk1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_25,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_26,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_27,plain,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
c_0_21 ).
cnf(c_0_28,negated_conjecture,
cons(hd(sk1),nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(hd(sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
cnf(c_0_30,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
( memberP(sk1,sk5(X1))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_32,negated_conjecture,
( ssItem(sk5(X1))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(X1)
| X1 != sk5(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_34,negated_conjecture,
( hd(sk1) = X1
| ~ memberP(sk1,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_17])]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( memberP(sk1,sk5(X1))
| ~ ssItem(X1) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( ssItem(sk5(X1))
| ~ ssItem(X1) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
( ~ ssItem(X1)
| X1 != sk5(X1) ),
c_0_33 ).
cnf(c_0_38,negated_conjecture,
( sk5(X1) = hd(sk1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38])]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWC200-1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Sun May 19 03:07:07 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.13/0.35 Running first-order model finding
% 0.13/0.35 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
% 0.13/0.39 # Version: 3.1.0
% 0.13/0.39 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # sh5l with pid 25446 completed with status 0
% 0.13/0.39 # Result found by sh5l
% 0.13/0.39 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.39 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.13/0.39 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.13/0.39 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 25456 completed with status 0
% 0.13/0.39 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.13/0.39 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.39 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.13/0.39 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.13/0.39 # Preprocessing time : 0.002 s
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39
% 0.13/0.39 # Proof found!
% 0.13/0.39 # SZS status Unsatisfiable
% 0.13/0.39 # SZS output start CNFRefutation
% See solution above
% 0.13/0.39 # Parsed axioms : 195
% 0.13/0.39 # Removed by relevancy pruning/SinE : 33
% 0.13/0.39 # Initial clauses : 162
% 0.13/0.39 # Removed in clause preprocessing : 0
% 0.13/0.39 # Initial clauses in saturation : 162
% 0.13/0.39 # Processed clauses : 371
% 0.13/0.39 # ...of these trivial : 3
% 0.13/0.39 # ...subsumed : 22
% 0.13/0.39 # ...remaining for further processing : 346
% 0.13/0.39 # Other redundant clauses eliminated : 37
% 0.13/0.39 # Clauses deleted for lack of memory : 0
% 0.13/0.39 # Backward-subsumed : 3
% 0.13/0.39 # Backward-rewritten : 1
% 0.13/0.39 # Generated clauses : 338
% 0.13/0.39 # ...of the previous two non-redundant : 258
% 0.13/0.39 # ...aggressively subsumed : 0
% 0.13/0.39 # Contextual simplify-reflections : 9
% 0.13/0.39 # Paramodulations : 296
% 0.13/0.39 # Factorizations : 0
% 0.13/0.39 # NegExts : 0
% 0.13/0.39 # Equation resolutions : 42
% 0.13/0.39 # Disequality decompositions : 0
% 0.13/0.39 # Total rewrite steps : 290
% 0.13/0.39 # ...of those cached : 259
% 0.13/0.39 # Propositional unsat checks : 0
% 0.13/0.39 # Propositional check models : 0
% 0.13/0.39 # Propositional check unsatisfiable : 0
% 0.13/0.39 # Propositional clauses : 0
% 0.13/0.39 # Propositional clauses after purity: 0
% 0.13/0.39 # Propositional unsat core size : 0
% 0.13/0.39 # Propositional preprocessing time : 0.000
% 0.13/0.39 # Propositional encoding time : 0.000
% 0.13/0.39 # Propositional solver time : 0.000
% 0.13/0.39 # Success case prop preproc time : 0.000
% 0.13/0.39 # Success case prop encoding time : 0.000
% 0.13/0.39 # Success case prop solver time : 0.000
% 0.13/0.39 # Current number of processed clauses : 168
% 0.13/0.39 # Positive orientable unit clauses : 54
% 0.13/0.39 # Positive unorientable unit clauses: 0
% 0.13/0.39 # Negative unit clauses : 2
% 0.13/0.39 # Non-unit-clauses : 112
% 0.13/0.39 # Current number of unprocessed clauses: 199
% 0.13/0.39 # ...number of literals in the above : 977
% 0.13/0.39 # Current number of archived formulas : 0
% 0.13/0.39 # Current number of archived clauses : 159
% 0.13/0.39 # Clause-clause subsumption calls (NU) : 7881
% 0.13/0.39 # Rec. Clause-clause subsumption calls : 1398
% 0.13/0.39 # Non-unit clause-clause subsumptions : 28
% 0.13/0.39 # Unit Clause-clause subsumption calls : 66
% 0.13/0.39 # Rewrite failures with RHS unbound : 0
% 0.13/0.39 # BW rewrite match attempts : 2
% 0.13/0.39 # BW rewrite match successes : 2
% 0.13/0.39 # Condensation attempts : 0
% 0.13/0.39 # Condensation successes : 0
% 0.13/0.39 # Termbank termtop insertions : 13302
% 0.13/0.39 # Search garbage collected termcells : 610
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.025 s
% 0.13/0.39 # System time : 0.002 s
% 0.13/0.39 # Total time : 0.027 s
% 0.13/0.39 # Maximum resident set size: 2204 pages
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.027 s
% 0.13/0.39 # System time : 0.003 s
% 0.13/0.39 # Total time : 0.031 s
% 0.13/0.39 # Maximum resident set size: 1900 pages
% 0.13/0.39 % E---3.1 exiting
%------------------------------------------------------------------------------