TSTP Solution File: SWC046-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC046-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:27:15 EDT 2024
% Result : Unsatisfiable 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 16 unt; 10 nHn; 37 RR)
% Number of literals : 81 ( 27 equ; 43 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 : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(co1_11,negated_conjecture,
( memberP(sk4,X1)
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
nil = sk2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_8,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_11,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_12,negated_conjecture,
( memberP(sk4,X1)
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_13,negated_conjecture,
sk2 = sk4,
co1_6 ).
cnf(c_0_14,negated_conjecture,
nil = sk2,
co1_5 ).
cnf(c_0_15,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_16,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_11 ).
cnf(c_0_17,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_18,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_19,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_20,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_21,negated_conjecture,
( memberP(sk4,X1)
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
c_0_12 ).
cnf(c_0_22,negated_conjecture,
sk4 = nil,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_15 ).
cnf(c_0_24,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_17 ).
cnf(c_0_26,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_18 ).
cnf(c_0_27,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_19 ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_30,negated_conjecture,
nil != sk1,
c_0_20 ).
cnf(c_0_31,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_32,plain,
( nil = X1
| memberP(X1,hd(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
sk3 != nil,
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
~ ssItem(hd(sk3)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_27]),c_0_33])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC046-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n003.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:42:37 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.17/0.49 # Version: 3.1.0
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # sh5l with pid 20643 completed with status 0
% 0.17/0.49 # Result found by sh5l
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.49 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.49 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.17/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 20648 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.49 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.49 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.17/0.49 # Preprocessing time : 0.002 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Unsatisfiable
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 197
% 0.17/0.49 # Removed by relevancy pruning/SinE : 40
% 0.17/0.49 # Initial clauses : 157
% 0.17/0.49 # Removed in clause preprocessing : 0
% 0.17/0.49 # Initial clauses in saturation : 157
% 0.17/0.49 # Processed clauses : 503
% 0.17/0.49 # ...of these trivial : 3
% 0.17/0.49 # ...subsumed : 139
% 0.17/0.49 # ...remaining for further processing : 361
% 0.17/0.49 # Other redundant clauses eliminated : 45
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 2
% 0.17/0.49 # Backward-rewritten : 2
% 0.17/0.49 # Generated clauses : 797
% 0.17/0.49 # ...of the previous two non-redundant : 660
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 16
% 0.17/0.49 # Paramodulations : 748
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 50
% 0.17/0.49 # Disequality decompositions : 0
% 0.17/0.49 # Total rewrite steps : 667
% 0.17/0.49 # ...of those cached : 613
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 194
% 0.17/0.49 # Positive orientable unit clauses : 41
% 0.17/0.49 # Positive unorientable unit clauses: 0
% 0.17/0.49 # Negative unit clauses : 2
% 0.17/0.49 # Non-unit-clauses : 151
% 0.17/0.49 # Current number of unprocessed clauses: 450
% 0.17/0.49 # ...number of literals in the above : 2628
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 149
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 10133
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 2008
% 0.17/0.49 # Non-unit clause-clause subsumptions : 157
% 0.17/0.49 # Unit Clause-clause subsumption calls : 75
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 2
% 0.17/0.49 # BW rewrite match successes : 2
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 22208
% 0.17/0.49 # Search garbage collected termcells : 640
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.035 s
% 0.17/0.49 # System time : 0.005 s
% 0.17/0.49 # Total time : 0.040 s
% 0.17/0.49 # Maximum resident set size: 2196 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.038 s
% 0.17/0.49 # System time : 0.007 s
% 0.17/0.49 # Total time : 0.045 s
% 0.17/0.49 # Maximum resident set size: 1872 pages
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------