TSTP Solution File: MSC010+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MSC010+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : 600s
% DateTime : Sun Jul 17 22:43:01 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 260 ( 63 equ)
% Maximal formula atoms : 68 ( 13 avg)
% Number of connectives : 277 ( 36 ~; 23 |; 166 &)
% ( 1 <=>; 51 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 18 con; 0-3 aty)
% Number of variables : 74 ( 0 sgn 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(n1,axiom,
( ( pv63 != pv64
& leq(n0,pv5)
& leq(n0,pv63)
& leq(n0,pv64)
& leq(pv5,n998)
& leq(pv63,n5)
& leq(pv64,n5)
& ! [X1,X2] :
( ( leq(n0,X1)
& leq(n0,X2)
& leq(X1,n2)
& leq(X2,n5) )
=> a_select3(h_ds1_filter_init,X1,X2) = init )
& ! [X3,X4] :
( ( leq(n0,X3)
& leq(n0,X4)
& leq(X3,n5)
& leq(X4,n5) )
=> a_select3(phi_ds1_filter_init,X3,X4) = init )
& ! [X5,X6] :
( ( leq(n0,X5)
& leq(n0,X6)
& leq(X5,n5)
& leq(X6,n0) )
=> a_select3(dv_ds1_filter_init,X5,X6) = init )
& ! [X7,X8] :
( ( leq(n0,X7)
& leq(n0,X8)
& leq(X7,n5)
& leq(X8,n5) )
=> a_select3(q_ds1_filter_init,X7,X8) = init )
& ! [X9,X10] :
( ( leq(n0,X9)
& leq(n0,X10)
& leq(X9,n2)
& leq(X10,n2) )
=> a_select3(r_ds1_filter_init,X9,X10) = init )
& ! [X11,X12] :
( ( leq(n0,X11)
& leq(n0,X12)
& leq(X11,n5)
& leq(X12,n0) )
=> a_select3(xhatmin_ds1_filter_init,X11,X12) = init )
& ! [X13,X14] :
( ( leq(n0,X13)
& leq(n0,X14)
& leq(X13,n5)
& leq(X14,n5) )
=> a_select3(pminus_ds1_filter_init,X13,X14) = init )
& ! [X15,X16] :
( ( leq(n0,X15)
& leq(n0,X16)
& leq(X15,n5)
& leq(X16,n5) )
=> ( ( X15 = pv63
& gt(pv64,X16) )
=> a_select3(id_ds1_filter_init,X15,X16) = init ) )
& ! [X17,X18] :
( ( leq(n0,X17)
& leq(n0,X18)
& leq(X17,n5)
& leq(X18,n5) )
=> ( gt(pv63,X17)
=> a_select3(id_ds1_filter_init,X17,X18) = init ) )
& ! [X19] :
( ( leq(n0,X19)
& leq(X19,pred(pv63)) )
=> ! [X20] :
( ( leq(n0,X20)
& leq(X20,n5) )
=> a_select3(id_ds1_filter_init,X19,X20) = init ) ) )
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> ( ( pv64 != X22
& X21 = pv63
& leq(X22,pv64) )
=> a_select3(id_ds1_filter_init,X21,X22) = init ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',n1) ).
fof(n91,conjecture,
~ ~ ( ( pv63 != pv64
& leq(n0,pv5)
& leq(n0,pv63)
& leq(n0,pv64)
& leq(pv5,n998)
& leq(pv63,n5)
& leq(pv64,n5)
& ! [X1,X2] :
( ( leq(n0,X1)
& leq(n0,X2)
& leq(X1,n2)
& leq(X2,n5) )
=> a_select3(h_ds1_filter_init,X1,X2) = init )
& ! [X3,X4] :
( ( leq(n0,X3)
& leq(n0,X4)
& leq(X3,n5)
& leq(X4,n5) )
=> a_select3(phi_ds1_filter_init,X3,X4) = init )
& ! [X5,X6] :
( ( leq(n0,X5)
& leq(n0,X6)
& leq(X5,n5)
& leq(X6,n0) )
=> a_select3(dv_ds1_filter_init,X5,X6) = init )
& ! [X7,X8] :
( ( leq(n0,X7)
& leq(n0,X8)
& leq(X7,n5)
& leq(X8,n5) )
=> a_select3(q_ds1_filter_init,X7,X8) = init )
& ! [X9,X10] :
( ( leq(n0,X9)
& leq(n0,X10)
& leq(X9,n2)
& leq(X10,n2) )
=> a_select3(r_ds1_filter_init,X9,X10) = init )
& ! [X11,X12] :
( ( leq(n0,X11)
& leq(n0,X12)
& leq(X11,n5)
& leq(X12,n0) )
=> a_select3(xhatmin_ds1_filter_init,X11,X12) = init )
& ! [X13,X14] :
( ( leq(n0,X13)
& leq(n0,X14)
& leq(X13,n5)
& leq(X14,n5) )
=> a_select3(pminus_ds1_filter_init,X13,X14) = init )
& ! [X15,X16] :
( ( leq(n0,X15)
& leq(n0,X16)
& leq(X15,n5)
& leq(X16,n5) )
=> ( ( X15 = pv63
& gt(pv64,X16) )
=> a_select3(id_ds1_filter_init,X15,X16) = init ) )
& ! [X17,X18] :
( ( leq(n0,X17)
& leq(n0,X18)
& leq(X17,n5)
& leq(X18,n5) )
=> ( gt(pv63,X17)
=> a_select3(id_ds1_filter_init,X17,X18) = init ) )
& ! [X19] :
( ( leq(n0,X19)
& leq(X19,pred(pv63)) )
=> ! [X20] :
( ( leq(n0,X20)
& leq(X20,n5) )
=> a_select3(id_ds1_filter_init,X19,X20) = init ) ) )
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> ( ( pv64 != X22
& X21 = pv63
& leq(X22,pv64) )
=> a_select3(id_ds1_filter_init,X21,X22) = init ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',n91) ).
fof(c_0_2,plain,
( epred1_0
<=> ( pv63 != pv64
& leq(n0,pv5)
& leq(n0,pv63)
& leq(n0,pv64)
& leq(pv5,n998)
& leq(pv63,n5)
& leq(pv64,n5)
& ! [X1,X2] :
( ( leq(n0,X1)
& leq(n0,X2)
& leq(X1,n2)
& leq(X2,n5) )
=> a_select3(h_ds1_filter_init,X1,X2) = init )
& ! [X3,X4] :
( ( leq(n0,X3)
& leq(n0,X4)
& leq(X3,n5)
& leq(X4,n5) )
=> a_select3(phi_ds1_filter_init,X3,X4) = init )
& ! [X5,X6] :
( ( leq(n0,X5)
& leq(n0,X6)
& leq(X5,n5)
& leq(X6,n0) )
=> a_select3(dv_ds1_filter_init,X5,X6) = init )
& ! [X7,X8] :
( ( leq(n0,X7)
& leq(n0,X8)
& leq(X7,n5)
& leq(X8,n5) )
=> a_select3(q_ds1_filter_init,X7,X8) = init )
& ! [X9,X10] :
( ( leq(n0,X9)
& leq(n0,X10)
& leq(X9,n2)
& leq(X10,n2) )
=> a_select3(r_ds1_filter_init,X9,X10) = init )
& ! [X11,X12] :
( ( leq(n0,X11)
& leq(n0,X12)
& leq(X11,n5)
& leq(X12,n0) )
=> a_select3(xhatmin_ds1_filter_init,X11,X12) = init )
& ! [X13,X14] :
( ( leq(n0,X13)
& leq(n0,X14)
& leq(X13,n5)
& leq(X14,n5) )
=> a_select3(pminus_ds1_filter_init,X13,X14) = init )
& ! [X15,X16] :
( ( leq(n0,X15)
& leq(n0,X16)
& leq(X15,n5)
& leq(X16,n5) )
=> ( ( X15 = pv63
& gt(pv64,X16) )
=> a_select3(id_ds1_filter_init,X15,X16) = init ) )
& ! [X17,X18] :
( ( leq(n0,X17)
& leq(n0,X18)
& leq(X17,n5)
& leq(X18,n5) )
=> ( gt(pv63,X17)
=> a_select3(id_ds1_filter_init,X17,X18) = init ) )
& ! [X19] :
( ( leq(n0,X19)
& leq(X19,pred(pv63)) )
=> ! [X20] :
( ( leq(n0,X20)
& leq(X20,n5) )
=> a_select3(id_ds1_filter_init,X19,X20) = init ) ) ) ),
introduced(definition) ).
fof(c_0_3,axiom,
( epred1_0
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> ( ( pv64 != X22
& X21 = pv63
& leq(X22,pv64) )
=> a_select3(id_ds1_filter_init,X21,X22) = init ) ) ),
inference(apply_def,[status(thm)],[n1,c_0_2]) ).
fof(c_0_4,negated_conjecture,
~ ~ ~ ( epred1_0
=> ! [X21,X22] :
( ( leq(n0,X21)
& leq(n0,X22)
& leq(X21,n5)
& leq(X22,n5) )
=> ( ( pv64 != X22
& X21 = pv63
& leq(X22,pv64) )
=> a_select3(id_ds1_filter_init,X21,X22) = init ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[n91]),c_0_2]) ).
fof(c_0_5,plain,
! [X23,X24] :
( ~ epred1_0
| ~ leq(n0,X23)
| ~ leq(n0,X24)
| ~ leq(X23,n5)
| ~ leq(X24,n5)
| pv64 = X24
| X23 != pv63
| ~ leq(X24,pv64)
| a_select3(id_ds1_filter_init,X23,X24) = init ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n5)
& leq(esk2_0,n5)
& pv64 != esk2_0
& esk1_0 = pv63
& leq(esk2_0,pv64)
& a_select3(id_ds1_filter_init,esk1_0,esk2_0) != init ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
cnf(c_0_7,plain,
( a_select3(id_ds1_filter_init,X1,X2) = init
| pv64 = X2
| ~ leq(X2,pv64)
| X1 != pv63
| ~ leq(X2,n5)
| ~ leq(X1,n5)
| ~ leq(n0,X2)
| ~ leq(n0,X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = pv63,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
a_select3(id_ds1_filter_init,esk1_0,esk2_0) != init,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( a_select3(id_ds1_filter_init,X1,X2) = init
| pv64 = X2
| X1 != esk1_0
| ~ leq(X2,pv64)
| ~ leq(X2,n5)
| ~ leq(X1,n5)
| ~ leq(n0,X2)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
leq(esk2_0,pv64),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
leq(esk2_0,n5),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
leq(esk1_0,n5),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
pv64 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MSC010+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 15:34:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.022 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 19
% 0.23/1.41 # Proof object clause steps : 12
% 0.23/1.41 # Proof object formula steps : 7
% 0.23/1.41 # Proof object conjectures : 13
% 0.23/1.41 # Proof object clause conjectures : 10
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 10
% 0.23/1.41 # Proof object initial formulas used : 2
% 0.23/1.41 # Proof object generating inferences : 1
% 0.23/1.41 # Proof object simplifying inferences : 10
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 2
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 171
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 171
% 0.23/1.41 # Processed clauses : 163
% 0.23/1.41 # ...of these trivial : 91
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 72
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 28
% 0.23/1.41 # ...of the previous two non-trivial : 1
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 28
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 71
% 0.23/1.41 # Positive orientable unit clauses : 9
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 60
% 0.23/1.41 # Current number of unprocessed clauses: 9
% 0.23/1.41 # ...number of literals in the above : 75
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 1
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 2076
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 243
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 10954
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.027 s
% 0.23/1.41 # System time : 0.000 s
% 0.23/1.41 # Total time : 0.027 s
% 0.23/1.41 # Maximum resident set size: 3256 pages
%------------------------------------------------------------------------------