TSTP Solution File: GEO469+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO469+1 : TPTP v8.1.0. Released v7.0.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 : Sat Jul 16 04:05:55 EDT 2022
% Result : Theorem 2.16s 175.32s
% Output : CNFRefutation 2.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 51 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 21 ~; 16 |; 3 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 35 ( 4 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aDEPENDENTu_SING,conjecture,
! [X1428,X1] :
( p(s(bool,i(s(fun(fun(cart(real,X1428),bool),bool),dependent),s(fun(cart(real,X1428),bool),i(s(fun(fun(cart(real,X1428),bool),fun(cart(real,X1428),bool)),i(s(fun(cart(real,X1428),fun(fun(cart(real,X1428),bool),fun(cart(real,X1428),bool))),insert),s(cart(real,X1428),X1))),s(fun(cart(real,X1428),bool),empty))))))
<=> s(cart(real,X1428),X1) = s(cart(real,X1428),i(s(fun(num,cart(real,X1428)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aDEPENDENTu_SING) ).
fof(aNUMERAL,axiom,
! [X84] : s(num,i(s(fun(num,num),numeral),s(num,X84))) = s(num,X84),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO010+0.ax',aNUMERAL) ).
fof(aINDEPENDENTu_SING,axiom,
! [X1427,X1] :
( p(s(bool,i(s(fun(fun(cart(real,X1427),bool),bool),independent),s(fun(cart(real,X1427),bool),i(s(fun(fun(cart(real,X1427),bool),fun(cart(real,X1427),bool)),i(s(fun(cart(real,X1427),fun(fun(cart(real,X1427),bool),fun(cart(real,X1427),bool))),insert),s(cart(real,X1427),X1))),s(fun(cart(real,X1427),bool),empty))))))
<=> s(cart(real,X1427),X1) != s(cart(real,X1427),i(s(fun(num,cart(real,X1427)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aINDEPENDENTu_SING) ).
fof(aindependent,axiom,
! [X1364,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1364),bool),bool),independent),s(fun(cart(real,X1364),bool),X97))))
<=> ~ p(s(bool,i(s(fun(fun(cart(real,X1364),bool),bool),dependent),s(fun(cart(real,X1364),bool),X97)))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aindependent) ).
fof(aSPANu_EMPTY,axiom,
! [X1389] : s(fun(cart(real,X1389),bool),i(s(fun(fun(cart(real,X1389),bool),fun(cart(real,X1389),bool)),span),s(fun(cart(real,X1389),bool),empty))) = s(fun(cart(real,X1389),bool),i(s(fun(fun(cart(real,X1389),bool),fun(cart(real,X1389),bool)),i(s(fun(cart(real,X1389),fun(fun(cart(real,X1389),bool),fun(cart(real,X1389),bool))),insert),s(cart(real,X1389),i(s(fun(num,cart(real,X1389)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X1389),bool),empty))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aSPANu_EMPTY) ).
fof(c_0_5,negated_conjecture,
~ ! [X1428,X1] :
( p(s(bool,i(s(fun(fun(cart(real,X1428),bool),bool),dependent),s(fun(cart(real,X1428),bool),i(s(fun(fun(cart(real,X1428),bool),fun(cart(real,X1428),bool)),i(s(fun(cart(real,X1428),fun(fun(cart(real,X1428),bool),fun(cart(real,X1428),bool))),insert),s(cart(real,X1428),X1))),s(fun(cart(real,X1428),bool),empty))))))
<=> s(cart(real,X1428),X1) = s(cart(real,X1428),i(s(fun(num,cart(real,X1428)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ),
inference(assume_negation,[status(cth)],[aDEPENDENTu_SING]) ).
fof(c_0_6,negated_conjecture,
( ( ~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),dependent),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool))),insert),s(cart(real,esk1_0),esk2_0))),s(fun(cart(real,esk1_0),bool),empty))))))
| s(cart(real,esk1_0),esk2_0) != s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) )
& ( p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),dependent),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool))),insert),s(cart(real,esk1_0),esk2_0))),s(fun(cart(real,esk1_0),bool),empty))))))
| s(cart(real,esk1_0),esk2_0) = s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X85] : s(num,i(s(fun(num,num),numeral),s(num,X85))) = s(num,X85),
inference(variable_rename,[status(thm)],[aNUMERAL]) ).
fof(c_0_8,plain,
! [X1428,X1429,X1428,X1429] :
( ( ~ p(s(bool,i(s(fun(fun(cart(real,X1428),bool),bool),independent),s(fun(cart(real,X1428),bool),i(s(fun(fun(cart(real,X1428),bool),fun(cart(real,X1428),bool)),i(s(fun(cart(real,X1428),fun(fun(cart(real,X1428),bool),fun(cart(real,X1428),bool))),insert),s(cart(real,X1428),X1429))),s(fun(cart(real,X1428),bool),empty))))))
| s(cart(real,X1428),X1429) != s(cart(real,X1428),i(s(fun(num,cart(real,X1428)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) )
& ( s(cart(real,X1428),X1429) = s(cart(real,X1428),i(s(fun(num,cart(real,X1428)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0)))))
| p(s(bool,i(s(fun(fun(cart(real,X1428),bool),bool),independent),s(fun(cart(real,X1428),bool),i(s(fun(fun(cart(real,X1428),bool),fun(cart(real,X1428),bool)),i(s(fun(cart(real,X1428),fun(fun(cart(real,X1428),bool),fun(cart(real,X1428),bool))),insert),s(cart(real,X1428),X1429))),s(fun(cart(real,X1428),bool),empty)))))) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aINDEPENDENTu_SING])])])]) ).
fof(c_0_9,plain,
! [X1365,X1366,X1365,X1366] :
( ( ~ p(s(bool,i(s(fun(fun(cart(real,X1365),bool),bool),independent),s(fun(cart(real,X1365),bool),X1366))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1365),bool),bool),dependent),s(fun(cart(real,X1365),bool),X1366)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X1365),bool),bool),dependent),s(fun(cart(real,X1365),bool),X1366))))
| p(s(bool,i(s(fun(fun(cart(real,X1365),bool),bool),independent),s(fun(cart(real,X1365),bool),X1366)))) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[aindependent])])])])]) ).
cnf(c_0_10,negated_conjecture,
( s(cart(real,esk1_0),esk2_0) = s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0)))))
| p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),dependent),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool))),insert),s(cart(real,esk1_0),esk2_0))),s(fun(cart(real,esk1_0),bool),empty)))))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),independent),s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool))),insert),s(cart(real,X1),X2))),s(fun(cart(real,X1),bool),empty))))))
| s(cart(real,X1),X2) = s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X1390] : s(fun(cart(real,X1390),bool),i(s(fun(fun(cart(real,X1390),bool),fun(cart(real,X1390),bool)),span),s(fun(cart(real,X1390),bool),empty))) = s(fun(cart(real,X1390),bool),i(s(fun(fun(cart(real,X1390),bool),fun(cart(real,X1390),bool)),i(s(fun(cart(real,X1390),fun(fun(cart(real,X1390),bool),fun(cart(real,X1390),bool))),insert),s(cart(real,X1390),i(s(fun(num,cart(real,X1390)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X1390),bool),empty))),
inference(variable_rename,[status(thm)],[aSPANu_EMPTY]) ).
cnf(c_0_14,negated_conjecture,
( s(cart(real,esk1_0),esk2_0) != s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0)))))
| ~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),dependent),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool))),insert),s(cart(real,esk1_0),esk2_0))),s(fun(cart(real,esk1_0),bool),empty)))))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),dependent),s(fun(cart(real,X1),bool),X2))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),independent),s(fun(cart(real,X1),bool),X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( s(cart(real,esk1_0),esk2_0) = s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,u_0)))
| p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),dependent),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool))),insert),s(cart(real,esk1_0),esk2_0))),s(fun(cart(real,esk1_0),bool),empty)))))) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( s(cart(real,X1),X2) = s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,u_0)))
| p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),independent),s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool))),insert),s(cart(real,X1),X2))),s(fun(cart(real,X1),bool),empty)))))) ),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_18,plain,
s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),span),s(fun(cart(real,X1),bool),empty))) = s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool))),insert),s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X1),bool),empty))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( s(cart(real,X1),X2) != s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0)))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),independent),s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool))),insert),s(cart(real,X1),X2))),s(fun(cart(real,X1),bool),empty)))))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( s(cart(real,esk1_0),esk2_0) != s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,u_0)))
| ~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),dependent),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool))),insert),s(cart(real,esk1_0),esk2_0))),s(fun(cart(real,esk1_0),bool),empty)))))) ),
inference(rw,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
s(cart(real,esk1_0),esk2_0) = s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,u_0))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_22,plain,
s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool))),insert),s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,u_0))))),s(fun(cart(real,X1),bool),empty))) = s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),span),s(fun(cart(real,X1),bool),empty))),
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_23,plain,
( s(cart(real,X1),X2) != s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,u_0)))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),independent),s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool))),insert),s(cart(real,X1),X2))),s(fun(cart(real,X1),bool),empty)))))) ),
inference(rw,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_24,negated_conjecture,
~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),dependent),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),empty)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),independent),s(fun(cart(real,X1),bool),X2))))
| p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),dependent),s(fun(cart(real,X1),bool),X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),independent),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),empty)))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GEO469+1 : TPTP v8.1.0. Released v7.0.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 04:56:13 EDT 2022
% 0.14/0.36 % CPUTime :
% 1.17/24.19 eprover: CPU time limit exceeded, terminating
% 1.17/24.20 eprover: CPU time limit exceeded, terminating
% 1.17/24.20 eprover: CPU time limit exceeded, terminating
% 1.17/24.20 eprover: CPU time limit exceeded, terminating
% 1.31/47.21 eprover: CPU time limit exceeded, terminating
% 1.31/47.21 eprover: CPU time limit exceeded, terminating
% 1.31/47.22 eprover: CPU time limit exceeded, terminating
% 1.31/47.22 eprover: CPU time limit exceeded, terminating
% 1.48/70.22 eprover: CPU time limit exceeded, terminating
% 1.48/70.23 eprover: CPU time limit exceeded, terminating
% 1.48/70.23 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.48/70.23
% 1.64/93.24 eprover: CPU time limit exceeded, terminating
% 1.64/93.24 eprover: CPU time limit exceeded, terminating
% 1.64/93.25 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.64/93.25
% 1.77/116.25 eprover: CPU time limit exceeded, terminating
% 1.77/116.27 eprover: CPU time limit exceeded, terminating
% 1.77/116.27 eprover: CPU time limit exceeded, terminating
% 1.77/116.27 eprover: CPU time limit exceeded, terminating
% 1.92/139.26 eprover: CPU time limit exceeded, terminating
% 1.92/139.28 eprover: CPU time limit exceeded, terminating
% 1.92/139.29 eprover: CPU time limit exceeded, terminating
% 1.92/139.29 eprover: CPU time limit exceeded, terminating
% 2.08/162.28 eprover: CPU time limit exceeded, terminating
% 2.08/162.30 eprover: CPU time limit exceeded, terminating
% 2.08/162.31 eprover: CPU time limit exceeded, terminating
% 2.08/162.34 eprover: CPU time limit exceeded, terminating
% 2.16/175.32 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 2.16/175.32
% 2.16/175.32 # Failure: Resource limit exceeded (time)
% 2.16/175.32 # OLD status Res
% 2.16/175.32 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 2.16/175.32 # Preprocessing time : 0.607 s
% 2.16/175.32 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 2.16/175.32
% 2.16/175.32 # Failure: Resource limit exceeded (time)
% 2.16/175.32 # OLD status Res
% 2.16/175.32 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 2.16/175.32 # Preprocessing time : 0.401 s
% 2.16/175.32 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 2.16/175.32
% 2.16/175.32 # Failure: Resource limit exceeded (time)
% 2.16/175.32 # OLD status Res
% 2.16/175.32 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 2.16/175.32 # Preprocessing time : 0.951 s
% 2.16/175.32 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 2.16/175.32
% 2.16/175.32 # Failure: Resource limit exceeded (time)
% 2.16/175.32 # OLD status Res
% 2.16/175.32 # Preprocessing time : 2.859 s
% 2.16/175.32 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 2.16/175.32
% 2.16/175.32 # Failure: Resource limit exceeded (time)
% 2.16/175.32 # OLD status Res
% 2.16/175.32 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 2.16/175.32 # Preprocessing time : 0.357 s
% 2.16/175.32 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 2.16/175.32
% 2.16/175.32 # Failure: Resource limit exceeded (time)
% 2.16/175.32 # OLD status Res
% 2.16/175.32 # Preprocessing time : 12.522 s
% 2.16/175.32 # Running protocol protocol_eprover_e6b386026570787d4ac06e541c4634c5e3f09cc5 for 23 seconds:
% 2.16/175.32
% 2.16/175.32 # Failure: Resource limit exceeded (time)
% 2.16/175.32 # OLD status Res
% 2.16/175.32 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,100,1.0)
% 2.16/175.32 # Preprocessing time : 0.330 s
% 2.16/175.32 # Running protocol protocol_eprover_2e85aeff02a0bd3743f362014f6604d7fba54d74 for 23 seconds:
% 2.16/175.32 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 2.16/175.32 # Preprocessing time : 0.498 s
% 2.16/175.32
% 2.16/175.32 # Proof found!
% 2.16/175.32 # SZS status Theorem
% 2.16/175.32 # SZS output start CNFRefutation
% See solution above
% 2.16/175.32 # Proof object total steps : 28
% 2.16/175.32 # Proof object clause steps : 17
% 2.16/175.32 # Proof object formula steps : 11
% 2.16/175.32 # Proof object conjectures : 11
% 2.16/175.32 # Proof object clause conjectures : 8
% 2.16/175.32 # Proof object formula conjectures : 3
% 2.16/175.32 # Proof object initial clauses used : 8
% 2.16/175.32 # Proof object initial formulas used : 5
% 2.16/175.32 # Proof object generating inferences : 3
% 2.16/175.32 # Proof object simplifying inferences : 12
% 2.16/175.32 # Training examples: 0 positive, 0 negative
% 2.16/175.32 # Parsed axioms : 3380
% 2.16/175.32 # Removed by relevancy pruning/SinE : 2879
% 2.16/175.32 # Initial clauses : 1576
% 2.16/175.32 # Removed in clause preprocessing : 151
% 2.16/175.32 # Initial clauses in saturation : 1425
% 2.16/175.32 # Processed clauses : 1610
% 2.16/175.32 # ...of these trivial : 40
% 2.16/175.32 # ...subsumed : 253
% 2.16/175.32 # ...remaining for further processing : 1316
% 2.16/175.32 # Other redundant clauses eliminated : 0
% 2.16/175.32 # Clauses deleted for lack of memory : 120187
% 2.16/175.32 # Backward-subsumed : 6
% 2.16/175.32 # Backward-rewritten : 125
% 2.16/175.32 # Generated clauses : 186235
% 2.16/175.32 # ...of the previous two non-trivial : 178061
% 2.16/175.32 # Contextual simplify-reflections : 1079
% 2.16/175.32 # Paramodulations : 186164
% 2.16/175.32 # Factorizations : 10
% 2.16/175.32 # Equation resolutions : 61
% 2.16/175.32 # Current number of processed clauses : 1185
% 2.16/175.32 # Positive orientable unit clauses : 96
% 2.16/175.32 # Positive unorientable unit clauses: 15
% 2.16/175.32 # Negative unit clauses : 9
% 2.16/175.32 # Non-unit-clauses : 1065
% 2.16/175.32 # Current number of unprocessed clauses: 52389
% 2.16/175.32 # ...number of literals in the above : 177703
% 2.16/175.32 # Current number of archived formulas : 0
% 2.16/175.32 # Current number of archived clauses : 131
% 2.16/175.32 # Clause-clause subsumption calls (NU) : 889521
% 2.16/175.32 # Rec. Clause-clause subsumption calls : 78973
% 2.16/175.32 # Non-unit clause-clause subsumptions : 1320
% 2.16/175.32 # Unit Clause-clause subsumption calls : 8405
% 2.16/175.32 # Rewrite failures with RHS unbound : 6
% 2.16/175.32 # BW rewrite match attempts : 42327
% 2.16/175.32 # BW rewrite match successes : 394
% 2.16/175.32 # Condensation attempts : 0
% 2.16/175.32 # Condensation successes : 0
% 2.16/175.32 # Termbank termtop insertions : 35111330
% 2.16/175.32
% 2.16/175.32 # -------------------------------------------------
% 2.16/175.32 # User time : 12.284 s
% 2.16/175.32 # System time : 0.123 s
% 2.16/175.32 # Total time : 12.407 s
% 2.16/175.32 # Maximum resident set size: 148768 pages
% 2.16/185.29 eprover: CPU time limit exceeded, terminating
% 2.16/185.31 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.16/185.31 eprover: No such file or directory
% 2.16/185.31 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.16/185.31 eprover: No such file or directory
% 2.16/185.32 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.16/185.32 eprover: No such file or directory
% 2.16/185.32 eprover: CPU time limit exceeded, terminating
% 2.16/185.33 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.16/185.33 eprover: No such file or directory
% 2.16/185.34 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.16/185.34 eprover: No such file or directory
% 2.16/185.35 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.16/185.35 eprover: No such file or directory
% 2.16/185.35 eprover: CPU time limit exceeded, terminating
% 2.16/185.35 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.16/185.35 eprover: No such file or directory
% 2.16/185.35 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.16/185.35 eprover: No such file or directory
% 2.16/185.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.16/185.36 eprover: No such file or directory
% 2.16/185.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.16/185.37 eprover: No such file or directory
% 2.16/185.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.16/185.37 eprover: No such file or directory
% 2.16/185.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.16/185.37 eprover: No such file or directory
%------------------------------------------------------------------------------