TSTP Solution File: KRS175+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS175+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:13:24 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 60 ( 14 unt; 0 def)
% Number of atoms : 235 ( 42 equ)
% Maximal formula atoms : 50 ( 3 avg)
% Number of connectives : 298 ( 123 ~; 143 |; 23 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 29 ( 2 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_4,axiom,
! [X3] :
( cB(X3)
<=> X3 = ib ),
file('/export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p',axiom_4) ).
fof(the_axiom,conjecture,
( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( cA_and_B(X3)
<=> ( X3 = ib
| X3 = ia ) )
& cowlThing(ia)
& cowlThing(ib) ),
file('/export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p',the_axiom) ).
fof(axiom_0,axiom,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p',axiom_0) ).
fof(axiom_1,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p',axiom_1) ).
fof(axiom_2,axiom,
! [X3] :
( cA(X3)
<=> X3 = ia ),
file('/export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p',axiom_2) ).
fof(axiom_3,axiom,
! [X3] :
( cA_and_B(X3)
<=> ( cA(X3)
| cB(X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p',axiom_3) ).
fof(axiom_5,axiom,
cowlThing(ia),
file('/export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p',axiom_5) ).
fof(axiom_6,axiom,
cowlThing(ib),
file('/export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p',axiom_6) ).
fof(c_0_8,plain,
! [X9] :
( ( ~ cB(X9)
| X9 = ib )
& ( X9 != ib
| cB(X9) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_9,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( cA_and_B(X3)
<=> ( X3 = ib
| X3 = ia ) )
& cowlThing(ia)
& cowlThing(ib) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_10,plain,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_11,plain,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_12,plain,
! [X10] :
( ( ~ cA(X10)
| X10 = ia )
& ( X10 != ia
| cA(X10) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
fof(c_0_13,plain,
! [X13] :
( ( ~ cA_and_B(X13)
| cA(X13)
| cB(X13) )
& ( ~ cA(X13)
| cA_and_B(X13) )
& ( ~ cB(X13)
| cA_and_B(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_14,plain,
( cB(X1)
| X1 != ib ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,negated_conjecture,
( ( esk3_0 != ib
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk3_0 != ia
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( cA_and_B(esk3_0)
| esk3_0 = ib
| esk3_0 = ia
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk3_0 != ib
| ~ cA_and_B(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk3_0 != ia
| ~ cA_and_B(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( cA_and_B(esk3_0)
| esk3_0 = ib
| esk3_0 = ia
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ) ),
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_9])])])])]) ).
fof(c_0_16,plain,
! [X21] :
( cowlThing(X21)
& ~ cowlNothing(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_17,plain,
! [X16] :
( ( ~ xsd_string(X16)
| ~ xsd_integer(X16) )
& ( xsd_integer(X16)
| xsd_string(X16) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_18,plain,
( cA(X1)
| X1 != ia ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( cA_and_B(X1)
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
cB(ib),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( cA_and_B(esk3_0)
| esk3_0 = ib
| esk3_0 = ia
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( cA_and_B(esk3_0)
| esk3_0 = ib
| esk3_0 = ia
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| esk3_0 != ib
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,plain,
cowlThing(ia),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_28,plain,
cowlThing(ib),
inference(split_conjunct,[status(thm)],[axiom_6]) ).
cnf(c_0_29,plain,
( cA_and_B(X1)
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,plain,
cA(ia),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_31,plain,
cA_and_B(ib),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_32,negated_conjecture,
( ib = esk3_0
| ia = esk3_0
| xsd_string(esk2_0)
| cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( ib = esk3_0
| ia = esk3_0
| xsd_integer(esk2_0)
| cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| esk3_0 != ia
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( xsd_integer(esk2_0)
| ib != esk3_0
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_23]) ).
cnf(c_0_36,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,plain,
cA_and_B(ia),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( ia = esk3_0
| xsd_string(esk2_0)
| cA_and_B(esk3_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( ia = esk3_0
| xsd_integer(esk2_0)
| cA_and_B(esk3_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( xsd_integer(esk2_0)
| ia != esk3_0
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_27]),c_0_28])]),c_0_23]) ).
cnf(c_0_41,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| esk3_0 != ib
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_42,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| esk3_0 != ia
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,negated_conjecture,
( ib != esk3_0
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_22])]),c_0_36]) ).
cnf(c_0_44,plain,
( X1 = ib
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_45,negated_conjecture,
( xsd_string(esk2_0)
| cA_and_B(esk3_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( xsd_integer(esk2_0)
| cA_and_B(esk3_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( ia != esk3_0
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_22])]),c_0_36]) ).
cnf(c_0_48,plain,
( X1 = ia
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_49,negated_conjecture,
( ib != esk3_0
| ~ xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_36]) ).
cnf(c_0_50,negated_conjecture,
( ia != esk3_0
| ~ xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_36]) ).
cnf(c_0_51,negated_conjecture,
( ~ xsd_string(esk2_0)
| ~ cB(esk3_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44])]),c_0_19]) ).
cnf(c_0_52,plain,
( cA(X1)
| cB(X1)
| ~ cA_and_B(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_53,negated_conjecture,
cA_and_B(esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_45]),c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( ~ xsd_string(esk2_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48])]),c_0_29]) ).
cnf(c_0_55,negated_conjecture,
( ~ xsd_integer(esk2_0)
| ~ cB(esk3_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_44])]),c_0_19]) ).
cnf(c_0_56,negated_conjecture,
( ~ xsd_integer(esk2_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48])]),c_0_29]) ).
cnf(c_0_57,negated_conjecture,
~ xsd_string(esk2_0),
inference(csr,[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]) ).
cnf(c_0_58,negated_conjecture,
~ xsd_integer(esk2_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_52]),c_0_53])]),c_0_56]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_24]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KRS175+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 13:33:20 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.geiPDmOZrL/E---3.1_16249.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 16327 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFSF00-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with 181s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with pid 16333 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFSF00-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 15
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 26
% 0.20/0.51 # Removed in clause preprocessing : 7
% 0.20/0.51 # Initial clauses in saturation : 19
% 0.20/0.51 # Processed clauses : 67
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 10
% 0.20/0.51 # ...remaining for further processing : 57
% 0.20/0.51 # Other redundant clauses eliminated : 10
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 12
% 0.20/0.51 # Backward-rewritten : 10
% 0.20/0.51 # Generated clauses : 80
% 0.20/0.51 # ...of the previous two non-redundant : 60
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 13
% 0.20/0.51 # Paramodulations : 70
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 10
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 48
% 0.20/0.51 # ...of those cached : 38
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 16
% 0.20/0.51 # Positive orientable unit clauses : 6
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 3
% 0.20/0.51 # Non-unit-clauses : 7
% 0.20/0.51 # Current number of unprocessed clauses: 24
% 0.20/0.51 # ...number of literals in the above : 73
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 39
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 257
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 173
% 0.20/0.51 # Non-unit clause-clause subsumptions : 27
% 0.20/0.51 # Unit Clause-clause subsumption calls : 27
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 4
% 0.20/0.51 # BW rewrite match successes : 4
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2071
% 0.20/0.51 # Search garbage collected termcells : 389
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.006 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.009 s
% 0.20/0.51 # Maximum resident set size: 1756 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.007 s
% 0.20/0.51 # System time : 0.006 s
% 0.20/0.51 # Total time : 0.013 s
% 0.20/0.51 # Maximum resident set size: 1704 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------