%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM220_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 12:11:45 PM UTC 2026
% Result : Theorem 0.15s 5.66s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 66 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 133 ( 77 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 116 ( 49 ~; 34 |; 22 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-1 aty)
% Number of variables : 66 ( 0 sgn 64 !; 2 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vOptTerm: $tType ).
tff(decl_sort2,type,
vTy: $tType ).
tff(decl_sort3,type,
vTerm: $tType ).
tff(decl_23,type,
vNat: vTy ).
tff(decl_24,type,
vSucc: vTerm > vTerm ).
tff(decl_26,type,
vsomeTerm: vTerm > vOptTerm ).
tff(decl_27,type,
vZero: vTerm ).
tff(decl_28,type,
vIszero: vTerm > vTerm ).
tff(decl_31,type,
vnoTerm: vOptTerm ).
tff(decl_33,type,
vB: vTy ).
tff(decl_35,type,
vt1: vTerm ).
tff(decl_38,type,
vreduce: vTerm > vOptTerm ).
tff(decl_40,type,
visSomeTerm: vOptTerm > $o ).
tff(decl_41,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_42,type,
vgetTerm: vOptTerm > vTerm ).
tff(decl_59,type,
esk9_1: vOptTerm > vTerm ).
tff(decl_66,type,
esk16_1: vOptTerm > vTerm ).
tff(decl_83,type,
esk33_1: vTerm > vTerm ).
tff(decl_103,type,
esk53_0: vTy ).
tff(decl_104,type,
esk54_0: vTerm ).
tff('Preservation-Iszero-t1-isSomeTerm-True',conjecture,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIszero(vt1)) = vsomeTerm(X99) )
& vptchecksimple(vIszero(vt1),X98)
& ! [X28: vTerm] : ( vt1 != vSucc(X28) )
& ( vt1 != vZero )
& visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Iszero-t1-isSomeTerm-True') ).
tff('DIFF-noTerm-someTerm',axiom,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noTerm-someTerm') ).
tff('dom-Ty',axiom,
! [X9: vTy] :
( ( X9 = vNat )
| ( X9 = vB ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dom-Ty') ).
tff('Tiszero_inv2',axiom,
! [X14: vTerm,X98: vTy] :
( vptchecksimple(vIszero(X14),X98)
=> ( X98 = vB ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Tiszero_inv2') ).
tff('DIFF-B-Nat',axiom,
vB != vNat,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-B-Nat') ).
tff('EQ-someTerm',axiom,
! [X2: vTerm,X3: vTerm] :
( ( vsomeTerm(X2) = vsomeTerm(X3) )
=> ( X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','EQ-someTerm') ).
tff('dom-OptTerm',axiom,
! [X8: vOptTerm] :
( ? [X2: vTerm] : ( X8 = vsomeTerm(X2) )
| ( X8 = vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dom-OptTerm') ).
tff('isSomeTerm-true-INV',axiom,
! [X15: vOptTerm] :
( visSomeTerm(X15)
=> ? [X12: vTerm] : ( X15 = vsomeTerm(X12) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeTerm-true-INV') ).
tff('reduce-16',axiom,
! [X14: vTerm] :
( ( visSomeTerm(vreduce(X14))
& ! [X28: vTerm] : ( X14 != vSucc(X28) )
& ( X14 != vZero ) )
=> ( vreduce(vIszero(X14)) = vsomeTerm(vIszero(vgetTerm(vreduce(X14)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduce-16') ).
tff('Tiszero_inv1',axiom,
! [X14: vTerm] :
( vptchecksimple(vIszero(X14),vB)
=> vptchecksimple(X14,vNat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Tiszero_inv1') ).
tff('getTerm-0',axiom,
! [X10: vTerm] : ( vgetTerm(vsomeTerm(X10)) = X10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getTerm-0') ).
tff('Preservation-Iszero-IH0',axiom,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vt1) = vsomeTerm(X99) )
& vptchecksimple(vt1,X98) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Iszero-IH0') ).
tff('Tiszero',axiom,
! [X14: vTerm] :
( vptchecksimple(X14,vNat)
=> vptchecksimple(vIszero(X14),vB) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Tiszero') ).
tff(c_0_13,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIszero(vt1)) = vsomeTerm(X99) )
& vptchecksimple(vIszero(vt1),X98)
& ! [X28: vTerm] : ( vt1 != vSucc(X28) )
& ( vt1 != vZero )
& visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
inference(assume_negation,[status(cth)],['Preservation-Iszero-t1-isSomeTerm-True']) ).
tff(c_0_14,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIszero(vt1)) = vsomeTerm(X99) )
& vptchecksimple(vIszero(vt1),X98)
& ! [X28: vTerm] : ( vt1 != vSucc(X28) )
& ( vt1 != vZero )
& visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
tff(c_0_15,plain,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-noTerm-someTerm']) ).
tff(c_0_16,negated_conjecture,
! [X340: vTerm] :
( ~ vptchecksimple(esk54_0,esk53_0)
& ( vreduce(vIszero(vt1)) = vsomeTerm(esk54_0) )
& vptchecksimple(vIszero(vt1),esk53_0)
& ( vt1 != vSucc(X340) )
& ( vt1 != vZero )
& visSomeTerm(vreduce(vt1)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
tff(c_0_17,plain,
! [X186: vTy] :
( ( X186 = vNat )
| ( X186 = vB ) ),
inference(variable_rename,[status(thm)],['dom-Ty']) ).
tff(c_0_18,plain,
! [X325: vTerm,X326: vTy] :
( ( X326 = vB )
| ~ vptchecksimple(vIszero(X325),X326) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Tiszero_inv2'])])]) ).
tff(c_0_19,plain,
vB != vNat,
inference(fof_simplification,[status(thm)],['DIFF-B-Nat']) ).
tff(c_0_20,plain,
! [X183: vTerm,X184: vTerm] :
( ( X183 = X184 )
| ( vsomeTerm(X183) != vsomeTerm(X184) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['EQ-someTerm'])])]) ).
tff(c_0_21,plain,
! [X181: vOptTerm] :
( ( X181 = vsomeTerm(esk9_1(X181)) )
| ( X181 = vnoTerm ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['dom-OptTerm'])]) ).
tff(c_0_22,plain,
! [X185: vTerm] : ( vnoTerm != vsomeTerm(X185) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
tcf(c_0_23,negated_conjecture,
vptchecksimple(vIszero(vt1),esk53_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_24,plain,
! [X9: vTy] :
( ( X9 = vNat )
| ( X9 = vB ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_25,plain,
! [X1: vTerm,X9: vTy] :
( ~ vptchecksimple(vIszero(X1),X9)
| ( X9 = vB ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tff(c_0_26,plain,
vB != vNat,
inference(fof_nnf,[status(thm)],[c_0_19]) ).
tcf(c_0_27,plain,
! [X1: vTerm,X2: vTerm] :
( ( vsomeTerm(X1) != vsomeTerm(X2) )
| ( X1 = X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_28,plain,
! [X8: vOptTerm] :
( ( X8 = vsomeTerm(esk9_1(X8)) )
| ( X8 = vnoTerm ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tcf(c_0_29,plain,
! [X1: vTerm] : vnoTerm != vsomeTerm(X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tff(c_0_30,plain,
! [X203: vOptTerm] :
( ( X203 = vsomeTerm(esk16_1(X203)) )
| ~ visSomeTerm(X203) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['isSomeTerm-true-INV'])])])]) ).
tcf(c_0_31,negated_conjecture,
( vptchecksimple(vIszero(vt1),vB)
| ( esk53_0 = vNat ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
tcf(c_0_32,negated_conjecture,
esk53_0 = vB,
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
tcf(c_0_33,plain,
vB != vNat,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
tcf(c_0_34,plain,
! [X1: vTerm] : esk9_1(vsomeTerm(X1)) = X1,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])]),c_0_29]) ).
tcf(c_0_35,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( X8 = vsomeTerm(esk16_1(X8)) ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
tff(c_0_36,plain,
! [X14: vTerm] :
( ( visSomeTerm(vreduce(X14))
& ! [X28: vTerm] : ( X14 != vSucc(X28) )
& ( X14 != vZero ) )
=> ( vreduce(vIszero(X14)) = vsomeTerm(vIszero(vgetTerm(vreduce(X14)))) ) ),
inference(fof_simplification,[status(thm)],['reduce-16']) ).
tff(c_0_37,plain,
! [X324: vTerm] :
( vptchecksimple(X324,vNat)
| ~ vptchecksimple(vIszero(X324),vB) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Tiszero_inv1'])])]) ).
tcf(c_0_38,negated_conjecture,
vptchecksimple(vIszero(vt1),vB),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
tff(c_0_39,plain,
! [X187: vTerm] : ( vgetTerm(vsomeTerm(X187)) = X187 ),
inference(variable_rename,[status(thm)],['getTerm-0']) ).
tcf(c_0_40,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( esk16_1(X8) = esk9_1(X8) ) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
tff(c_0_41,plain,
! [X250: vTerm] :
( ( vreduce(vIszero(X250)) = vsomeTerm(vIszero(vgetTerm(vreduce(X250)))) )
| ~ visSomeTerm(vreduce(X250))
| ( X250 = vSucc(esk33_1(X250)) )
| ( X250 = vZero ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).
tff(c_0_42,plain,
! [X336: vTy,X337: vTerm] :
( vptchecksimple(X337,X336)
| ( vreduce(vt1) != vsomeTerm(X337) )
| ~ vptchecksimple(vt1,X336) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Preservation-Iszero-IH0'])])]) ).
tcf(c_0_43,plain,
! [X1: vTerm] :
( ~ vptchecksimple(vIszero(X1),vB)
| vptchecksimple(X1,vNat) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
tcf(c_0_44,negated_conjecture,
! [X9: vTy] :
( vptchecksimple(vIszero(vt1),X9)
| ( X9 = vNat ) ),
inference(spm,[status(thm)],[c_0_38,c_0_24]) ).
tcf(c_0_45,plain,
! [X1: vTerm] : vgetTerm(vsomeTerm(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
tcf(c_0_46,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( vsomeTerm(esk9_1(X8)) = X8 ) ),
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
tcf(c_0_47,plain,
! [X1: vTerm] :
( ~ visSomeTerm(vreduce(X1))
| ( vreduce(vIszero(X1)) = vsomeTerm(vIszero(vgetTerm(vreduce(X1)))) )
| ( X1 = vSucc(esk33_1(X1)) )
| ( X1 = vZero ) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
tcf(c_0_48,negated_conjecture,
visSomeTerm(vreduce(vt1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_49,negated_conjecture,
vreduce(vIszero(vt1)) = vsomeTerm(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_50,negated_conjecture,
! [X1: vTerm] : vt1 != vSucc(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_51,negated_conjecture,
vt1 != vZero,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_52,plain,
! [X9: vTy,X1: vTerm] :
( ( vreduce(vt1) != vsomeTerm(X1) )
| ~ vptchecksimple(vt1,X9)
| vptchecksimple(X1,X9) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
tcf(c_0_53,negated_conjecture,
vptchecksimple(vt1,vNat),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_33]) ).
tcf(c_0_54,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( esk9_1(X8) = vgetTerm(X8) ) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
tcf(c_0_55,negated_conjecture,
~ vptchecksimple(esk54_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tff(c_0_56,plain,
! [X323: vTerm] :
( vptchecksimple(vIszero(X323),vB)
| ~ vptchecksimple(X323,vNat) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Tiszero'])])]) ).
tcf(c_0_57,negated_conjecture,
vsomeTerm(vIszero(vgetTerm(vreduce(vt1)))) = vsomeTerm(esk54_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]),c_0_51]) ).
tcf(c_0_58,negated_conjecture,
! [X1: vTerm] :
( ( vreduce(vt1) != vsomeTerm(X1) )
| vptchecksimple(X1,vNat) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
tcf(c_0_59,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( vsomeTerm(vgetTerm(X8)) = X8 ) ),
inference(spm,[status(thm)],[c_0_46,c_0_54]) ).
tcf(c_0_60,negated_conjecture,
( ~ vptchecksimple(esk54_0,vB)
| ( esk53_0 = vNat ) ),
inference(spm,[status(thm)],[c_0_55,c_0_24]) ).
tcf(c_0_61,plain,
! [X1: vTerm] :
( ~ vptchecksimple(X1,vNat)
| vptchecksimple(vIszero(X1),vB) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
tcf(c_0_62,negated_conjecture,
vIszero(vgetTerm(vreduce(vt1))) = esk54_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_57]),c_0_45]) ).
tcf(c_0_63,negated_conjecture,
vptchecksimple(vgetTerm(vreduce(vt1)),vNat),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59])]),c_0_48])]) ).
tcf(c_0_64,negated_conjecture,
~ vptchecksimple(esk54_0,vB),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_32]),c_0_33]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM220_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n016.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 14:24:44 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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.15/5.66 % Version: 3.5.1
% 0.15/5.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.66 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.66 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.66 % Starting sh5l with 300s (1) cores
% 0.15/5.66 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2653022 completed with status 0
% 0.15/5.66 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/5.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.66 % No SInE strategy applied
% 0.15/5.66 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.15/5.66 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.15/5.66 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.66 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.66 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.15/5.66 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.15/5.66 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/5.66 % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 2653030 completed with status 0
% 0.15/5.66 % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.15/5.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.66 % No SInE strategy applied
% 0.15/5.66 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.15/5.66 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.15/5.66 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.66 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.66 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.15/5.66 % Preprocessing time : 0.011 s
% 0.15/5.66 % Presaturation interreduction done
% 0.15/5.66
% 0.15/5.66 % Proof found!
% 0.15/5.66 % SZS status Theorem
% 0.15/5.66 % SZS output start CNFRefutation
% See solution above
% 0.15/5.66 % Parsed axioms : 129
% 0.15/5.66 % Removed by relevancy pruning/SinE : 0
% 0.15/5.66 % Initial clauses : 796
% 0.15/5.66 % Removed in clause preprocessing : 23
% 0.15/5.66 % Initial clauses in saturation : 773
% 0.15/5.66 % Processed clauses : 1695
% 0.15/5.66 % ...of these trivial : 136
% 0.15/5.66 % ...subsumed : 288
% 0.15/5.66 % ...remaining for further processing : 1271
% 0.15/5.66 % Other redundant clauses eliminated : 246
% 0.15/5.66 % Clauses deleted for lack of memory : 0
% 0.15/5.66 % Backward-subsumed : 8
% 0.15/5.66 % Backward-rewritten : 33
% 0.15/5.66 % Generated clauses : 3154
% 0.15/5.66 % ...of the previous two non-redundant : 2549
% 0.15/5.66 % ...aggressively subsumed : 0
% 0.15/5.66 % Contextual simplify-reflections : 11
% 0.15/5.66 % Paramodulations : 3004
% 0.15/5.66 % Factorizations : 7
% 0.15/5.66 % NegExts : 0
% 0.15/5.66 % Equation resolutions : 255
% 0.15/5.66 % Disequality decompositions : 0
% 0.15/5.66 % Total rewrite steps : 1925
% 0.15/5.66 % ...of those cached : 1699
% 0.15/5.66 % Propositional unsat checks : 0
% 0.15/5.66 % Propositional check models : 0
% 0.15/5.66 % Propositional check unsatisfiable : 0
% 0.15/5.66 % Propositional clauses : 0
% 0.15/5.66 % Propositional clauses after purity: 0
% 0.15/5.66 % Propositional unsat core size : 0
% 0.15/5.66 % Propositional preprocessing time : 0.000
% 0.15/5.66 % Propositional encoding time : 0.000
% 0.15/5.66 % Propositional solver time : 0.000
% 0.15/5.66 % Success case prop preproc time : 0.000
% 0.15/5.66 % Success case prop encoding time : 0.000
% 0.15/5.66 % Success case prop solver time : 0.000
% 0.15/5.66 % Current number of processed clauses : 417
% 0.15/5.66 % Positive orientable unit clauses : 145
% 0.15/5.66 % Positive unorientable unit clauses: 0
% 0.15/5.66 % Negative unit clauses : 50
% 0.15/5.66 % Non-unit-clauses : 222
% 0.15/5.66 % Current number of unprocessed clauses: 2310
% 0.15/5.66 % ...number of literals in the above : 7321
% 0.15/5.66 % Current number of archived formulas : 0
% 0.15/5.66 % Current number of archived clauses : 774
% 0.15/5.66 % Clause-clause subsumption calls (NU) : 108665
% 0.15/5.66 % Rec. Clause-clause subsumption calls : 19142
% 0.15/5.66 % Non-unit clause-clause subsumptions : 136
% 0.15/5.66 % Unit Clause-clause subsumption calls : 1896
% 0.15/5.66 % Rewrite failures with RHS unbound : 0
% 0.15/5.66 % BW rewrite match attempts : 1651
% 0.15/5.66 % BW rewrite match successes : 30
% 0.15/5.66 % Condensation attempts : 0
% 0.15/5.66 % Condensation successes : 0
% 0.15/5.66 % Termbank termtop insertions : 103263
% 0.15/5.66 % Search garbage collected termcells : 5992
% 0.15/5.66
% 0.15/5.66 % -------------------------------------------------
% 0.15/5.66 % User time : 0.197 s
% 0.15/5.66 % System time : 0.016 s
% 0.15/5.66 % Total time : 0.213 s
% 0.15/5.66 % Maximum resident set size: 5120 pages
% 0.15/5.66
% 0.15/5.66 % -------------------------------------------------
% 0.15/5.66 % User time : 0.936 s
% 0.15/5.66 % System time : 0.048 s
% 0.15/5.66 % Total time : 0.984 s
% 0.15/5.66 % Maximum resident set size: 4864 pages
% 0.15/5.66 % E exiting
%------------------------------------------------------------------------------