TSTP Solution File: SWC003-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC003-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:38:48 EDT 2023
% Result : Unsatisfiable 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 16 unt; 3 nHn; 39 RR)
% Number of literals : 85 ( 23 equ; 50 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_5) ).
cnf(co1_16,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1
| ~ neq(X2,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_16) ).
cnf(co1_21,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_21) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_6) ).
cnf(co1_19,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_19) ).
cnf(co1_18,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_18) ).
cnf(co1_20,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_20) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',clause8) ).
cnf(co1_17,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',co1_17) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',clause86) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Fzl8DADt9X/E---3.1_28489.p',clause99) ).
cnf(c_0_13,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_14,negated_conjecture,
neq(sk2,nil),
c_0_13 ).
cnf(c_0_15,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_16,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1
| ~ neq(X2,nil)
| ~ neq(sk4,nil) ),
co1_16 ).
cnf(c_0_17,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
co1_21 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
co1_19 ).
cnf(c_0_21,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
co1_18 ).
cnf(c_0_22,negated_conjecture,
( app(app(X1,X2),X3) != sk4
| app(X1,X3) != sk1
| ~ neq(X2,nil)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
app(sk6,sk7) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_17])]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
co1_20 ).
cnf(c_0_27,negated_conjecture,
( app(app(sk6,X1),sk7) != sk4
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
( ~ neq(cons(sk5,nil),nil)
| ~ ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_17 ).
cnf(c_0_33,negated_conjecture,
( cons(sk5,nil) = nil
| ~ ssList(cons(sk5,nil)) ),
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,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_35,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_17])]) ).
cnf(c_0_36,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_37,negated_conjecture,
cons(sk5,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_35]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC003-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n003.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Oct 3 01:43:48 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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.Fzl8DADt9X/E---3.1_28489.p
% 0.18/0.48 # Version: 3.1pre001
% 0.18/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # sh5l with pid 28570 completed with status 0
% 0.18/0.48 # Result found by sh5l
% 0.18/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.48 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.18/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 28574 completed with status 0
% 0.18/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.18/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.48 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.18/0.48 # Preprocessing time : 0.002 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Unsatisfiable
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 207
% 0.18/0.48 # Removed by relevancy pruning/SinE : 57
% 0.18/0.48 # Initial clauses : 150
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 150
% 0.18/0.48 # Processed clauses : 288
% 0.18/0.48 # ...of these trivial : 10
% 0.18/0.48 # ...subsumed : 12
% 0.18/0.48 # ...remaining for further processing : 266
% 0.18/0.48 # Other redundant clauses eliminated : 23
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 6
% 0.18/0.48 # Generated clauses : 120
% 0.18/0.48 # ...of the previous two non-redundant : 89
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 3
% 0.18/0.48 # Paramodulations : 96
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 25
% 0.18/0.48 # Total rewrite steps : 141
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 110
% 0.18/0.48 # Positive orientable unit clauses : 43
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 0
% 0.18/0.48 # Non-unit-clauses : 67
% 0.18/0.48 # Current number of unprocessed clauses: 82
% 0.18/0.48 # ...number of literals in the above : 393
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 140
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 4777
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 617
% 0.18/0.48 # Non-unit clause-clause subsumptions : 15
% 0.18/0.48 # Unit Clause-clause subsumption calls : 9
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 2
% 0.18/0.48 # BW rewrite match successes : 2
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 7451
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.016 s
% 0.18/0.48 # System time : 0.004 s
% 0.18/0.48 # Total time : 0.020 s
% 0.18/0.48 # Maximum resident set size: 2180 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.020 s
% 0.18/0.48 # System time : 0.005 s
% 0.18/0.48 # Total time : 0.025 s
% 0.18/0.48 # Maximum resident set size: 1856 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------