%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM253_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 : n020.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:48 PM UTC 2026
% Result : Theorem 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 29 unt; 0 typ; 0 def)
% Number of atoms : 95 ( 94 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 67 ( 27 ~; 24 |; 8 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 7 ( 7 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-3 aty)
% Number of variables : 109 ( 0 sgn 107 !; 2 ?; 109 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vOptAval: $tType ).
tff(decl_sort2,type,
vAval: $tType ).
tff(decl_sort3,type,
vQID: $tType ).
tff(decl_sort4,type,
vAType: $tType ).
tff(decl_sort5,type,
vOptAType: $tType ).
tff(decl_sort6,type,
vAnsMap: $tType ).
tff(decl_sort7,type,
vATMap: $tType ).
tff(decl_33,type,
vnoAType: vOptAType ).
tff(decl_40,type,
vabind: ( vAnsMap * ( vAval * vQID ) ) > vAnsMap ).
tff(decl_41,type,
vnoAval: vOptAval ).
tff(decl_61,type,
vsomeAval: vAval > vOptAval ).
tff(decl_67,type,
vam1: vAnsMap ).
tff(decl_70,type,
vatmbind: ( vATMap * ( vAType * vQID ) ) > vATMap ).
tff(decl_75,type,
vsomeAType: vAType > vOptAType ).
tff(decl_87,type,
vtypeOf: vAval > vAType ).
tff(decl_95,type,
vtypeAM: vAnsMap > vATMap ).
tff(decl_104,type,
vlookupATMap: ( vATMap * vQID ) > vOptAType ).
tff(decl_126,type,
vlookupAnsMap: ( vAnsMap * vQID ) > vOptAval ).
tff(decl_149,type,
esk1_0: vQID ).
tff(decl_150,type,
esk2_0: vAval ).
tff(decl_151,type,
esk3_0: vAType ).
tff(decl_152,type,
esk4_0: vAval ).
tff(decl_153,type,
esk5_0: vQID ).
tff(decl_194,type,
esk46_1: vOptAType > vAType ).
tff(decl_196,type,
esk48_1: vOptAval > vAval ).
tff('lookupAnsMapPreservation-abind-qid-qid1-False',axiom,
! [X115: vQID,X181: vAval,X73: vAType,X500: vAval,X71: vQID] :
( ( ( vlookupAnsMap(X71,vabind(X115,X181,vam1)) = vsomeAval(X500) )
& ( vlookupATMap(X71,vtypeAM(vabind(X115,X181,vam1))) = vsomeAType(X73) )
& ( X71 != X115 ) )
=> ( vtypeOf(X500) = X73 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lookupAnsMapPreservation-abind-qid-qid1-False') ).
tff('lookupAnsMapPreservation-abind',conjecture,
! [X115: vQID,X181: vAval,X73: vAType,X500: vAval,X71: vQID] :
( ( ( vlookupAnsMap(X71,vabind(X115,X181,vam1)) = vsomeAval(X500) )
& ( vlookupATMap(X71,vtypeAM(vabind(X115,X181,vam1))) = vsomeAType(X73) ) )
=> ( vtypeOf(X500) = X73 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lookupAnsMapPreservation-abind') ).
tff('lookupAnsMap-2',axiom,
! [X71: vQID,X115: vQID,X69: vAval,X116: vAnsMap] :
( ( X71 != X115 )
=> ( vlookupAnsMap(X71,vabind(X115,X69,X116)) = vlookupAnsMap(X71,X116) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lookupAnsMap-2') ).
tff('DIFF-noAval-someAval',axiom,
! [X21: vAval] : ( vnoAval != vsomeAval(X21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noAval-someAval') ).
tff('EQ-someAval',axiom,
! [X21: vAval,X24: vAval] :
( ( vsomeAval(X21) = vsomeAval(X24) )
=> ( X21 = X24 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','EQ-someAval') ).
tff('dom-OptAval',axiom,
! [X68: vOptAval] :
( ? [X21: vAval] : ( X68 = vsomeAval(X21) )
| ( X68 = vnoAval ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dom-OptAval') ).
tff('lookupAnsMap-1',axiom,
! [X115: vQID,X69: vAval,X116: vAnsMap] : ( vlookupAnsMap(X115,vabind(X115,X69,X116)) = vsomeAval(X69) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lookupAnsMap-1') ).
tff('DIFF-noAType-someAType',axiom,
! [X4: vAType] : ( vnoAType != vsomeAType(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noAType-someAType') ).
tff('lookupATMap-1',axiom,
! [X291: vQID,X73: vAType,X349: vATMap] : ( vlookupATMap(X291,vatmbind(X291,X73,X349)) = vsomeAType(X73) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lookupATMap-1') ).
tff('typeAM-1',axiom,
! [X71: vQID,X76: vAval,X372: vAnsMap] : ( vtypeAM(vabind(X71,X76,X372)) = vatmbind(X71,vtypeOf(X76),vtypeAM(X372)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','typeAM-1') ).
tff('EQ-someAType',axiom,
! [X4: vAType,X8: vAType] :
( ( vsomeAType(X4) = vsomeAType(X8) )
=> ( X4 = X8 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','EQ-someAType') ).
tff('dom-OptAType',axiom,
! [X46: vOptAType] :
( ? [X4: vAType] : ( X46 = vsomeAType(X4) )
| ( X46 = vnoAType ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dom-OptAType') ).
tff(c_0_12,plain,
! [X115: vQID,X181: vAval,X73: vAType,X500: vAval,X71: vQID] :
( ( ( vlookupAnsMap(X71,vabind(X115,X181,vam1)) = vsomeAval(X500) )
& ( vlookupATMap(X71,vtypeAM(vabind(X115,X181,vam1))) = vsomeAType(X73) )
& ( X71 != X115 ) )
=> ( vtypeOf(X500) = X73 ) ),
inference(fof_simplification,[status(thm)],['lookupAnsMapPreservation-abind-qid-qid1-False']) ).
tff(c_0_13,negated_conjecture,
~ ! [X115: vQID,X181: vAval,X73: vAType,X500: vAval,X71: vQID] :
( ( ( vlookupAnsMap(X71,vabind(X115,X181,vam1)) = vsomeAval(X500) )
& ( vlookupATMap(X71,vtypeAM(vabind(X115,X181,vam1))) = vsomeAType(X73) ) )
=> ( vtypeOf(X500) = X73 ) ),
inference(assume_negation,[status(cth)],['lookupAnsMapPreservation-abind']) ).
tff(c_0_14,plain,
! [X71: vQID,X115: vQID,X69: vAval,X116: vAnsMap] :
( ( X71 != X115 )
=> ( vlookupAnsMap(X71,vabind(X115,X69,X116)) = vlookupAnsMap(X71,X116) ) ),
inference(fof_simplification,[status(thm)],['lookupAnsMap-2']) ).
tff(c_0_15,plain,
! [X542: vQID,X543: vAval,X544: vAType,X545: vAval,X546: vQID] :
( ( vtypeOf(X545) = X544 )
| ( vlookupAnsMap(X546,vabind(X542,X543,vam1)) != vsomeAval(X545) )
| ( vlookupATMap(X546,vtypeAM(vabind(X542,X543,vam1))) != vsomeAType(X544) )
| ( X546 = X542 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
tff(c_0_16,negated_conjecture,
( ( vtypeOf(esk4_0) != esk3_0 )
& ( vlookupAnsMap(esk5_0,vabind(esk1_0,esk2_0,vam1)) = vsomeAval(esk4_0) )
& ( vlookupATMap(esk5_0,vtypeAM(vabind(esk1_0,esk2_0,vam1))) = vsomeAType(esk3_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
tff(c_0_17,plain,
! [X525: vQID,X526: vQID,X527: vAval,X528: vAnsMap] :
( ( vlookupAnsMap(X525,vabind(X526,X527,X528)) = vlookupAnsMap(X525,X528) )
| ( X525 = X526 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
tcf(c_0_18,plain,
! [X2: vQID,X4: vAType,X6: vQID,X21: vAval,X24: vAval] :
( ( vlookupAnsMap(X2,vabind(X6,X21,vam1)) != vsomeAval(X24) )
| ( vlookupATMap(X2,vtypeAM(vabind(X6,X21,vam1))) != vsomeAType(X4) )
| ( vtypeOf(X24) = X4 )
| ( X2 = X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_19,negated_conjecture,
vlookupAnsMap(esk5_0,vabind(esk1_0,esk2_0,vam1)) = vsomeAval(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_20,negated_conjecture,
vlookupATMap(esk5_0,vtypeAM(vabind(esk1_0,esk2_0,vam1))) = vsomeAType(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_21,plain,
! [X6: vQID,X2: vQID,X21: vAval,X55: vAnsMap] :
( ( vlookupAnsMap(X2,vabind(X6,X21,X55)) = vlookupAnsMap(X2,X55) )
| ( X2 = X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tff(c_0_22,plain,
! [X21: vAval] : ( vnoAval != vsomeAval(X21) ),
inference(fof_simplification,[status(thm)],['DIFF-noAval-someAval']) ).
tcf(c_0_23,negated_conjecture,
! [X4: vAType,X21: vAval] :
( ( vsomeAval(esk4_0) != vsomeAval(X21) )
| ( vsomeAType(esk3_0) != vsomeAType(X4) )
| ( vtypeOf(X21) = X4 )
| ( esk1_0 = esk5_0 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
tcf(c_0_24,negated_conjecture,
( ( esk1_0 = esk5_0 )
| ( vsomeAval(esk4_0) = vlookupAnsMap(esk5_0,vam1) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
tff(c_0_25,plain,
! [X520: vAval,X521: vAval] :
( ( X520 = X521 )
| ( vsomeAval(X520) != vsomeAval(X521) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['EQ-someAval'])])]) ).
tff(c_0_26,plain,
! [X709: vOptAval] :
( ( X709 = vsomeAval(esk48_1(X709)) )
| ( X709 = vnoAval ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['dom-OptAval'])]) ).
tff(c_0_27,plain,
! [X711: vAval] : ( vnoAval != vsomeAval(X711) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
tcf(c_0_28,negated_conjecture,
! [X4: vAType] :
( ( vsomeAType(esk3_0) != vsomeAType(X4) )
| ( esk1_0 = esk5_0 )
| ( vtypeOf(esk4_0) = X4 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
tcf(c_0_29,negated_conjecture,
vtypeOf(esk4_0) != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tff(c_0_30,plain,
! [X522: vQID,X523: vAval,X524: vAnsMap] : ( vlookupAnsMap(X522,vabind(X522,X523,X524)) = vsomeAval(X523) ),
inference(variable_rename,[status(thm)],['lookupAnsMap-1']) ).
tff(c_0_31,plain,
! [X4: vAType] : ( vnoAType != vsomeAType(X4) ),
inference(fof_simplification,[status(thm)],['DIFF-noAType-someAType']) ).
tff(c_0_32,plain,
! [X549: vQID,X550: vAType,X551: vATMap] : ( vlookupATMap(X549,vatmbind(X549,X550,X551)) = vsomeAType(X550) ),
inference(variable_rename,[status(thm)],['lookupATMap-1']) ).
tff(c_0_33,plain,
! [X513: vQID,X514: vAval,X515: vAnsMap] : ( vtypeAM(vabind(X513,X514,X515)) = vatmbind(X513,vtypeOf(X514),vtypeAM(X515)) ),
inference(variable_rename,[status(thm)],['typeAM-1']) ).
tcf(c_0_34,plain,
! [X21: vAval,X24: vAval] :
( ( vsomeAval(X21) != vsomeAval(X24) )
| ( X21 = X24 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
tcf(c_0_35,plain,
! [X68: vOptAval] :
( ( X68 = vsomeAval(esk48_1(X68)) )
| ( X68 = vnoAval ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
tcf(c_0_36,plain,
! [X21: vAval] : vnoAval != vsomeAval(X21),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tcf(c_0_37,negated_conjecture,
esk1_0 = esk5_0,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_29]) ).
tcf(c_0_38,plain,
! [X2: vQID,X55: vAnsMap,X21: vAval] : vlookupAnsMap(X2,vabind(X2,X21,X55)) = vsomeAval(X21),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
tff(c_0_39,plain,
! [X547: vAType,X548: vAType] :
( ( X547 = X548 )
| ( vsomeAType(X547) != vsomeAType(X548) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['EQ-someAType'])])]) ).
tff(c_0_40,plain,
! [X640: vOptAType] :
( ( X640 = vsomeAType(esk46_1(X640)) )
| ( X640 = vnoAType ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['dom-OptAType'])]) ).
tff(c_0_41,plain,
! [X642: vAType] : ( vnoAType != vsomeAType(X642) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_31])]) ).
tcf(c_0_42,plain,
! [X2: vQID,X15: vATMap,X4: vAType] : vlookupATMap(X2,vatmbind(X2,X4,X15)) = vsomeAType(X4),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
tcf(c_0_43,plain,
! [X2: vQID,X21: vAval,X55: vAnsMap] : vtypeAM(vabind(X2,X21,X55)) = vatmbind(X2,vtypeOf(X21),vtypeAM(X55)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
tcf(c_0_44,plain,
! [X21: vAval] : esk48_1(vsomeAval(X21)) = X21,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35])]),c_0_36]) ).
tcf(c_0_45,negated_conjecture,
vsomeAval(esk4_0) = vsomeAval(esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_37]),c_0_38]) ).
tcf(c_0_46,plain,
! [X4: vAType,X8: vAType] :
( ( vsomeAType(X4) != vsomeAType(X8) )
| ( X4 = X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
tcf(c_0_47,plain,
! [X46: vOptAType] :
( ( X46 = vsomeAType(esk46_1(X46)) )
| ( X46 = vnoAType ) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
tcf(c_0_48,plain,
! [X4: vAType] : vnoAType != vsomeAType(X4),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
tcf(c_0_49,plain,
! [X2: vQID,X55: vAnsMap,X21: vAval] : vlookupATMap(X2,vtypeAM(vabind(X2,X21,X55))) = vsomeAType(vtypeOf(X21)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
tcf(c_0_50,negated_conjecture,
esk4_0 = esk2_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_44]) ).
tcf(c_0_51,plain,
! [X4: vAType] : esk46_1(vsomeAType(X4)) = X4,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47])]),c_0_48]) ).
tcf(c_0_52,negated_conjecture,
vsomeAType(vtypeOf(esk2_0)) = vsomeAType(esk3_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_37]),c_0_49]) ).
tcf(c_0_53,negated_conjecture,
vtypeOf(esk2_0) != esk3_0,
inference(rw,[status(thm)],[c_0_29,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_51]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM253_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/0.38 % Computer : n020.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 14:22:03 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.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.20/0.56 % Version: 3.5.1
% 0.20/0.56 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.56 % Starting new_bool_3 with 600s (2) cores
% 0.20/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.56 % Starting sh5l with 300s (1) cores
% 0.20/0.56 % new_bool_3 with pid 3163797 completed with status 0
% 0.20/0.56 % Result found by new_bool_3
% 0.20/0.56 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.56 % Starting new_bool_3 with 600s (2) cores
% 0.20/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.56 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.20/0.56 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.20/0.56 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.56 % Starting SubtermCWHack with 55s (1) cores
% 0.20/0.56 % Starting new_bool_3 with 61s (1) cores
% 0.20/0.56 % new_bool_3 with pid 3163807 completed with status 0
% 0.20/0.56 % Result found by new_bool_3
% 0.20/0.56 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.56 % Starting new_bool_3 with 600s (2) cores
% 0.20/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.56 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.20/0.56 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.20/0.56 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.56 % Starting SubtermCWHack with 55s (1) cores
% 0.20/0.56 % Starting new_bool_3 with 61s (1) cores
% 0.20/0.56 % Preprocessing time : 0.008 s
% 0.20/0.56 % Presaturation interreduction done
% 0.20/0.56
% 0.20/0.56 % Proof found!
% 0.20/0.56 % SZS status Theorem
% 0.20/0.56 % SZS output start CNFRefutation
% See solution above
% 0.20/0.56 % Parsed axioms : 508
% 0.20/0.56 % Removed by relevancy pruning/SinE : 393
% 0.20/0.56 % Initial clauses : 554
% 0.20/0.56 % Removed in clause preprocessing : 0
% 0.20/0.56 % Initial clauses in saturation : 554
% 0.20/0.56 % Processed clauses : 1098
% 0.20/0.56 % ...of these trivial : 16
% 0.20/0.56 % ...subsumed : 415
% 0.20/0.56 % ...remaining for further processing : 667
% 0.20/0.56 % Other redundant clauses eliminated : 136
% 0.20/0.56 % Clauses deleted for lack of memory : 0
% 0.20/0.56 % Backward-subsumed : 8
% 0.20/0.56 % Backward-rewritten : 54
% 0.20/0.56 % Generated clauses : 1044
% 0.20/0.56 % ...of the previous two non-redundant : 700
% 0.20/0.56 % ...aggressively subsumed : 0
% 0.20/0.56 % Contextual simplify-reflections : 10
% 0.20/0.56 % Paramodulations : 852
% 0.20/0.56 % Factorizations : 24
% 0.20/0.56 % NegExts : 0
% 0.20/0.56 % Equation resolutions : 168
% 0.20/0.56 % Disequality decompositions : 0
% 0.20/0.56 % Total rewrite steps : 428
% 0.20/0.56 % ...of those cached : 344
% 0.20/0.56 % Propositional unsat checks : 0
% 0.20/0.56 % Propositional check models : 0
% 0.20/0.56 % Propositional check unsatisfiable : 0
% 0.20/0.56 % Propositional clauses : 0
% 0.20/0.56 % Propositional clauses after purity: 0
% 0.20/0.56 % Propositional unsat core size : 0
% 0.20/0.56 % Propositional preprocessing time : 0.000
% 0.20/0.56 % Propositional encoding time : 0.000
% 0.20/0.56 % Propositional solver time : 0.000
% 0.20/0.56 % Success case prop preproc time : 0.000
% 0.20/0.56 % Success case prop encoding time : 0.000
% 0.20/0.56 % Success case prop solver time : 0.000
% 0.20/0.56 % Current number of processed clauses : 278
% 0.20/0.56 % Positive orientable unit clauses : 50
% 0.20/0.56 % Positive unorientable unit clauses: 1
% 0.20/0.56 % Negative unit clauses : 52
% 0.20/0.56 % Non-unit-clauses : 175
% 0.20/0.56 % Current number of unprocessed clauses: 467
% 0.20/0.56 % ...number of literals in the above : 1969
% 0.20/0.56 % Current number of archived formulas : 0
% 0.20/0.56 % Current number of archived clauses : 389
% 0.20/0.56 % Clause-clause subsumption calls (NU) : 27192
% 0.20/0.56 % Rec. Clause-clause subsumption calls : 11128
% 0.20/0.56 % Non-unit clause-clause subsumptions : 393
% 0.20/0.56 % Unit Clause-clause subsumption calls : 2647
% 0.20/0.56 % Rewrite failures with RHS unbound : 2
% 0.20/0.56 % BW rewrite match attempts : 10
% 0.20/0.56 % BW rewrite match successes : 5
% 0.20/0.56 % Condensation attempts : 0
% 0.20/0.56 % Condensation successes : 0
% 0.20/0.56 % Termbank termtop insertions : 37578
% 0.20/0.56 % Search garbage collected termcells : 6891
% 0.20/0.56
% 0.20/0.56 % -------------------------------------------------
% 0.20/0.56 % User time : 0.085 s
% 0.20/0.56 % System time : 0.005 s
% 0.20/0.56 % Total time : 0.090 s
% 0.20/0.56 % Maximum resident set size: 5560 pages
% 0.20/0.56
% 0.20/0.56 % -------------------------------------------------
% 0.20/0.56 % User time : 0.178 s
% 0.20/0.56 % System time : 0.014 s
% 0.20/0.56 % Total time : 0.192 s
% 0.20/0.56 % Maximum resident set size: 5632 pages
% 0.20/0.56 % E exiting
%------------------------------------------------------------------------------