TSTP Solution File: RNG100+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG100+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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 : Mon Jul 18 20:26:55 EDT 2022
% Result : Theorem 1.20s 163.37s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 17 unt; 0 def)
% Number of atoms : 161 ( 25 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 169 ( 64 ~; 62 |; 25 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 71 ( 1 sgn 43 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSet0(slsdtgt0(xc))
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xc))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xc,X2) = X1 ) ) )
=> ( ! [X1] :
( aElementOf0(X1,slsdtgt0(xc))
=> ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xc))
=> aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc)) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),slsdtgt0(xc)) ) ) )
| aIdeal0(slsdtgt0(xc)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulAsso) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEOfElem) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1905) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulComm) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAMDistr) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddComm) ).
fof(c_0_9,negated_conjecture,
~ ( ( aSet0(slsdtgt0(xc))
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xc))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xc,X2) = X1 ) ) )
=> ( ! [X1] :
( aElementOf0(X1,slsdtgt0(xc))
=> ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xc))
=> aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc)) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),slsdtgt0(xc)) ) ) )
| aIdeal0(slsdtgt0(xc)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,negated_conjecture,
! [X3,X3,X5] :
( aSet0(slsdtgt0(xc))
& ( aElement0(esk1_1(X3))
| ~ aElementOf0(X3,slsdtgt0(xc)) )
& ( sdtasdt0(xc,esk1_1(X3)) = X3
| ~ aElementOf0(X3,slsdtgt0(xc)) )
& ( ~ aElement0(X5)
| sdtasdt0(xc,X5) != X3
| aElementOf0(X3,slsdtgt0(xc)) )
& aElementOf0(esk2_0,slsdtgt0(xc))
& ( aElement0(esk4_0)
| aElementOf0(esk3_0,slsdtgt0(xc)) )
& ( ~ aElementOf0(sdtasdt0(esk4_0,esk2_0),slsdtgt0(xc))
| aElementOf0(esk3_0,slsdtgt0(xc)) )
& ( aElement0(esk4_0)
| ~ aElementOf0(sdtpldt0(esk2_0,esk3_0),slsdtgt0(xc)) )
& ( ~ aElementOf0(sdtasdt0(esk4_0,esk2_0),slsdtgt0(xc))
| ~ aElementOf0(sdtpldt0(esk2_0,esk3_0),slsdtgt0(xc)) )
& ~ aIdeal0(slsdtgt0(xc)) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[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_9])])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6)
| sdtasdt0(sdtasdt0(X4,X5),X6) = sdtasdt0(X4,sdtasdt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
cnf(c_0_12,negated_conjecture,
( sdtasdt0(xc,esk1_1(X1)) = X1
| ~ aElementOf0(X1,slsdtgt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
aElementOf0(esk2_0,slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( aElement0(esk1_1(X1))
| ~ aElementOf0(X1,slsdtgt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ aElementOf0(X4,X3)
| aElement0(X4) ),
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)],[mEOfElem])])])])]) ).
cnf(c_0_16,negated_conjecture,
( aElementOf0(X1,slsdtgt0(xc))
| sdtasdt0(xc,X2) != X1
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
sdtasdt0(xc,esk1_1(esk2_0)) = esk2_0,
inference(pm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
aElement0(esk1_1(esk2_0)),
inference(pm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_20,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_22,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
aSet0(slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
( aElementOf0(sdtasdt0(xc,X1),slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( sdtasdt0(xc,sdtasdt0(esk1_1(esk2_0),X1)) = sdtasdt0(esk2_0,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_27,negated_conjecture,
( aElementOf0(esk3_0,slsdtgt0(xc))
| ~ aElementOf0(sdtasdt0(esk4_0,esk2_0),slsdtgt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
aElement0(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_22,c_0_13]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
( aElementOf0(esk3_0,slsdtgt0(xc))
| aElement0(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( aElementOf0(sdtasdt0(esk2_0,X1),slsdtgt0(xc))
| ~ aElement0(sdtasdt0(esk1_1(esk2_0),X1))
| ~ aElement0(X1) ),
inference(pm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_33,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6) )
& ( sdtasdt0(sdtpldt0(X5,X6),X4) = sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
| ~ aElement0(X4)
| ~ aElement0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])]) ).
cnf(c_0_34,negated_conjecture,
( aElementOf0(esk3_0,slsdtgt0(xc))
| ~ aElementOf0(sdtasdt0(esk2_0,esk4_0),slsdtgt0(xc)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( aElementOf0(sdtasdt0(esk2_0,X1),slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_31,c_0_32]),c_0_19])]) ).
cnf(c_0_36,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
aElementOf0(esk3_0,slsdtgt0(xc)),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_35]),c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( sdtpldt0(sdtasdt0(xc,X1),esk2_0) = sdtasdt0(xc,sdtpldt0(X1,esk1_1(esk2_0)))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_36,c_0_18]),c_0_20]),c_0_19])]) ).
cnf(c_0_39,negated_conjecture,
sdtasdt0(xc,esk1_1(esk3_0)) = esk3_0,
inference(pm,[status(thm)],[c_0_12,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
aElement0(esk1_1(esk3_0)),
inference(pm,[status(thm)],[c_0_14,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
sdtasdt0(xc,sdtpldt0(esk1_1(esk3_0),esk1_1(esk2_0))) = sdtpldt0(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
fof(c_0_42,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| aElement0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_43,negated_conjecture,
( aElementOf0(sdtpldt0(esk3_0,esk2_0),slsdtgt0(xc))
| ~ aElement0(sdtpldt0(esk1_1(esk3_0),esk1_1(esk2_0))) ),
inference(pm,[status(thm)],[c_0_24,c_0_41]) ).
cnf(c_0_44,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ~ aElement0(X3)
| ~ aElement0(X4)
| sdtpldt0(X3,X4) = sdtpldt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).
cnf(c_0_46,negated_conjecture,
aElementOf0(sdtpldt0(esk3_0,esk2_0),slsdtgt0(xc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_43,c_0_44]),c_0_19]),c_0_40])]) ).
cnf(c_0_47,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_48,negated_conjecture,
aElement0(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_22,c_0_37]),c_0_23])]) ).
cnf(c_0_49,negated_conjecture,
( ~ aElementOf0(sdtpldt0(esk2_0,esk3_0),slsdtgt0(xc))
| ~ aElementOf0(sdtasdt0(esk4_0,esk2_0),slsdtgt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_50,negated_conjecture,
aElementOf0(sdtpldt0(esk2_0,esk3_0),slsdtgt0(xc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_46,c_0_47]),c_0_29]),c_0_48])]) ).
cnf(c_0_51,negated_conjecture,
~ aElementOf0(sdtasdt0(esk4_0,esk2_0),slsdtgt0(xc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_52,negated_conjecture,
( aElementOf0(sdtasdt0(X1,esk2_0),slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_35,c_0_28]),c_0_29])]) ).
cnf(c_0_53,negated_conjecture,
( aElement0(esk4_0)
| ~ aElementOf0(sdtpldt0(esk2_0,esk3_0),slsdtgt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_54,negated_conjecture,
~ aElement0(esk4_0),
inference(pm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_50])]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : RNG100+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n024.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 : Mon May 30 16:16:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.34/23.39 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.48/46.41 eprover: CPU time limit exceeded, terminating
% 0.48/46.41 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.48/46.41
% 0.48/46.50 eprover: CPU time limit exceeded, terminating
% 0.62/69.42 eprover: CPU time limit exceeded, terminating
% 0.62/69.43 eprover: CPU time limit exceeded, terminating
% 0.62/69.44 eprover: CPU time limit exceeded, terminating
% 0.62/69.51 eprover: CPU time limit exceeded, terminating
% 0.77/92.44 eprover: CPU time limit exceeded, terminating
% 0.77/92.46 eprover: CPU time limit exceeded, terminating
% 0.77/92.48 eprover: CPU time limit exceeded, terminating
% 0.77/92.52 eprover: CPU time limit exceeded, terminating
% 0.90/115.49 eprover: CPU time limit exceeded, terminating
% 0.90/115.49 eprover: CPU time limit exceeded, terminating
% 0.90/115.54 eprover: CPU time limit exceeded, terminating
% 1.03/136.98 eprover: CPU time limit exceeded, terminating
% 1.04/138.51 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.04/138.51
% 1.04/138.55 eprover: CPU time limit exceeded, terminating
% 1.18/159.99 eprover: CPU time limit exceeded, terminating
% 1.19/161.52 eprover: CPU time limit exceeded, terminating
% 1.19/161.53 eprover: CPU time limit exceeded, terminating
% 1.19/161.57 eprover: CPU time limit exceeded, terminating
% 1.20/163.37 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 1.20/163.37
% 1.20/163.37 # Failure: Resource limit exceeded (time)
% 1.20/163.37 # OLD status Res
% 1.20/163.37 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 1.20/163.37 # Preprocessing time : 0.018 s
% 1.20/163.37 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 1.20/163.37
% 1.20/163.37 # Failure: Resource limit exceeded (time)
% 1.20/163.37 # OLD status Res
% 1.20/163.37 # Preprocessing time : 0.022 s
% 1.20/163.37 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 1.20/163.37
% 1.20/163.37 # Failure: Resource limit exceeded (time)
% 1.20/163.37 # OLD status Res
% 1.20/163.37 # Preprocessing time : 0.012 s
% 1.20/163.37 # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 1.20/163.37
% 1.20/163.37 # Failure: Resource limit exceeded (time)
% 1.20/163.37 # OLD status Res
% 1.20/163.37 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 1.20/163.37 # Preprocessing time : 0.027 s
% 1.20/163.37 # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 1.20/163.37 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 1.20/163.37 # Preprocessing time : 0.018 s
% 1.20/163.37
% 1.20/163.37 # Failure: Out of unprocessed clauses!
% 1.20/163.37 # OLD status GaveUp
% 1.20/163.37 # Parsed axioms : 39
% 1.20/163.37 # Removed by relevancy pruning/SinE : 24
% 1.20/163.37 # Initial clauses : 41
% 1.20/163.37 # Removed in clause preprocessing : 2
% 1.20/163.37 # Initial clauses in saturation : 39
% 1.20/163.37 # Processed clauses : 44230
% 1.20/163.37 # ...of these trivial : 381
% 1.20/163.37 # ...subsumed : 331
% 1.20/163.37 # ...remaining for further processing : 43518
% 1.20/163.37 # Other redundant clauses eliminated : 0
% 1.20/163.37 # Clauses deleted for lack of memory : 26985
% 1.20/163.37 # Backward-subsumed : 1
% 1.20/163.37 # Backward-rewritten : 5950
% 1.20/163.37 # Generated clauses : 68499
% 1.20/163.37 # ...of the previous two non-trivial : 73519
% 1.20/163.37 # Contextual simplify-reflections : 0
% 1.20/163.37 # Paramodulations : 68458
% 1.20/163.37 # Factorizations : 0
% 1.20/163.37 # Equation resolutions : 41
% 1.20/163.37 # Current number of processed clauses : 37567
% 1.20/163.37 # Positive orientable unit clauses : 32829
% 1.20/163.37 # Positive unorientable unit clauses: 0
% 1.20/163.37 # Negative unit clauses : 1
% 1.20/163.37 # Non-unit-clauses : 4737
% 1.20/163.37 # Current number of unprocessed clauses: 0
% 1.20/163.37 # ...number of literals in the above : 0
% 1.20/163.37 # Current number of archived formulas : 0
% 1.20/163.37 # Current number of archived clauses : 5951
% 1.20/163.37 # Clause-clause subsumption calls (NU) : 8161860
% 1.20/163.37 # Rec. Clause-clause subsumption calls : 407543
% 1.20/163.37 # Non-unit clause-clause subsumptions : 292
% 1.20/163.37 # Unit Clause-clause subsumption calls : 1565756
% 1.20/163.37 # Rewrite failures with RHS unbound : 0
% 1.20/163.37 # BW rewrite match attempts : 27431022
% 1.20/163.37 # BW rewrite match successes : 92
% 1.20/163.37 # Condensation attempts : 0
% 1.20/163.37 # Condensation successes : 0
% 1.20/163.37 # Termbank termtop insertions : 12274839
% 1.20/163.37
% 1.20/163.37 # -------------------------------------------------
% 1.20/163.37 # User time : 21.214 s
% 1.20/163.37 # System time : 0.233 s
% 1.20/163.37 # Total time : 21.447 s
% 1.20/163.37 # Maximum resident set size: 349236 pages
% 1.20/163.37 # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 1.20/163.37
% 1.20/163.37 # Failure: Resource limit exceeded (time)
% 1.20/163.37 # OLD status Res
% 1.20/163.37 # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 1.20/163.37 # Preprocessing time : 0.020 s
% 1.20/163.37 # Running protocol protocol_eprover_b1d72019af42f5b571a6c0b233a5b6d1de064075 for 23 seconds:
% 1.20/163.37
% 1.20/163.37 # Failure: Resource limit exceeded (time)
% 1.20/163.37 # OLD status Res
% 1.20/163.37 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,500,1.0)
% 1.20/163.37 # Preprocessing time : 0.010 s
% 1.20/163.37 # Running protocol protocol_eprover_e96ef4641ae500918cdd95fcfce21e29f2ac5eec for 23 seconds:
% 1.20/163.37 # SinE strategy is GSinE(CountFormulas,,6.0,,03,100,1.0)
% 1.20/163.37 # Preprocessing time : 0.012 s
% 1.20/163.37
% 1.20/163.37 # Proof found!
% 1.20/163.37 # SZS status Theorem
% 1.20/163.37 # SZS output start CNFRefutation
% See solution above
% 1.20/163.37 # Proof object total steps : 56
% 1.20/163.37 # Proof object clause steps : 38
% 1.20/163.37 # Proof object formula steps : 18
% 1.20/163.37 # Proof object conjectures : 33
% 1.20/163.37 # Proof object clause conjectures : 30
% 1.20/163.37 # Proof object formula conjectures : 3
% 1.20/163.37 # Proof object initial clauses used : 17
% 1.20/163.37 # Proof object initial formulas used : 9
% 1.20/163.37 # Proof object generating inferences : 19
% 1.20/163.37 # Proof object simplifying inferences : 31
% 1.20/163.37 # Training examples: 0 positive, 0 negative
% 1.20/163.37 # Parsed axioms : 39
% 1.20/163.37 # Removed by relevancy pruning/SinE : 0
% 1.20/163.37 # Initial clauses : 103
% 1.20/163.37 # Removed in clause preprocessing : 4
% 1.20/163.37 # Initial clauses in saturation : 99
% 1.20/163.37 # Processed clauses : 46551
% 1.20/163.37 # ...of these trivial : 8459
% 1.20/163.37 # ...subsumed : 30423
% 1.20/163.37 # ...remaining for further processing : 7668
% 1.20/163.37 # Other redundant clauses eliminated : 12
% 1.20/163.37 # Clauses deleted for lack of memory : 0
% 1.20/163.37 # Backward-subsumed : 71
% 1.20/163.37 # Backward-rewritten : 1636
% 1.20/163.37 # Generated clauses : 278501
% 1.20/163.37 # ...of the previous two non-trivial : 186378
% 1.20/163.37 # Contextual simplify-reflections : 1649
% 1.20/163.37 # Paramodulations : 276905
% 1.20/163.37 # Factorizations : 4
% 1.20/163.37 # Equation resolutions : 1592
% 1.20/163.37 # Current number of processed clauses : 5961
% 1.20/163.37 # Positive orientable unit clauses : 3789
% 1.20/163.37 # Positive unorientable unit clauses: 0
% 1.20/163.37 # Negative unit clauses : 4
% 1.20/163.37 # Non-unit-clauses : 2168
% 1.20/163.37 # Current number of unprocessed clauses: 118275
% 1.20/163.37 # ...number of literals in the above : 298905
% 1.20/163.37 # Current number of archived formulas : 0
% 1.20/163.37 # Current number of archived clauses : 1707
% 1.20/163.37 # Clause-clause subsumption calls (NU) : 2161954
% 1.20/163.37 # Rec. Clause-clause subsumption calls : 2081764
% 1.20/163.37 # Non-unit clause-clause subsumptions : 32120
% 1.20/163.37 # Unit Clause-clause subsumption calls : 41630
% 1.20/163.37 # Rewrite failures with RHS unbound : 0
% 1.20/163.37 # BW rewrite match attempts : 146981
% 1.20/163.37 # BW rewrite match successes : 994
% 1.20/163.37 # Condensation attempts : 0
% 1.20/163.37 # Condensation successes : 0
% 1.20/163.37 # Termbank termtop insertions : 3619813
% 1.20/163.37
% 1.20/163.37 # -------------------------------------------------
% 1.20/163.37 # User time : 2.427 s
% 1.20/163.37 # System time : 0.058 s
% 1.20/163.37 # Total time : 2.485 s
% 1.20/163.37 # Maximum resident set size: 102932 pages
% 1.20/184.53 eprover: CPU time limit exceeded, terminating
% 1.20/184.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.20/184.55 eprover: No such file or directory
% 1.20/184.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.20/184.56 eprover: No such file or directory
% 1.20/184.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.20/184.56 eprover: No such file or directory
% 1.20/184.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.20/184.57 eprover: No such file or directory
% 1.20/184.57 eprover: CPU time limit exceeded, terminating
% 1.20/184.58 eprover: CPU time limit exceeded, terminating
% 1.20/184.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/184.59 eprover: No such file or directory
% 1.20/184.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/184.59 eprover: No such file or directory
% 1.20/184.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/184.59 eprover: No such file or directory
% 1.20/184.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/184.60 eprover: No such file or directory
% 1.20/184.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/184.60 eprover: No such file or directory
% 1.20/184.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/184.60 eprover: No such file or directory
% 1.20/184.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/184.61 eprover: No such file or directory
% 1.20/184.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/184.61 eprover: No such file or directory
%------------------------------------------------------------------------------