TSTP Solution File: SWC323-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC323-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 15 unt; 4 nHn; 45 RR)
% Number of literals : 101 ( 39 equ; 59 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 : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != sk2
| app(X2,X1) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(co1_10,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_12,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_11,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_13,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != sk2
| app(X2,X1) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_14,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_15,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_16,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_17,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != sk2
| app(X2,X1) != sk1 ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_14 ).
cnf(c_0_22,axiom,
ssList(nil),
clause8 ).
cnf(c_0_23,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_24,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
c_0_15 ).
cnf(c_0_25,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_16 ).
cnf(c_0_26,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( app(X1,X2) != sk3
| app(X2,X1) != sk4
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_18]) ).
cnf(c_0_28,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_23 ).
cnf(c_0_30,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_31,negated_conjecture,
( sk4 = nil
| ssList(sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_22])]) ).
cnf(c_0_32,negated_conjecture,
sk4 != nil,
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_28]),c_0_22])]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_34,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk3
| ~ neq(sk4,nil) ),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| ~ neq(sk4,nil) ),
c_0_33 ).
cnf(c_0_37,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(sk4,nil)
| ~ ssList(cons(sk5,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_34]),c_0_35])]),c_0_36]) ).
cnf(c_0_39,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_40,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_25]),c_0_26]),c_0_22])]),c_0_32]) ).
cnf(c_0_42,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
ssItem(sk5),
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_25]),c_0_26]),c_0_22])]),c_0_32]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC323-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 03:32:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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.18/0.47 # Version: 3.1.0
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_1 with pid 15147 completed with status 0
% 0.18/0.47 # Result found by new_bool_1
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # SAT001_MinMin_p005000_rr_RG with pid 15150 completed with status 0
% 0.18/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Unsatisfiable
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 197
% 0.18/0.47 # Removed by relevancy pruning/SinE : 164
% 0.18/0.47 # Initial clauses : 33
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 33
% 0.18/0.47 # Processed clauses : 78
% 0.18/0.47 # ...of these trivial : 2
% 0.18/0.47 # ...subsumed : 1
% 0.18/0.47 # ...remaining for further processing : 75
% 0.18/0.47 # Other redundant clauses eliminated : 10
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 7
% 0.18/0.47 # Backward-rewritten : 2
% 0.18/0.47 # Generated clauses : 66
% 0.18/0.47 # ...of the previous two non-redundant : 46
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 6
% 0.18/0.47 # Paramodulations : 54
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 12
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 66
% 0.18/0.47 # ...of those cached : 58
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 31
% 0.18/0.47 # Positive orientable unit clauses : 8
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 5
% 0.18/0.47 # Non-unit-clauses : 18
% 0.18/0.47 # Current number of unprocessed clauses: 31
% 0.18/0.47 # ...number of literals in the above : 126
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 41
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 179
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 71
% 0.18/0.47 # Non-unit clause-clause subsumptions : 9
% 0.18/0.47 # Unit Clause-clause subsumption calls : 23
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 2
% 0.18/0.47 # BW rewrite match successes : 2
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 3632
% 0.18/0.47 # Search garbage collected termcells : 932
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.003 s
% 0.18/0.47 # System time : 0.004 s
% 0.18/0.47 # Total time : 0.008 s
% 0.18/0.47 # Maximum resident set size: 1928 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.006 s
% 0.18/0.47 # System time : 0.006 s
% 0.18/0.47 # Total time : 0.012 s
% 0.18/0.47 # Maximum resident set size: 1872 pages
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------