TSTP Solution File: SWC004-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC004-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:22:32 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 15 unt; 4 nHn; 47 RR)
% Number of literals : 111 ( 29 equ; 69 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 : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_15,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/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_20,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
cnf(co1_18,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_19,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_16,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(c_0_13,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1
| ~ neq(X2,nil)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_14,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_15,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_20]) ).
cnf(c_0_16,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_17,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1
| ~ neq(X2,nil)
| ~ neq(sk4,nil) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,negated_conjecture,
neq(sk2,nil),
c_0_14 ).
cnf(c_0_21,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
c_0_17 ).
cnf(c_0_25,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_26,negated_conjecture,
( app(app(X1,X2),X3) != sk2
| 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_18,c_0_19]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
app(sk6,sk7) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_19]),c_0_20])]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_19]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_19]),c_0_20])]) ).
cnf(c_0_30,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
( app(app(sk6,X1),sk7) != sk2
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_19]),c_0_19]),c_0_20])]) ).
cnf(c_0_33,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_34,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_35,negated_conjecture,
( ~ neq(cons(sk5,nil),nil)
| ~ ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_33 ).
cnf(c_0_37,axiom,
ssList(nil),
clause8 ).
cnf(c_0_38,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_39,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_34 ).
cnf(c_0_40,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_41,negated_conjecture,
( cons(sk5,nil) = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_42,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_19]),c_0_20])]) ).
cnf(c_0_44,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_40 ).
cnf(c_0_45,negated_conjecture,
cons(sk5,nil) = nil,
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_37])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_43]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC004-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:49:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # sh5l with pid 3530 completed with status 0
% 0.20/0.52 # Result found by sh5l
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.52 # Search class: FGHSM-FSMM21-MFFFFFNN
% 0.20/0.52 # partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.20/0.52 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 3538 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.52 # Search class: FGHSM-FSMM21-MFFFFFNN
% 0.20/0.52 # partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.20/0.52 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.20/0.52 # Preprocessing time : 0.003 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 205
% 0.20/0.52 # Removed by relevancy pruning/SinE : 65
% 0.20/0.52 # Initial clauses : 140
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 140
% 0.20/0.52 # Processed clauses : 266
% 0.20/0.52 # ...of these trivial : 9
% 0.20/0.52 # ...subsumed : 13
% 0.20/0.52 # ...remaining for further processing : 244
% 0.20/0.52 # Other redundant clauses eliminated : 17
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 4
% 0.20/0.52 # Generated clauses : 80
% 0.20/0.52 # ...of the previous two non-redundant : 56
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 3
% 0.20/0.52 # Paramodulations : 64
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 17
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 100
% 0.20/0.52 # ...of those cached : 85
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 101
% 0.20/0.52 # Positive orientable unit clauses : 42
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 0
% 0.20/0.52 # Non-unit-clauses : 59
% 0.20/0.52 # Current number of unprocessed clauses: 52
% 0.20/0.52 # ...number of literals in the above : 265
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 129
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 3644
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 537
% 0.20/0.52 # Non-unit clause-clause subsumptions : 16
% 0.20/0.52 # Unit Clause-clause subsumption calls : 11
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 1
% 0.20/0.52 # BW rewrite match successes : 1
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 8011
% 0.20/0.52 # Search garbage collected termcells : 701
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.015 s
% 0.20/0.52 # System time : 0.007 s
% 0.20/0.52 # Total time : 0.023 s
% 0.20/0.52 # Maximum resident set size: 2180 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.020 s
% 0.20/0.52 # System time : 0.009 s
% 0.20/0.52 # Total time : 0.029 s
% 0.20/0.52 # Maximum resident set size: 1880 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------