%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS172+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 01:01:05 PM UTC 2026
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 60 ( 11 unt; 0 def)
% Number of atoms : 196 ( 9 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 218 ( 82 ~; 102 |; 20 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 60 ( 4 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X4,X5] :
( rq(X4,X5)
<=> rp(X4,X5) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_7,axiom,
! [X4,X5] :
( rq(X4,X5)
=> cd(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rp(X4,X5)
=> cd(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_3,axiom,
! [X4] :
( cd(X4)
<=> rp(X4,iv) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_6,axiom,
! [X4,X5,X6] :
( ( rq(X4,X6)
& rq(X4,X5) )
=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_2,axiom,
! [X4] :
( cd(X4)
<=> rq(X4,iv) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
! [X4,X5,X6] :
( ( rp(X4,X6)
& rp(X4,X5) )
=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(c_0_9,negated_conjecture,
~ ( ! [X4,X5] :
( rq(X4,X5)
<=> rp(X4,X5) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_10,negated_conjecture,
~ ( ! [X4,X5] :
( rq(X4,X5)
<=> rp(X4,X5) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_12,negated_conjecture,
( ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| ~ rp(esk3_0,esk4_0)
| ~ rq(esk3_0,esk4_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ rp(esk3_0,esk4_0)
| ~ rq(esk3_0,esk4_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_13,plain,
! [X29] :
( ~ cowlNothing(X29)
& cowlThing(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_17,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( ~ xsd_string(esk2_0)
| rq(esk3_0,esk4_0)
| rp(esk3_0,esk4_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_19,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X30] :
( ( xsd_string(X30)
| xsd_integer(X30) )
& ( ~ xsd_integer(X30)
| ~ xsd_string(X30) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ xsd_integer(esk2_0)
| rq(esk3_0,esk4_0)
| rp(esk3_0,esk4_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
( ~ xsd_string(esk2_0)
| rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0)
| xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ xsd_integer(esk2_0)
| rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0)
| xsd_string(esk2_0) ),
inference(sr,[status(thm)],[c_0_21,c_0_19]) ).
fof(c_0_25,plain,
! [X41,X42] :
( cd(X41)
| ~ rq(X41,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
cnf(c_0_26,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0)
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0)
| xsd_string(esk2_0) ),
inference(csr,[status(thm)],[c_0_24,c_0_23]) ).
fof(c_0_29,plain,
! [X36,X37] :
( cd(X36)
| ~ rp(X36,X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
fof(c_0_30,plain,
! [X32] :
( ( cd(X32)
| ~ rp(X32,iv) )
& ( rp(X32,iv)
| ~ cd(X32) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_31,plain,
( ~ rq(X1,X2)
| cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( rp(esk3_0,esk4_0)
| rq(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,plain,
( ~ rp(X1,X2)
| cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_34,plain,
! [X38,X39,X40] :
( X39 = X40
| ~ rq(X38,X40)
| ~ rq(X38,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).
fof(c_0_35,plain,
! [X31] :
( ( cd(X31)
| ~ rq(X31,iv) )
& ( rq(X31,iv)
| ~ cd(X31) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
fof(c_0_36,plain,
! [X33,X34,X35] :
( X34 = X35
| ~ rp(X33,X35)
| ~ rp(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
cnf(c_0_37,plain,
( ~ cd(X1)
| rp(X1,iv) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
cd(esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ rp(esk3_0,esk4_0)
| ~ rq(esk3_0,esk4_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,plain,
( ~ rq(X1,X3)
| ~ rq(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( ~ cd(X1)
| rq(X1,iv) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( ~ rp(X1,X3)
| ~ rp(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
rp(esk3_0,iv),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ rp(esk3_0,esk4_0)
| ~ rq(esk3_0,esk4_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
( ~ rq(esk3_0,esk4_0)
| ~ rp(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_15])]) ).
cnf(c_0_46,negated_conjecture,
( ~ rq(esk3_0,X1)
| rp(esk3_0,esk4_0)
| X1 = esk4_0 ),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
cnf(c_0_47,negated_conjecture,
rq(esk3_0,iv),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( ~ rp(esk3_0,X1)
| X1 = iv ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( ~ rq(esk3_0,esk4_0)
| ~ rp(esk3_0,esk4_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_15])]) ).
cnf(c_0_50,negated_conjecture,
( ~ rp(esk3_0,esk4_0)
| ~ rq(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[c_0_45,c_0_19]) ).
cnf(c_0_51,negated_conjecture,
iv = esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( ~ rp(esk3_0,esk4_0)
| ~ rq(esk3_0,esk4_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0) ),
inference(sr,[status(thm)],[c_0_49,c_0_19]) ).
cnf(c_0_53,negated_conjecture,
( ~ rp(esk3_0,esk4_0)
| ~ rq(esk3_0,esk4_0)
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[c_0_50,c_0_23]) ).
cnf(c_0_54,negated_conjecture,
rq(esk3_0,esk4_0),
inference(rw,[status(thm)],[c_0_47,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
rp(esk3_0,esk4_0),
inference(rw,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( ~ rp(esk3_0,esk4_0)
| ~ rq(esk3_0,esk4_0)
| xsd_string(esk2_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_23]) ).
cnf(c_0_57,negated_conjecture,
xsd_integer(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
xsd_string(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_54])]),c_0_55])]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_57]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS172+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n018.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 : Sun Sep 20 22:57:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/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
% 0.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 382535 completed with status 0
% 0.14/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FGHSF-FFSF00-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 136s (1) cores
% 0.14/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.43 % new_bool_3 with pid 382542 completed with status 0
% 0.14/0.43 % Result found by new_bool_3
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FGHSF-FFSF00-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 136s (1) cores
% 0.14/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43 % Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Theorem
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 19
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 26
% 0.14/0.43 % Removed in clause preprocessing : 11
% 0.14/0.43 % Initial clauses in saturation : 15
% 0.14/0.43 % Processed clauses : 45
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 1
% 0.14/0.43 % ...remaining for further processing : 44
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 6
% 0.14/0.43 % Backward-rewritten : 8
% 0.14/0.43 % Generated clauses : 21
% 0.14/0.43 % ...of the previous two non-redundant : 18
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 6
% 0.14/0.43 % Paramodulations : 21
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 17
% 0.14/0.43 % ...of those cached : 12
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 17
% 0.14/0.43 % Positive orientable unit clauses : 6
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 1
% 0.14/0.43 % Non-unit-clauses : 10
% 0.14/0.43 % Current number of unprocessed clauses: 0
% 0.14/0.43 % ...number of literals in the above : 0
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 28
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 121
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 86
% 0.14/0.43 % Non-unit clause-clause subsumptions : 12
% 0.14/0.43 % Unit Clause-clause subsumption calls : 6
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 3
% 0.14/0.43 % BW rewrite match successes : 3
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 2050
% 0.14/0.43 % Search garbage collected termcells : 399
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.004 s
% 0.14/0.43 % System time : 0.002 s
% 0.14/0.43 % Total time : 0.006 s
% 0.14/0.43 % Maximum resident set size: 3392 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.013 s
% 0.14/0.43 % System time : 0.011 s
% 0.14/0.43 % Total time : 0.023 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------