TSTP Solution File: GEO473+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO473+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:56 EDT 2022
% Result : Theorem 2.13s 232.28s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 18 unt; 0 def)
% Number of atoms : 41 ( 27 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 11 ~; 9 |; 2 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aDIMu_EQu_FULL,conjecture,
! [X733,X97] :
( s(num,i(s(fun(fun(cart(real,X733),bool),num),dim),s(fun(cart(real,X733),bool),X97))) = s(num,i(s(fun(fun(X733,bool),num),dimindex),s(fun(X733,bool),univ)))
<=> s(fun(cart(real,X733),bool),i(s(fun(fun(cart(real,X733),bool),fun(cart(real,X733),bool)),span),s(fun(cart(real,X733),bool),X97))) = s(fun(cart(real,X733),bool),univ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aDIMu_EQu_FULL) ).
fof(aDIMu_SPAN,axiom,
! [X733,X97] : s(num,i(s(fun(fun(cart(real,X733),bool),num),dim),s(fun(cart(real,X733),bool),i(s(fun(fun(cart(real,X733),bool),fun(cart(real,X733),bool)),span),s(fun(cart(real,X733),bool),X97))))) = s(num,i(s(fun(fun(cart(real,X733),bool),num),dim),s(fun(cart(real,X733),bool),X97))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aDIMu_SPAN) ).
fof(aDIMu_UNIV,axiom,
! [X733] : s(num,i(s(fun(fun(cart(real,X733),bool),num),dim),s(fun(cart(real,X733),bool),univ))) = s(num,i(s(fun(fun(X733,bool),num),dimindex),s(fun(X733,bool),univ))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aDIMu_UNIV) ).
fof(aDIMu_EQu_SPAN,axiom,
! [X733,X97,X15] :
( ( p(s(bool,i(s(fun(fun(cart(real,X733),bool),bool),i(s(fun(fun(cart(real,X733),bool),fun(fun(cart(real,X733),bool),bool)),subset),s(fun(cart(real,X733),bool),X97))),s(fun(cart(real,X733),bool),X15))))
& p(s(bool,i(s(fun(num,bool),i(s(fun(num,fun(num,bool)),l_a_),s(num,i(s(fun(fun(cart(real,X733),bool),num),dim),s(fun(cart(real,X733),bool),X15))))),s(num,i(s(fun(fun(cart(real,X733),bool),num),dim),s(fun(cart(real,X733),bool),X97)))))) )
=> s(fun(cart(real,X733),bool),i(s(fun(fun(cart(real,X733),bool),fun(cart(real,X733),bool)),span),s(fun(cart(real,X733),bool),X97))) = s(fun(cart(real,X733),bool),i(s(fun(fun(cart(real,X733),bool),fun(cart(real,X733),bool)),span),s(fun(cart(real,X733),bool),X15))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aDIMu_EQu_SPAN) ).
fof(aDIMu_SUBSETu_UNIV,axiom,
! [X733,X97] : p(s(bool,i(s(fun(num,bool),i(s(fun(num,fun(num,bool)),l_a_),s(num,i(s(fun(fun(cart(real,X733),bool),num),dim),s(fun(cart(real,X733),bool),X97))))),s(num,i(s(fun(fun(X733,bool),num),dimindex),s(fun(X733,bool),univ)))))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aDIMu_SUBSETu_UNIV) ).
fof(aSPANu_UNIV,axiom,
! [X733] : s(fun(cart(real,X733),bool),i(s(fun(fun(cart(real,X733),bool),fun(cart(real,X733),bool)),span),s(fun(cart(real,X733),bool),univ))) = s(fun(cart(real,X733),bool),univ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aSPANu_UNIV) ).
fof(aSUBSETu_UNIV,axiom,
! [X4,X97] : p(s(bool,i(s(fun(fun(X4,bool),bool),i(s(fun(fun(X4,bool),fun(fun(X4,bool),bool)),subset),s(fun(X4,bool),X97))),s(fun(X4,bool),univ)))),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO010+0.ax',aSUBSETu_UNIV) ).
fof(c_0_7,negated_conjecture,
~ ! [X733,X97] :
( s(num,i(s(fun(fun(cart(real,X733),bool),num),dim),s(fun(cart(real,X733),bool),X97))) = s(num,i(s(fun(fun(X733,bool),num),dimindex),s(fun(X733,bool),univ)))
<=> s(fun(cart(real,X733),bool),i(s(fun(fun(cart(real,X733),bool),fun(cart(real,X733),bool)),span),s(fun(cart(real,X733),bool),X97))) = s(fun(cart(real,X733),bool),univ) ),
inference(assume_negation,[status(cth)],[aDIMu_EQu_FULL]) ).
fof(c_0_8,plain,
! [X734,X735] : s(num,i(s(fun(fun(cart(real,X734),bool),num),dim),s(fun(cart(real,X734),bool),i(s(fun(fun(cart(real,X734),bool),fun(cart(real,X734),bool)),span),s(fun(cart(real,X734),bool),X735))))) = s(num,i(s(fun(fun(cart(real,X734),bool),num),dim),s(fun(cart(real,X734),bool),X735))),
inference(variable_rename,[status(thm)],[aDIMu_SPAN]) ).
fof(c_0_9,negated_conjecture,
( ( s(num,i(s(fun(fun(cart(real,esk1_0),bool),num),dim),s(fun(cart(real,esk1_0),bool),esk2_0))) != s(num,i(s(fun(fun(esk1_0,bool),num),dimindex),s(fun(esk1_0,bool),univ)))
| 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),esk2_0))) != s(fun(cart(real,esk1_0),bool),univ) )
& ( s(num,i(s(fun(fun(cart(real,esk1_0),bool),num),dim),s(fun(cart(real,esk1_0),bool),esk2_0))) = s(num,i(s(fun(fun(esk1_0,bool),num),dimindex),s(fun(esk1_0,bool),univ)))
| 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),esk2_0))) = s(fun(cart(real,esk1_0),bool),univ) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X734] : s(num,i(s(fun(fun(cart(real,X734),bool),num),dim),s(fun(cart(real,X734),bool),univ))) = s(num,i(s(fun(fun(X734,bool),num),dimindex),s(fun(X734,bool),univ))),
inference(variable_rename,[status(thm)],[aDIMu_UNIV]) ).
fof(c_0_11,plain,
! [X734,X735,X736] :
( ~ p(s(bool,i(s(fun(fun(cart(real,X734),bool),bool),i(s(fun(fun(cart(real,X734),bool),fun(fun(cart(real,X734),bool),bool)),subset),s(fun(cart(real,X734),bool),X735))),s(fun(cart(real,X734),bool),X736))))
| ~ p(s(bool,i(s(fun(num,bool),i(s(fun(num,fun(num,bool)),l_a_),s(num,i(s(fun(fun(cart(real,X734),bool),num),dim),s(fun(cart(real,X734),bool),X736))))),s(num,i(s(fun(fun(cart(real,X734),bool),num),dim),s(fun(cart(real,X734),bool),X735))))))
| s(fun(cart(real,X734),bool),i(s(fun(fun(cart(real,X734),bool),fun(cart(real,X734),bool)),span),s(fun(cart(real,X734),bool),X735))) = s(fun(cart(real,X734),bool),i(s(fun(fun(cart(real,X734),bool),fun(cart(real,X734),bool)),span),s(fun(cart(real,X734),bool),X736))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aDIMu_EQu_SPAN])]) ).
cnf(c_0_12,plain,
s(num,i(s(fun(fun(cart(real,X1),bool),num),dim),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),X2))))) = s(num,i(s(fun(fun(cart(real,X1),bool),num),dim),s(fun(cart(real,X1),bool),X2))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( 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),esk2_0))) = s(fun(cart(real,esk1_0),bool),univ)
| s(num,i(s(fun(fun(cart(real,esk1_0),bool),num),dim),s(fun(cart(real,esk1_0),bool),esk2_0))) = s(num,i(s(fun(fun(esk1_0,bool),num),dimindex),s(fun(esk1_0,bool),univ))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
s(num,i(s(fun(fun(cart(real,X1),bool),num),dim),s(fun(cart(real,X1),bool),univ))) = s(num,i(s(fun(fun(X1,bool),num),dimindex),s(fun(X1,bool),univ))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X734,X735] : p(s(bool,i(s(fun(num,bool),i(s(fun(num,fun(num,bool)),l_a_),s(num,i(s(fun(fun(cart(real,X734),bool),num),dim),s(fun(cart(real,X734),bool),X735))))),s(num,i(s(fun(fun(X734,bool),num),dimindex),s(fun(X734,bool),univ)))))),
inference(variable_rename,[status(thm)],[aDIMu_SUBSETu_UNIV]) ).
cnf(c_0_16,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),X2))) = 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),X3)))
| ~ p(s(bool,i(s(fun(num,bool),i(s(fun(num,fun(num,bool)),l_a_),s(num,i(s(fun(fun(cart(real,X1),bool),num),dim),s(fun(cart(real,X1),bool),X3))))),s(num,i(s(fun(fun(cart(real,X1),bool),num),dim),s(fun(cart(real,X1),bool),X2))))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),i(s(fun(fun(cart(real,X1),bool),fun(fun(cart(real,X1),bool),bool)),subset),s(fun(cart(real,X1),bool),X2))),s(fun(cart(real,X1),bool),X3)))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
s(num,i(s(fun(fun(cart(real,esk1_0),bool),num),dim),s(fun(cart(real,esk1_0),bool),esk2_0))) = s(num,i(s(fun(fun(esk1_0,bool),num),dimindex),s(fun(esk1_0,bool),univ))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
p(s(bool,i(s(fun(num,bool),i(s(fun(num,fun(num,bool)),l_a_),s(num,i(s(fun(fun(cart(real,X1),bool),num),dim),s(fun(cart(real,X1),bool),X2))))),s(num,i(s(fun(fun(X1,bool),num),dimindex),s(fun(X1,bool),univ)))))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X734] : s(fun(cart(real,X734),bool),i(s(fun(fun(cart(real,X734),bool),fun(cart(real,X734),bool)),span),s(fun(cart(real,X734),bool),univ))) = s(fun(cart(real,X734),bool),univ),
inference(variable_rename,[status(thm)],[aSPANu_UNIV]) ).
fof(c_0_20,plain,
! [X98,X99] : p(s(bool,i(s(fun(fun(X98,bool),bool),i(s(fun(fun(X98,bool),fun(fun(X98,bool),bool)),subset),s(fun(X98,bool),X99))),s(fun(X98,bool),univ)))),
inference(variable_rename,[status(thm)],[aSUBSETu_UNIV]) ).
cnf(c_0_21,negated_conjecture,
( 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),esk2_0))) != s(fun(cart(real,esk1_0),bool),univ)
| s(num,i(s(fun(fun(cart(real,esk1_0),bool),num),dim),s(fun(cart(real,esk1_0),bool),esk2_0))) != s(num,i(s(fun(fun(esk1_0,bool),num),dimindex),s(fun(esk1_0,bool),univ))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( 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),esk2_0))) = 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),X1)))
| ~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(fun(cart(real,esk1_0),bool),bool)),subset),s(fun(cart(real,esk1_0),bool),esk2_0))),s(fun(cart(real,esk1_0),bool),X1)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_23,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),univ))) = s(fun(cart(real,X1),bool),univ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
p(s(bool,i(s(fun(fun(X1,bool),bool),i(s(fun(fun(X1,bool),fun(fun(X1,bool),bool)),subset),s(fun(X1,bool),X2))),s(fun(X1,bool),univ)))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
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),esk2_0))) != s(fun(cart(real,esk1_0),bool),univ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO473+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 14:36:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.13/24.19 eprover: CPU time limit exceeded, terminating
% 1.13/24.19 eprover: CPU time limit exceeded, terminating
% 1.13/24.19 eprover: CPU time limit exceeded, terminating
% 1.13/24.19 eprover: CPU time limit exceeded, terminating
% 1.23/47.21 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.23/47.21
% 1.23/47.22 eprover: CPU time limit exceeded, terminating
% 1.23/47.23 eprover: CPU time limit exceeded, terminating
% 1.35/70.23 eprover: CPU time limit exceeded, terminating
% 1.35/70.24 eprover: CPU time limit exceeded, terminating
% 1.35/70.25 eprover: CPU time limit exceeded, terminating
% 1.35/70.26 eprover: CPU time limit exceeded, terminating
% 1.45/93.25 eprover: CPU time limit exceeded, terminating
% 1.45/93.27 eprover: CPU time limit exceeded, terminating
% 1.45/93.27 eprover: CPU time limit exceeded, terminating
% 1.45/93.29 eprover: CPU time limit exceeded, terminating
% 1.57/116.28 eprover: CPU time limit exceeded, terminating
% 1.57/116.29 eprover: CPU time limit exceeded, terminating
% 1.57/116.31 eprover: CPU time limit exceeded, terminating
% 1.57/116.31 eprover: CPU time limit exceeded, terminating
% 1.68/139.29 eprover: CPU time limit exceeded, terminating
% 1.68/139.32 eprover: CPU time limit exceeded, terminating
% 1.68/139.33 eprover: CPU time limit exceeded, terminating
% 1.68/139.34 eprover: CPU time limit exceeded, terminating
% 1.79/162.31 eprover: CPU time limit exceeded, terminating
% 1.79/162.35 eprover: CPU time limit exceeded, terminating
% 1.79/162.35 eprover: CPU time limit exceeded, terminating
% 1.79/162.36 eprover: CPU time limit exceeded, terminating
% 1.91/185.33 eprover: CPU time limit exceeded, terminating
% 1.91/185.37 eprover: CPU time limit exceeded, terminating
% 1.91/185.37 eprover: CPU time limit exceeded, terminating
% 1.91/185.38 eprover: CPU time limit exceeded, terminating
% 2.01/208.35 eprover: CPU time limit exceeded, terminating
% 2.01/208.39 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 2.01/208.39
% 2.01/208.40 eprover: CPU time limit exceeded, terminating
% 2.13/231.37 eprover: CPU time limit exceeded, terminating
% 2.13/231.41 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 2.13/231.41
% 2.13/231.42 eprover: CPU time limit exceeded, terminating
% 2.13/232.28 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 2.13/232.28 # Preprocessing time : 0.412 s
% 2.13/232.28 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # Preprocessing time : 2.527 s
% 2.13/232.28 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # Preprocessing time : 2.647 s
% 2.13/232.28 # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 2.13/232.28 # Preprocessing time : 0.443 s
% 2.13/232.28 # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 2.13/232.28 # Preprocessing time : 0.703 s
% 2.13/232.28 # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 2.13/232.28 # Preprocessing time : 0.289 s
% 2.13/232.28 # Running protocol protocol_eprover_b1d72019af42f5b571a6c0b233a5b6d1de064075 for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,500,1.0)
% 2.13/232.28 # Preprocessing time : 1.095 s
% 2.13/232.28 # Running protocol protocol_eprover_e96ef4641ae500918cdd95fcfce21e29f2ac5eec for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # SinE strategy is GSinE(CountFormulas,,6.0,,03,100,1.0)
% 2.13/232.28 # Preprocessing time : 0.304 s
% 2.13/232.28 # Running protocol protocol_eprover_1f734394cb6ce69b36c9826f6782d3567d6ecd6c for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,20000,1.0)
% 2.13/232.28 # Preprocessing time : 0.909 s
% 2.13/232.28 # Running protocol protocol_eprover_e9eb28a402764e1f99b41605245cd0a359f475fb for 23 seconds:
% 2.13/232.28
% 2.13/232.28 # Failure: Resource limit exceeded (time)
% 2.13/232.28 # OLD status Res
% 2.13/232.28 # Preprocessing time : 2.741 s
% 2.13/232.28 # Running protocol protocol_eprover_3dd3316ad6e39f95bf120b2757347c6970e0a532 for 23 seconds:
% 2.13/232.28 # SinE strategy is GSinE(CountFormulas,,1.1,,01,500,1.0)
% 2.13/232.28 # Preprocessing time : 0.309 s
% 2.13/232.28
% 2.13/232.28 # Proof found!
% 2.13/232.28 # SZS status Theorem
% 2.13/232.28 # SZS output start CNFRefutation
% See solution above
% 2.13/232.28 # Proof object total steps : 27
% 2.13/232.28 # Proof object clause steps : 12
% 2.13/232.28 # Proof object formula steps : 15
% 2.13/232.28 # Proof object conjectures : 9
% 2.13/232.28 # Proof object clause conjectures : 6
% 2.13/232.28 # Proof object formula conjectures : 3
% 2.13/232.28 # Proof object initial clauses used : 8
% 2.13/232.28 # Proof object initial formulas used : 7
% 2.13/232.28 # Proof object generating inferences : 3
% 2.13/232.28 # Proof object simplifying inferences : 10
% 2.13/232.28 # Training examples: 0 positive, 0 negative
% 2.13/232.28 # Parsed axioms : 3493
% 2.13/232.28 # Removed by relevancy pruning/SinE : 3410
% 2.13/232.28 # Initial clauses : 189
% 2.13/232.28 # Removed in clause preprocessing : 13
% 2.13/232.28 # Initial clauses in saturation : 176
% 2.13/232.28 # Processed clauses : 196
% 2.13/232.28 # ...of these trivial : 0
% 2.13/232.28 # ...subsumed : 19
% 2.13/232.28 # ...remaining for further processing : 177
% 2.13/232.28 # Other redundant clauses eliminated : 0
% 2.13/232.28 # Clauses deleted for lack of memory : 0
% 2.13/232.28 # Backward-subsumed : 0
% 2.13/232.28 # Backward-rewritten : 7
% 2.13/232.28 # Generated clauses : 4877
% 2.13/232.28 # ...of the previous two non-trivial : 4565
% 2.13/232.28 # Contextual simplify-reflections : 3
% 2.13/232.28 # Paramodulations : 4866
% 2.13/232.28 # Factorizations : 0
% 2.13/232.28 # Equation resolutions : 11
% 2.13/232.28 # Current number of processed clauses : 170
% 2.13/232.28 # Positive orientable unit clauses : 36
% 2.13/232.28 # Positive unorientable unit clauses: 2
% 2.13/232.28 # Negative unit clauses : 4
% 2.13/232.28 # Non-unit-clauses : 128
% 2.13/232.28 # Current number of unprocessed clauses: 4357
% 2.13/232.28 # ...number of literals in the above : 23970
% 2.13/232.28 # Current number of archived formulas : 0
% 2.13/232.28 # Current number of archived clauses : 7
% 2.13/232.28 # Clause-clause subsumption calls (NU) : 6592
% 2.13/232.28 # Rec. Clause-clause subsumption calls : 830
% 2.13/232.28 # Non-unit clause-clause subsumptions : 21
% 2.13/232.28 # Unit Clause-clause subsumption calls : 295
% 2.13/232.28 # Rewrite failures with RHS unbound : 6
% 2.13/232.28 # BW rewrite match attempts : 1921
% 2.13/232.28 # BW rewrite match successes : 8
% 2.13/232.28 # Condensation attempts : 0
% 2.13/232.28 # Condensation successes : 0
% 2.13/232.28 # Termbank termtop insertions : 1564659
% 2.13/232.28
% 2.13/232.28 # -------------------------------------------------
% 2.13/232.28 # User time : 0.538 s
% 2.13/232.28 # System time : 0.017 s
% 2.13/232.28 # Total time : 0.555 s
% 2.13/232.28 # Maximum resident set size: 21628 pages
% 2.13/254.39 eprover: CPU time limit exceeded, terminating
% 2.13/254.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.13/254.40 eprover: No such file or directory
% 2.13/254.43 eprover: CPU time limit exceeded, terminating
% 2.13/254.43 eprover: CPU time limit exceeded, terminating
% 2.13/254.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.13/254.45 eprover: No such file or directory
% 2.13/254.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.13/254.45 eprover: No such file or directory
%------------------------------------------------------------------------------