TSTP Solution File: RNG082+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG082+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 300s
% DateTime : Tue May 21 02:36:15 EDT 2024
% Result : Theorem 39.81s 5.48s
% Output : CNFRefutation 39.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 74 ( 29 unt; 0 def)
% Number of atoms : 162 ( 66 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 157 ( 69 ~; 64 |; 15 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulUnit,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulUnit) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(mAddInvr,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddInvr) ).
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/sandbox/benchmark/theBenchmark.p',mAMDistr) ).
fof(m__444,hypothesis,
aElement0(xx),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__444) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsU) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(m__,conjecture,
sdtasdt0(smndt0(sz10),xx) = smndt0(xx),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_13,plain,
! [X17] :
( ( sdtasdt0(X17,sz10) = X17
| ~ aElement0(X17) )
& ( X17 = sdtasdt0(sz10,X17)
| ~ aElement0(X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulUnit])])])]) ).
fof(c_0_14,plain,
! [X9,X10] :
( ~ aElement0(X9)
| ~ aElement0(X10)
| sdtasdt0(X9,X10) = sdtasdt0(X10,X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_15,plain,
! [X6] :
( ( sdtpldt0(X6,smndt0(X6)) = sz00
| ~ aElement0(X6) )
& ( sz00 = sdtpldt0(smndt0(X6),X6)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddInvr])])])]) ).
fof(c_0_16,plain,
! [X14,X15,X16] :
( ( sdtasdt0(X14,sdtpldt0(X15,X16)) = sdtpldt0(sdtasdt0(X14,X15),sdtasdt0(X14,X16))
| ~ aElement0(X14)
| ~ aElement0(X15)
| ~ aElement0(X16) )
& ( sdtasdt0(sdtpldt0(X15,X16),X14) = sdtpldt0(sdtasdt0(X15,X14),sdtasdt0(X16,X14))
| ~ aElement0(X14)
| ~ aElement0(X15)
| ~ aElement0(X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])])]) ).
cnf(c_0_17,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__444]) ).
cnf(c_0_19,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X25] :
( ( sdtpldt0(X25,sz00) = X25
| ~ aElement0(X25) )
& ( X25 = sdtpldt0(sz00,X25)
| ~ aElement0(X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
fof(c_0_21,plain,
! [X22,X23,X24] :
( ~ aElement0(X22)
| ~ aElement0(X23)
| ~ aElement0(X24)
| sdtpldt0(sdtpldt0(X22,X23),X24) = sdtpldt0(X22,sdtpldt0(X23,X24)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).
fof(c_0_22,plain,
! [X7,X8] :
( ~ aElement0(X7)
| ~ aElement0(X8)
| aElement0(sdtasdt0(X7,X8)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_23,plain,
! [X5] :
( ~ aElement0(X5)
| aElement0(smndt0(X5)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])])]) ).
cnf(c_0_24,plain,
( sz00 = sdtpldt0(smndt0(X1),X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,hypothesis,
sdtasdt0(xx,sz10) = xx,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_28,hypothesis,
( sdtasdt0(X1,xx) = sdtasdt0(xx,X1)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_29,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_30,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( aElement0(smndt0(X1))
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,hypothesis,
sdtpldt0(smndt0(xx),xx) = sz00,
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
fof(c_0_35,plain,
! [X20,X21] :
( ~ aElement0(X20)
| ~ aElement0(X21)
| sdtpldt0(X20,X21) = sdtpldt0(X21,X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_36,hypothesis,
( sdtpldt0(sdtasdt0(xx,X1),xx) = sdtasdt0(xx,sdtpldt0(X1,sz10))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_18])]) ).
cnf(c_0_37,hypothesis,
sdtasdt0(xx,sz00) = sdtasdt0(sz00,xx),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,plain,
sdtpldt0(sz00,sz10) = sz10,
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_39,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_40,plain,
( sdtpldt0(sdtpldt0(X1,X2),sdtasdt0(X3,X4)) = sdtpldt0(X1,sdtpldt0(X2,sdtasdt0(X3,X4)))
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X4)
| ~ aElement0(X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
( sdtasdt0(smndt0(X1),sz10) = smndt0(X1)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_42,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,hypothesis,
( sdtpldt0(smndt0(xx),sdtpldt0(xx,X1)) = sdtpldt0(sz00,X1)
| ~ aElement0(smndt0(xx))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_34]),c_0_18])]) ).
cnf(c_0_44,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,hypothesis,
sdtpldt0(sdtasdt0(sz00,xx),xx) = xx,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_37]),c_0_38]),c_0_26]) ).
cnf(c_0_46,hypothesis,
aElement0(sdtasdt0(sz00,xx)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_29]),c_0_18])]) ).
cnf(c_0_47,plain,
( sdtpldt0(sdtasdt0(X1,X2),sz00) = sdtasdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_32]) ).
fof(c_0_48,negated_conjecture,
sdtasdt0(smndt0(sz10),xx) != smndt0(xx),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_49,hypothesis,
( sdtpldt0(sdtpldt0(X1,xx),sdtasdt0(X2,X3)) = sdtpldt0(X1,sdtpldt0(xx,sdtasdt0(X2,X3)))
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aElement0(X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_18]) ).
cnf(c_0_50,hypothesis,
sdtasdt0(smndt0(xx),sz10) = smndt0(xx),
inference(spm,[status(thm)],[c_0_41,c_0_18]) ).
cnf(c_0_51,hypothesis,
sdtpldt0(xx,smndt0(xx)) = sz00,
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_52,hypothesis,
( sdtasdt0(smndt0(X1),xx) = sdtasdt0(xx,smndt0(X1))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_53,hypothesis,
( sdtpldt0(smndt0(xx),sdtpldt0(xx,X1)) = sdtpldt0(sz00,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_33]),c_0_18])]) ).
cnf(c_0_54,hypothesis,
sdtpldt0(xx,sdtasdt0(sz00,xx)) = xx,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_18]),c_0_46])]) ).
cnf(c_0_55,hypothesis,
sdtpldt0(sz00,sdtasdt0(sz00,xx)) = sdtasdt0(sz00,xx),
inference(spm,[status(thm)],[c_0_30,c_0_46]) ).
cnf(c_0_56,hypothesis,
( sdtpldt0(sdtasdt0(X1,xx),sz00) = sdtasdt0(X1,xx)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_18]) ).
fof(c_0_57,negated_conjecture,
sdtasdt0(smndt0(sz10),xx) != smndt0(xx),
inference(fof_nnf,[status(thm)],[c_0_48]) ).
cnf(c_0_58,hypothesis,
( sdtpldt0(sdtpldt0(X1,xx),smndt0(xx)) = sdtpldt0(X1,sz00)
| ~ aElement0(smndt0(xx))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_27])]) ).
cnf(c_0_59,hypothesis,
sdtasdt0(smndt0(sz10),xx) = sdtasdt0(xx,smndt0(sz10)),
inference(spm,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_60,hypothesis,
( sdtpldt0(sdtasdt0(xx,smndt0(X1)),xx) = sdtasdt0(xx,sdtpldt0(smndt0(X1),sz10))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_61,plain,
sdtpldt0(smndt0(sz10),sz10) = sz00,
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_62,hypothesis,
sdtasdt0(sz00,xx) = sz00,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_54]),c_0_34]),c_0_55]) ).
cnf(c_0_63,plain,
( sdtpldt0(sz00,smndt0(X1)) = smndt0(X1)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_64,hypothesis,
( sdtpldt0(sdtasdt0(smndt0(X1),xx),sz00) = sdtasdt0(smndt0(X1),xx)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_33]) ).
cnf(c_0_65,negated_conjecture,
sdtasdt0(smndt0(sz10),xx) != smndt0(xx),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_66,hypothesis,
( sdtpldt0(sdtpldt0(X1,xx),smndt0(xx)) = sdtpldt0(X1,sz00)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_33]),c_0_18])]) ).
cnf(c_0_67,hypothesis,
( aElement0(sdtasdt0(xx,smndt0(sz10)))
| ~ aElement0(smndt0(sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_59]),c_0_18])]) ).
cnf(c_0_68,hypothesis,
sdtpldt0(sdtasdt0(xx,smndt0(sz10)),xx) = sz00,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_27]),c_0_61]),c_0_37]),c_0_62]) ).
cnf(c_0_69,hypothesis,
sdtpldt0(sz00,smndt0(xx)) = smndt0(xx),
inference(spm,[status(thm)],[c_0_63,c_0_18]) ).
cnf(c_0_70,hypothesis,
sdtpldt0(sdtasdt0(xx,smndt0(sz10)),sz00) = sdtasdt0(xx,smndt0(sz10)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_27]),c_0_59]),c_0_59]) ).
cnf(c_0_71,negated_conjecture,
sdtasdt0(xx,smndt0(sz10)) != smndt0(xx),
inference(rw,[status(thm)],[c_0_65,c_0_59]) ).
cnf(c_0_72,hypothesis,
~ aElement0(smndt0(sz10)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69]),c_0_70]),c_0_71]) ).
cnf(c_0_73,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_33]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG082+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 11:58:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.45 Running first-order theorem proving
% 0.20/0.45 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 39.81/5.48 # Version: 3.1.0
% 39.81/5.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 39.81/5.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.81/5.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.81/5.48 # Starting new_bool_3 with 300s (1) cores
% 39.81/5.48 # Starting new_bool_1 with 300s (1) cores
% 39.81/5.48 # Starting sh5l with 300s (1) cores
% 39.81/5.48 # new_bool_3 with pid 31902 completed with status 0
% 39.81/5.48 # Result found by new_bool_3
% 39.81/5.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 39.81/5.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.81/5.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.81/5.48 # Starting new_bool_3 with 300s (1) cores
% 39.81/5.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 39.81/5.48 # Search class: FHUSF-FFSS21-SFFFFFNN
% 39.81/5.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 39.81/5.48 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 39.81/5.48 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 31906 completed with status 0
% 39.81/5.48 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 39.81/5.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 39.81/5.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.81/5.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.81/5.48 # Starting new_bool_3 with 300s (1) cores
% 39.81/5.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 39.81/5.48 # Search class: FHUSF-FFSS21-SFFFFFNN
% 39.81/5.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 39.81/5.48 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 39.81/5.48 # Preprocessing time : 0.001 s
% 39.81/5.48 # Presaturation interreduction done
% 39.81/5.48
% 39.81/5.48 # Proof found!
% 39.81/5.48 # SZS status Theorem
% 39.81/5.48 # SZS output start CNFRefutation
% See solution above
% 39.81/5.48 # Parsed axioms : 16
% 39.81/5.48 # Removed by relevancy pruning/SinE : 0
% 39.81/5.48 # Initial clauses : 20
% 39.81/5.48 # Removed in clause preprocessing : 1
% 39.81/5.48 # Initial clauses in saturation : 19
% 39.81/5.48 # Processed clauses : 14620
% 39.81/5.48 # ...of these trivial : 2632
% 39.81/5.48 # ...subsumed : 7168
% 39.81/5.48 # ...remaining for further processing : 4820
% 39.81/5.48 # Other redundant clauses eliminated : 0
% 39.81/5.48 # Clauses deleted for lack of memory : 0
% 39.81/5.48 # Backward-subsumed : 381
% 39.81/5.48 # Backward-rewritten : 1096
% 39.81/5.48 # Generated clauses : 570497
% 39.81/5.48 # ...of the previous two non-redundant : 487233
% 39.81/5.48 # ...aggressively subsumed : 0
% 39.81/5.48 # Contextual simplify-reflections : 17
% 39.81/5.48 # Paramodulations : 570497
% 39.81/5.48 # Factorizations : 0
% 39.81/5.48 # NegExts : 0
% 39.81/5.48 # Equation resolutions : 0
% 39.81/5.48 # Disequality decompositions : 0
% 39.81/5.48 # Total rewrite steps : 809333
% 39.81/5.48 # ...of those cached : 808096
% 39.81/5.48 # Propositional unsat checks : 0
% 39.81/5.48 # Propositional check models : 0
% 39.81/5.48 # Propositional check unsatisfiable : 0
% 39.81/5.48 # Propositional clauses : 0
% 39.81/5.48 # Propositional clauses after purity: 0
% 39.81/5.48 # Propositional unsat core size : 0
% 39.81/5.48 # Propositional preprocessing time : 0.000
% 39.81/5.48 # Propositional encoding time : 0.000
% 39.81/5.48 # Propositional solver time : 0.000
% 39.81/5.48 # Success case prop preproc time : 0.000
% 39.81/5.48 # Success case prop encoding time : 0.000
% 39.81/5.48 # Success case prop solver time : 0.000
% 39.81/5.48 # Current number of processed clauses : 3324
% 39.81/5.48 # Positive orientable unit clauses : 1017
% 39.81/5.48 # Positive unorientable unit clauses: 0
% 39.81/5.48 # Negative unit clauses : 2
% 39.81/5.48 # Non-unit-clauses : 2305
% 39.81/5.48 # Current number of unprocessed clauses: 470707
% 39.81/5.48 # ...number of literals in the above : 1440407
% 39.81/5.48 # Current number of archived formulas : 0
% 39.81/5.48 # Current number of archived clauses : 1496
% 39.81/5.48 # Clause-clause subsumption calls (NU) : 468737
% 39.81/5.48 # Rec. Clause-clause subsumption calls : 454502
% 39.81/5.48 # Non-unit clause-clause subsumptions : 7259
% 39.81/5.48 # Unit Clause-clause subsumption calls : 16236
% 39.81/5.48 # Rewrite failures with RHS unbound : 0
% 39.81/5.48 # BW rewrite match attempts : 6298
% 39.81/5.48 # BW rewrite match successes : 398
% 39.81/5.48 # Condensation attempts : 0
% 39.81/5.48 # Condensation successes : 0
% 39.81/5.48 # Termbank termtop insertions : 16729049
% 39.81/5.48 # Search garbage collected termcells : 183
% 39.81/5.48
% 39.81/5.48 # -------------------------------------------------
% 39.81/5.48 # User time : 4.737 s
% 39.81/5.48 # System time : 0.232 s
% 39.81/5.48 # Total time : 4.969 s
% 39.81/5.48 # Maximum resident set size: 1708 pages
% 39.81/5.48
% 39.81/5.48 # -------------------------------------------------
% 39.81/5.48 # User time : 4.739 s
% 39.81/5.48 # System time : 0.232 s
% 39.81/5.48 # Total time : 4.971 s
% 39.81/5.48 # Maximum resident set size: 1704 pages
% 39.81/5.48 % E---3.1 exiting
% 39.81/5.48 % E exiting
%------------------------------------------------------------------------------