TSTP Solution File: SWC322-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC322-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:29:02 EDT 2024
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of clauses : 62 ( 13 unt; 6 nHn; 62 RR)
% Number of literals : 147 ( 93 equ; 84 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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_15,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
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_16,negated_conjecture,
( app(cons(sk5,nil),sk6) != sk1
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(co1_7,negated_conjecture,
( app(cons(X1,nil),X2) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,cons(X1,nil)) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_13,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(c_0_17,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
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,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_20,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_21,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_18 ).
cnf(c_0_25,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil != sk1 ),
c_0_19 ).
cnf(c_0_26,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
c_0_20 ).
cnf(c_0_27,negated_conjecture,
( sk1 = nil
| sk2 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_29,negated_conjecture,
( sk6 = nil
| sk2 != nil
| ~ ssList(cons(sk5,nil)) ),
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_30,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_28 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_33,negated_conjecture,
( sk6 = nil
| sk2 != nil
| ~ ssItem(sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
c_0_32 ).
cnf(c_0_35,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_36,negated_conjecture,
( sk6 = nil
| sk2 != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27]) ).
cnf(c_0_37,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
( app(nil,cons(sk5,nil)) = sk2
| sk2 != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_27]) ).
cnf(c_0_39,negated_conjecture,
( app(cons(sk5,nil),sk6) != sk1
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_40,negated_conjecture,
( cons(sk5,nil) = nil
| sk2 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).
cnf(c_0_41,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_42,negated_conjecture,
( app(cons(sk5,nil),sk6) != sk1
| nil != sk1 ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
( cons(sk5,nil) = nil
| sk2 != nil
| ~ ssItem(sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_30]),c_0_31])]) ).
cnf(c_0_44,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
( app(cons(X1,nil),X2) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,cons(X1,nil)) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_46,negated_conjecture,
( app(cons(sk5,nil),nil) != sk1
| sk2 != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_27]) ).
cnf(c_0_47,negated_conjecture,
( cons(sk5,nil) = nil
| sk2 != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_27]) ).
cnf(c_0_48,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])]),c_0_31])]) ).
cnf(c_0_49,negated_conjecture,
( app(cons(X1,nil),X2) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,cons(X1,nil)) != sk4 ),
c_0_45 ).
cnf(c_0_50,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil = sk2 ),
co1_12 ).
cnf(c_0_51,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_27]) ).
cnf(c_0_52,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
co1_9 ).
cnf(c_0_53,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
co1_11 ).
cnf(c_0_54,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_55,negated_conjecture,
( app(cons(X1,nil),X2) = sk1
| app(X2,cons(X1,nil)) != sk2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_22]),c_0_23]) ).
cnf(c_0_56,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk2,
inference(sr,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_53,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) != sk1 ),
c_0_54 ).
cnf(c_0_60,negated_conjecture,
app(cons(sk5,nil),sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SWC322-1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n003.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 03:55:52 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.15/0.44 # Version: 3.1.0
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # new_bool_1 with pid 6807 completed with status 0
% 0.15/0.44 # Result found by new_bool_1
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # SAT001_MinMin_p005000_rr_RG with pid 6809 completed with status 0
% 0.15/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # Preprocessing time : 0.004 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Unsatisfiable
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 201
% 0.15/0.44 # Removed by relevancy pruning/SinE : 168
% 0.15/0.44 # Initial clauses : 33
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 33
% 0.15/0.44 # Processed clauses : 95
% 0.15/0.44 # ...of these trivial : 2
% 0.15/0.44 # ...subsumed : 7
% 0.15/0.44 # ...remaining for further processing : 86
% 0.15/0.44 # Other redundant clauses eliminated : 6
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 15
% 0.15/0.44 # Backward-rewritten : 2
% 0.15/0.44 # Generated clauses : 153
% 0.15/0.44 # ...of the previous two non-redundant : 111
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 15
% 0.15/0.44 # Paramodulations : 143
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 8
% 0.15/0.44 # Disequality decompositions : 0
% 0.15/0.44 # Total rewrite steps : 76
% 0.15/0.44 # ...of those cached : 66
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 34
% 0.15/0.44 # Positive orientable unit clauses : 10
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 1
% 0.15/0.44 # Non-unit-clauses : 23
% 0.15/0.44 # Current number of unprocessed clauses: 72
% 0.15/0.44 # ...number of literals in the above : 349
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 51
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 240
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 124
% 0.15/0.44 # Non-unit clause-clause subsumptions : 26
% 0.15/0.44 # Unit Clause-clause subsumption calls : 20
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 4
% 0.15/0.44 # BW rewrite match successes : 4
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 4837
% 0.15/0.44 # Search garbage collected termcells : 938
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.004 s
% 0.15/0.44 # System time : 0.005 s
% 0.15/0.44 # Total time : 0.010 s
% 0.15/0.44 # Maximum resident set size: 1936 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.009 s
% 0.15/0.44 # System time : 0.007 s
% 0.15/0.44 # Total time : 0.016 s
% 0.15/0.44 # Maximum resident set size: 1876 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------