%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM218_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:44 PM UTC 2026
% Result : Theorem 0.17s 1.04s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 151 ( 74 equ)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 163 ( 59 ~; 61 |; 32 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 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 : 17 ( 17 usr; 8 con; 0-3 aty)
% Number of variables : 95 ( 0 sgn 94 !; 1 ?; 95 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vOptTerm: $tType ).
tff(decl_sort2,type,
vTy: $tType ).
tff(decl_sort3,type,
vTerm: $tType ).
tff(decl_26,type,
vsomeTerm: vTerm > vOptTerm ).
tff(decl_29,type,
vTrue: vTerm ).
tff(decl_30,type,
vFalse: vTerm ).
tff(decl_31,type,
vt3: vTerm ).
tff(decl_34,type,
vt2: vTerm ).
tff(decl_35,type,
vB: vTy ).
tff(decl_36,type,
vIfelse: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(decl_37,type,
vt1: vTerm ).
tff(decl_40,type,
vreduce: vTerm > vOptTerm ).
tff(decl_42,type,
visSomeTerm: vOptTerm > $o ).
tff(decl_43,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_44,type,
vgetTerm: vOptTerm > vTerm ).
tff(decl_68,type,
esk16_1: vOptTerm > vTerm ).
tff(decl_75,type,
esk23_3: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(decl_76,type,
esk24_3: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(decl_77,type,
esk25_3: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(decl_78,type,
esk26_3: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(decl_105,type,
esk53_0: vTy ).
tff(decl_106,type,
esk54_0: vTerm ).
tff('Preservation-Ifelse-t1-isSomeTerm-True',conjecture,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue )
& visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-Ifelse-t1-isSomeTerm-True') ).
tff('reduce-2',axiom,
! [X14: vTerm,X16: vTerm,X17: vTerm] :
( ( visSomeTerm(vreduce(X14))
& ! [X26: vTerm,X27: vTerm] :
( ( X17 != X27 )
| ( X16 != X26 )
| ( X14 != vFalse ) )
& ! [X24: vTerm,X25: vTerm] :
( ( X17 != X25 )
| ( X16 != X24 )
| ( X14 != vTrue ) ) )
=> ( vreduce(vIfelse(X14,X16,X17)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X14)),X16,X17)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduce-2') ).
tff('Tif_inv1',axiom,
! [X14: vTerm,X16: vTerm,X17: vTerm,X98: vTy] :
( vptchecksimple(vIfelse(X14,X16,X17),X98)
=> vptchecksimple(X14,vB) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Tif_inv1') ).
tff('getTerm-0',axiom,
! [X10: vTerm] : ( vgetTerm(vsomeTerm(X10)) = X10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','getTerm-0') ).
tff('isSomeTerm-true-INV',axiom,
! [X15: vOptTerm] :
( visSomeTerm(X15)
=> ? [X12: vTerm] : ( X15 = vsomeTerm(X12) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isSomeTerm-true-INV') ).
tff('Preservation-Ifelse-IH0',axiom,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vt1) = vsomeTerm(X99) )
& vptchecksimple(vt1,X98) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-Ifelse-IH0') ).
tff('Tif',axiom,
! [X14: vTerm,X16: vTerm,X98: vTy,X17: vTerm] :
( ( vptchecksimple(X17,X98)
& vptchecksimple(X16,X98)
& vptchecksimple(X14,vB) )
=> vptchecksimple(vIfelse(X14,X16,X17),X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Tif') ).
tff('Tif_inv3',axiom,
! [X14: vTerm,X16: vTerm,X17: vTerm,X98: vTy] :
( vptchecksimple(vIfelse(X14,X16,X17),X98)
=> vptchecksimple(X17,X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Tif_inv3') ).
tff('Tif_inv2',axiom,
! [X14: vTerm,X16: vTerm,X17: vTerm,X98: vTy] :
( vptchecksimple(vIfelse(X14,X16,X17),X98)
=> vptchecksimple(X16,X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Tif_inv2') ).
tff(c_0_9,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue )
& visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
inference(assume_negation,[status(cth)],['Preservation-Ifelse-t1-isSomeTerm-True']) ).
tff(c_0_10,plain,
! [X14: vTerm,X16: vTerm,X17: vTerm] :
( ( visSomeTerm(vreduce(X14))
& ! [X26: vTerm,X27: vTerm] :
( ( X17 != X27 )
| ( X16 != X26 )
| ( X14 != vFalse ) )
& ! [X24: vTerm,X25: vTerm] :
( ( X17 != X25 )
| ( X16 != X24 )
| ( X14 != vTrue ) ) )
=> ( vreduce(vIfelse(X14,X16,X17)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X14)),X16,X17)) ) ),
inference(fof_simplification,[status(thm)],['reduce-2']) ).
tff(c_0_11,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue )
& visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
tff(c_0_12,plain,
! [X224: vTerm,X225: vTerm,X226: vTerm] :
( ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X226 = esk24_3(X224,X225,X226) )
| ( X226 = esk26_3(X224,X225,X226) ) )
& ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X226 = esk24_3(X224,X225,X226) )
| ( X225 = esk25_3(X224,X225,X226) ) )
& ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X226 = esk24_3(X224,X225,X226) )
| ( X224 = vFalse ) )
& ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X225 = esk23_3(X224,X225,X226) )
| ( X226 = esk26_3(X224,X225,X226) ) )
& ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X225 = esk23_3(X224,X225,X226) )
| ( X225 = esk25_3(X224,X225,X226) ) )
& ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X225 = esk23_3(X224,X225,X226) )
| ( X224 = vFalse ) )
& ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X224 = vTrue )
| ( X226 = esk26_3(X224,X225,X226) ) )
& ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X224 = vTrue )
| ( X225 = esk25_3(X224,X225,X226) ) )
& ( ( vreduce(vIfelse(X224,X225,X226)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X224)),X225,X226)) )
| ~ visSomeTerm(vreduce(X224))
| ( X224 = vTrue )
| ( X224 = vFalse ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])]) ).
tff(c_0_13,negated_conjecture,
( ~ vptchecksimple(esk54_0,esk53_0)
& ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(esk54_0) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),esk53_0)
& ( vt1 != vFalse )
& ( vt1 != vTrue )
& visSomeTerm(vreduce(vt1)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
tff(c_0_14,plain,
! [X302: vTerm,X303: vTerm,X304: vTerm,X305: vTy] :
( vptchecksimple(X302,vB)
| ~ vptchecksimple(vIfelse(X302,X303,X304),X305) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Tif_inv1'])])]) ).
tff(c_0_15,plain,
! [X187: vTerm] : ( vgetTerm(vsomeTerm(X187)) = X187 ),
inference(variable_rename,[status(thm)],['getTerm-0']) ).
tff(c_0_16,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_17,plain,
! [X3: vTerm,X2: vTerm,X1: vTerm] :
( ~ visSomeTerm(vreduce(X1))
| ( vreduce(vIfelse(X1,X2,X3)) = vsomeTerm(vIfelse(vgetTerm(vreduce(X1)),X2,X3)) )
| ( X1 = vTrue )
| ( X1 = vFalse ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_18,negated_conjecture,
visSomeTerm(vreduce(vt1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_19,negated_conjecture,
vt1 != vTrue,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_20,negated_conjecture,
vt1 != vFalse,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tff(c_0_21,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-Ifelse-IH0'])])]) ).
tcf(c_0_22,plain,
! [X1: vTerm,X2: vTerm,X3: vTerm,X9: vTy] :
( ~ vptchecksimple(vIfelse(X1,X2,X3),X9)
| vptchecksimple(X1,vB) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_23,negated_conjecture,
vptchecksimple(vIfelse(vt1,vt2,vt3),esk53_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_24,plain,
! [X1: vTerm] : vgetTerm(vsomeTerm(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_25,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( X8 = vsomeTerm(esk16_1(X8)) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_26,negated_conjecture,
! [X1: vTerm,X2: vTerm] : vsomeTerm(vIfelse(vgetTerm(vreduce(vt1)),X1,X2)) = vreduce(vIfelse(vt1,X1,X2)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]) ).
tcf(c_0_27,plain,
! [X9: vTy,X1: vTerm] :
( ( vreduce(vt1) != vsomeTerm(X1) )
| ~ vptchecksimple(vt1,X9)
| vptchecksimple(X1,X9) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tcf(c_0_28,negated_conjecture,
vptchecksimple(vt1,vB),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
tcf(c_0_29,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( esk16_1(X8) = vgetTerm(X8) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
tff(c_0_30,plain,
! [X298: vTerm,X299: vTerm,X300: vTy,X301: vTerm] :
( vptchecksimple(vIfelse(X298,X299,X301),X300)
| ~ vptchecksimple(X301,X300)
| ~ vptchecksimple(X299,X300)
| ~ vptchecksimple(X298,vB) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Tif'])])]) ).
tcf(c_0_31,negated_conjecture,
! [X1: vTerm,X2: vTerm] : vgetTerm(vreduce(vIfelse(vt1,X1,X2))) = vIfelse(vgetTerm(vreduce(vt1)),X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
tcf(c_0_32,negated_conjecture,
vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_33,negated_conjecture,
! [X1: vTerm] :
( ( vreduce(vt1) != vsomeTerm(X1) )
| vptchecksimple(X1,vB) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
tcf(c_0_34,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( vsomeTerm(vgetTerm(X8)) = X8 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
tff(c_0_35,plain,
! [X310: vTerm,X311: vTerm,X312: vTerm,X313: vTy] :
( vptchecksimple(X312,X313)
| ~ vptchecksimple(vIfelse(X310,X311,X312),X313) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Tif_inv3'])])]) ).
tff(c_0_36,plain,
! [X306: vTerm,X307: vTerm,X308: vTerm,X309: vTy] :
( vptchecksimple(X307,X309)
| ~ vptchecksimple(vIfelse(X306,X307,X308),X309) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Tif_inv2'])])]) ).
tcf(c_0_37,plain,
! [X1: vTerm,X2: vTerm,X3: vTerm,X9: vTy] :
( ~ vptchecksimple(X3,X9)
| ~ vptchecksimple(X2,X9)
| ~ vptchecksimple(X1,vB)
| vptchecksimple(vIfelse(X1,X2,X3),X9) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
tcf(c_0_38,negated_conjecture,
vIfelse(vgetTerm(vreduce(vt1)),vt2,vt3) = esk54_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]) ).
tcf(c_0_39,negated_conjecture,
vptchecksimple(vgetTerm(vreduce(vt1)),vB),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34])]),c_0_18])]) ).
tcf(c_0_40,plain,
! [X1: vTerm,X2: vTerm,X3: vTerm,X9: vTy] :
( ~ vptchecksimple(vIfelse(X1,X2,X3),X9)
| vptchecksimple(X3,X9) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
tcf(c_0_41,plain,
! [X1: vTerm,X2: vTerm,X3: vTerm,X9: vTy] :
( ~ vptchecksimple(vIfelse(X1,X2,X3),X9)
| vptchecksimple(X2,X9) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
tcf(c_0_42,negated_conjecture,
~ vptchecksimple(esk54_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_43,negated_conjecture,
! [X9: vTy] :
( ~ vptchecksimple(vt2,X9)
| ~ vptchecksimple(vt3,X9)
| vptchecksimple(esk54_0,X9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
tcf(c_0_44,negated_conjecture,
vptchecksimple(vt3,esk53_0),
inference(spm,[status(thm)],[c_0_40,c_0_23]) ).
tcf(c_0_45,negated_conjecture,
vptchecksimple(vt2,esk53_0),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM218_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.51 % Computer : n010.cluster.edu
% 0.10/0.51 % Model : x86_64 x86_64
% 0.10/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.51 % Memory : 8046.5625MB
% 0.10/0.51 % OS : Linux 6.8.0-71-generic
% 0.10/0.52 % CPULimit : 300
% 0.10/0.52 % WCLimit : 300
% 0.10/0.52 % DateTime : Mon Sep 21 14:20:27 UTC 2026
% 0.10/0.52 % CPUTime :
% 0.10/0.52 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.56 Running first-order theorem proving
% 0.16/0.56 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
% 0.17/1.04 % Version: 3.5.1
% 0.17/1.04 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/1.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/1.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/1.04 % Starting new_bool_3 with 300s (1) cores
% 0.17/1.04 % Starting new_bool_1 with 300s (1) cores
% 0.17/1.04 % Starting sh5l with 300s (1) cores
% 0.17/1.04 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1087472 completed with status 0
% 0.17/1.04 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/1.04 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/1.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/1.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/1.04 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/1.04 % No SInE strategy applied
% 0.17/1.04 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.17/1.04 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.17/1.04 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/1.04 % Starting SubtermCWHack with 136s (1) cores
% 0.17/1.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/1.04 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.17/1.04 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.17/1.04 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/1.04 % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 1087481 completed with status 0
% 0.17/1.04 % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.17/1.04 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/1.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/1.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/1.04 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/1.04 % No SInE strategy applied
% 0.17/1.04 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.17/1.04 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.17/1.04 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/1.04 % Starting SubtermCWHack with 136s (1) cores
% 0.17/1.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/1.04 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.17/1.04 % Preprocessing time : 0.006 s
% 0.17/1.04 % Presaturation interreduction done
% 0.17/1.04
% 0.17/1.04 % Proof found!
% 0.17/1.04 % SZS status Theorem
% 0.17/1.04 % SZS output start CNFRefutation
% See solution above
% 0.17/1.04 % Parsed axioms : 133
% 0.17/1.04 % Removed by relevancy pruning/SinE : 0
% 0.17/1.04 % Initial clauses : 800
% 0.17/1.04 % Removed in clause preprocessing : 25
% 0.17/1.04 % Initial clauses in saturation : 775
% 0.17/1.04 % Processed clauses : 5020
% 0.17/1.04 % ...of these trivial : 321
% 0.17/1.04 % ...subsumed : 2221
% 0.17/1.04 % ...remaining for further processing : 2478
% 0.17/1.04 % Other redundant clauses eliminated : 542
% 0.17/1.04 % Clauses deleted for lack of memory : 0
% 0.17/1.04 % Backward-subsumed : 49
% 0.17/1.04 % Backward-rewritten : 301
% 0.17/1.04 % Generated clauses : 26047
% 0.17/1.04 % ...of the previous two non-redundant : 22832
% 0.17/1.04 % ...aggressively subsumed : 0
% 0.17/1.04 % Contextual simplify-reflections : 26
% 0.17/1.04 % Paramodulations : 25514
% 0.17/1.04 % Factorizations : 89
% 0.17/1.04 % NegExts : 0
% 0.17/1.04 % Equation resolutions : 556
% 0.17/1.04 % Disequality decompositions : 0
% 0.17/1.04 % Total rewrite steps : 8027
% 0.17/1.04 % ...of those cached : 7230
% 0.17/1.04 % Propositional unsat checks : 0
% 0.17/1.04 % Propositional check models : 0
% 0.17/1.04 % Propositional check unsatisfiable : 0
% 0.17/1.04 % Propositional clauses : 0
% 0.17/1.04 % Propositional clauses after purity: 0
% 0.17/1.04 % Propositional unsat core size : 0
% 0.17/1.04 % Propositional preprocessing time : 0.000
% 0.17/1.04 % Propositional encoding time : 0.000
% 0.17/1.04 % Propositional solver time : 0.000
% 0.17/1.04 % Success case prop preproc time : 0.000
% 0.17/1.04 % Success case prop encoding time : 0.000
% 0.17/1.04 % Success case prop solver time : 0.000
% 0.17/1.04 % Current number of processed clauses : 1313
% 0.17/1.04 % Positive orientable unit clauses : 102
% 0.17/1.04 % Positive unorientable unit clauses: 0
% 0.17/1.04 % Negative unit clauses : 77
% 0.17/1.04 % Non-unit-clauses : 1134
% 0.17/1.04 % Current number of unprocessed clauses: 18761
% 0.17/1.04 % ...number of literals in the above : 78051
% 0.17/1.04 % Current number of archived formulas : 0
% 0.17/1.04 % Current number of archived clauses : 1085
% 0.17/1.04 % Clause-clause subsumption calls (NU) : 344593
% 0.17/1.04 % Rec. Clause-clause subsumption calls : 90934
% 0.17/1.04 % Non-unit clause-clause subsumptions : 1384
% 0.17/1.04 % Unit Clause-clause subsumption calls : 35527
% 0.17/1.04 % Rewrite failures with RHS unbound : 0
% 0.17/1.04 % BW rewrite match attempts : 967
% 0.17/1.04 % BW rewrite match successes : 197
% 0.17/1.04 % Condensation attempts : 0
% 0.17/1.04 % Condensation successes : 0
% 0.17/1.04 % Termbank termtop insertions : 567934
% 0.17/1.04 % Search garbage collected termcells : 6016
% 0.17/1.04
% 0.17/1.04 % -------------------------------------------------
% 0.17/1.04 % User time : 0.425 s
% 0.17/1.04 % System time : 0.024 s
% 0.17/1.04 % Total time : 0.449 s
% 0.17/1.04 % Maximum resident set size: 5124 pages
% 0.17/1.04
% 0.17/1.04 % -------------------------------------------------
% 0.17/1.04 % User time : 2.086 s
% 0.17/1.04 % System time : 0.085 s
% 0.17/1.04 % Total time : 2.170 s
% 0.17/1.04 % Maximum resident set size: 4864 pages
% 0.17/1.04 % E exiting
%------------------------------------------------------------------------------