%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM534+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:55:24 PM UTC 2026
% Result : Theorem 0.09s 0.43s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 11 unt; 0 def)
% Number of atoms : 256 ( 50 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 336 ( 126 ~; 138 |; 47 &)
% ( 11 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 77 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( X1 != xx
& aElementOf0(X1,xS)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xS,xx)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
<=> ( ( X1 = xx
| aElementOf0(X1,sdtmndt0(xS,xx)) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)) )
=> sdtpldt0(sdtmndt0(xS,xx),xx) = xS ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__617_02,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__617_02) ).
fof(m__617,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__617) ).
fof(mSubASymm,axiom,
! [X1,X2] :
( ( aSet0(X2)
& aSet0(X1) )
=> ( ( aSubsetOf0(X2,X1)
& aSubsetOf0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubASymm) ).
fof(c_0_7,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( X1 != xx
& aElementOf0(X1,xS)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xS,xx)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
<=> ( ( X1 = xx
| aElementOf0(X1,sdtmndt0(xS,xx)) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)) )
=> sdtpldt0(sdtmndt0(xS,xx),xx) = xS ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( X1 != xx
& aElementOf0(X1,xS)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xS,xx)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
<=> ( ( X1 = xx
| aElementOf0(X1,sdtmndt0(xS,xx)) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)) )
=> sdtpldt0(sdtmndt0(xS,xx),xx) = xS ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
inference(fof_simplification,[status(thm)],[mDefDiff]) ).
fof(c_0_10,negated_conjecture,
! [X44,X45] :
( sdtpldt0(sdtmndt0(xS,xx),xx) != xS
& ( aElementOf0(X45,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElement0(X45)
| X45 != xx )
& ( aElementOf0(X45,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElement0(X45)
| ~ aElementOf0(X45,sdtmndt0(xS,xx)) )
& ( ~ aElementOf0(X45,sdtpldt0(sdtmndt0(xS,xx),xx))
| X45 = xx
| aElementOf0(X45,sdtmndt0(xS,xx)) )
& ( ~ aElementOf0(X45,sdtpldt0(sdtmndt0(xS,xx),xx))
| aElement0(X45) )
& aSet0(sdtpldt0(sdtmndt0(xS,xx),xx))
& ( aElementOf0(X44,sdtmndt0(xS,xx))
| X44 = xx
| ~ aElementOf0(X44,xS)
| ~ aElement0(X44) )
& ( ~ aElementOf0(X44,sdtmndt0(xS,xx))
| X44 != xx )
& ( ~ aElementOf0(X44,sdtmndt0(xS,xx))
| aElementOf0(X44,xS) )
& ( ~ aElementOf0(X44,sdtmndt0(xS,xx))
| aElement0(X44) )
& aSet0(sdtmndt0(xS,xx)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_11,plain,
! [X37,X38,X39,X40,X41,X42] :
( ( ~ aElement0(X38)
| ~ aSet0(X37)
| X42 = sdtmndt0(X37,X38)
| ~ aSet0(X42)
| aElementOf0(esk4_3(X37,X38,X42),X42)
| esk4_3(X37,X38,X42) != X38 )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X42 = sdtmndt0(X37,X38)
| ~ aSet0(X42)
| aElementOf0(esk4_3(X37,X38,X42),X42)
| aElementOf0(esk4_3(X37,X38,X42),X37) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X42 = sdtmndt0(X37,X38)
| ~ aSet0(X42)
| aElementOf0(esk4_3(X37,X38,X42),X42)
| aElement0(esk4_3(X37,X38,X42)) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X42 = sdtmndt0(X37,X38)
| ~ aSet0(X42)
| esk4_3(X37,X38,X42) = X38
| ~ aElementOf0(esk4_3(X37,X38,X42),X37)
| ~ aElement0(esk4_3(X37,X38,X42))
| ~ aElementOf0(esk4_3(X37,X38,X42),X42) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| aElementOf0(X41,X39)
| X41 = X38
| ~ aElementOf0(X41,X37)
| ~ aElement0(X41) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| ~ aElementOf0(X40,X39)
| X40 != X38 )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| ~ aElementOf0(X40,X39)
| aElementOf0(X40,X37) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| ~ aElementOf0(X40,X39)
| aElement0(X40) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| aSet0(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).
fof(c_0_12,plain,
! [X7,X8] :
( aElement0(X8)
| ~ aElementOf0(X8,X7)
| ~ aSet0(X7) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_13,plain,
! [X17,X18,X19,X20] :
( ( ~ aSet0(X17)
| aSubsetOf0(X20,X17)
| ~ aSet0(X20)
| ~ aElementOf0(esk2_2(X17,X20),X17) )
& ( ~ aSet0(X17)
| aSubsetOf0(X20,X17)
| ~ aSet0(X20)
| aElementOf0(esk2_2(X17,X20),X20) )
& ( ~ aSet0(X17)
| ~ aSubsetOf0(X18,X17)
| aElementOf0(X19,X17)
| ~ aElementOf0(X19,X18) )
& ( ~ aSet0(X17)
| ~ aSubsetOf0(X18,X17)
| aSet0(X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ aElement0(X1)
| ~ aElementOf0(X1,sdtmndt0(xS,xx))
| aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( ~ aElementOf0(X1,sdtmndt0(xS,xx))
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ aElement0(X3)
| ~ aSet0(X2)
| X4 != sdtmndt0(X2,X3)
| ~ aElementOf0(X1,X2)
| ~ aElement0(X1)
| aElementOf0(X1,X4)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X1,X2),X1)
| aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ aElementOf0(X1,sdtmndt0(xS,xx))
| aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( ~ aSet0(X4)
| ~ aElement0(X2)
| ~ aElementOf0(X1,X4)
| X3 != sdtmndt0(X4,X2)
| aElementOf0(X1,X3)
| X1 = X2 ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__617_02]) ).
cnf(c_0_23,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[m__617]) ).
cnf(c_0_24,negated_conjecture,
( ~ aSet0(X1)
| ~ aElementOf0(esk2_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1),sdtmndt0(xS,xx))
| aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
( ~ aSet0(X3)
| ~ aElement0(X2)
| ~ aElementOf0(X1,X3)
| aElementOf0(X1,sdtmndt0(X3,X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_26,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_23])]) ).
fof(c_0_27,plain,
! [X25,X26] :
( X25 = X26
| ~ aSubsetOf0(X26,X25)
| ~ aSubsetOf0(X25,X26)
| ~ aSet0(X26)
| ~ aSet0(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubASymm])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ aElement0(X1)
| X1 != xx
| aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( ~ aSet0(X1)
| ~ aElementOf0(esk2_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1),xS)
| aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| esk2_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1) = xx ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_23])]) ).
cnf(c_0_30,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1)
| aElementOf0(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,plain,
( ~ aElement0(X4)
| ~ aSet0(X2)
| X3 != sdtmndt0(X2,X4)
| ~ aElementOf0(X1,X3)
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
( ~ aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| X1 = xx
| aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_33,plain,
( ~ aSubsetOf0(X2,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,negated_conjecture,
( ~ aSet0(X1)
| ~ aElement0(esk2_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1))
| esk2_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1) != xx
| aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_28]),c_0_20])]) ).
cnf(c_0_36,negated_conjecture,
( aSubsetOf0(xS,sdtpldt0(sdtmndt0(xS,xx),xx))
| esk2_2(sdtpldt0(sdtmndt0(xS,xx),xx),xS) = xx ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_23]),c_0_20])]) ).
cnf(c_0_37,plain,
( ~ aSet0(X2)
| ~ aElement0(X3)
| ~ aElementOf0(X1,sdtmndt0(X2,X3))
| aElementOf0(X1,X2) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( ~ aSet0(X1)
| aElementOf0(esk2_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)),sdtmndt0(xS,xx))
| aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),X1)
| esk2_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_20])]) ).
cnf(c_0_39,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X1)
| X1 = X2 ),
inference(csr,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
aSubsetOf0(xS,sdtpldt0(sdtmndt0(xS,xx),xx)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26]),c_0_23])]) ).
cnf(c_0_41,negated_conjecture,
sdtpldt0(sdtmndt0(xS,xx),xx) != xS,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_42,negated_conjecture,
( ~ aSet0(X1)
| aElementOf0(esk2_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)),xS)
| aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),X1)
| esk2_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_26]),c_0_23])]) ).
cnf(c_0_43,negated_conjecture,
~ aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),xS),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_23])]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
esk2_2(xS,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_42]),c_0_20]),c_0_23])]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_44]),c_0_22]),c_0_20]),c_0_23])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM534+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 02:37:52 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.34 Running first-order theorem proving
% 0.04/0.34 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.43 % Version: 3.5.1
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % Starting sh5l with 300s (1) cores
% 0.09/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1390927 completed with status 0
% 0.09/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.43 % No SInE strategy applied
% 0.09/0.43 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.09/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.43 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.09/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.43 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1390935 completed with status 0
% 0.09/0.43 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.43 % No SInE strategy applied
% 0.09/0.43 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.09/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.43 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.09/0.43 % Preprocessing time : 0.003 s
% 0.09/0.43
% 0.09/0.43 % Proof found!
% 0.09/0.43 % SZS status Theorem
% 0.09/0.43 % SZS output start CNFRefutation
% See solution above
% 0.09/0.43 % Parsed axioms : 19
% 0.09/0.43 % Removed by relevancy pruning/SinE : 0
% 0.09/0.43 % Initial clauses : 50
% 0.09/0.43 % Removed in clause preprocessing : 4
% 0.09/0.43 % Initial clauses in saturation : 46
% 0.09/0.43 % Processed clauses : 547
% 0.09/0.43 % ...of these trivial : 15
% 0.09/0.43 % ...subsumed : 244
% 0.09/0.43 % ...remaining for further processing : 288
% 0.09/0.43 % Other redundant clauses eliminated : 7
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 61
% 0.09/0.43 % Backward-rewritten : 17
% 0.09/0.43 % Generated clauses : 1399
% 0.09/0.43 % ...of the previous two non-redundant : 1197
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 61
% 0.09/0.43 % Paramodulations : 1375
% 0.09/0.43 % Factorizations : 0
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 18
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 846
% 0.09/0.43 % ...of those cached : 833
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 202
% 0.09/0.43 % Positive orientable unit clauses : 16
% 0.09/0.43 % Positive unorientable unit clauses: 0
% 0.09/0.43 % Negative unit clauses : 6
% 0.09/0.43 % Non-unit-clauses : 180
% 0.09/0.43 % Current number of unprocessed clauses: 618
% 0.09/0.43 % ...number of literals in the above : 4028
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 84
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 18053
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 3969
% 0.09/0.43 % Non-unit clause-clause subsumptions : 253
% 0.09/0.43 % Unit Clause-clause subsumption calls : 434
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 5
% 0.09/0.43 % BW rewrite match successes : 5
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 36516
% 0.09/0.43 % Search garbage collected termcells : 1030
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.070 s
% 0.09/0.43 % System time : 0.004 s
% 0.09/0.43 % Total time : 0.074 s
% 0.09/0.43 % Maximum resident set size: 3652 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.268 s
% 0.09/0.43 % System time : 0.019 s
% 0.09/0.43 % Total time : 0.287 s
% 0.09/0.43 % Maximum resident set size: 4864 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------