TSTP Solution File: SWV376+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : 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 : Sat May 4 09:52:54 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 79 ( 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/sandbox2/tmp/tmp.XDJYLnjlJO/E---3.1_32169.p',l12_co) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox2/tmp/tmp.XDJYLnjlJO/E---3.1_32169.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/sandbox2/tmp/tmp.XDJYLnjlJO/E---3.1_32169.p',l12_induction) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/tmp/tmp.XDJYLnjlJO/E---3.1_32169.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/sandbox2/tmp/tmp.XDJYLnjlJO/E---3.1_32169.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,negated_conjecture,
( ~ ok(triple(esk7_0,esk8_0,esk9_0))
& succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0))
& ok(triple(esk10_0,esk11_0,esk12_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_8,plain,
! [X89,X90,X91] :
( ok(triple(X89,X90,X91))
| X91 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_9,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]) ).
cnf(c_0_10,negated_conjecture,
~ ok(triple(esk7_0,esk8_0,esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X87,X88] :
( ( ~ ok(triple(X87,X88,bad))
| ~ $true )
& ( $true
| ok(triple(X87,X88,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
fof(c_0_13,plain,
! [X132,X133,X134,X135,X136,X137] :
( ( succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0))
| ok(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137)) )
& ( ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ok(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137)) )
& ( ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ok(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137)) ) ),
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_9])])])])])]) ).
cnf(c_0_14,negated_conjecture,
succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
esk9_0 = bad,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ ok(triple(X1,X2,bad))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ok(triple(X1,X2,X3))
| ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
succ_cpq(triple(esk7_0,esk8_0,bad),triple(esk10_0,esk11_0,esk12_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
ok(triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ ok(triple(esk4_0,esk5_0,esk6_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
fof(c_0_22,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_23,plain,
( ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_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_13]) ).
cnf(c_0_24,negated_conjecture,
esk6_0 = bad,
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
fof(c_0_25,lemma,
! [X138,X139,X140] :
( ok(triple(X138,X139,X140))
| ~ ok(im_succ_cpq(triple(X138,X139,X140))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
cnf(c_0_26,plain,
( ok(im_succ_cpq(triple(esk4_0,esk5_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_23,c_0_24]) ).
cnf(c_0_27,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
ok(im_succ_cpq(triple(esk4_0,esk5_0,bad))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_29,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV376+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n025.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri May 3 17:04:38 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.XDJYLnjlJO/E---3.1_32169.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 32246 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 32252 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.21/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.21/0.50 # Preprocessing time : 0.002 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 44
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 59
% 0.21/0.50 # Removed in clause preprocessing : 4
% 0.21/0.50 # Initial clauses in saturation : 55
% 0.21/0.50 # Processed clauses : 150
% 0.21/0.50 # ...of these trivial : 1
% 0.21/0.50 # ...subsumed : 8
% 0.21/0.50 # ...remaining for further processing : 141
% 0.21/0.50 # Other redundant clauses eliminated : 3
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 12
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 114
% 0.21/0.50 # ...of the previous two non-redundant : 82
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 2
% 0.21/0.50 # Paramodulations : 102
% 0.21/0.50 # Factorizations : 10
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 3
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 38
% 0.21/0.50 # ...of those cached : 17
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 72
% 0.21/0.50 # Positive orientable unit clauses : 22
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 13
% 0.21/0.50 # Non-unit-clauses : 37
% 0.21/0.50 # Current number of unprocessed clauses: 40
% 0.21/0.50 # ...number of literals in the above : 116
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 69
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 525
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 375
% 0.21/0.50 # Non-unit clause-clause subsumptions : 8
% 0.21/0.50 # Unit Clause-clause subsumption calls : 52
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 12
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 6278
% 0.21/0.50 # Search garbage collected termcells : 710
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.015 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.017 s
% 0.21/0.50 # Maximum resident set size: 1952 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.048 s
% 0.21/0.50 # System time : 0.008 s
% 0.21/0.50 # Total time : 0.056 s
% 0.21/0.50 # Maximum resident set size: 1748 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------