TSTP Solution File: SWV376+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV376+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Sat May 4 09:43:58 EDT 2024
% Result : Theorem 0.11s 0.41s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 78 ( 6 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 92 ( 43 ~; 25 |; 5 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 92 ( 6 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l12_co,conjecture,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ~ ok(triple(X4,X5,X6)) ) ),
file('/export/starexec/sandbox/tmp/tmp.yL9bkT4TlM/E---3.1_21582.p',l12_co) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox/tmp/tmp.yL9bkT4TlM/E---3.1_21582.p',ax41) ).
fof(l12_induction,axiom,
( ! [X1,X2,X3,X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
=> ~ ok(im_succ_cpq(triple(X4,X5,X6))) ) )
=> ! [X7,X8,X9] :
( ~ ok(triple(X7,X8,X9))
=> ! [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
=> ~ ok(triple(X10,X11,X12)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yL9bkT4TlM/E---3.1_21582.p',l12_induction) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/tmp/tmp.yL9bkT4TlM/E---3.1_21582.p',ax40) ).
fof(l12_l13,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/tmp/tmp.yL9bkT4TlM/E---3.1_21582.p',l12_l13) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ~ ok(triple(X4,X5,X6)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l12_co])]) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
fof(c_0_7,plain,
( ! [X1,X2,X3,X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
=> ~ ok(im_succ_cpq(triple(X4,X5,X6))) ) )
=> ! [X7,X8,X9] :
( ~ ok(triple(X7,X8,X9))
=> ! [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
=> ~ ok(triple(X10,X11,X12)) ) ) ),
inference(fof_simplification,[status(thm)],[l12_induction]) ).
fof(c_0_8,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
& succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))
& ok(triple(esk4_0,esk5_0,esk6_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X21,X22,X23] :
( ok(triple(X21,X22,X23))
| X23 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_10,plain,
! [X19,X20] :
( ( ~ ok(triple(X19,X20,bad))
| ~ $true )
& ( $true
| ok(triple(X19,X20,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
fof(c_0_11,plain,
! [X30,X31,X32,X33,X34,X35] :
( ( succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0))
| ok(triple(X30,X31,X32))
| ~ succ_cpq(triple(X30,X31,X32),triple(X33,X34,X35))
| ~ ok(triple(X33,X34,X35)) )
& ( ~ ok(triple(esk10_0,esk11_0,esk12_0))
| ok(triple(X30,X31,X32))
| ~ succ_cpq(triple(X30,X31,X32),triple(X33,X34,X35))
| ~ ok(triple(X33,X34,X35)) )
& ( ok(im_succ_cpq(triple(esk10_0,esk11_0,esk12_0)))
| ok(triple(X30,X31,X32))
| ~ succ_cpq(triple(X30,X31,X32),triple(X33,X34,X35))
| ~ ok(triple(X33,X34,X35)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
cnf(c_0_12,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ ok(triple(X1,X2,bad))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ok(triple(X1,X2,X3))
| ~ ok(triple(esk10_0,esk11_0,esk12_0))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
~ ok(triple(esk10_0,esk11_0,esk12_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]),c_0_19]) ).
fof(c_0_21,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[l12_l13]) ).
cnf(c_0_22,plain,
( ok(im_succ_cpq(triple(esk10_0,esk11_0,esk12_0)))
| ok(triple(X1,X2,X3))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
esk12_0 = bad,
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
fof(c_0_24,lemma,
! [X36,X37,X38] :
( ok(triple(X36,X37,X38))
| ~ ok(im_succ_cpq(triple(X36,X37,X38))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_25,plain,
( ok(im_succ_cpq(triple(esk10_0,esk11_0,bad)))
| ok(triple(X1,X2,X3))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6)) ),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
ok(im_succ_cpq(triple(esk10_0,esk11_0,bad))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_28,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWV376+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n015.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Fri May 3 17:04:38 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.39 Running first-order theorem proving
% 0.11/0.39 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.yL9bkT4TlM/E---3.1_21582.p
% 0.11/0.41 # Version: 3.1.0
% 0.11/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.41 # Starting sh5l with 300s (1) cores
% 0.11/0.41 # sh5l with pid 21719 completed with status 0
% 0.11/0.41 # Result found by sh5l
% 0.11/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.41 # Starting sh5l with 300s (1) cores
% 0.11/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.41 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.11/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.11/0.41 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 21726 completed with status 0
% 0.11/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.11/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.41 # Starting sh5l with 300s (1) cores
% 0.11/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.41 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.11/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.11/0.41 # Preprocessing time : 0.001 s
% 0.11/0.41 # Presaturation interreduction done
% 0.11/0.41
% 0.11/0.41 # Proof found!
% 0.11/0.41 # SZS status Theorem
% 0.11/0.41 # SZS output start CNFRefutation
% See solution above
% 0.11/0.41 # Parsed axioms : 44
% 0.11/0.41 # Removed by relevancy pruning/SinE : 5
% 0.11/0.41 # Initial clauses : 50
% 0.11/0.41 # Removed in clause preprocessing : 2
% 0.11/0.41 # Initial clauses in saturation : 48
% 0.11/0.41 # Processed clauses : 161
% 0.11/0.41 # ...of these trivial : 2
% 0.11/0.41 # ...subsumed : 15
% 0.11/0.41 # ...remaining for further processing : 144
% 0.11/0.41 # Other redundant clauses eliminated : 1
% 0.11/0.41 # Clauses deleted for lack of memory : 0
% 0.11/0.41 # Backward-subsumed : 8
% 0.11/0.41 # Backward-rewritten : 0
% 0.11/0.41 # Generated clauses : 243
% 0.11/0.41 # ...of the previous two non-redundant : 204
% 0.11/0.41 # ...aggressively subsumed : 0
% 0.11/0.41 # Contextual simplify-reflections : 2
% 0.11/0.41 # Paramodulations : 232
% 0.11/0.41 # Factorizations : 10
% 0.11/0.41 # NegExts : 0
% 0.11/0.41 # Equation resolutions : 1
% 0.11/0.41 # Disequality decompositions : 0
% 0.11/0.41 # Total rewrite steps : 53
% 0.11/0.41 # ...of those cached : 22
% 0.11/0.41 # Propositional unsat checks : 0
% 0.11/0.41 # Propositional check models : 0
% 0.11/0.41 # Propositional check unsatisfiable : 0
% 0.11/0.41 # Propositional clauses : 0
% 0.11/0.41 # Propositional clauses after purity: 0
% 0.11/0.41 # Propositional unsat core size : 0
% 0.11/0.41 # Propositional preprocessing time : 0.000
% 0.11/0.41 # Propositional encoding time : 0.000
% 0.11/0.41 # Propositional solver time : 0.000
% 0.11/0.41 # Success case prop preproc time : 0.000
% 0.11/0.41 # Success case prop encoding time : 0.000
% 0.11/0.41 # Success case prop solver time : 0.000
% 0.11/0.41 # Current number of processed clauses : 87
% 0.11/0.41 # Positive orientable unit clauses : 23
% 0.11/0.41 # Positive unorientable unit clauses: 0
% 0.11/0.41 # Negative unit clauses : 13
% 0.11/0.41 # Non-unit-clauses : 51
% 0.11/0.41 # Current number of unprocessed clauses: 136
% 0.11/0.41 # ...number of literals in the above : 490
% 0.11/0.41 # Current number of archived formulas : 0
% 0.11/0.41 # Current number of archived clauses : 56
% 0.11/0.41 # Clause-clause subsumption calls (NU) : 500
% 0.11/0.41 # Rec. Clause-clause subsumption calls : 353
% 0.11/0.41 # Non-unit clause-clause subsumptions : 13
% 0.11/0.41 # Unit Clause-clause subsumption calls : 34
% 0.11/0.41 # Rewrite failures with RHS unbound : 0
% 0.11/0.41 # BW rewrite match attempts : 8
% 0.11/0.41 # BW rewrite match successes : 1
% 0.11/0.41 # Condensation attempts : 0
% 0.11/0.41 # Condensation successes : 0
% 0.11/0.41 # Termbank termtop insertions : 7957
% 0.11/0.41 # Search garbage collected termcells : 663
% 0.11/0.41
% 0.11/0.41 # -------------------------------------------------
% 0.11/0.41 # User time : 0.011 s
% 0.11/0.41 # System time : 0.002 s
% 0.11/0.41 # Total time : 0.013 s
% 0.11/0.41 # Maximum resident set size: 2036 pages
% 0.11/0.41
% 0.11/0.41 # -------------------------------------------------
% 0.11/0.41 # User time : 0.013 s
% 0.11/0.41 # System time : 0.003 s
% 0.11/0.41 # Total time : 0.016 s
% 0.11/0.41 # Maximum resident set size: 1748 pages
% 0.11/0.41 % E---3.1 exiting
% 0.11/0.42 % E exiting
%------------------------------------------------------------------------------