TSTP Solution File: KRS143+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS143+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : Mon May 20 23:16:33 EDT 2024
% Result : Theorem 0.12s 0.34s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 55 ( 9 unt; 0 def)
% Number of atoms : 210 ( 18 equ)
% Maximal formula atoms : 46 ( 3 avg)
% Number of connectives : 243 ( 88 ~; 122 |; 22 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 53 ( 16 sgn 25 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( cc(X4)
=> ( ? [X5] : rp(X4,X5)
& ! [X5,X6] :
( ( rp(X4,X5)
& rp(X4,X6) )
=> X5 = X6 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(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_2,axiom,
! [X4] :
( cc(X4)
=> ? [X5] : rp(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4] :
( cc(X4)
=> ! [X5,X6] :
( ( rp(X4,X5)
& rp(X4,X6) )
=> X5 = X6 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(c_0_5,negated_conjecture,
~ ( ! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( cc(X4)
=> ( ? [X5] : rp(X4,X5)
& ! [X5,X6] :
( ( rp(X4,X5)
& rp(X4,X6) )
=> X5 = X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_6,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_7,plain,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_8,negated_conjecture,
! [X10] :
( ( cc(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rp(esk3_0,esk4_0)
| ~ rp(esk3_0,X10)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rp(esk3_0,esk5_0)
| ~ rp(esk3_0,X10)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( esk4_0 != esk5_0
| ~ rp(esk3_0,X10)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( cc(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rp(esk3_0,esk4_0)
| ~ rp(esk3_0,X10)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rp(esk3_0,esk5_0)
| ~ rp(esk3_0,X10)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( esk4_0 != esk5_0
| ~ rp(esk3_0,X10)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) ) ),
inference(distribute,[status(thm)],[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_5])])])])])]) ).
fof(c_0_9,plain,
! [X33] :
( cowlThing(X33)
& ~ cowlNothing(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_10,plain,
! [X28] :
( ( ~ xsd_string(X28)
| ~ xsd_integer(X28) )
& ( xsd_integer(X28)
| xsd_string(X28) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,negated_conjecture,
( cc(esk3_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( rp(esk3_0,esk4_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ rp(esk3_0,X1)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X19] :
( ~ cc(X19)
| rp(X19,esk6_1(X19)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])]) ).
cnf(c_0_17,negated_conjecture,
( xsd_integer(esk2_0)
| cc(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( cc(esk3_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( xsd_integer(esk2_0)
| rp(esk3_0,esk4_0)
| ~ rp(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12])]),c_0_13]),c_0_15]) ).
cnf(c_0_20,plain,
( rp(X1,esk6_1(X1))
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( xsd_integer(esk2_0)
| cc(esk3_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( rp(esk3_0,esk4_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ rp(esk3_0,X1)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( xsd_string(esk2_0)
| cc(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_12])]),c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( xsd_integer(esk2_0)
| rp(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( xsd_string(esk2_0)
| rp(esk3_0,esk4_0)
| ~ rp(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_12])]),c_0_13]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( xsd_string(esk2_0)
| rp(esk3_0,esk4_0)
| cc(esk3_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( rp(esk3_0,esk5_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ rp(esk3_0,X1)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_28,plain,
! [X21,X22,X23] :
( ~ cc(X21)
| ~ rp(X21,X22)
| ~ rp(X21,X23)
| X22 = X23 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_29,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( xsd_string(esk2_0)
| rp(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( rp(esk3_0,esk5_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ rp(esk3_0,X1)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,negated_conjecture,
( xsd_integer(esk2_0)
| rp(esk3_0,esk5_0)
| ~ rp(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_12])]),c_0_13]),c_0_15]) ).
cnf(c_0_33,plain,
( X2 = X3
| ~ cc(X1)
| ~ rp(X1,X2)
| ~ rp(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
rp(esk3_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( xsd_string(esk2_0)
| rp(esk3_0,esk5_0)
| ~ rp(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_12])]),c_0_13]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( X1 = esk4_0
| ~ rp(esk3_0,X1)
| ~ cc(esk3_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( xsd_string(esk2_0)
| rp(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( xsd_integer(esk2_0)
| rp(esk3_0,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_21]) ).
cnf(c_0_39,negated_conjecture,
( X1 = esk4_0
| xsd_integer(esk2_0)
| ~ rp(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_40,negated_conjecture,
rp(esk3_0,esk5_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_37]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| esk4_0 != esk5_0
| ~ rp(esk3_0,X1)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_42,negated_conjecture,
( esk5_0 = esk4_0
| xsd_integer(esk2_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| esk4_0 != esk5_0
| ~ rp(esk3_0,X1)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_44,negated_conjecture,
( xsd_integer(esk2_0)
| esk5_0 != esk4_0
| ~ rp(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_12])]),c_0_13]),c_0_15]) ).
cnf(c_0_45,negated_conjecture,
( esk5_0 = esk4_0
| xsd_string(esk2_0)
| cc(esk3_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( xsd_string(esk2_0)
| esk5_0 != esk4_0
| ~ rp(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_12])]),c_0_13]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( X1 = esk4_0
| xsd_string(esk2_0)
| ~ rp(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_45]),c_0_46]) ).
cnf(c_0_48,negated_conjecture,
( esk5_0 = esk4_0
| xsd_string(esk2_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_40]) ).
cnf(c_0_49,negated_conjecture,
esk5_0 = esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_48]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( xsd_string(esk2_0)
| ~ rp(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_49])]) ).
cnf(c_0_51,negated_conjecture,
xsd_string(esk2_0),
inference(spm,[status(thm)],[c_0_50,c_0_34]) ).
cnf(c_0_52,negated_conjecture,
~ xsd_integer(esk2_0),
inference(spm,[status(thm)],[c_0_29,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
~ rp(esk3_0,X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_49])]),c_0_52]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_34,c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.08 % Problem : KRS143+1 : TPTP v8.2.0. Released v3.1.0.
% 0.06/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n023.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sat May 18 21:56:37 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.12/0.33 Running first-order theorem proving
% 0.12/0.33 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.12/0.34 # Version: 3.1.0
% 0.12/0.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.34 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.34 # Starting sh5l with 300s (1) cores
% 0.12/0.34 # new_bool_3 with pid 14080 completed with status 0
% 0.12/0.34 # Result found by new_bool_3
% 0.12/0.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.34 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.34 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.12/0.34 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.34 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.12/0.34 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 14084 completed with status 0
% 0.12/0.34 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.12/0.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.34 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.34 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.12/0.34 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.34 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.12/0.34 # Preprocessing time : 0.001 s
% 0.12/0.34 # Presaturation interreduction done
% 0.12/0.34
% 0.12/0.34 # Proof found!
% 0.12/0.34 # SZS status Theorem
% 0.12/0.34 # SZS output start CNFRefutation
% See solution above
% 0.12/0.34 # Parsed axioms : 12
% 0.12/0.34 # Removed by relevancy pruning/SinE : 0
% 0.12/0.34 # Initial clauses : 21
% 0.12/0.34 # Removed in clause preprocessing : 7
% 0.12/0.34 # Initial clauses in saturation : 14
% 0.12/0.34 # Processed clauses : 63
% 0.12/0.34 # ...of these trivial : 0
% 0.12/0.34 # ...subsumed : 5
% 0.12/0.34 # ...remaining for further processing : 58
% 0.12/0.34 # Other redundant clauses eliminated : 0
% 0.12/0.34 # Clauses deleted for lack of memory : 0
% 0.12/0.34 # Backward-subsumed : 11
% 0.12/0.34 # Backward-rewritten : 17
% 0.12/0.34 # Generated clauses : 44
% 0.12/0.34 # ...of the previous two non-redundant : 46
% 0.12/0.34 # ...aggressively subsumed : 0
% 0.12/0.34 # Contextual simplify-reflections : 13
% 0.12/0.34 # Paramodulations : 41
% 0.12/0.34 # Factorizations : 0
% 0.12/0.34 # NegExts : 0
% 0.12/0.34 # Equation resolutions : 0
% 0.12/0.34 # Disequality decompositions : 0
% 0.12/0.34 # Total rewrite steps : 31
% 0.12/0.34 # ...of those cached : 25
% 0.12/0.34 # Propositional unsat checks : 0
% 0.12/0.34 # Propositional check models : 0
% 0.12/0.34 # Propositional check unsatisfiable : 0
% 0.12/0.34 # Propositional clauses : 0
% 0.12/0.34 # Propositional clauses after purity: 0
% 0.12/0.34 # Propositional unsat core size : 0
% 0.12/0.34 # Propositional preprocessing time : 0.000
% 0.12/0.34 # Propositional encoding time : 0.000
% 0.12/0.34 # Propositional solver time : 0.000
% 0.12/0.34 # Success case prop preproc time : 0.000
% 0.12/0.34 # Success case prop encoding time : 0.000
% 0.12/0.34 # Success case prop solver time : 0.000
% 0.12/0.34 # Current number of processed clauses : 13
% 0.12/0.34 # Positive orientable unit clauses : 5
% 0.12/0.34 # Positive unorientable unit clauses: 0
% 0.12/0.34 # Negative unit clauses : 3
% 0.12/0.34 # Non-unit-clauses : 5
% 0.12/0.34 # Current number of unprocessed clauses: 9
% 0.12/0.34 # ...number of literals in the above : 22
% 0.12/0.34 # Current number of archived formulas : 0
% 0.12/0.34 # Current number of archived clauses : 45
% 0.12/0.34 # Clause-clause subsumption calls (NU) : 166
% 0.12/0.34 # Rec. Clause-clause subsumption calls : 135
% 0.12/0.34 # Non-unit clause-clause subsumptions : 28
% 0.12/0.34 # Unit Clause-clause subsumption calls : 17
% 0.12/0.34 # Rewrite failures with RHS unbound : 0
% 0.12/0.34 # BW rewrite match attempts : 5
% 0.12/0.34 # BW rewrite match successes : 5
% 0.12/0.34 # Condensation attempts : 0
% 0.12/0.34 # Condensation successes : 0
% 0.12/0.34 # Termbank termtop insertions : 1956
% 0.12/0.34 # Search garbage collected termcells : 361
% 0.12/0.34
% 0.12/0.34 # -------------------------------------------------
% 0.12/0.34 # User time : 0.002 s
% 0.12/0.34 # System time : 0.003 s
% 0.12/0.34 # Total time : 0.005 s
% 0.12/0.34 # Maximum resident set size: 1708 pages
% 0.12/0.34
% 0.12/0.34 # -------------------------------------------------
% 0.12/0.34 # User time : 0.002 s
% 0.12/0.34 # System time : 0.005 s
% 0.12/0.34 # Total time : 0.007 s
% 0.12/0.34 # Maximum resident set size: 1752 pages
% 0.12/0.34 % E---3.1 exiting
% 0.12/0.34 % E exiting
%------------------------------------------------------------------------------