%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM290_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 : n001.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:52 PM UTC 2026
% Result : Theorem 237.16s 30.56s
% Output : CNFRefutation 237.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 142 ( 54 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 135 ( 52 ~; 43 |; 27 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 131 ( 0 sgn 130 !; 1 ?; 131 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vTStore: $tType ).
tff(decl_sort2,type,
vTable: $tType ).
tff(decl_sort3,type,
vQuery: $tType ).
tff(decl_sort4,type,
vOptQuery: $tType ).
tff(decl_sort5,type,
vTType: $tType ).
tff(decl_sort6,type,
vTTContext: $tType ).
tff(decl_26,type,
vtvalue: vTable > vQuery ).
tff(decl_28,type,
vsomeQuery: vQuery > vOptQuery ).
tff(decl_40,type,
vIntersection: ( vQuery * vQuery ) > vQuery ).
tff(decl_53,type,
vq1: vQuery ).
tff(decl_64,type,
vq2: vQuery ).
tff(decl_84,type,
vwelltypedtable: ( vTable * vTType ) > $o ).
tff(decl_97,type,
vreduce: ( vTStore * vQuery ) > vOptQuery ).
tff(decl_109,type,
visSomeQuery: vOptQuery > $o ).
tff(decl_110,type,
vstoreContextConsistent: ( vTTContext * vTStore ) > $o ).
tff(decl_112,type,
vptcheck: ( vTType * ( vQuery * vTTContext ) ) > $o ).
tff(decl_115,type,
vgetQuery: vOptQuery > vQuery ).
tff(decl_137,type,
esk1_0: vQuery ).
tff(decl_138,type,
esk2_0: vTable ).
tff(decl_139,type,
esk3_0: vTTContext ).
tff(decl_140,type,
esk4_0: vTStore ).
tff(decl_141,type,
esk5_0: vTType ).
tff(decl_144,type,
esk8_1: vOptQuery > vQuery ).
tff(decl_151,type,
esk15_3: ( vTStore * ( vQuery * vTable ) ) > vTable ).
tff(decl_152,type,
esk16_3: ( vTStore * ( vQuery * vTable ) ) > vTable ).
tff('Preservation-Intersection-tvalue-q2-isSomeQuery-True',conjecture,
! [X461: vQuery,X53: vTable,X460: vTTContext,X294: vTStore,X54: vTType] :
( ( ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vIntersection(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) )
& ! [X299: vTable] : ( vq2 != vtvalue(X299) )
& visSomeQuery(vreduce(vq2,X294)) )
=> vptcheck(X460,X461,X54) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Intersection-tvalue-q2-isSomeQuery-True') ).
tff('reduce-10',axiom,
! [X53: vTable,X297: vQuery,X294: vTStore] :
( ( visSomeQuery(vreduce(X297,X294))
& ! [X298: vTable,X299: vTable] :
( ( X297 != vtvalue(X299) )
| ( X53 != X298 ) ) )
=> ( vreduce(vIntersection(vtvalue(X53),X297),X294) = vsomeQuery(vIntersection(vtvalue(X53),vgetQuery(vreduce(X297,X294)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduce-10') ).
tff('EQ-someQuery',axiom,
! [X9: vQuery,X10: vQuery] :
( ( vsomeQuery(X9) = vsomeQuery(X10) )
=> ( X9 = X10 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','EQ-someQuery') ).
tff('TIntersection_inv2',axiom,
! [X456: vTTContext,X300: vQuery,X297: vQuery,X455: vTType] :
( vptcheck(X456,vIntersection(X300,X297),X455)
=> vptcheck(X456,X297,X455) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','TIntersection_inv2') ).
tff('Ttvalue_inv',axiom,
! [X456: vTTContext,X53: vTable,X455: vTType] :
( vptcheck(X456,vtvalue(X53),X455)
=> vwelltypedtable(X455,X53) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Ttvalue_inv') ).
tff('TIntersection_inv1',axiom,
! [X456: vTTContext,X300: vQuery,X297: vQuery,X455: vTType] :
( vptcheck(X456,vIntersection(X300,X297),X455)
=> vptcheck(X456,X300,X455) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','TIntersection_inv1') ).
tff('Preservation-Intersection-IH1',axiom,
! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vq2,X294) = vsomeQuery(X461) )
& vptcheck(X460,vq2,X54)
& vstoreContextConsistent(X294,X460) )
=> vptcheck(X460,X461,X54) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Intersection-IH1') ).
tff('TIntersection',axiom,
! [X456: vTTContext,X300: vQuery,X455: vTType,X297: vQuery] :
( ( vptcheck(X456,X297,X455)
& vptcheck(X456,X300,X455) )
=> vptcheck(X456,vIntersection(X300,X297),X455) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','TIntersection') ).
tff('Ttvalue',axiom,
! [X455: vTType,X53: vTable,X456: vTTContext] :
( vwelltypedtable(X455,X53)
=> vptcheck(X456,vtvalue(X53),X455) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Ttvalue') ).
tff('getQuery-0',axiom,
! [X55: vQuery] : ( vgetQuery(vsomeQuery(X55)) = X55 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','getQuery-0') ).
tff('isSomeQuery-true-INV',axiom,
! [X219: vOptQuery] :
( visSomeQuery(X219)
=> ? [X220: vQuery] : ( X219 = vsomeQuery(X220) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeQuery-true-INV') ).
tff(c_0_11,negated_conjecture,
~ ! [X461: vQuery,X53: vTable,X460: vTTContext,X294: vTStore,X54: vTType] :
( ( ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vIntersection(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) )
& ! [X299: vTable] : ( vq2 != vtvalue(X299) )
& visSomeQuery(vreduce(vq2,X294)) )
=> vptcheck(X460,X461,X54) ),
inference(assume_negation,[status(cth)],['Preservation-Intersection-tvalue-q2-isSomeQuery-True']) ).
tff(c_0_12,negated_conjecture,
~ ! [X461: vQuery,X53: vTable,X460: vTTContext,X294: vTStore,X54: vTType] :
( ( ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vIntersection(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) )
& ! [X299: vTable] : ( vq2 != vtvalue(X299) )
& visSomeQuery(vreduce(vq2,X294)) )
=> vptcheck(X460,X461,X54) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
tff(c_0_13,plain,
! [X53: vTable,X297: vQuery,X294: vTStore] :
( ( visSomeQuery(vreduce(X297,X294))
& ! [X298: vTable,X299: vTable] :
( ( X297 != vtvalue(X299) )
| ( X53 != X298 ) ) )
=> ( vreduce(vIntersection(vtvalue(X53),X297),X294) = vsomeQuery(vIntersection(vtvalue(X53),vgetQuery(vreduce(X297,X294)))) ) ),
inference(fof_simplification,[status(thm)],['reduce-10']) ).
tff(c_0_14,negated_conjecture,
! [X467: vTable] :
( ~ vptcheck(esk3_0,esk1_0,esk5_0)
& ( vreduce(vIntersection(vq1,vq2),esk4_0) = vsomeQuery(esk1_0) )
& vptcheck(esk3_0,vIntersection(vq1,vq2),esk5_0)
& vstoreContextConsistent(esk4_0,esk3_0)
& ( vq1 = vtvalue(esk2_0) )
& ( vq2 != vtvalue(X467) )
& visSomeQuery(vreduce(vq2,esk4_0)) ),
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_12])])])])]) ).
tff(c_0_15,plain,
! [X566: vTable,X567: vQuery,X568: vTStore] :
( ( ( vreduce(vIntersection(vtvalue(X566),X567),X568) = vsomeQuery(vIntersection(vtvalue(X566),vgetQuery(vreduce(X567,X568)))) )
| ~ visSomeQuery(vreduce(X567,X568))
| ( X567 = vtvalue(esk16_3(X566,X567,X568)) ) )
& ( ( vreduce(vIntersection(vtvalue(X566),X567),X568) = vsomeQuery(vIntersection(vtvalue(X566),vgetQuery(vreduce(X567,X568)))) )
| ~ visSomeQuery(vreduce(X567,X568))
| ( X566 = esk15_3(X566,X567,X568) ) ) ),
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_13])])])])])]) ).
tcf(c_0_16,negated_conjecture,
! [X5: vTable] : vq2 != vtvalue(X5),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_17,plain,
! [X4: vQuery,X5: vTable,X47: vTStore] :
( ~ visSomeQuery(vreduce(X4,X47))
| ( vreduce(vIntersection(vtvalue(X5),X4),X47) = vsomeQuery(vIntersection(vtvalue(X5),vgetQuery(vreduce(X4,X47)))) )
| ( X4 = vtvalue(esk16_3(X5,X4,X47)) ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tff(c_0_18,plain,
! [X537: vQuery,X538: vQuery] :
( ( X537 = X538 )
| ( vsomeQuery(X537) != vsomeQuery(X538) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['EQ-someQuery'])])]) ).
tcf(c_0_19,negated_conjecture,
! [X5: vTable,X47: vTStore] :
( ~ visSomeQuery(vreduce(vq2,X47))
| ( vsomeQuery(vIntersection(vtvalue(X5),vgetQuery(vreduce(vq2,X47)))) = vreduce(vIntersection(vtvalue(X5),vq2),X47) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17])]) ).
tcf(c_0_20,negated_conjecture,
vq1 = vtvalue(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_21,plain,
! [X4: vQuery,X9: vQuery] :
( ( vsomeQuery(X4) != vsomeQuery(X9) )
| ( X4 = X9 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_22,negated_conjecture,
! [X47: vTStore] :
( ~ visSomeQuery(vreduce(vq2,X47))
| ( vsomeQuery(vIntersection(vq1,vgetQuery(vreduce(vq2,X47)))) = vreduce(vIntersection(vq1,vq2),X47) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
tff(c_0_23,plain,
! [X523: vTTContext,X524: vQuery,X525: vQuery,X526: vTType] :
( vptcheck(X523,X525,X526)
| ~ vptcheck(X523,vIntersection(X524,X525),X526) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TIntersection_inv2'])])]) ).
tff(c_0_24,plain,
! [X502: vTTContext,X503: vTable,X504: vTType] :
( vwelltypedtable(X504,X503)
| ~ vptcheck(X502,vtvalue(X503),X504) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Ttvalue_inv'])])]) ).
tff(c_0_25,plain,
! [X519: vTTContext,X520: vQuery,X521: vQuery,X522: vTType] :
( vptcheck(X519,X520,X522)
| ~ vptcheck(X519,vIntersection(X520,X521),X522) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TIntersection_inv1'])])]) ).
tcf(c_0_26,negated_conjecture,
! [X4: vQuery,X47: vTStore] :
( ~ visSomeQuery(vreduce(vq2,X47))
| ( vsomeQuery(X4) != vreduce(vIntersection(vq1,vq2),X47) )
| ( X4 = vIntersection(vq1,vgetQuery(vreduce(vq2,X47))) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
tcf(c_0_27,negated_conjecture,
vreduce(vIntersection(vq1,vq2),esk4_0) = vsomeQuery(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_28,negated_conjecture,
visSomeQuery(vreduce(vq2,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tff(c_0_29,plain,
! [X688: vTStore,X689: vTTContext,X690: vTType,X691: vQuery] :
( vptcheck(X689,X691,X690)
| ( vreduce(vq2,X688) != vsomeQuery(X691) )
| ~ vptcheck(X689,vq2,X690)
| ~ vstoreContextConsistent(X688,X689) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Preservation-Intersection-IH1'])])]) ).
tcf(c_0_30,plain,
! [X4: vQuery,X9: vQuery,X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,vIntersection(X4,X9),X18)
| vptcheck(X23,X9,X18) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_31,negated_conjecture,
vptcheck(esk3_0,vIntersection(vq1,vq2),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_32,plain,
! [X5: vTable,X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,vtvalue(X5),X18)
| vwelltypedtable(X18,X5) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
tcf(c_0_33,plain,
! [X4: vQuery,X9: vQuery,X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,vIntersection(X4,X9),X18)
| vptcheck(X23,X4,X18) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
tff(c_0_34,plain,
! [X494: vTTContext,X495: vQuery,X496: vTType,X497: vQuery] :
( vptcheck(X494,vIntersection(X495,X497),X496)
| ~ vptcheck(X494,X497,X496)
| ~ vptcheck(X494,X495,X496) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TIntersection'])])]) ).
tcf(c_0_35,negated_conjecture,
! [X4: vQuery] :
( ( vsomeQuery(X4) != vsomeQuery(esk1_0) )
| ( X4 = vIntersection(vq1,vgetQuery(vreduce(vq2,esk4_0))) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
tcf(c_0_36,plain,
! [X18: vTType,X47: vTStore,X23: vTTContext,X4: vQuery] :
( ( vreduce(vq2,X47) != vsomeQuery(X4) )
| ~ vptcheck(X23,vq2,X18)
| ~ vstoreContextConsistent(X47,X23)
| vptcheck(X23,X4,X18) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
tcf(c_0_37,negated_conjecture,
vptcheck(esk3_0,vq2,esk5_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
tff(c_0_38,plain,
! [X481: vTType,X482: vTable,X483: vTTContext] :
( vptcheck(X483,vtvalue(X482),X481)
| ~ vwelltypedtable(X481,X482) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Ttvalue'])])]) ).
tcf(c_0_39,negated_conjecture,
! [X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,vq1,X18)
| vwelltypedtable(X18,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
tcf(c_0_40,negated_conjecture,
vptcheck(esk3_0,vq1,esk5_0),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
tff(c_0_41,plain,
! [X540: vQuery] : ( vgetQuery(vsomeQuery(X540)) = X540 ),
inference(variable_rename,[status(thm)],['getQuery-0']) ).
tff(c_0_42,plain,
! [X542: vOptQuery] :
( ( X542 = vsomeQuery(esk8_1(X542)) )
| ~ visSomeQuery(X542) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['isSomeQuery-true-INV'])])])]) ).
tcf(c_0_43,plain,
! [X4: vQuery,X9: vQuery,X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,X9,X18)
| ~ vptcheck(X23,X4,X18)
| vptcheck(X23,vIntersection(X4,X9),X18) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
tcf(c_0_44,negated_conjecture,
vIntersection(vq1,vgetQuery(vreduce(vq2,esk4_0))) = esk1_0,
inference(er,[status(thm)],[c_0_35]) ).
tcf(c_0_45,negated_conjecture,
! [X4: vQuery,X47: vTStore] :
( ~ vstoreContextConsistent(X47,esk3_0)
| ( vreduce(vq2,X47) != vsomeQuery(X4) )
| vptcheck(esk3_0,X4,esk5_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
tcf(c_0_46,negated_conjecture,
vstoreContextConsistent(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_47,plain,
! [X23: vTTContext,X18: vTType,X5: vTable] :
( ~ vwelltypedtable(X18,X5)
| vptcheck(X23,vtvalue(X5),X18) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
tcf(c_0_48,negated_conjecture,
vwelltypedtable(esk5_0,esk2_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
tcf(c_0_49,plain,
! [X4: vQuery] : vgetQuery(vsomeQuery(X4)) = X4,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
tcf(c_0_50,plain,
! [X36: vOptQuery] :
( ~ visSomeQuery(X36)
| ( X36 = vsomeQuery(esk8_1(X36)) ) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
tcf(c_0_51,negated_conjecture,
! [X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,vq1,X18)
| ~ vptcheck(X23,vgetQuery(vreduce(vq2,esk4_0)),X18)
| vptcheck(X23,esk1_0,X18) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
tcf(c_0_52,negated_conjecture,
! [X4: vQuery] :
( ( vsomeQuery(X4) != vreduce(vq2,esk4_0) )
| vptcheck(esk3_0,X4,esk5_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
tcf(c_0_53,negated_conjecture,
! [X23: vTTContext] : vptcheck(X23,vq1,esk5_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_20]) ).
tcf(c_0_54,negated_conjecture,
~ vptcheck(esk3_0,esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_55,plain,
! [X36: vOptQuery] :
( ~ visSomeQuery(X36)
| ( esk8_1(X36) = vgetQuery(X36) ) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
tcf(c_0_56,negated_conjecture,
vsomeQuery(vgetQuery(vreduce(vq2,esk4_0))) != vreduce(vq2,esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),c_0_54]) ).
tcf(c_0_57,plain,
! [X36: vOptQuery] :
( ~ visSomeQuery(X36)
| ( vsomeQuery(vgetQuery(X36)) = X36 ) ),
inference(spm,[status(thm)],[c_0_50,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM290_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n001.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 14:27:30 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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
% 237.16/30.56 % Version: 3.5.1
% 237.16/30.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 237.16/30.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 237.16/30.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 237.16/30.56 % Starting new_bool_3 with 300s (1) cores
% 237.16/30.56 % Starting new_bool_1 with 300s (1) cores
% 237.16/30.56 % Starting sh5l with 300s (1) cores
% 237.16/30.56 % sh5l with pid 3362639 completed with status 0
% 237.16/30.56 % Result found by sh5l
% 237.16/30.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 237.16/30.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 237.16/30.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 237.16/30.56 % Starting new_bool_3 with 300s (1) cores
% 237.16/30.56 % Starting new_bool_1 with 300s (1) cores
% 237.16/30.56 % Starting sh5l with 300s (1) cores
% 237.16/30.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 237.16/30.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 237.16/30.56 % Search class: FGHSM-SMLM32-DFFFFFNN
% 237.16/30.56 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 237.16/30.56 % Starting SubtermCWHack with 28s (1) cores
% 237.16/30.56 % SubtermCWHack with pid 3362643 completed with status 8
% 237.16/30.56 % Starting sh5l with 31s (1) cores
% 237.16/30.56 % sh5l with pid 3363071 completed with status 0
% 237.16/30.56 % Result found by sh5l
% 237.16/30.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 237.16/30.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 237.16/30.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 237.16/30.56 % Starting new_bool_3 with 300s (1) cores
% 237.16/30.56 % Starting new_bool_1 with 300s (1) cores
% 237.16/30.56 % Starting sh5l with 300s (1) cores
% 237.16/30.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 237.16/30.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 237.16/30.56 % Search class: FGHSM-SMLM32-DFFFFFNN
% 237.16/30.56 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 237.16/30.56 % Starting SubtermCWHack with 28s (1) cores
% 237.16/30.56 % SubtermCWHack with pid 3362643 completed with status 8
% 237.16/30.56 % Starting sh5l with 31s (1) cores
% 237.16/30.56 % Preprocessing time : 0.066 s
% 237.16/30.56 % Presaturation interreduction done
% 237.16/30.56
% 237.16/30.56 % Proof found!
% 237.16/30.56 % SZS status Theorem
% 237.16/30.56 % SZS output start CNFRefutation
% See solution above
% 237.16/30.56 % Parsed axioms : 412
% 237.16/30.56 % Removed by relevancy pruning/SinE : 128
% 237.16/30.56 % Initial clauses : 2769
% 237.16/30.56 % Removed in clause preprocessing : 0
% 237.16/30.56 % Initial clauses in saturation : 2769
% 237.16/30.56 % Processed clauses : 6626
% 237.16/30.56 % ...of these trivial : 66
% 237.16/30.56 % ...subsumed : 2337
% 237.16/30.56 % ...remaining for further processing : 4223
% 237.16/30.56 % Other redundant clauses eliminated : 769
% 237.16/30.56 % Clauses deleted for lack of memory : 0
% 237.16/30.56 % Backward-subsumed : 14
% 237.16/30.56 % Backward-rewritten : 16
% 237.16/30.56 % Generated clauses : 9498
% 237.16/30.56 % ...of the previous two non-redundant : 7895
% 237.16/30.56 % ...aggressively subsumed : 0
% 237.16/30.56 % Contextual simplify-reflections : 7
% 237.16/30.56 % Paramodulations : 8689
% 237.16/30.56 % Factorizations : 0
% 237.16/30.56 % NegExts : 0
% 237.16/30.56 % Equation resolutions : 820
% 237.16/30.56 % Disequality decompositions : 0
% 237.16/30.56 % Total rewrite steps : 2459
% 237.16/30.56 % ...of those cached : 2179
% 237.16/30.56 % Propositional unsat checks : 0
% 237.16/30.56 % Propositional check models : 0
% 237.16/30.56 % Propositional check unsatisfiable : 0
% 237.16/30.56 % Propositional clauses : 0
% 237.16/30.56 % Propositional clauses after purity: 0
% 237.16/30.56 % Propositional unsat core size : 0
% 237.16/30.56 % Propositional preprocessing time : 0.000
% 237.16/30.56 % Propositional encoding time : 0.000
% 237.16/30.56 % Propositional solver time : 0.000
% 237.16/30.56 % Success case prop preproc time : 0.000
% 237.16/30.56 % Success case prop encoding time : 0.000
% 237.16/30.56 % Success case prop solver time : 0.000
% 237.16/30.56 % Current number of processed clauses : 1451
% 237.16/30.56 % Positive orientable unit clauses : 163
% 237.16/30.56 % Positive unorientable unit clauses: 17
% 237.16/30.56 % Negative unit clauses : 92
% 237.16/30.56 % Non-unit-clauses : 1179
% 237.16/30.56 % Current number of unprocessed clauses: 6587
% 237.16/30.56 % ...number of literals in the above : 23736
% 237.16/30.56 % Current number of archived formulas : 0
% 237.16/30.56 % Current number of archived clauses : 2631
% 237.16/30.56 % Clause-clause subsumption calls (NU) : 1234234
% 237.16/30.56 % Rec. Clause-clause subsumption calls : 501185
% 237.16/30.56 % Non-unit clause-clause subsumptions : 1632
% 237.16/30.56 % Unit Clause-clause subsumption calls : 17963
% 237.16/30.56 % Rewrite failures with RHS unbound : 289
% 237.16/30.56 % BW rewrite match attempts : 61
% 237.16/30.56 % BW rewrite match successes : 32
% 237.16/30.56 % Condensation attempts : 6626
% 237.16/30.56 % Condensation successes : 36
% 237.16/30.56 % Termbank termtop insertions : 247578
% 237.16/30.56 % Search garbage collected termcells : 19487
% 237.16/30.56
% 237.16/30.56 % -------------------------------------------------
% 237.16/30.56 % User time : 28.821 s
% 237.16/30.56 % System time : 1.122 s
% 237.16/30.56 % Total time : 29.943 s
% 237.16/30.56 % Maximum resident set size: 9252 pages
% 237.16/30.56
% 237.16/30.56 % -------------------------------------------------
% 237.16/30.56 % User time : 28.838 s
% 237.16/30.56 % System time : 1.133 s
% 237.16/30.56 % Total time : 29.971 s
% 237.16/30.56 % Maximum resident set size: 5632 pages
% 237.16/30.56 % E exiting
%------------------------------------------------------------------------------