TSTP Solution File: SWC182-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC182-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:24:09 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 20 unt; 3 nHn; 43 RR)
% Number of literals : 84 ( 27 equ; 41 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
nil = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_11,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
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_12,negated_conjecture,
( memberP(sk6,sk5)
| memberP(sk7,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_0_13,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_14,negated_conjecture,
nil = sk3,
co1_5 ).
cnf(c_0_15,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_16,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_11 ).
cnf(c_0_17,negated_conjecture,
sk1 = nil,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_19,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = nil,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_22,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_23,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
( sk7 = nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_22 ).
cnf(c_0_26,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_27,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_28,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_21])]) ).
cnf(c_0_29,negated_conjecture,
( sk7 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_30,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_27 ).
cnf(c_0_31,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_32,axiom,
ssList(nil),
clause8 ).
cnf(c_0_33,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26])]) ).
cnf(c_0_34,negated_conjecture,
( memberP(sk6,sk5)
| memberP(sk7,sk5) ),
co1_12 ).
cnf(c_0_35,negated_conjecture,
sk7 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
( sk6 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_26])]) ).
cnf(c_0_37,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_38,negated_conjecture,
( memberP(nil,sk5)
| memberP(sk6,sk5) ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_40,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
memberP(nil,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC182-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:05:22 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_1 with pid 24784 completed with status 0
% 0.19/0.51 # Result found by new_bool_1
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.19/0.51 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24786 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.19/0.51 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.51 # Preprocessing time : 0.003 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 197
% 0.19/0.51 # Removed by relevancy pruning/SinE : 160
% 0.19/0.51 # Initial clauses : 37
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 37
% 0.19/0.51 # Processed clauses : 81
% 0.19/0.51 # ...of these trivial : 3
% 0.19/0.51 # ...subsumed : 0
% 0.19/0.51 # ...remaining for further processing : 78
% 0.19/0.51 # Other redundant clauses eliminated : 8
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 10
% 0.19/0.51 # Generated clauses : 92
% 0.19/0.51 # ...of the previous two non-redundant : 73
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 81
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 12
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 86
% 0.19/0.51 # ...of those cached : 75
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 31
% 0.19/0.51 # Positive orientable unit clauses : 11
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 0
% 0.19/0.51 # Non-unit-clauses : 20
% 0.19/0.51 # Current number of unprocessed clauses: 63
% 0.19/0.51 # ...number of literals in the above : 270
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 44
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 161
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 50
% 0.19/0.51 # Non-unit clause-clause subsumptions : 0
% 0.19/0.51 # Unit Clause-clause subsumption calls : 6
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 2
% 0.19/0.51 # BW rewrite match successes : 2
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 4443
% 0.19/0.51 # Search garbage collected termcells : 900
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.004 s
% 0.19/0.51 # System time : 0.007 s
% 0.19/0.51 # Total time : 0.011 s
% 0.19/0.51 # Maximum resident set size: 2068 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.005 s
% 0.19/0.51 # System time : 0.010 s
% 0.19/0.51 # Total time : 0.016 s
% 0.19/0.51 # Maximum resident set size: 1896 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------