TSTP Solution File: SWC392-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC392-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:40:47 EDT 2023
% Result : Unsatisfiable 0.39s 0.58s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 50 ( 19 unt; 15 nHn; 50 RR)
% Number of literals : 110 ( 46 equ; 55 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 : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',clause145) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',clause8) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',clause98) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',clause157) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',clause85) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',clause161) ).
cnf(co1_15,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_15) ).
cnf(co1_11,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_11) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',clause71) ).
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_6) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',clause120) ).
cnf(co1_12,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_12) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk6)
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_10) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_5) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_7) ).
cnf(co1_16,negated_conjecture,
( memberP(sk4,sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p',co1_16) ).
cnf(c_0_18,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_19,axiom,
ssList(nil),
clause8 ).
cnf(c_0_20,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_21,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_22,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_23,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])]),c_0_19])]) ).
cnf(c_0_24,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_25,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
co1_15 ).
cnf(c_0_26,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
co1_11 ).
cnf(c_0_27,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_28,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_31,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_21,c_0_23]),c_0_19])]) ).
cnf(c_0_32,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_33,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk4 ),
co1_12 ).
cnf(c_0_34,negated_conjecture,
( ssItem(sk6)
| nil = sk4 ),
co1_10 ).
cnf(c_0_35,negated_conjecture,
~ memberP(sk2,sk5),
co1_9 ).
cnf(c_0_36,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_37,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_24,c_0_25]),c_0_19])]),c_0_26]),c_0_27]) ).
cnf(c_0_38,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_40,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19])]) ).
cnf(c_0_41,negated_conjecture,
( cons(sk6,X1) = app(sk3,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_42,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( sk5 = sk6
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_44,negated_conjecture,
( memberP(sk4,sk6)
| nil = sk3 ),
co1_16 ).
cnf(c_0_45,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_40,c_0_41]),c_0_19])]),c_0_34]) ).
cnf(c_0_46,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_23])]) ).
cnf(c_0_48,negated_conjecture,
~ memberP(nil,sk5),
inference(rw,[status(thm)],[c_0_42,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_46]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC392-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n011.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Oct 3 01:56:23 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.36/0.54 Running first-order theorem proving
% 0.36/0.54 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/tmp/tmp.OzUQpIp6KK/E---3.1_25566.p
% 0.39/0.58 # Version: 3.1pre001
% 0.39/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.58 # Starting sh5l with 300s (1) cores
% 0.39/0.58 # new_bool_3 with pid 25677 completed with status 0
% 0.39/0.58 # Result found by new_bool_3
% 0.39/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.58 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.39/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.39/0.58 # SAT001_MinMin_p005000_rr_RG with pid 25680 completed with status 0
% 0.39/0.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.39/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.58 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.39/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.39/0.58 # Preprocessing time : 0.003 s
% 0.39/0.58 # Presaturation interreduction done
% 0.39/0.58
% 0.39/0.58 # Proof found!
% 0.39/0.58 # SZS status Unsatisfiable
% 0.39/0.58 # SZS output start CNFRefutation
% See solution above
% 0.39/0.58 # Parsed axioms : 202
% 0.39/0.58 # Removed by relevancy pruning/SinE : 149
% 0.39/0.58 # Initial clauses : 53
% 0.39/0.58 # Removed in clause preprocessing : 0
% 0.39/0.58 # Initial clauses in saturation : 53
% 0.39/0.58 # Processed clauses : 334
% 0.39/0.58 # ...of these trivial : 4
% 0.39/0.58 # ...subsumed : 155
% 0.39/0.58 # ...remaining for further processing : 174
% 0.39/0.58 # Other redundant clauses eliminated : 9
% 0.39/0.58 # Clauses deleted for lack of memory : 0
% 0.39/0.58 # Backward-subsumed : 0
% 0.39/0.58 # Backward-rewritten : 68
% 0.39/0.58 # Generated clauses : 497
% 0.39/0.58 # ...of the previous two non-redundant : 402
% 0.39/0.58 # ...aggressively subsumed : 0
% 0.39/0.58 # Contextual simplify-reflections : 40
% 0.39/0.58 # Paramodulations : 485
% 0.39/0.58 # Factorizations : 0
% 0.39/0.58 # NegExts : 0
% 0.39/0.58 # Equation resolutions : 13
% 0.39/0.58 # Total rewrite steps : 546
% 0.39/0.58 # Propositional unsat checks : 0
% 0.39/0.58 # Propositional check models : 0
% 0.39/0.58 # Propositional check unsatisfiable : 0
% 0.39/0.58 # Propositional clauses : 0
% 0.39/0.58 # Propositional clauses after purity: 0
% 0.39/0.58 # Propositional unsat core size : 0
% 0.39/0.58 # Propositional preprocessing time : 0.000
% 0.39/0.58 # Propositional encoding time : 0.000
% 0.39/0.58 # Propositional solver time : 0.000
% 0.39/0.58 # Success case prop preproc time : 0.000
% 0.39/0.58 # Success case prop encoding time : 0.000
% 0.39/0.58 # Success case prop solver time : 0.000
% 0.39/0.58 # Current number of processed clauses : 53
% 0.39/0.58 # Positive orientable unit clauses : 7
% 0.39/0.58 # Positive unorientable unit clauses: 0
% 0.39/0.58 # Negative unit clauses : 1
% 0.39/0.58 # Non-unit-clauses : 45
% 0.39/0.58 # Current number of unprocessed clauses: 170
% 0.39/0.58 # ...number of literals in the above : 915
% 0.39/0.58 # Current number of archived formulas : 0
% 0.39/0.58 # Current number of archived clauses : 117
% 0.39/0.58 # Clause-clause subsumption calls (NU) : 1724
% 0.39/0.58 # Rec. Clause-clause subsumption calls : 902
% 0.39/0.58 # Non-unit clause-clause subsumptions : 195
% 0.39/0.58 # Unit Clause-clause subsumption calls : 15
% 0.39/0.58 # Rewrite failures with RHS unbound : 0
% 0.39/0.58 # BW rewrite match attempts : 2
% 0.39/0.58 # BW rewrite match successes : 2
% 0.39/0.58 # Condensation attempts : 0
% 0.39/0.58 # Condensation successes : 0
% 0.39/0.58 # Termbank termtop insertions : 10279
% 0.39/0.58
% 0.39/0.58 # -------------------------------------------------
% 0.39/0.58 # User time : 0.019 s
% 0.39/0.58 # System time : 0.006 s
% 0.39/0.58 # Total time : 0.025 s
% 0.39/0.58 # Maximum resident set size: 2076 pages
% 0.39/0.58
% 0.39/0.58 # -------------------------------------------------
% 0.39/0.58 # User time : 0.023 s
% 0.39/0.58 # System time : 0.006 s
% 0.39/0.58 # Total time : 0.029 s
% 0.39/0.58 # Maximum resident set size: 1848 pages
% 0.39/0.58 % E---3.1 exiting
% 0.39/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------