TSTP Solution File: SWC364-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC364-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:38 EDT 2023
% Result : Unsatisfiable 5.24s 4.77s
% Output : CNFRefutation 5.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 17 unt; 1 nHn; 34 RR)
% Number of literals : 66 ( 11 equ; 36 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',co1_7) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',clause173) ).
cnf(co1_13,negated_conjecture,
( app(cons(sk5,nil),sk3) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',co1_13) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',co1_5) ).
cnf(co1_14,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',co1_14) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',co1_1) ).
cnf(co1_12,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',co1_12) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',clause73) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.F7qHnryJgG/E---3.1_13624.p',clause86) ).
cnf(c_0_12,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_13,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_14,negated_conjecture,
( app(cons(sk5,nil),sk3) = sk4
| ~ neq(sk4,nil) ),
co1_13 ).
cnf(c_0_15,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
neq(sk2,nil),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_19,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_20,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_14,c_0_15]),c_0_16]),c_0_16]),c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_22,negated_conjecture,
( ~ neq(sk2,nil)
| ~ segmentP(sk2,sk1) ),
inference(rw,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_24,negated_conjecture,
( segmentP(app(sk2,X1),sk1)
| ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk2,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_26,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
~ segmentP(sk2,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk2,nil) ),
inference(rw,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_31,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_32,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_17])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC364-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 01:44:14 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.F7qHnryJgG/E---3.1_13624.p
% 5.24/4.77 # Version: 3.1pre001
% 5.24/4.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.24/4.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.24/4.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.24/4.77 # Starting new_bool_3 with 300s (1) cores
% 5.24/4.77 # Starting new_bool_1 with 300s (1) cores
% 5.24/4.77 # Starting sh5l with 300s (1) cores
% 5.24/4.77 # new_bool_3 with pid 13739 completed with status 0
% 5.24/4.77 # Result found by new_bool_3
% 5.24/4.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.24/4.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.24/4.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.24/4.77 # Starting new_bool_3 with 300s (1) cores
% 5.24/4.77 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.24/4.77 # Search class: FGHSF-FFMM22-SFFFFFNN
% 5.24/4.77 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.24/4.77 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 5.24/4.77 # SAT001_MinMin_p005000_rr_RG with pid 13744 completed with status 0
% 5.24/4.77 # Result found by SAT001_MinMin_p005000_rr_RG
% 5.24/4.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.24/4.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.24/4.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.24/4.77 # Starting new_bool_3 with 300s (1) cores
% 5.24/4.77 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.24/4.77 # Search class: FGHSF-FFMM22-SFFFFFNN
% 5.24/4.77 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.24/4.77 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 5.24/4.77 # Preprocessing time : 0.003 s
% 5.24/4.77 # Presaturation interreduction done
% 5.24/4.77
% 5.24/4.77 # Proof found!
% 5.24/4.77 # SZS status Unsatisfiable
% 5.24/4.77 # SZS output start CNFRefutation
% See solution above
% 5.24/4.77 # Parsed axioms : 199
% 5.24/4.77 # Removed by relevancy pruning/SinE : 156
% 5.24/4.77 # Initial clauses : 43
% 5.24/4.77 # Removed in clause preprocessing : 0
% 5.24/4.77 # Initial clauses in saturation : 43
% 5.24/4.77 # Processed clauses : 192
% 5.24/4.77 # ...of these trivial : 6
% 5.24/4.77 # ...subsumed : 61
% 5.24/4.77 # ...remaining for further processing : 125
% 5.24/4.77 # Other redundant clauses eliminated : 10
% 5.24/4.77 # Clauses deleted for lack of memory : 0
% 5.24/4.77 # Backward-subsumed : 8
% 5.24/4.77 # Backward-rewritten : 2
% 5.24/4.77 # Generated clauses : 231
% 5.24/4.77 # ...of the previous two non-redundant : 203
% 5.24/4.77 # ...aggressively subsumed : 0
% 5.24/4.77 # Contextual simplify-reflections : 6
% 5.24/4.77 # Paramodulations : 218
% 5.24/4.77 # Factorizations : 0
% 5.24/4.77 # NegExts : 0
% 5.24/4.77 # Equation resolutions : 14
% 5.24/4.77 # Total rewrite steps : 223
% 5.24/4.77 # Propositional unsat checks : 0
% 5.24/4.77 # Propositional check models : 0
% 5.24/4.77 # Propositional check unsatisfiable : 0
% 5.24/4.77 # Propositional clauses : 0
% 5.24/4.77 # Propositional clauses after purity: 0
% 5.24/4.77 # Propositional unsat core size : 0
% 5.24/4.77 # Propositional preprocessing time : 0.000
% 5.24/4.77 # Propositional encoding time : 0.000
% 5.24/4.77 # Propositional solver time : 0.000
% 5.24/4.77 # Success case prop preproc time : 0.000
% 5.24/4.77 # Success case prop encoding time : 0.000
% 5.24/4.77 # Success case prop solver time : 0.000
% 5.24/4.77 # Current number of processed clauses : 73
% 5.24/4.77 # Positive orientable unit clauses : 11
% 5.24/4.77 # Positive unorientable unit clauses: 0
% 5.24/4.77 # Negative unit clauses : 12
% 5.24/4.77 # Non-unit-clauses : 50
% 5.24/4.77 # Current number of unprocessed clauses: 90
% 5.24/4.77 # ...number of literals in the above : 469
% 5.24/4.77 # Current number of archived formulas : 0
% 5.24/4.77 # Current number of archived clauses : 47
% 5.24/4.77 # Clause-clause subsumption calls (NU) : 632
% 5.24/4.77 # Rec. Clause-clause subsumption calls : 204
% 5.24/4.77 # Non-unit clause-clause subsumptions : 51
% 5.24/4.77 # Unit Clause-clause subsumption calls : 43
% 5.24/4.77 # Rewrite failures with RHS unbound : 0
% 5.24/4.77 # BW rewrite match attempts : 1
% 5.24/4.77 # BW rewrite match successes : 1
% 5.24/4.77 # Condensation attempts : 0
% 5.24/4.77 # Condensation successes : 0
% 5.24/4.77 # Termbank termtop insertions : 6333
% 5.24/4.77
% 5.24/4.77 # -------------------------------------------------
% 5.24/4.77 # User time : 0.014 s
% 5.24/4.77 # System time : 0.002 s
% 5.24/4.77 # Total time : 0.016 s
% 5.24/4.77 # Maximum resident set size: 2032 pages
% 5.24/4.77
% 5.24/4.77 # -------------------------------------------------
% 5.24/4.77 # User time : 0.020 s
% 5.24/4.77 # System time : 0.002 s
% 5.24/4.77 # Total time : 0.022 s
% 5.24/4.77 # Maximum resident set size: 1852 pages
% 5.24/4.77 % E---3.1 exiting
% 5.24/4.77 % E---3.1 exiting
%------------------------------------------------------------------------------