TSTP Solution File: NUM534+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM534+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:56:14 EDT 2023
% Result : Timeout 0.58s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 10 unt; 0 def)
% Number of atoms : 235 ( 43 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 312 ( 121 ~; 135 |; 38 &)
% ( 7 <=>; 11 =>; 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 : 68 ( 0 sgn; 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSet0(sdtmndt0(xS,xx))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( aElement0(X1)
& aElementOf0(X1,xS)
& X1 != xx ) ) )
=> ( ( aSet0(sdtpldt0(sdtmndt0(xS,xx),xx))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
<=> ( aElement0(X1)
& ( aElementOf0(X1,sdtmndt0(xS,xx))
| X1 = xx ) ) ) )
=> sdtpldt0(sdtmndt0(xS,xx),xx) = xS ) ),
file('/export/starexec/sandbox2/tmp/tmp.IG8rCJDBjf/E---3.1_3203.p',m__) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IG8rCJDBjf/E---3.1_3203.p',mDefSub) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IG8rCJDBjf/E---3.1_3203.p',mDefDiff) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IG8rCJDBjf/E---3.1_3203.p',mEOfElem) ).
fof(mSubASymm,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aSet0(X2) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.IG8rCJDBjf/E---3.1_3203.p',mSubASymm) ).
fof(m__617,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox2/tmp/tmp.IG8rCJDBjf/E---3.1_3203.p',m__617) ).
fof(m__617_02,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/tmp/tmp.IG8rCJDBjf/E---3.1_3203.p',m__617_02) ).
fof(c_0_7,negated_conjecture,
~ ( ( aSet0(sdtmndt0(xS,xx))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( aElement0(X1)
& aElementOf0(X1,xS)
& X1 != xx ) ) )
=> ( ( aSet0(sdtpldt0(sdtmndt0(xS,xx),xx))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
<=> ( aElement0(X1)
& ( aElementOf0(X1,sdtmndt0(xS,xx))
| X1 = xx ) ) ) )
=> sdtpldt0(sdtmndt0(xS,xx),xx) = xS ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
! [X5,X6] :
( aSet0(sdtmndt0(xS,xx))
& ( aElement0(X5)
| ~ aElementOf0(X5,sdtmndt0(xS,xx)) )
& ( aElementOf0(X5,xS)
| ~ aElementOf0(X5,sdtmndt0(xS,xx)) )
& ( X5 != xx
| ~ aElementOf0(X5,sdtmndt0(xS,xx)) )
& ( ~ aElement0(X5)
| ~ aElementOf0(X5,xS)
| X5 = xx
| aElementOf0(X5,sdtmndt0(xS,xx)) )
& aSet0(sdtpldt0(sdtmndt0(xS,xx),xx))
& ( aElement0(X6)
| ~ aElementOf0(X6,sdtpldt0(sdtmndt0(xS,xx),xx)) )
& ( aElementOf0(X6,sdtmndt0(xS,xx))
| X6 = xx
| ~ aElementOf0(X6,sdtpldt0(sdtmndt0(xS,xx),xx)) )
& ( ~ aElementOf0(X6,sdtmndt0(xS,xx))
| ~ aElement0(X6)
| aElementOf0(X6,sdtpldt0(sdtmndt0(xS,xx),xx)) )
& ( X6 != xx
| ~ aElement0(X6)
| aElementOf0(X6,sdtpldt0(sdtmndt0(xS,xx),xx)) )
& sdtpldt0(sdtmndt0(xS,xx),xx) != xS ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_9,plain,
! [X9,X10,X11,X12] :
( ( aSet0(X10)
| ~ aSubsetOf0(X10,X9)
| ~ aSet0(X9) )
& ( ~ aElementOf0(X11,X10)
| aElementOf0(X11,X9)
| ~ aSubsetOf0(X10,X9)
| ~ aSet0(X9) )
& ( aElementOf0(esk1_2(X9,X12),X12)
| ~ aSet0(X12)
| aSubsetOf0(X12,X9)
| ~ aSet0(X9) )
& ( ~ aElementOf0(esk1_2(X9,X12),X9)
| ~ aSet0(X12)
| aSubsetOf0(X12,X9)
| ~ aSet0(X9) ) ),
inference(distribute,[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_10,negated_conjecture,
( aElementOf0(X1,sdtmndt0(xS,xx))
| X1 = xx
| ~ aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( aElementOf0(esk1_2(X1,X2),X2)
| aSubsetOf0(X2,X1)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
aSet0(sdtpldt0(sdtmndt0(xS,xx),xx)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X21,X22,X23,X24,X25,X26] :
( ( aSet0(X23)
| X23 != sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) )
& ( aElement0(X24)
| ~ aElementOf0(X24,X23)
| X23 != sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) )
& ( aElementOf0(X24,X21)
| ~ aElementOf0(X24,X23)
| X23 != sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) )
& ( X24 != X22
| ~ aElementOf0(X24,X23)
| X23 != sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) )
& ( ~ aElement0(X25)
| ~ aElementOf0(X25,X21)
| X25 = X22
| aElementOf0(X25,X23)
| X23 != sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) )
& ( ~ aElementOf0(esk3_3(X21,X22,X26),X26)
| ~ aElement0(esk3_3(X21,X22,X26))
| ~ aElementOf0(esk3_3(X21,X22,X26),X21)
| esk3_3(X21,X22,X26) = X22
| ~ aSet0(X26)
| X26 = sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) )
& ( aElement0(esk3_3(X21,X22,X26))
| aElementOf0(esk3_3(X21,X22,X26),X26)
| ~ aSet0(X26)
| X26 = sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) )
& ( aElementOf0(esk3_3(X21,X22,X26),X21)
| aElementOf0(esk3_3(X21,X22,X26),X26)
| ~ aSet0(X26)
| X26 = sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) )
& ( esk3_3(X21,X22,X26) != X22
| aElementOf0(esk3_3(X21,X22,X26),X26)
| ~ aSet0(X26)
| X26 = sdtmndt0(X21,X22)
| ~ aSet0(X21)
| ~ aElement0(X22) ) ),
inference(distribute,[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)],[mDefDiff])])])])])]) ).
fof(c_0_14,plain,
! [X7,X8] :
( ~ aSet0(X7)
| ~ aElementOf0(X8,X7)
| aElement0(X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
cnf(c_0_15,negated_conjecture,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( esk1_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx
| aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),X1)
| aElementOf0(esk1_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)),sdtmndt0(xS,xx))
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,negated_conjecture,
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElementOf0(X1,sdtmndt0(xS,xx))
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( aElement0(X1)
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( X1 = X3
| aElementOf0(X1,X4)
| ~ aElement0(X1)
| ~ aElementOf0(X1,X2)
| X4 != sdtmndt0(X2,X3)
| ~ aSet0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( aSubsetOf0(X2,X1)
| ~ aElementOf0(esk1_2(X1,X2),X1)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| X1 != xx
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_23,plain,
! [X31,X32] :
( ~ aSet0(X31)
| ~ aSet0(X32)
| ~ aSubsetOf0(X31,X32)
| ~ aSubsetOf0(X32,X31)
| X31 = X32 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubASymm])]) ).
cnf(c_0_24,negated_conjecture,
( esk1_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx
| aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),X1)
| aElementOf0(esk1_2(X1,sdtpldt0(sdtmndt0(xS,xx),xx)),xS)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[m__617]) ).
cnf(c_0_26,negated_conjecture,
( aElementOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(csr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( X1 = X2
| aElementOf0(X1,X3)
| X3 != sdtmndt0(X4,X2)
| ~ aElementOf0(X1,X4)
| ~ aElement0(X2)
| ~ aSet0(X4) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__617_02]) ).
cnf(c_0_29,negated_conjecture,
( aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1) != xx
| ~ aElement0(esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1))
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12])]) ).
cnf(c_0_30,plain,
( aSubsetOf0(X1,X2)
| aElement0(esk1_2(X2,X1))
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_31,plain,
( X1 = X2
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,negated_conjecture,
( esk1_2(xS,sdtpldt0(sdtmndt0(xS,xx),xx)) = xx
| aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_12]),c_0_25])]) ).
cnf(c_0_34,negated_conjecture,
( aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElementOf0(esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1),sdtmndt0(xS,xx))
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_12])]) ).
cnf(c_0_35,plain,
( X1 = X2
| aElementOf0(X1,sdtmndt0(X3,X2))
| ~ aElementOf0(X1,X3)
| ~ aElement0(X2)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_36,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_25])]) ).
cnf(c_0_37,negated_conjecture,
( aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1) != xx
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_12])]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ aSubsetOf0(X2,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
aSubsetOf0(sdtpldt0(sdtmndt0(xS,xx),xx),xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_33]),c_0_28]),c_0_12]),c_0_25])]) ).
cnf(c_0_40,negated_conjecture,
sdtpldt0(sdtmndt0(xS,xx),xx) != xS,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_41,negated_conjecture,
( aSubsetOf0(X1,sdtpldt0(sdtmndt0(xS,xx),xx))
| ~ aElementOf0(esk1_2(sdtpldt0(sdtmndt0(xS,xx),xx),X1),xS)
| ~ aSet0(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_25])]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ aSubsetOf0(xS,sdtpldt0(sdtmndt0(xS,xx),xx)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_12])]),c_0_40]) ).
cnf(c_0_43,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_41,c_0_11]),c_0_25]),c_0_12])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM534+2 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.09/0.31 % Computer : n015.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.32 % CPULimit : 2400
% 0.09/0.32 % WCLimit : 300
% 0.09/0.32 % DateTime : Mon Oct 2 14:51:46 EDT 2023
% 0.09/0.32 % CPUTime :
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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/tmp/tmp.IG8rCJDBjf/E---3.1_3203.p
% 0.58/300.10 # Version: 3.1pre001
% 0.58/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.58/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.58/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.58/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.58/300.10 # Starting sh5l with 300s (1) cores
% 0.58/300.10 # new_bool_3 with pid 3282 completed with status 0
% 0.58/300.10 # Result found by new_bool_3
% 0.58/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.58/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.58/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.58/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.58/300.10 # Search class: FGHSF-FFMS32-SFFFFFNN
% 0.58/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.58/300.10 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.58/300.10 # G-E--_301_C18_F1_URBAN_S0Y with pid 3285 completed with status 0
% 0.58/300.10 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.58/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.58/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.58/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.58/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.58/300.10 # Search class: FGHSF-FFMS32-SFFFFFNN
% 0.58/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.58/300.10 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.58/300.10 # Preprocessing time : 0.002 s
% 0.58/300.10
% 0.58/300.10 # Proof found!
% 0.58/300.10 # SZS status Theorem
% 0.58/300.10 # SZS output start CNFRefutation
% See solution above
% 0.58/300.10 # Parsed axioms : 19
% 0.58/300.10 # Removed by relevancy pruning/SinE : 3
% 0.58/300.10 # Initial clauses : 45
% 0.58/300.10 # Removed in clause preprocessing : 3
% 0.58/300.10 # Initial clauses in saturation : 42
% 0.58/300.10 # Processed clauses : 324
% 0.58/300.10 # ...of these trivial : 6
% 0.58/300.10 # ...subsumed : 106
% 0.58/300.10 # ...remaining for further processing : 212
% 0.58/300.10 # Other redundant clauses eliminated : 2
% 0.58/300.10 # Clauses deleted for lack of memory : 0
% 0.58/300.10 # Backward-subsumed : 24
% 0.58/300.10 # Backward-rewritten : 17
% 0.58/300.10 # Generated clauses : 813
% 0.58/300.10 # ...of the previous two non-redundant : 670
% 0.58/300.10 # ...aggressively subsumed : 0
% 0.58/300.10 # Contextual simplify-reflections : 45
% 0.58/300.10 # Paramodulations : 800
% 0.58/300.10 # Factorizations : 0
% 0.58/300.10 # NegExts : 0
% 0.58/300.10 # Equation resolutions : 12
% 0.58/300.10 # Total rewrite steps : 520
% 0.58/300.10 # Propositional unsat checks : 0
% 0.58/300.10 # Propositional check models : 0
% 0.58/300.10 # Propositional check unsatisfiable : 0
% 0.58/300.10 # Propositional clauses : 0
% 0.58/300.10 # Propositional clauses after purity: 0
% 0.58/300.10 # Propositional unsat core size : 0
% 0.58/300.10 # Propositional preprocessing time : 0.000
% 0.58/300.10 # Propositional encoding time : 0.000
% 0.58/300.10 # Propositional solver time : 0.000
% 0.58/300.10 # Success case prop preproc time : 0.000
% 0.58/300.10 # Success case prop encoding time : 0.000
% 0.58/300.10 # Success case prop solver time : 0.000
% 0.58/300.10 # Current number of processed clauses : 168
% 0.58/300.10 # Positive orientable unit clauses : 13
% 0.58/300.10 # Positive unorientable unit clauses: 0
% 0.58/300.10 # Negative unit clauses : 4
% 0.58/300.10 # Non-unit-clauses : 151
% 0.58/300.10 # Current number of unprocessed clauses: 341
% 0.58/300.10 # ...number of literals in the above : 2555
% 0.58/300.10 # Current number of archived formulas : 0
% 0.58/300.10 # Current number of archived clauses : 42
% 0.58/300.10 # Clause-clause subsumption calls (NU) : 7683
% 0.58/300.10 # Rec. Clause-clause subsumption calls : 1340
% 0.58/300.10 # Non-unit clause-clause subsumptions : 153
% 0.58/300.10 # Unit Clause-clause subsumption calls : 136
% 0.58/300.10 # Rewrite failures with RHS unbound : 0
% 0.58/300.10 # BW rewrite match attempts : 5
% 0.58/300.10 # BW rewrite match successes : 5
% 0.58/300.10 # Condensation attempts : 0
% 0.58/300.10 # Condensation successes : 0
% 0.58/300.10 # Termbank termtop insertions : 25468
% 0.58/300.10
% 0.58/300.10 # -------------------------------------------------
% 0.58/300.10 # User time : 0.040 s
% 0.58/300.10 # System time : 0.006 s
% 0.58/300.10 # Total time : 0.046 s
% 0.58/300.10 # Maximum resident set size: 1852 pages
% 0.58/300.10
% 0.58/300.10 # -------------------------------------------------
% 0.58/300.10 # User time : 0.040 s
% 0.58/300.10 # System time : 0.008 s
% 0.58/300.10 # Total time : 0.049 s
% 0.58/300.10 # Maximum resident set size: 1692 pages
% 0.58/300.10 % E---3.1 exiting
% 0.58/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------