%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM223_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:45 PM UTC 2026
% Result : Theorem 7.69s 1.44s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 69 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 142 ( 58 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 122 ( 49 ~; 38 |; 23 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 77 !; 2 ?; 79 :)
% 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_26,type,
vsomeTerm: vTerm > vOptTerm ).
tff(decl_31,type,
vnoTerm: vOptTerm ).
tff(decl_32,type,
vPlus: ( vTerm * vTerm ) > vTerm ).
tff(decl_33,type,
vt2: vTerm ).
tff(decl_34,type,
vB: vTy ).
tff(decl_36,type,
vt1: vTerm ).
tff(decl_38,type,
visNV: vTerm > $o ).
tff(decl_39,type,
vreduce: vTerm > vOptTerm ).
tff(decl_41,type,
visSomeTerm: vOptTerm > $o ).
tff(decl_42,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_43,type,
vgetTerm: vOptTerm > vTerm ).
tff(decl_60,type,
esk9_1: vOptTerm > vTerm ).
tff(decl_67,type,
esk16_1: vOptTerm > vTerm ).
tff(decl_104,type,
esk53_0: vTy ).
tff(decl_105,type,
esk54_0: vTerm ).
tff('Preservation-Plus-isNV-True-isNV-False-isSomeTerm-True',conjecture,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X99) )
& vptchecksimple(vPlus(vt1,vt2),X98)
& visNV(vt1)
& ~ visNV(vt2)
& visSomeTerm(vreduce(vt2)) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-Plus-isNV-True-isNV-False-isSomeTerm-True') ).
tff('DIFF-noTerm-someTerm',axiom,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-noTerm-someTerm') ).
tff('dom-Ty',axiom,
! [X9: vTy] :
( ( X9 = vNat )
| ( X9 = vB ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dom-Ty') ).
tff('DIFF-B-Nat',axiom,
vB != vNat,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-B-Nat') ).
tff('EQ-someTerm',axiom,
! [X2: vTerm,X3: vTerm] :
( ( vsomeTerm(X2) = vsomeTerm(X3) )
=> ( X2 = X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','EQ-someTerm') ).
tff('dom-OptTerm',axiom,
! [X8: vOptTerm] :
( ? [X2: vTerm] : ( X8 = vsomeTerm(X2) )
| ( X8 = vnoTerm ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dom-OptTerm') ).
tff('TPlus_inv0',axiom,
! [X14: vTerm,X16: vTerm,X98: vTy] :
( vptchecksimple(vPlus(X14,X16),X98)
=> ( X98 = vNat ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','TPlus_inv0') ).
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('reduce-19',axiom,
! [X14: vTerm,X16: vTerm] :
( ( visSomeTerm(vreduce(X16))
& ~ visNV(X16)
& visNV(X14) )
=> ( vreduce(vPlus(X14,X16)) = vsomeTerm(vPlus(X14,vgetTerm(vreduce(X16)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduce-19') ).
tff('TPlus_inv2',axiom,
! [X14: vTerm,X16: vTerm] :
( vptchecksimple(vPlus(X14,X16),vNat)
=> vptchecksimple(X16,vNat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','TPlus_inv2') ).
tff('getTerm-0',axiom,
! [X10: vTerm] : ( vgetTerm(vsomeTerm(X10)) = X10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','getTerm-0') ).
tff('Preservation-Plus-IH1',axiom,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vt2) = vsomeTerm(X99) )
& vptchecksimple(vt2,X98) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-Plus-IH1') ).
tff('TPlus_inv1',axiom,
! [X14: vTerm,X16: vTerm] :
( vptchecksimple(vPlus(X14,X16),vNat)
=> vptchecksimple(X14,vNat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','TPlus_inv1') ).
tff('TPlus',axiom,
! [X14: vTerm,X16: vTerm] :
( ( vptchecksimple(X16,vNat)
& vptchecksimple(X14,vNat) )
=> vptchecksimple(vPlus(X14,X16),vNat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','TPlus') ).
tff(c_0_14,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X99) )
& vptchecksimple(vPlus(vt1,vt2),X98)
& visNV(vt1)
& ~ visNV(vt2)
& visSomeTerm(vreduce(vt2)) )
=> vptchecksimple(X99,X98) ),
inference(assume_negation,[status(cth)],['Preservation-Plus-isNV-True-isNV-False-isSomeTerm-True']) ).
tff(c_0_15,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X99) )
& vptchecksimple(vPlus(vt1,vt2),X98)
& visNV(vt1)
& ~ visNV(vt2)
& visSomeTerm(vreduce(vt2)) )
=> vptchecksimple(X99,X98) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
tff(c_0_16,plain,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-noTerm-someTerm']) ).
tff(c_0_17,negated_conjecture,
( ~ vptchecksimple(esk54_0,esk53_0)
& ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(esk54_0) )
& vptchecksimple(vPlus(vt1,vt2),esk53_0)
& visNV(vt1)
& ~ visNV(vt2)
& visSomeTerm(vreduce(vt2)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
tff(c_0_18,plain,
! [X186: vTy] :
( ( X186 = vNat )
| ( X186 = vB ) ),
inference(variable_rename,[status(thm)],['dom-Ty']) ).
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_16])]) ).
tff(c_0_23,plain,
! [X329: vTerm,X330: vTerm,X331: vTy] :
( ( X331 = vNat )
| ~ vptchecksimple(vPlus(X329,X330),X331) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TPlus_inv0'])])]) ).
tcf(c_0_24,negated_conjecture,
vptchecksimple(vPlus(vt1,vt2),esk53_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_25,plain,
! [X9: vTy] :
( ( X9 = vNat )
| ( 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'])])])]) ).
tff(c_0_31,plain,
! [X14: vTerm,X16: vTerm] :
( ( visSomeTerm(vreduce(X16))
& ~ visNV(X16)
& visNV(X14) )
=> ( vreduce(vPlus(X14,X16)) = vsomeTerm(vPlus(X14,vgetTerm(vreduce(X16)))) ) ),
inference(fof_simplification,[status(thm)],['reduce-19']) ).
tcf(c_0_32,plain,
! [X1: vTerm,X2: vTerm,X9: vTy] :
( ~ vptchecksimple(vPlus(X1,X2),X9)
| ( X9 = vNat ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_33,negated_conjecture,
( vptchecksimple(vPlus(vt1,vt2),vB)
| ( esk53_0 = vNat ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
tcf(c_0_34,plain,
vB != vNat,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
tcf(c_0_35,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_36,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( X8 = vsomeTerm(esk16_1(X8)) ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
tff(c_0_37,plain,
! [X256: vTerm,X257: vTerm] :
( ( vreduce(vPlus(X256,X257)) = vsomeTerm(vPlus(X256,vgetTerm(vreduce(X257)))) )
| ~ visSomeTerm(vreduce(X257))
| visNV(X257)
| ~ visNV(X256) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).
tff(c_0_38,plain,
! [X334: vTerm,X335: vTerm] :
( vptchecksimple(X335,vNat)
| ~ vptchecksimple(vPlus(X334,X335),vNat) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TPlus_inv2'])])]) ).
tcf(c_0_39,negated_conjecture,
esk53_0 = vNat,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
tff(c_0_40,plain,
! [X187: vTerm] : ( vgetTerm(vsomeTerm(X187)) = X187 ),
inference(variable_rename,[status(thm)],['getTerm-0']) ).
tcf(c_0_41,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( esk16_1(X8) = esk9_1(X8) ) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
tcf(c_0_42,plain,
! [X1: vTerm,X2: vTerm] :
( ~ visSomeTerm(vreduce(X2))
| ~ visNV(X1)
| ( vreduce(vPlus(X1,X2)) = vsomeTerm(vPlus(X1,vgetTerm(vreduce(X2)))) )
| visNV(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
tcf(c_0_43,negated_conjecture,
visSomeTerm(vreduce(vt2)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_44,negated_conjecture,
~ visNV(vt2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tff(c_0_45,plain,
! [X338: vTy,X339: vTerm] :
( vptchecksimple(X339,X338)
| ( vreduce(vt2) != vsomeTerm(X339) )
| ~ vptchecksimple(vt2,X338) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Preservation-Plus-IH1'])])]) ).
tcf(c_0_46,plain,
! [X1: vTerm,X2: vTerm] :
( ~ vptchecksimple(vPlus(X1,X2),vNat)
| vptchecksimple(X2,vNat) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
tcf(c_0_47,negated_conjecture,
vptchecksimple(vPlus(vt1,vt2),vNat),
inference(rw,[status(thm)],[c_0_24,c_0_39]) ).
tcf(c_0_48,plain,
! [X1: vTerm] : vgetTerm(vsomeTerm(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
tcf(c_0_49,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( vsomeTerm(esk9_1(X8)) = X8 ) ),
inference(spm,[status(thm)],[c_0_36,c_0_41]) ).
tcf(c_0_50,negated_conjecture,
! [X1: vTerm] :
( ~ visNV(X1)
| ( vsomeTerm(vPlus(X1,vgetTerm(vreduce(vt2)))) = vreduce(vPlus(X1,vt2)) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
tcf(c_0_51,plain,
! [X9: vTy,X1: vTerm] :
( ( vreduce(vt2) != vsomeTerm(X1) )
| ~ vptchecksimple(vt2,X9)
| vptchecksimple(X1,X9) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
tcf(c_0_52,negated_conjecture,
vptchecksimple(vt2,vNat),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
tcf(c_0_53,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( esk9_1(X8) = vgetTerm(X8) ) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
tff(c_0_54,plain,
! [X332: vTerm,X333: vTerm] :
( vptchecksimple(X332,vNat)
| ~ vptchecksimple(vPlus(X332,X333),vNat) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TPlus_inv1'])])]) ).
tff(c_0_55,plain,
! [X327: vTerm,X328: vTerm] :
( vptchecksimple(vPlus(X327,X328),vNat)
| ~ vptchecksimple(X328,vNat)
| ~ vptchecksimple(X327,vNat) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TPlus'])])]) ).
tcf(c_0_56,negated_conjecture,
! [X1: vTerm] :
( ~ visNV(X1)
| ( vgetTerm(vreduce(vPlus(X1,vt2))) = vPlus(X1,vgetTerm(vreduce(vt2))) ) ),
inference(spm,[status(thm)],[c_0_48,c_0_50]) ).
tcf(c_0_57,negated_conjecture,
vreduce(vPlus(vt1,vt2)) = vsomeTerm(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_58,negated_conjecture,
visNV(vt1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_59,negated_conjecture,
! [X1: vTerm] :
( ( vreduce(vt2) != vsomeTerm(X1) )
| vptchecksimple(X1,vNat) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
tcf(c_0_60,plain,
! [X8: vOptTerm] :
( ~ visSomeTerm(X8)
| ( vsomeTerm(vgetTerm(X8)) = X8 ) ),
inference(spm,[status(thm)],[c_0_49,c_0_53]) ).
tcf(c_0_61,plain,
! [X1: vTerm,X2: vTerm] :
( ~ vptchecksimple(vPlus(X1,X2),vNat)
| vptchecksimple(X1,vNat) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
tcf(c_0_62,negated_conjecture,
~ vptchecksimple(esk54_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_63,plain,
! [X1: vTerm,X2: vTerm] :
( ~ vptchecksimple(X2,vNat)
| ~ vptchecksimple(X1,vNat)
| vptchecksimple(vPlus(X1,X2),vNat) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
tcf(c_0_64,negated_conjecture,
vPlus(vt1,vgetTerm(vreduce(vt2))) = esk54_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_48]),c_0_58])]) ).
tcf(c_0_65,negated_conjecture,
vptchecksimple(vgetTerm(vreduce(vt2)),vNat),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60])]),c_0_43])]) ).
tcf(c_0_66,negated_conjecture,
vptchecksimple(vt1,vNat),
inference(spm,[status(thm)],[c_0_61,c_0_47]) ).
tcf(c_0_67,negated_conjecture,
~ vptchecksimple(esk54_0,vNat),
inference(rw,[status(thm)],[c_0_62,c_0_39]) ).
cnf(c_0_68,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_63,c_0_64]),c_0_65]),c_0_66])]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM223_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.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 14:20:55 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 7.69/1.44 % Version: 3.5.1
% 7.69/1.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.69/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.69/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.69/1.44 % Starting new_bool_3 with 300s (1) cores
% 7.69/1.44 % Starting new_bool_1 with 300s (1) cores
% 7.69/1.44 % Starting sh5l with 300s (1) cores
% 7.69/1.44 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1088676 completed with status 0
% 7.69/1.44 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 7.69/1.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.69/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.69/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.69/1.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.69/1.44 % No SInE strategy applied
% 7.69/1.44 % Search class: FGUSM-FSLM31-MFFFFFNN
% 7.69/1.44 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 7.69/1.44 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 7.69/1.44 % Starting SubtermCWHack with 136s (1) cores
% 7.69/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.69/1.44 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 7.69/1.44 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 7.69/1.44 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.69/1.44 % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 1088696 completed with status 0
% 7.69/1.44 % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 7.69/1.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.69/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.69/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.69/1.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.69/1.44 % No SInE strategy applied
% 7.69/1.44 % Search class: FGUSM-FSLM31-MFFFFFNN
% 7.69/1.44 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 7.69/1.44 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 7.69/1.44 % Starting SubtermCWHack with 136s (1) cores
% 7.69/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.69/1.44 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 7.69/1.44 % Preprocessing time : 0.011 s
% 7.69/1.44 % Presaturation interreduction done
% 7.69/1.44
% 7.69/1.44 % Proof found!
% 7.69/1.44 % SZS status Theorem
% 7.69/1.44 % SZS output start CNFRefutation
% See solution above
% 7.69/1.44 % Parsed axioms : 132
% 7.69/1.44 % Removed by relevancy pruning/SinE : 0
% 7.69/1.44 % Initial clauses : 799
% 7.69/1.44 % Removed in clause preprocessing : 24
% 7.69/1.44 % Initial clauses in saturation : 775
% 7.69/1.44 % Processed clauses : 5989
% 7.69/1.44 % ...of these trivial : 265
% 7.69/1.44 % ...subsumed : 3008
% 7.69/1.44 % ...remaining for further processing : 2716
% 7.69/1.44 % Other redundant clauses eliminated : 703
% 7.69/1.44 % Clauses deleted for lack of memory : 0
% 7.69/1.44 % Backward-subsumed : 164
% 7.69/1.44 % Backward-rewritten : 323
% 7.69/1.44 % Generated clauses : 31036
% 7.69/1.44 % ...of the previous two non-redundant : 27575
% 7.69/1.44 % ...aggressively subsumed : 0
% 7.69/1.44 % Contextual simplify-reflections : 54
% 7.69/1.44 % Paramodulations : 30330
% 7.69/1.44 % Factorizations : 98
% 7.69/1.44 % NegExts : 0
% 7.69/1.44 % Equation resolutions : 720
% 7.69/1.44 % Disequality decompositions : 0
% 7.69/1.44 % Total rewrite steps : 8713
% 7.69/1.44 % ...of those cached : 7655
% 7.69/1.44 % Propositional unsat checks : 0
% 7.69/1.44 % Propositional check models : 0
% 7.69/1.44 % Propositional check unsatisfiable : 0
% 7.69/1.44 % Propositional clauses : 0
% 7.69/1.44 % Propositional clauses after purity: 0
% 7.69/1.44 % Propositional unsat core size : 0
% 7.69/1.44 % Propositional preprocessing time : 0.000
% 7.69/1.44 % Propositional encoding time : 0.000
% 7.69/1.44 % Propositional solver time : 0.000
% 7.69/1.44 % Success case prop preproc time : 0.000
% 7.69/1.44 % Success case prop encoding time : 0.000
% 7.69/1.44 % Success case prop solver time : 0.000
% 7.69/1.44 % Current number of processed clauses : 1414
% 7.69/1.44 % Positive orientable unit clauses : 113
% 7.69/1.44 % Positive unorientable unit clauses: 0
% 7.69/1.44 % Negative unit clauses : 69
% 7.69/1.44 % Non-unit-clauses : 1232
% 7.69/1.44 % Current number of unprocessed clauses: 22342
% 7.69/1.44 % ...number of literals in the above : 100835
% 7.69/1.44 % Current number of archived formulas : 0
% 7.69/1.44 % Current number of archived clauses : 1222
% 7.69/1.44 % Clause-clause subsumption calls (NU) : 423506
% 7.69/1.44 % Rec. Clause-clause subsumption calls : 110973
% 7.69/1.44 % Non-unit clause-clause subsumptions : 2245
% 7.69/1.44 % Unit Clause-clause subsumption calls : 17103
% 7.69/1.44 % Rewrite failures with RHS unbound : 0
% 7.69/1.44 % BW rewrite match attempts : 701
% 7.69/1.44 % BW rewrite match successes : 225
% 7.69/1.44 % Condensation attempts : 0
% 7.69/1.44 % Condensation successes : 0
% 7.69/1.44 % Termbank termtop insertions : 719611
% 7.69/1.44 % Search garbage collected termcells : 5990
% 7.69/1.44
% 7.69/1.44 % -------------------------------------------------
% 7.69/1.44 % User time : 0.955 s
% 7.69/1.44 % System time : 0.030 s
% 7.69/1.44 % Total time : 0.985 s
% 7.69/1.44 % Maximum resident set size: 5380 pages
% 7.69/1.44
% 7.69/1.44 % -------------------------------------------------
% 7.69/1.44 % User time : 4.647 s
% 7.69/1.44 % System time : 0.153 s
% 7.69/1.44 % Total time : 4.800 s
% 7.69/1.44 % Maximum resident set size: 5120 pages
% 7.69/1.44 % E exiting
%------------------------------------------------------------------------------