%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM289_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 : 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:52 PM UTC 2026
% Result : Theorem 20.35s 3.24s
% Output : CNFRefutation 20.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 134 ( 61 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 138 ( 52 ~; 48 |; 27 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 111 ( 0 sgn 110 !; 1 ?; 111 :)
% 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_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_336,type,
esk200_1: vOptQuery > vQuery ).
tff(decl_421,type,
esk285_3: ( vTStore * ( vQuery * vQuery ) ) > vTable ).
tff(decl_422,type,
esk286_3: ( vTStore * ( vQuery * vQuery ) ) > vTable ).
tff(decl_423,type,
esk287_3: ( vTStore * ( vQuery * vQuery ) ) > vTable ).
tff(decl_424,type,
esk288_3: ( vTStore * ( vQuery * vQuery ) ) > vQuery ).
tff(decl_514,type,
esk378_0: vTStore ).
tff(decl_515,type,
esk379_0: vTTContext ).
tff(decl_516,type,
esk380_0: vTType ).
tff(decl_517,type,
esk381_0: vQuery ).
tff('Preservation-Intersection-q1-isSomeQuery-True',conjecture,
! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vIntersection(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ! [X301: vTable] : ( vq1 != vtvalue(X301) )
& visSomeQuery(vreduce(vq1,X294)) )
=> vptcheck(X460,X461,X54) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Intersection-q1-isSomeQuery-True') ).
tff('reduce-12',axiom,
! [X300: vQuery,X297: vQuery,X294: vTStore] :
( ( visSomeQuery(vreduce(X300,X294))
& ! [X301: vTable,X302: vQuery] :
( ( X297 != X302 )
| ( X300 != vtvalue(X301) ) )
& ! [X298: vTable,X299: vTable] :
( ( X297 != vtvalue(X299) )
| ( X300 != vtvalue(X298) ) ) )
=> ( vreduce(vIntersection(X300,X297),X294) = vsomeQuery(vIntersection(vgetQuery(vreduce(X300,X294)),X297)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduce-12') ).
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_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-IH0',axiom,
! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vq1,X294) = vsomeQuery(X461) )
& vptcheck(X460,vq1,X54)
& vstoreContextConsistent(X294,X460) )
=> vptcheck(X460,X461,X54) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Intersection-IH0') ).
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('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('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_9,negated_conjecture,
~ ! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vIntersection(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ! [X301: vTable] : ( vq1 != vtvalue(X301) )
& visSomeQuery(vreduce(vq1,X294)) )
=> vptcheck(X460,X461,X54) ),
inference(assume_negation,[status(cth)],['Preservation-Intersection-q1-isSomeQuery-True']) ).
tff(c_0_10,negated_conjecture,
~ ! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vIntersection(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ! [X301: vTable] : ( vq1 != vtvalue(X301) )
& visSomeQuery(vreduce(vq1,X294)) )
=> vptcheck(X460,X461,X54) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
tff(c_0_11,plain,
! [X300: vQuery,X297: vQuery,X294: vTStore] :
( ( visSomeQuery(vreduce(X300,X294))
& ! [X301: vTable,X302: vQuery] :
( ( X297 != X302 )
| ( X300 != vtvalue(X301) ) )
& ! [X298: vTable,X299: vTable] :
( ( X297 != vtvalue(X299) )
| ( X300 != vtvalue(X298) ) ) )
=> ( vreduce(vIntersection(X300,X297),X294) = vsomeQuery(vIntersection(vgetQuery(vreduce(X300,X294)),X297)) ) ),
inference(fof_simplification,[status(thm)],['reduce-12']) ).
tff(c_0_12,negated_conjecture,
! [X1582: vTable] :
( ~ vptcheck(esk379_0,esk381_0,esk380_0)
& ( vreduce(vIntersection(vq1,vq2),esk378_0) = vsomeQuery(esk381_0) )
& vptcheck(esk379_0,vIntersection(vq1,vq2),esk380_0)
& vstoreContextConsistent(esk378_0,esk379_0)
& ( vq1 != vtvalue(X1582) )
& visSomeQuery(vreduce(vq1,esk378_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_10])])])])]) ).
tff(c_0_13,plain,
! [X1308: vQuery,X1309: vQuery,X1310: vTStore] :
( ( ( vreduce(vIntersection(X1308,X1309),X1310) = vsomeQuery(vIntersection(vgetQuery(vreduce(X1308,X1310)),X1309)) )
| ~ visSomeQuery(vreduce(X1308,X1310))
| ( X1309 = vtvalue(esk286_3(X1308,X1309,X1310)) )
| ( X1309 = esk288_3(X1308,X1309,X1310) ) )
& ( ( vreduce(vIntersection(X1308,X1309),X1310) = vsomeQuery(vIntersection(vgetQuery(vreduce(X1308,X1310)),X1309)) )
| ~ visSomeQuery(vreduce(X1308,X1310))
| ( X1309 = vtvalue(esk286_3(X1308,X1309,X1310)) )
| ( X1308 = vtvalue(esk287_3(X1308,X1309,X1310)) ) )
& ( ( vreduce(vIntersection(X1308,X1309),X1310) = vsomeQuery(vIntersection(vgetQuery(vreduce(X1308,X1310)),X1309)) )
| ~ visSomeQuery(vreduce(X1308,X1310))
| ( X1308 = vtvalue(esk285_3(X1308,X1309,X1310)) )
| ( X1309 = esk288_3(X1308,X1309,X1310) ) )
& ( ( vreduce(vIntersection(X1308,X1309),X1310) = vsomeQuery(vIntersection(vgetQuery(vreduce(X1308,X1310)),X1309)) )
| ~ visSomeQuery(vreduce(X1308,X1310))
| ( X1308 = vtvalue(esk285_3(X1308,X1309,X1310)) )
| ( X1308 = vtvalue(esk287_3(X1308,X1309,X1310)) ) ) ),
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_11])])])])])]) ).
tff(c_0_14,plain,
! [X602: vQuery,X603: vQuery] :
( ( X602 = X603 )
| ( vsomeQuery(X602) != vsomeQuery(X603) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['EQ-someQuery'])])]) ).
tcf(c_0_15,negated_conjecture,
! [X5: vTable] : vq1 != vtvalue(X5),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_16,plain,
! [X4: vQuery,X9: vQuery,X47: vTStore] :
( ~ visSomeQuery(vreduce(X4,X47))
| ( vreduce(vIntersection(X4,X9),X47) = vsomeQuery(vIntersection(vgetQuery(vreduce(X4,X47)),X9)) )
| ( X4 = vtvalue(esk285_3(X4,X9,X47)) )
| ( X4 = vtvalue(esk287_3(X4,X9,X47)) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_17,plain,
! [X4: vQuery,X9: vQuery] :
( ( vsomeQuery(X4) != vsomeQuery(X9) )
| ( X4 = X9 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_18,negated_conjecture,
! [X4: vQuery,X47: vTStore] :
( ~ visSomeQuery(vreduce(vq1,X47))
| ( vsomeQuery(vIntersection(vgetQuery(vreduce(vq1,X47)),X4)) = vreduce(vIntersection(vq1,X4),X47) ) ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]),c_0_15]) ).
tff(c_0_19,plain,
! [X1554: vTTContext,X1555: vQuery,X1556: vQuery,X1557: vTType] :
( vptcheck(X1554,X1555,X1557)
| ~ vptcheck(X1554,vIntersection(X1555,X1556),X1557) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TIntersection_inv1'])])]) ).
tcf(c_0_20,negated_conjecture,
! [X4: vQuery,X9: vQuery,X47: vTStore] :
( ~ visSomeQuery(vreduce(vq1,X47))
| ( vsomeQuery(X4) != vreduce(vIntersection(vq1,X9),X47) )
| ( X4 = vIntersection(vgetQuery(vreduce(vq1,X47)),X9) ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
tcf(c_0_21,negated_conjecture,
vreduce(vIntersection(vq1,vq2),esk378_0) = vsomeQuery(esk381_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_22,negated_conjecture,
visSomeQuery(vreduce(vq1,esk378_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tff(c_0_23,plain,
! [X1570: vTStore,X1571: vTTContext,X1572: vTType,X1573: vQuery] :
( vptcheck(X1571,X1573,X1572)
| ( vreduce(vq1,X1570) != vsomeQuery(X1573) )
| ~ vptcheck(X1571,vq1,X1572)
| ~ vstoreContextConsistent(X1570,X1571) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Preservation-Intersection-IH0'])])]) ).
tcf(c_0_24,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_19]) ).
tcf(c_0_25,negated_conjecture,
vptcheck(esk379_0,vIntersection(vq1,vq2),esk380_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tff(c_0_26,plain,
! [X1529: vTTContext,X1530: vQuery,X1531: vTType,X1532: vQuery] :
( vptcheck(X1529,vIntersection(X1530,X1532),X1531)
| ~ vptcheck(X1529,X1532,X1531)
| ~ vptcheck(X1529,X1530,X1531) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TIntersection'])])]) ).
tcf(c_0_27,negated_conjecture,
! [X4: vQuery] :
( ( vsomeQuery(X4) != vsomeQuery(esk381_0) )
| ( X4 = vIntersection(vgetQuery(vreduce(vq1,esk378_0)),vq2) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
tcf(c_0_28,plain,
! [X18: vTType,X47: vTStore,X23: vTTContext,X4: vQuery] :
( ( vreduce(vq1,X47) != vsomeQuery(X4) )
| ~ vptcheck(X23,vq1,X18)
| ~ vstoreContextConsistent(X47,X23)
| vptcheck(X23,X4,X18) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_29,negated_conjecture,
vptcheck(esk379_0,vq1,esk380_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
tff(c_0_30,plain,
! [X1558: vTTContext,X1559: vQuery,X1560: vQuery,X1561: vTType] :
( vptcheck(X1558,X1560,X1561)
| ~ vptcheck(X1558,vIntersection(X1559,X1560),X1561) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['TIntersection_inv2'])])]) ).
tff(c_0_31,plain,
! [X735: vQuery] : ( vgetQuery(vsomeQuery(X735)) = X735 ),
inference(variable_rename,[status(thm)],['getQuery-0']) ).
tff(c_0_32,plain,
! [X1076: vOptQuery] :
( ( X1076 = vsomeQuery(esk200_1(X1076)) )
| ~ visSomeQuery(X1076) ),
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_33,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_26]) ).
tcf(c_0_34,negated_conjecture,
vIntersection(vgetQuery(vreduce(vq1,esk378_0)),vq2) = esk381_0,
inference(er,[status(thm)],[c_0_27]) ).
tcf(c_0_35,negated_conjecture,
! [X4: vQuery,X47: vTStore] :
( ~ vstoreContextConsistent(X47,esk379_0)
| ( vreduce(vq1,X47) != vsomeQuery(X4) )
| vptcheck(esk379_0,X4,esk380_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
tcf(c_0_36,negated_conjecture,
vstoreContextConsistent(esk378_0,esk379_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_37,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_30]) ).
tcf(c_0_38,plain,
! [X4: vQuery] : vgetQuery(vsomeQuery(X4)) = X4,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
tcf(c_0_39,plain,
! [X36: vOptQuery] :
( ~ visSomeQuery(X36)
| ( X36 = vsomeQuery(esk200_1(X36)) ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
tcf(c_0_40,negated_conjecture,
! [X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,vq2,X18)
| ~ vptcheck(X23,vgetQuery(vreduce(vq1,esk378_0)),X18)
| vptcheck(X23,esk381_0,X18) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
tcf(c_0_41,negated_conjecture,
! [X4: vQuery] :
( ( vreduce(vq1,esk378_0) != vsomeQuery(X4) )
| vptcheck(esk379_0,X4,esk380_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
tcf(c_0_42,negated_conjecture,
vptcheck(esk379_0,vq2,esk380_0),
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
tcf(c_0_43,negated_conjecture,
~ vptcheck(esk379_0,esk381_0,esk380_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_44,plain,
! [X36: vOptQuery] :
( ~ visSomeQuery(X36)
| ( esk200_1(X36) = vgetQuery(X36) ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
tcf(c_0_45,negated_conjecture,
vsomeQuery(vgetQuery(vreduce(vq1,esk378_0))) != vreduce(vq1,esk378_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]) ).
tcf(c_0_46,plain,
! [X36: vOptQuery] :
( ~ visSomeQuery(X36)
| ( vsomeQuery(vgetQuery(X36)) = X36 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM289_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.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 14:22:26 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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
% 20.35/3.24 % Version: 3.5.1
% 20.35/3.24 % Preprocessing class: FSLSSMSMSSSNFFN.
% 20.35/3.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.35/3.24 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 20.35/3.24 % Starting new_bool_3 with 300s (1) cores
% 20.35/3.24 % Starting new_bool_1 with 300s (1) cores
% 20.35/3.24 % Starting sh5l with 300s (1) cores
% 20.35/3.24 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1091354 completed with status 0
% 20.35/3.24 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 20.35/3.24 % Preprocessing class: FSLSSMSMSSSNFFN.
% 20.35/3.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.35/3.24 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 20.35/3.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 20.35/3.24 % No SInE strategy applied
% 20.35/3.24 % Search class: FGHSM-SMLM32-DFFFFFNN
% 20.35/3.24 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 20.35/3.24 % Starting SubtermCWHack with 136s (1) cores
% 20.35/3.24 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 20.35/3.24 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 20.35/3.24 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 20.35/3.24 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 20.35/3.24 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1091362 completed with status 0
% 20.35/3.24 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 20.35/3.24 % Preprocessing class: FSLSSMSMSSSNFFN.
% 20.35/3.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.35/3.24 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 20.35/3.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 20.35/3.24 % No SInE strategy applied
% 20.35/3.24 % Search class: FGHSM-SMLM32-DFFFFFNN
% 20.35/3.24 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 20.35/3.24 % Starting SubtermCWHack with 136s (1) cores
% 20.35/3.24 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 20.35/3.24 % Preprocessing time : 0.067 s
% 20.35/3.24 % Presaturation interreduction done
% 20.35/3.24
% 20.35/3.24 % Proof found!
% 20.35/3.24 % SZS status Theorem
% 20.35/3.24 % SZS output start CNFRefutation
% See solution above
% 20.35/3.24 % Parsed axioms : 412
% 20.35/3.24 % Removed by relevancy pruning/SinE : 0
% 20.35/3.24 % Initial clauses : 2916
% 20.35/3.24 % Removed in clause preprocessing : 124
% 20.35/3.24 % Initial clauses in saturation : 2792
% 20.35/3.24 % Processed clauses : 5713
% 20.35/3.24 % ...of these trivial : 57
% 20.35/3.24 % ...subsumed : 856
% 20.35/3.24 % ...remaining for further processing : 4800
% 20.35/3.24 % Other redundant clauses eliminated : 4261
% 20.35/3.24 % Clauses deleted for lack of memory : 0
% 20.35/3.24 % Backward-subsumed : 1
% 20.35/3.24 % Backward-rewritten : 27
% 20.35/3.24 % Generated clauses : 23610
% 20.35/3.24 % ...of the previous two non-redundant : 18878
% 20.35/3.24 % ...aggressively subsumed : 0
% 20.35/3.24 % Contextual simplify-reflections : 11
% 20.35/3.24 % Paramodulations : 19301
% 20.35/3.24 % Factorizations : 1
% 20.35/3.24 % NegExts : 0
% 20.35/3.24 % Equation resolutions : 4319
% 20.35/3.24 % Disequality decompositions : 0
% 20.35/3.24 % Total rewrite steps : 1168
% 20.35/3.24 % ...of those cached : 942
% 20.35/3.24 % Propositional unsat checks : 0
% 20.35/3.24 % Propositional check models : 0
% 20.35/3.24 % Propositional check unsatisfiable : 0
% 20.35/3.24 % Propositional clauses : 0
% 20.35/3.24 % Propositional clauses after purity: 0
% 20.35/3.24 % Propositional unsat core size : 0
% 20.35/3.24 % Propositional preprocessing time : 0.000
% 20.35/3.24 % Propositional encoding time : 0.000
% 20.35/3.24 % Propositional solver time : 0.000
% 20.35/3.24 % Success case prop preproc time : 0.000
% 20.35/3.24 % Success case prop encoding time : 0.000
% 20.35/3.24 % Success case prop solver time : 0.000
% 20.35/3.24 % Current number of processed clauses : 2006
% 20.35/3.24 % Positive orientable unit clauses : 151
% 20.35/3.24 % Positive unorientable unit clauses: 10
% 20.35/3.24 % Negative unit clauses : 83
% 20.35/3.24 % Non-unit-clauses : 1762
% 20.35/3.24 % Current number of unprocessed clauses: 18552
% 20.35/3.24 % ...number of literals in the above : 76023
% 20.35/3.24 % Current number of archived formulas : 0
% 20.35/3.24 % Current number of archived clauses : 2660
% 20.35/3.24 % Clause-clause subsumption calls (NU) : 1897627
% 20.35/3.24 % Rec. Clause-clause subsumption calls : 628645
% 20.35/3.24 % Non-unit clause-clause subsumptions : 506
% 20.35/3.24 % Unit Clause-clause subsumption calls : 22369
% 20.35/3.24 % Rewrite failures with RHS unbound : 133
% 20.35/3.24 % BW rewrite match attempts : 25
% 20.35/3.24 % BW rewrite match successes : 16
% 20.35/3.24 % Condensation attempts : 0
% 20.35/3.24 % Condensation successes : 0
% 20.35/3.24 % Termbank termtop insertions : 409712
% 20.35/3.24 % Search garbage collected termcells : 19653
% 20.35/3.24
% 20.35/3.24 % -------------------------------------------------
% 20.35/3.24 % User time : 2.614 s
% 20.35/3.24 % System time : 0.070 s
% 20.35/3.24 % Total time : 2.684 s
% 20.35/3.24 % Maximum resident set size: 9556 pages
% 20.35/3.24
% 20.35/3.24 % -------------------------------------------------
% 20.35/3.24 % User time : 12.333 s
% 20.35/3.24 % System time : 0.352 s
% 20.35/3.24 % Total time : 12.685 s
% 20.35/3.24 % Maximum resident set size: 5632 pages
% 20.35/3.24 % E exiting
%------------------------------------------------------------------------------