TSTP Solution File: SWC416-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC416-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:55 EDT 2023
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of clauses : 57 ( 21 unt; 7 nHn; 57 RR)
% Number of literals : 136 ( 49 equ; 82 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',co1_7) ).
cnf(co1_14,negated_conjecture,
( app(cons(sk5,nil),sk3) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',co1_5) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause119) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',co1_1) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',co1_13) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause8) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause73) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause76) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',co1_2) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause99) ).
cnf(co1_12,negated_conjecture,
( ~ ssList(X1)
| sk2 != X1
| ~ ssList(X2)
| app(X2,sk1) != X1
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk2) != X3
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',co1_12) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause120) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause85) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause97) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.hiKatVuy8q/E---3.1_22023.p',clause100) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_19,negated_conjecture,
( app(cons(sk5,nil),sk3) = sk4
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,negated_conjecture,
neq(sk2,nil),
c_0_18 ).
cnf(c_0_23,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_24,negated_conjecture,
app(cons(sk5,nil),sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_26,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_13 ).
cnf(c_0_27,negated_conjecture,
( sk1 = nil
| sk2 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_29,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_21]),c_0_22])]) ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,negated_conjecture,
( sk1 = nil
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_32,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_33,negated_conjecture,
( app(cons(sk5,nil),nil) = sk2
| sk2 != nil ),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( cons(sk5,nil) = sk2
| sk2 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_36,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_37,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_38,negated_conjecture,
( cons(sk5,nil) = sk2
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| sk2 != X1
| ~ ssList(X2)
| app(X2,sk1) != X1
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk2) != X3
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_40,negated_conjecture,
( sk2 = nil
| ssItem(hd(sk2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
sk2 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_29]),c_0_30])]) ).
cnf(c_0_42,negated_conjecture,
( app(cons(hd(sk2),nil),sk1) != sk2
| ~ neq(nil,sk2)
| ~ ssItem(hd(sk2))
| ~ ssList(app(cons(hd(sk2),nil),sk1))
| ~ ssList(cons(hd(sk2),nil)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_21]),c_0_22])])])])]) ).
cnf(c_0_43,negated_conjecture,
ssItem(hd(sk2)),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_45,negated_conjecture,
( app(cons(hd(sk2),nil),sk1) != sk2
| ~ neq(nil,sk2)
| ~ ssList(app(cons(hd(sk2),nil),sk1))
| ~ ssList(cons(hd(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_46,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_47,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_48,negated_conjecture,
cons(sk5,sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_44]),c_0_29]),c_0_25])]) ).
cnf(c_0_49,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_50,negated_conjecture,
( app(cons(hd(sk2),nil),sk1) != sk2
| ~ neq(nil,sk2)
| ~ ssList(cons(hd(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_25])]) ).
cnf(c_0_51,negated_conjecture,
hd(sk2) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_29]),c_0_25])]) ).
cnf(c_0_52,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_30]) ).
cnf(c_0_53,negated_conjecture,
( ~ neq(nil,sk2)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_24])]) ).
cnf(c_0_54,negated_conjecture,
neq(nil,sk2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_36]),c_0_41]) ).
cnf(c_0_55,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_28]),c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC416-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:48:29 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.hiKatVuy8q/E---3.1_22023.p
% 0.18/0.49 # Version: 3.1pre001
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # new_bool_1 with pid 22103 completed with status 0
% 0.18/0.49 # Result found by new_bool_1
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22105 completed with status 0
% 0.18/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.49 # Preprocessing time : 0.004 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Unsatisfiable
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 199
% 0.18/0.49 # Removed by relevancy pruning/SinE : 135
% 0.18/0.49 # Initial clauses : 64
% 0.18/0.49 # Removed in clause preprocessing : 0
% 0.18/0.49 # Initial clauses in saturation : 64
% 0.18/0.49 # Processed clauses : 175
% 0.18/0.49 # ...of these trivial : 6
% 0.18/0.49 # ...subsumed : 14
% 0.18/0.49 # ...remaining for further processing : 155
% 0.18/0.49 # Other redundant clauses eliminated : 16
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 7
% 0.18/0.49 # Backward-rewritten : 4
% 0.18/0.49 # Generated clauses : 208
% 0.18/0.49 # ...of the previous two non-redundant : 179
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 1
% 0.18/0.49 # Paramodulations : 189
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 20
% 0.18/0.49 # Total rewrite steps : 186
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 80
% 0.18/0.49 # Positive orientable unit clauses : 17
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 4
% 0.18/0.49 # Non-unit-clauses : 59
% 0.18/0.49 # Current number of unprocessed clauses: 112
% 0.18/0.49 # ...number of literals in the above : 605
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 66
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 1483
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 200
% 0.18/0.49 # Non-unit clause-clause subsumptions : 13
% 0.18/0.49 # Unit Clause-clause subsumption calls : 64
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 3
% 0.18/0.49 # BW rewrite match successes : 3
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 6879
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.013 s
% 0.18/0.49 # System time : 0.004 s
% 0.18/0.49 # Total time : 0.017 s
% 0.18/0.49 # Maximum resident set size: 2060 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.015 s
% 0.18/0.49 # System time : 0.007 s
% 0.18/0.49 # Total time : 0.022 s
% 0.18/0.49 # Maximum resident set size: 1848 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------