%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COM297_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 : n004.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:12:45 PM UTC 2026
% Result : Theorem 5.90s 1.26s
% Output : CNFRefutation 5.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 101 ( 42 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 110 ( 48 ~; 31 |; 21 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 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 : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 67 !; 15 ?; 82 :)
% 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_44,type,
vnoQuery: vOptQuery ).
tff(decl_53,type,
vq1: vQuery ).
tff(decl_64,type,
vq2: vQuery ).
tff(decl_83,type,
visValue: vQuery > $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_336,type,
esk200_1: vOptQuery > vQuery ).
tff(decl_516,type,
esk380_2: ( vTStore * vTable ) > vQuery ).
tff(decl_517,type,
esk381_2: ( vTTContext * vTStore ) > vTable ).
tff(decl_518,type,
esk382_1: vTStore > vQuery ).
tff(decl_519,type,
esk383_0: vTStore ).
tff(decl_520,type,
esk384_0: vTTContext ).
tff(decl_521,type,
esk385_0: vTType ).
tff('Progress-Intersection',conjecture,
! [X294: vTStore,X460: vTTContext] :
( ( ? [X424: vTType] : vptcheck(X460,vIntersection(vq1,vq2),X424)
& ~ visValue(vIntersection(vq1,vq2))
& vstoreContextConsistent(X294,X460) )
=> ? [X461: vQuery] : ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Progress-Intersection') ).
tff('Progress-Intersection-tvalue',axiom,
! [X53: vTable,X294: vTStore,X460: vTTContext] :
( ( ? [X424: vTType] : vptcheck(X460,vIntersection(vq1,vq2),X424)
& ~ visValue(vIntersection(vq1,vq2))
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) ) )
=> ? [X461: vQuery] : ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Progress-Intersection-tvalue') ).
tff('isValue-3',axiom,
! [X205: vQuery,X206: vQuery] : ~ visValue(vIntersection(X205,X206)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isValue-3') ).
tff('isSomeQuery-true-INV',axiom,
! [X219: vOptQuery] :
( visSomeQuery(X219)
=> ? [X220: vQuery] : ( X219 = vsomeQuery(X220) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isSomeQuery-true-INV') ).
tff('isSomeQuery-false-INV',axiom,
! [X219: vOptQuery] :
( ~ visSomeQuery(X219)
=> ( X219 = vnoQuery ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isSomeQuery-false-INV') ).
tff('Progress-Intersection-q1',axiom,
! [X294: vTStore,X460: vTTContext] :
( ( ? [X424: vTType] : vptcheck(X460,vIntersection(vq1,vq2),X424)
& ~ visValue(vIntersection(vq1,vq2))
& vstoreContextConsistent(X294,X460)
& ! [X182: vTable] : ( vq1 != vtvalue(X182) ) )
=> ? [X461: vQuery] : ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Progress-Intersection-q1') ).
tff('DIFF-noQuery-someQuery',axiom,
! [X9: vQuery] : ( vnoQuery != vsomeQuery(X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-noQuery-someQuery') ).
tff(c_0_7,negated_conjecture,
~ ! [X294: vTStore,X460: vTTContext] :
( ( ? [X424: vTType] : vptcheck(X460,vIntersection(vq1,vq2),X424)
& ~ visValue(vIntersection(vq1,vq2))
& vstoreContextConsistent(X294,X460) )
=> ? [X461: vQuery] : ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) ) ),
inference(assume_negation,[status(cth)],['Progress-Intersection']) ).
tff(c_0_8,plain,
! [X53: vTable,X294: vTStore,X460: vTTContext] :
( ( ? [X424: vTType] : vptcheck(X460,vIntersection(vq1,vq2),X424)
& ~ visValue(vIntersection(vq1,vq2))
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) ) )
=> ? [X461: vQuery] : ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) ) ),
inference(fof_simplification,[status(thm)],['Progress-Intersection-tvalue']) ).
tff(c_0_9,plain,
! [X205: vQuery,X206: vQuery] : ~ visValue(vIntersection(X205,X206)),
inference(fof_simplification,[status(thm)],['isValue-3']) ).
tff(c_0_10,negated_conjecture,
~ ! [X294: vTStore,X460: vTTContext] :
( ( ? [X424: vTType] : vptcheck(X460,vIntersection(vq1,vq2),X424)
& ~ visValue(vIntersection(vq1,vq2))
& vstoreContextConsistent(X294,X460) )
=> ? [X461: vQuery] : ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
tff(c_0_11,plain,
! [X1578: vTable,X1579: vTStore,X1580: vTTContext,X1581: vTType] :
( ( vreduce(vIntersection(vq1,vq2),X1579) = vsomeQuery(esk380_2(X1578,X1579)) )
| ~ vptcheck(X1580,vIntersection(vq1,vq2),X1581)
| visValue(vIntersection(vq1,vq2))
| ~ vstoreContextConsistent(X1579,X1580)
| ( vq1 != vtvalue(X1578) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
tff(c_0_12,plain,
! [X1059: vQuery,X1060: vQuery] : ~ visValue(vIntersection(X1059,X1060)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
tff(c_0_13,negated_conjecture,
! [X1591: vQuery] :
( ( vreduce(vIntersection(vq1,vq2),esk383_0) != vsomeQuery(X1591) )
& vptcheck(esk384_0,vIntersection(vq1,vq2),esk385_0)
& ~ visValue(vIntersection(vq1,vq2))
& vstoreContextConsistent(esk383_0,esk384_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_14,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'])])])]) ).
tff(c_0_15,plain,
! [X219: vOptQuery] :
( ~ visSomeQuery(X219)
=> ( X219 = vnoQuery ) ),
inference(fof_simplification,[status(thm)],['isSomeQuery-false-INV']) ).
tff(c_0_16,plain,
! [X294: vTStore,X460: vTTContext] :
( ( ? [X424: vTType] : vptcheck(X460,vIntersection(vq1,vq2),X424)
& ~ visValue(vIntersection(vq1,vq2))
& vstoreContextConsistent(X294,X460)
& ! [X182: vTable] : ( vq1 != vtvalue(X182) ) )
=> ? [X461: vQuery] : ( vreduce(vIntersection(vq1,vq2),X294) = vsomeQuery(X461) ) ),
inference(fof_simplification,[status(thm)],['Progress-Intersection-q1']) ).
tcf(c_0_17,plain,
! [X5: vTable,X47: vTStore,X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,vIntersection(vq1,vq2),X18)
| ~ vstoreContextConsistent(X47,X23)
| ( vq1 != vtvalue(X5) )
| ( vreduce(vIntersection(vq1,vq2),X47) = vsomeQuery(esk380_2(X5,X47)) )
| visValue(vIntersection(vq1,vq2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_18,plain,
! [X4: vQuery,X9: vQuery] : ~ visValue(vIntersection(X4,X9)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_19,negated_conjecture,
! [X4: vQuery] : vreduce(vIntersection(vq1,vq2),esk383_0) != vsomeQuery(X4),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_20,plain,
! [X36: vOptQuery] :
( ~ visSomeQuery(X36)
| ( X36 = vsomeQuery(esk200_1(X36)) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tff(c_0_21,plain,
! [X1078: vOptQuery] :
( ( X1078 = vnoQuery )
| visSomeQuery(X1078) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])]) ).
tff(c_0_22,plain,
! [X9: vQuery] : ( vnoQuery != vsomeQuery(X9) ),
inference(fof_simplification,[status(thm)],['DIFF-noQuery-someQuery']) ).
tff(c_0_23,plain,
! [X1583: vTStore,X1584: vTTContext,X1586: vTType] :
( ( vreduce(vIntersection(vq1,vq2),X1583) = vsomeQuery(esk382_1(X1583)) )
| ~ vptcheck(X1584,vIntersection(vq1,vq2),X1586)
| visValue(vIntersection(vq1,vq2))
| ~ vstoreContextConsistent(X1583,X1584)
| ( vq1 = vtvalue(esk381_2(X1583,X1584)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])])]) ).
tcf(c_0_24,plain,
! [X5: vTable,X18: vTType,X47: vTStore,X23: vTTContext] :
( ~ vstoreContextConsistent(X47,X23)
| ~ vptcheck(X23,vIntersection(vq1,vq2),X18)
| ( vq1 != vtvalue(X5) )
| ( vreduce(vIntersection(vq1,vq2),X47) = vsomeQuery(esk380_2(X5,X47)) ) ),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
tcf(c_0_25,negated_conjecture,
vptcheck(esk384_0,vIntersection(vq1,vq2),esk385_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_26,negated_conjecture,
~ visSomeQuery(vreduce(vIntersection(vq1,vq2),esk383_0)),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20])]) ).
tcf(c_0_27,plain,
! [X36: vOptQuery] :
( ( X36 = vnoQuery )
| visSomeQuery(X36) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tff(c_0_28,plain,
! [X604: vQuery] : ( vnoQuery != vsomeQuery(X604) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
tcf(c_0_29,plain,
! [X47: vTStore,X23: vTTContext,X18: vTType] :
( ~ vptcheck(X23,vIntersection(vq1,vq2),X18)
| ~ vstoreContextConsistent(X47,X23)
| ( vreduce(vIntersection(vq1,vq2),X47) = vsomeQuery(esk382_1(X47)) )
| visValue(vIntersection(vq1,vq2))
| ( vq1 = vtvalue(esk381_2(X47,X23)) ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_30,negated_conjecture,
! [X5: vTable,X47: vTStore] :
( ~ vstoreContextConsistent(X47,esk384_0)
| ( vq1 != vtvalue(X5) )
| ( vreduce(vIntersection(vq1,vq2),X47) = vsomeQuery(esk380_2(X5,X47)) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
tcf(c_0_31,negated_conjecture,
vstoreContextConsistent(esk383_0,esk384_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_32,negated_conjecture,
vreduce(vIntersection(vq1,vq2),esk383_0) = vnoQuery,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
tcf(c_0_33,plain,
! [X4: vQuery] : vnoQuery != vsomeQuery(X4),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
tcf(c_0_34,plain,
! [X18: vTType,X47: vTStore,X23: vTTContext] :
( ~ vstoreContextConsistent(X47,X23)
| ~ vptcheck(X23,vIntersection(vq1,vq2),X18)
| ( vq1 = vtvalue(esk381_2(X47,X23)) )
| ( vreduce(vIntersection(vq1,vq2),X47) = vsomeQuery(esk382_1(X47)) ) ),
inference(sr,[status(thm)],[c_0_29,c_0_18]) ).
tcf(c_0_35,negated_conjecture,
! [X5: vTable] : vq1 != vtvalue(X5),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]) ).
tcf(c_0_36,plain,
! [X18: vTType,X47: vTStore,X23: vTTContext] :
( ~ vstoreContextConsistent(X47,X23)
| ~ vptcheck(X23,vIntersection(vq1,vq2),X18)
| ( vreduce(vIntersection(vq1,vq2),X47) = vsomeQuery(esk382_1(X47)) ) ),
inference(sr,[status(thm)],[c_0_34,c_0_35]) ).
tcf(c_0_37,negated_conjecture,
! [X47: vTStore] :
( ~ vstoreContextConsistent(X47,esk384_0)
| ( vreduce(vIntersection(vq1,vq2),X47) = vsomeQuery(esk382_1(X47)) ) ),
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM297_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.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 14:22:49 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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
% 5.90/1.26 % Version: 3.5.1
% 5.90/1.26 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.90/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.90/1.26 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.90/1.26 % Starting new_bool_3 with 300s (1) cores
% 5.90/1.26 % Starting new_bool_1 with 300s (1) cores
% 5.90/1.26 % Starting sh5l with 300s (1) cores
% 5.90/1.26 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3365828 completed with status 0
% 5.90/1.26 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.90/1.26 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.90/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.90/1.26 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.90/1.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.90/1.26 % No SInE strategy applied
% 5.90/1.26 % Search class: FGHSM-SMLM32-DFFFFFNN
% 5.90/1.26 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 5.90/1.26 % Starting SubtermCWHack with 136s (1) cores
% 5.90/1.26 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.90/1.26 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 5.90/1.26 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 5.90/1.26 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 5.90/1.26 % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3365864 completed with status 0
% 5.90/1.26 % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.90/1.26 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.90/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.90/1.26 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.90/1.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.90/1.26 % No SInE strategy applied
% 5.90/1.26 % Search class: FGHSM-SMLM32-DFFFFFNN
% 5.90/1.26 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 5.90/1.26 % Starting SubtermCWHack with 136s (1) cores
% 5.90/1.26 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.90/1.26 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 5.90/1.26 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 5.90/1.26 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 5.90/1.26 % Preprocessing time : 0.023 s
% 5.90/1.26 % Presaturation interreduction done
% 5.90/1.26
% 5.90/1.26 % Proof found!
% 5.90/1.26 % SZS status Theorem
% 5.90/1.26 % SZS output start CNFRefutation
% See solution above
% 5.90/1.26 % Parsed axioms : 414
% 5.90/1.26 % Removed by relevancy pruning/SinE : 0
% 5.90/1.26 % Initial clauses : 2916
% 5.90/1.26 % Removed in clause preprocessing : 124
% 5.90/1.26 % Initial clauses in saturation : 2792
% 5.90/1.26 % Processed clauses : 8180
% 5.90/1.26 % ...of these trivial : 137
% 5.90/1.26 % ...subsumed : 3605
% 5.90/1.26 % ...remaining for further processing : 4438
% 5.90/1.26 % Other redundant clauses eliminated : 1531
% 5.90/1.26 % Clauses deleted for lack of memory : 0
% 5.90/1.26 % Backward-subsumed : 59
% 5.90/1.26 % Backward-rewritten : 38
% 5.90/1.26 % Generated clauses : 15645
% 5.90/1.26 % ...of the previous two non-redundant : 12125
% 5.90/1.26 % ...aggressively subsumed : 0
% 5.90/1.26 % Contextual simplify-reflections : 15
% 5.90/1.26 % Paramodulations : 14046
% 5.90/1.26 % Factorizations : 15
% 5.90/1.26 % NegExts : 0
% 5.90/1.26 % Equation resolutions : 1595
% 5.90/1.26 % Disequality decompositions : 0
% 5.90/1.26 % Total rewrite steps : 3172
% 5.90/1.26 % ...of those cached : 2885
% 5.90/1.26 % Propositional unsat checks : 0
% 5.90/1.26 % Propositional check models : 0
% 5.90/1.26 % Propositional check unsatisfiable : 0
% 5.90/1.26 % Propositional clauses : 0
% 5.90/1.26 % Propositional clauses after purity: 0
% 5.90/1.26 % Propositional unsat core size : 0
% 5.90/1.26 % Propositional preprocessing time : 0.000
% 5.90/1.26 % Propositional encoding time : 0.000
% 5.90/1.26 % Propositional solver time : 0.000
% 5.90/1.26 % Success case prop preproc time : 0.000
% 5.90/1.26 % Success case prop encoding time : 0.000
% 5.90/1.26 % Success case prop solver time : 0.000
% 5.90/1.26 % Current number of processed clauses : 1576
% 5.90/1.26 % Positive orientable unit clauses : 120
% 5.90/1.26 % Positive unorientable unit clauses: 19
% 5.90/1.26 % Negative unit clauses : 76
% 5.90/1.26 % Non-unit-clauses : 1361
% 5.90/1.26 % Current number of unprocessed clauses: 9233
% 5.90/1.26 % ...number of literals in the above : 31200
% 5.90/1.26 % Current number of archived formulas : 0
% 5.90/1.26 % Current number of archived clauses : 2728
% 5.90/1.26 % Clause-clause subsumption calls (NU) : 1750244
% 5.90/1.26 % Rec. Clause-clause subsumption calls : 600080
% 5.90/1.26 % Non-unit clause-clause subsumptions : 3014
% 5.90/1.26 % Unit Clause-clause subsumption calls : 9790
% 5.90/1.26 % Rewrite failures with RHS unbound : 0
% 5.90/1.26 % BW rewrite match attempts : 123
% 5.90/1.26 % BW rewrite match successes : 100
% 5.90/1.26 % Condensation attempts : 0
% 5.90/1.26 % Condensation successes : 0
% 5.90/1.26 % Termbank termtop insertions : 322489
% 5.90/1.26 % Search garbage collected termcells : 19727
% 5.90/1.26
% 5.90/1.26 % -------------------------------------------------
% 5.90/1.26 % User time : 0.774 s
% 5.90/1.26 % System time : 0.025 s
% 5.90/1.26 % Total time : 0.799 s
% 5.90/1.26 % Maximum resident set size: 9560 pages
% 5.90/1.26
% 5.90/1.26 % -------------------------------------------------
% 5.90/1.26 % User time : 3.592 s
% 5.90/1.26 % System time : 0.131 s
% 5.90/1.26 % Total time : 3.723 s
% 5.90/1.26 % Maximum resident set size: 5632 pages
% 5.90/1.26 % E exiting
%------------------------------------------------------------------------------