TSTP Solution File: ITP012+5 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ITP012+5 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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 : Sat Jul 16 22:45:54 EDT 2022
% Result : Theorem 2.52s 157.67s
% Output : CNFRefutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 134 ( 3 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 168 ( 66 ~; 63 |; 11 &)
% ( 6 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2Einteger_2EINT__DIVIDES__RSUB,conjecture,
! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ! [X107] :
( mem(X107,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),X106))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(ap(c_2Einteger_2Eint__sub,X107),X106)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X107)) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__RSUB) ).
fof(ap_tp,axiom,
! [X1,X2,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(conj_thm_2Einteger_2EINT__DIVIDES__LSUB,axiom,
! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ! [X107] :
( mem(X107,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),X106))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(ap(c_2Einteger_2Eint__sub,X106),X107)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X107)) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__LSUB) ).
fof(conj_thm_2Einteger_2EINT__DIVIDES__RADD,axiom,
! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ! [X107] :
( mem(X107,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),X106))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(ap(c_2Einteger_2Eint__add,X107),X106)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X107)) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__RADD) ).
fof(ax_thm_2Einteger_2Eint__sub,axiom,
! [X32] :
( mem(X32,ty_2Einteger_2Eint)
=> ! [X25] :
( mem(X25,ty_2Einteger_2Eint)
=> ap(ap(c_2Einteger_2Eint__sub,X32),X25) = ap(ap(c_2Einteger_2Eint__add,X32),ap(c_2Einteger_2Eint__neg,X25)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',ax_thm_2Einteger_2Eint__sub) ).
fof(mem_c_2Einteger_2Eint__neg,axiom,
mem(c_2Einteger_2Eint__neg,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',mem_c_2Einteger_2Eint__neg) ).
fof(conj_thm_2Einteger_2EINT__DIVIDES__NEG,axiom,
! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ( ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(c_2Einteger_2Eint__neg,X106)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X106)) )
& ( p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X34)),X106))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X106)) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__NEG) ).
fof(c_0_7,negated_conjecture,
~ ! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ! [X107] :
( mem(X107,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),X106))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(ap(c_2Einteger_2Eint__sub,X107),X106)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X107)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Einteger_2EINT__DIVIDES__RSUB]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X8] :
( ~ mem(X7,arr(X5,X6))
| ~ mem(X8,X5)
| mem(ap(X7,X8),X6) ),
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)],[ap_tp])])])])]) ).
fof(c_0_9,negated_conjecture,
( mem(esk1_0,ty_2Einteger_2Eint)
& mem(esk2_0,ty_2Einteger_2Eint)
& mem(esk3_0,ty_2Einteger_2Eint)
& p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk2_0))
& ( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0)) )
& ( p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0)))
| p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0)) ) ),
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_7])])])])]) ).
fof(c_0_10,plain,
! [X108,X109,X110] :
( ( ~ p(ap(ap(c_2Einteger_2Eint__divides,X108),ap(ap(c_2Einteger_2Eint__sub,X109),X110)))
| p(ap(ap(c_2Einteger_2Eint__divides,X108),X110))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X108),X109))
| ~ mem(X110,ty_2Einteger_2Eint)
| ~ mem(X109,ty_2Einteger_2Eint)
| ~ mem(X108,ty_2Einteger_2Eint) )
& ( ~ p(ap(ap(c_2Einteger_2Eint__divides,X108),X110))
| p(ap(ap(c_2Einteger_2Eint__divides,X108),ap(ap(c_2Einteger_2Eint__sub,X109),X110)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X108),X109))
| ~ mem(X110,ty_2Einteger_2Eint)
| ~ mem(X109,ty_2Einteger_2Eint)
| ~ mem(X108,ty_2Einteger_2Eint) ) ),
inference(distribute,[status(thm)],[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)],[conj_thm_2Einteger_2EINT__DIVIDES__LSUB])])])])])]) ).
fof(c_0_11,plain,
! [X108,X109,X110] :
( ( ~ p(ap(ap(c_2Einteger_2Eint__divides,X108),ap(ap(c_2Einteger_2Eint__add,X110),X109)))
| p(ap(ap(c_2Einteger_2Eint__divides,X108),X110))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X108),X109))
| ~ mem(X110,ty_2Einteger_2Eint)
| ~ mem(X109,ty_2Einteger_2Eint)
| ~ mem(X108,ty_2Einteger_2Eint) )
& ( ~ p(ap(ap(c_2Einteger_2Eint__divides,X108),X110))
| p(ap(ap(c_2Einteger_2Eint__divides,X108),ap(ap(c_2Einteger_2Eint__add,X110),X109)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X108),X109))
| ~ mem(X110,ty_2Einteger_2Eint)
| ~ mem(X109,ty_2Einteger_2Eint)
| ~ mem(X108,ty_2Einteger_2Eint) ) ),
inference(distribute,[status(thm)],[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)],[conj_thm_2Einteger_2EINT__DIVIDES__RADD])])])])])]) ).
fof(c_0_12,plain,
! [X33,X34] :
( ~ mem(X33,ty_2Einteger_2Eint)
| ~ mem(X34,ty_2Einteger_2Eint)
| ap(ap(c_2Einteger_2Eint__sub,X33),X34) = ap(ap(c_2Einteger_2Eint__add,X33),ap(c_2Einteger_2Eint__neg,X34)) ),
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)],[ax_thm_2Einteger_2Eint__sub])])])])]) ).
cnf(c_0_13,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
mem(c_2Einteger_2Eint__neg,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)),
inference(split_conjunct,[status(thm)],[mem_c_2Einteger_2Eint__neg]) ).
cnf(c_0_15,negated_conjecture,
( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__sub,X2),X3)))
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
mem(esk2_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
mem(esk3_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
mem(esk1_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),X3))
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X3),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( ap(ap(c_2Einteger_2Eint__sub,X1),X2) = ap(ap(c_2Einteger_2Eint__add,X1),ap(c_2Einteger_2Eint__neg,X2))
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( mem(ap(c_2Einteger_2Eint__neg,X1),ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint) ),
inference(pm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_26,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__sub,X2),X3)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X3)))
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X3,ty_2Einteger_2Eint) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0))),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_28,plain,
! [X107,X108] :
( ( ~ p(ap(ap(c_2Einteger_2Eint__divides,X107),ap(c_2Einteger_2Eint__neg,X108)))
| p(ap(ap(c_2Einteger_2Eint__divides,X107),X108))
| ~ mem(X108,ty_2Einteger_2Eint)
| ~ mem(X107,ty_2Einteger_2Eint) )
& ( ~ p(ap(ap(c_2Einteger_2Eint__divides,X107),X108))
| p(ap(ap(c_2Einteger_2Eint__divides,X107),ap(c_2Einteger_2Eint__neg,X108)))
| ~ mem(X108,ty_2Einteger_2Eint)
| ~ mem(X107,ty_2Einteger_2Eint) )
& ( ~ p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X107)),X108))
| p(ap(ap(c_2Einteger_2Eint__divides,X107),X108))
| ~ mem(X108,ty_2Einteger_2Eint)
| ~ mem(X107,ty_2Einteger_2Eint) )
& ( ~ p(ap(ap(c_2Einteger_2Eint__divides,X107),X108))
| p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X107)),X108))
| ~ mem(X108,ty_2Einteger_2Eint)
| ~ mem(X107,ty_2Einteger_2Eint) ) ),
inference(distribute,[status(thm)],[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)],[conj_thm_2Einteger_2EINT__DIVIDES__NEG])])])])])]) ).
cnf(c_0_29,negated_conjecture,
~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(c_2Einteger_2Eint__neg,esk2_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_26,c_0_27]),c_0_19]),c_0_20]),c_0_18])]),c_0_25]) ).
cnf(c_0_30,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X2)))
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_29,c_0_30]),c_0_17]),c_0_18]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP012+5 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.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 Jun 3 15:52:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.65/24.69 eprover: CPU time limit exceeded, terminating
% 1.65/24.70 eprover: CPU time limit exceeded, terminating
% 1.65/24.70 eprover: CPU time limit exceeded, terminating
% 1.65/24.71 eprover: CPU time limit exceeded, terminating
% 1.81/47.71 eprover: CPU time limit exceeded, terminating
% 1.81/47.72 eprover: CPU time limit exceeded, terminating
% 1.81/47.75 eprover: CPU time limit exceeded, terminating
% 1.81/47.76 eprover: CPU time limit exceeded, terminating
% 1.95/70.76 eprover: CPU time limit exceeded, terminating
% 1.95/70.76 eprover: CPU time limit exceeded, terminating
% 1.95/70.77 eprover: CPU time limit exceeded, terminating
% 1.95/70.78 eprover: CPU time limit exceeded, terminating
% 2.10/93.81 eprover: CPU time limit exceeded, terminating
% 2.10/93.82 eprover: CPU time limit exceeded, terminating
% 2.10/93.82 eprover: CPU time limit exceeded, terminating
% 2.10/93.83 eprover: CPU time limit exceeded, terminating
% 2.25/116.86 eprover: CPU time limit exceeded, terminating
% 2.25/116.91 eprover: CPU time limit exceeded, terminating
% 2.25/117.20 eprover: CPU time limit exceeded, terminating
% 2.37/135.36 eprover: CPU time limit exceeded, terminating
% 2.40/139.88 eprover: CPU time limit exceeded, terminating
% 2.40/139.92 eprover: CPU time limit exceeded, terminating
% 2.40/140.25 eprover: CPU time limit exceeded, terminating
% 2.52/157.67 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 2.52/157.67
% 2.52/157.67 # Failure: Resource limit exceeded (time)
% 2.52/157.67 # OLD status Res
% 2.52/157.67 # Preprocessing time : 21.423 s
% 2.52/157.67 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 2.52/157.67
% 2.52/157.67 # Failure: Resource limit exceeded (time)
% 2.52/157.67 # OLD status Res
% 2.52/157.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 2.52/157.67 # Preprocessing time : 0.818 s
% 2.52/157.67 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 2.52/157.67
% 2.52/157.67 # Failure: Resource limit exceeded (time)
% 2.52/157.67 # OLD status Res
% 2.52/157.67 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 2.52/157.67
% 2.52/157.67 # Failure: Resource limit exceeded (time)
% 2.52/157.67 # OLD status Res
% 2.52/157.67 # Preprocessing time : 21.113 s
% 2.52/157.67 # Running protocol protocol_eprover_fc511518e5f98a6b2c7baef820b71b6d1abb3e55 for 23 seconds:
% 2.52/157.67
% 2.52/157.67 # Failure: Resource limit exceeded (time)
% 2.52/157.67 # OLD status Res
% 2.52/157.67 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,80,1.0)
% 2.52/157.67 # Preprocessing time : 0.644 s
% 2.52/157.67 # Running protocol protocol_eprover_95b56b3f38545d2cfee43b45856d192a814b65d5 for 23 seconds:
% 2.52/157.67
% 2.52/157.67 # Failure: Resource limit exceeded (time)
% 2.52/157.67 # OLD status Res
% 2.52/157.67 # Preprocessing time : 21.298 s
% 2.52/157.67 # Running protocol protocol_eprover_6017f334107ca4679a9978dd19d7c76a8bd36e48 for 23 seconds:
% 2.52/157.67 # SinE strategy is GSinE(CountFormulas,,1.4,,02,20000,1.0)
% 2.52/157.67 # Preprocessing time : 0.842 s
% 2.52/157.67
% 2.52/157.67 # Proof found!
% 2.52/157.67 # SZS status Theorem
% 2.52/157.67 # SZS output start CNFRefutation
% See solution above
% 2.52/157.67 # Proof object total steps : 32
% 2.52/157.67 # Proof object clause steps : 18
% 2.52/157.67 # Proof object formula steps : 14
% 2.52/157.67 # Proof object conjectures : 13
% 2.52/157.67 # Proof object clause conjectures : 10
% 2.52/157.67 # Proof object formula conjectures : 3
% 2.52/157.67 # Proof object initial clauses used : 12
% 2.52/157.67 # Proof object initial formulas used : 7
% 2.52/157.67 # Proof object generating inferences : 5
% 2.52/157.67 # Proof object simplifying inferences : 16
% 2.52/157.67 # Training examples: 0 positive, 0 negative
% 2.52/157.67 # Parsed axioms : 10257
% 2.52/157.67 # Removed by relevancy pruning/SinE : 9757
% 2.52/157.67 # Initial clauses : 2707
% 2.52/157.67 # Removed in clause preprocessing : 989
% 2.52/157.67 # Initial clauses in saturation : 1718
% 2.52/157.67 # Processed clauses : 7524
% 2.52/157.67 # ...of these trivial : 71
% 2.52/157.67 # ...subsumed : 4539
% 2.52/157.67 # ...remaining for further processing : 2914
% 2.52/157.67 # Other redundant clauses eliminated : 146
% 2.52/157.67 # Clauses deleted for lack of memory : 159955
% 2.52/157.67 # Backward-subsumed : 36
% 2.52/157.67 # Backward-rewritten : 16
% 2.52/157.67 # Generated clauses : 272956
% 2.52/157.67 # ...of the previous two non-trivial : 267188
% 2.52/157.67 # Contextual simplify-reflections : 7520
% 2.52/157.67 # Paramodulations : 272739
% 2.52/157.67 # Factorizations : 0
% 2.52/157.67 # Equation resolutions : 186
% 2.52/157.67 # Current number of processed clauses : 2848
% 2.52/157.67 # Positive orientable unit clauses : 42
% 2.52/157.67 # Positive unorientable unit clauses: 0
% 2.52/157.67 # Negative unit clauses : 26
% 2.52/157.67 # Non-unit-clauses : 2780
% 2.52/157.67 # Current number of unprocessed clauses: 98282
% 2.52/157.67 # ...number of literals in the above : 832355
% 2.52/157.67 # Current number of archived formulas : 0
% 2.52/157.67 # Current number of archived clauses : 53
% 2.52/157.67 # Clause-clause subsumption calls (NU) : 2989016
% 2.52/157.67 # Rec. Clause-clause subsumption calls : 159516
% 2.52/157.67 # Non-unit clause-clause subsumptions : 11927
% 2.52/157.67 # Unit Clause-clause subsumption calls : 28471
% 2.52/157.67 # Rewrite failures with RHS unbound : 0
% 2.52/157.67 # BW rewrite match attempts : 301
% 2.52/157.67 # BW rewrite match successes : 9
% 2.52/157.67 # Condensation attempts : 0
% 2.52/157.67 # Condensation successes : 0
% 2.52/157.67 # Termbank termtop insertions : 9811721
% 2.52/157.67
% 2.52/157.67 # -------------------------------------------------
% 2.52/157.67 # User time : 16.971 s
% 2.52/157.67 # System time : 0.149 s
% 2.52/157.67 # Total time : 17.120 s
% 2.52/157.67 # Maximum resident set size: 173704 pages
% 2.52/158.38 eprover: CPU time limit exceeded, terminating
% 2.52/158.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/158.40 eprover: No such file or directory
% 2.52/158.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/158.40 eprover: No such file or directory
% 2.52/158.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/158.41 eprover: No such file or directory
% 2.52/158.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/158.41 eprover: No such file or directory
% 2.52/158.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/158.42 eprover: No such file or directory
% 2.52/162.97 eprover: CPU time limit exceeded, terminating
% 2.52/162.99 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.52/162.99 eprover: No such file or directory
% 2.52/162.99 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.52/162.99 eprover: No such file or directory
% 2.52/163.00 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.52/163.00 eprover: No such file or directory
% 2.52/163.01 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.52/163.01 eprover: No such file or directory
% 2.52/163.01 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.52/163.01 eprover: No such file or directory
% 2.52/163.27 eprover: CPU time limit exceeded, terminating
% 2.52/163.29 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/163.29 eprover: No such file or directory
% 2.52/163.29 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/163.29 eprover: No such file or directory
% 2.52/163.30 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/163.30 eprover: No such file or directory
% 2.52/163.30 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/163.30 eprover: No such file or directory
% 2.52/163.31 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.52/163.31 eprover: No such file or directory
%------------------------------------------------------------------------------