TSTP Solution File: SWC392-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC392-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:27 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of clauses : 58 ( 20 unt; 16 nHn; 58 RR)
% Number of literals : 137 ( 53 equ; 76 neg)
% Maximal clause size : 6 ( 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 : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_15,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_11,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_12,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk6)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_16,negated_conjecture,
( memberP(sk4,sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(c_0_18,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_19,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_20,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_21,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_22,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_18 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,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_25,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_26,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_19 ).
cnf(c_0_27,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_20 ).
cnf(c_0_28,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_21 ).
cnf(c_0_29,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]),c_0_23])]) ).
cnf(c_0_30,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_31,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_32,plain,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
c_0_24 ).
cnf(c_0_33,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
co1_15 ).
cnf(c_0_34,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
co1_11 ).
cnf(c_0_35,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_25 ).
cnf(c_0_36,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_37,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_38,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_39,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_23])]) ).
cnf(c_0_40,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_30 ).
cnf(c_0_41,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk4 ),
co1_12 ).
cnf(c_0_42,negated_conjecture,
( ssItem(sk6)
| nil = sk4 ),
co1_10 ).
cnf(c_0_43,negated_conjecture,
~ memberP(sk2,sk5),
c_0_31 ).
cnf(c_0_44,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_45,negated_conjecture,
( sk3 = nil
| sk6 = X1
| ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_23])]),c_0_34]),c_0_35]) ).
cnf(c_0_46,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_48,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23])]) ).
cnf(c_0_49,negated_conjecture,
( cons(sk6,X1) = app(sk3,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( sk5 = sk6
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_52,negated_conjecture,
( memberP(sk4,sk6)
| nil = sk3 ),
co1_16 ).
cnf(c_0_53,negated_conjecture,
( sk4 = nil
| app(sk3,nil) != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_23])]),c_0_42]) ).
cnf(c_0_54,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_29])]) ).
cnf(c_0_56,negated_conjecture,
~ memberP(nil,sk5),
inference(rw,[status(thm)],[c_0_50,c_0_55]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_54]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC392-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:18:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 27998 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 28001 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.003 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 202
% 0.21/0.52 # Removed by relevancy pruning/SinE : 149
% 0.21/0.52 # Initial clauses : 53
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 53
% 0.21/0.52 # Processed clauses : 334
% 0.21/0.52 # ...of these trivial : 4
% 0.21/0.52 # ...subsumed : 155
% 0.21/0.52 # ...remaining for further processing : 174
% 0.21/0.52 # Other redundant clauses eliminated : 9
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 68
% 0.21/0.52 # Generated clauses : 497
% 0.21/0.52 # ...of the previous two non-redundant : 402
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 40
% 0.21/0.52 # Paramodulations : 485
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 13
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 546
% 0.21/0.52 # ...of those cached : 537
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 53
% 0.21/0.52 # Positive orientable unit clauses : 7
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 45
% 0.21/0.52 # Current number of unprocessed clauses: 170
% 0.21/0.52 # ...number of literals in the above : 915
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 117
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 1724
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 902
% 0.21/0.52 # Non-unit clause-clause subsumptions : 195
% 0.21/0.52 # Unit Clause-clause subsumption calls : 15
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 2
% 0.21/0.52 # BW rewrite match successes : 2
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 10890
% 0.21/0.52 # Search garbage collected termcells : 897
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.021 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.026 s
% 0.21/0.52 # Maximum resident set size: 2064 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.027 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.032 s
% 0.21/0.52 # Maximum resident set size: 1876 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------