TSTP Solution File: SWV391+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV391+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:44:31 EDT 2023
% Result : Theorem 0.93s 0.65s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 11 unt; 0 def)
% Number of atoms : 141 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 139 ( 52 ~; 60 |; 13 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 152 ( 24 sgn; 79 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',ax40) ).
fof(ax45,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',ax45) ).
fof(l27_l33,lemma,
! [X1,X2,X3,X4] :
( ok(remove_cpq(triple(X1,X2,X3),X4))
=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',l27_l33) ).
fof(l27_co,conjecture,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',l27_co) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',totality) ).
fof(l27_li4142,lemma,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',l27_li4142) ).
fof(ax44,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',ax44) ).
fof(l27_li2829,lemma,
! [X1,X2,X3] :
( pair_in_list(X1,X2,X3)
=> ! [X4] :
( contains_slb(X1,X4)
=> ( pair_in_list(remove_slb(X1,X4),X2,X3)
| X2 = X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',l27_li2829) ).
fof(l27_l30,lemma,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> ! [X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.kYRboHiANL/E---3.1_27260.p',l27_l30) ).
fof(c_0_10,plain,
! [X1,X2] : ~ ok(triple(X1,X2,bad)),
inference(fof_simplification,[status(thm)],[ax40]) ).
fof(c_0_11,plain,
! [X37,X38] : ~ ok(triple(X37,X38,bad)),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X71,X72,X73,X74] :
( ~ contains_slb(X72,X74)
| ~ strictly_less_than(X74,lookup_slb(X72,X74))
| remove_cpq(triple(X71,X72,X73),X74) = triple(remove_pqp(X71,X74),remove_slb(X72,X74),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
fof(c_0_13,lemma,
! [X60,X61,X62,X63] :
( ~ ok(remove_cpq(triple(X60,X61,X62),X63))
| contains_slb(X61,X63) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_l33])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
inference(assume_negation,[status(cth)],[l27_co]) ).
fof(c_0_15,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
cnf(c_0_16,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad)
| ~ contains_slb(X1,X2)
| ~ strictly_less_than(X2,lookup_slb(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,lemma,
( contains_slb(X2,X4)
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,negated_conjecture,
( check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))
& ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_20,plain,
! [X119,X120] :
( ( less_than(X119,X120)
| ~ strictly_less_than(X119,X120) )
& ( ~ less_than(X120,X119)
| ~ strictly_less_than(X119,X120) )
& ( ~ less_than(X119,X120)
| less_than(X120,X119)
| strictly_less_than(X119,X120) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_21,plain,
! [X116,X117] :
( less_than(X116,X117)
| less_than(X117,X116) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_22,lemma,
! [X22,X23,X24,X25,X26,X27,X28,X31] :
( ( ~ check_cpq(triple(X22,X23,X24))
| ~ pair_in_list(X23,X25,X26)
| less_than(X26,X25) )
& ( pair_in_list(X28,esk5_2(X27,X28),esk6_2(X27,X28))
| check_cpq(triple(X27,X28,X31)) )
& ( ~ less_than(esk6_2(X27,X28),esk5_2(X27,X28))
| check_cpq(triple(X27,X28,X31)) ) ),
inference(distribute,[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)],[l27_li4142])])])])])]) ).
fof(c_0_23,plain,
! [X67,X68,X69,X70] :
( ~ contains_slb(X68,X70)
| ~ less_than(lookup_slb(X68,X70),X70)
| remove_cpq(triple(X67,X68,X69),X70) = triple(remove_pqp(X67,X70),remove_slb(X68,X70),X69) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])]) ).
cnf(c_0_24,plain,
( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,lemma,
! [X122,X123,X124,X125] :
( ~ pair_in_list(X122,X123,X124)
| ~ contains_slb(X122,X125)
| pair_in_list(remove_slb(X122,X125),X123,X124)
| X123 = X125 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_li2829])])]) ).
cnf(c_0_29,lemma,
( less_than(X5,X4)
| ~ check_cpq(triple(X1,X2,X3))
| ~ pair_in_list(X2,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4)
| ~ contains_slb(X1,X2)
| ~ less_than(lookup_slb(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
~ strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,lemma,
( pair_in_list(remove_slb(X1,X4),X2,X3)
| X2 = X4
| ~ pair_in_list(X1,X2,X3)
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,lemma,
( pair_in_list(X1,esk5_2(X2,X1),esk6_2(X2,X1))
| check_cpq(triple(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,lemma,
( less_than(X1,X2)
| ~ check_cpq(remove_cpq(triple(X3,X4,X5),X6))
| ~ pair_in_list(remove_slb(X4,X6),X2,X1)
| ~ contains_slb(X4,X6)
| ~ less_than(lookup_slb(X4,X6),X6) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
check_cpq(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_37,negated_conjecture,
contains_slb(esk2_0,esk4_0),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_38,negated_conjecture,
less_than(lookup_slb(esk2_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,lemma,
( esk5_2(X1,X2) = X3
| check_cpq(triple(X1,X2,X4))
| pair_in_list(remove_slb(X2,X3),esk5_2(X1,X2),esk6_2(X1,X2))
| ~ contains_slb(X2,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(remove_slb(esk2_0,esk4_0),X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
( esk5_2(X1,esk2_0) = esk4_0
| check_cpq(triple(X1,esk2_0,X2))
| pair_in_list(remove_slb(esk2_0,esk4_0),esk5_2(X1,esk2_0),esk6_2(X1,esk2_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_42,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk6_2(X1,X2),esk5_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_43,lemma,
! [X32,X33,X34,X35,X36] :
( ~ check_cpq(remove_cpq(triple(X32,X33,X34),X35))
| ~ ok(remove_cpq(triple(X32,X33,X34),X35))
| ~ pair_in_list(X33,X35,X36)
| less_than(X36,X35) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_l30])])]) ).
cnf(c_0_44,negated_conjecture,
( esk5_2(X1,esk2_0) = esk4_0
| check_cpq(triple(X1,esk2_0,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,lemma,
( less_than(X5,X4)
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ pair_in_list(X2,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,lemma,
( check_cpq(triple(X1,esk2_0,X2))
| check_cpq(triple(X1,esk2_0,X3))
| pair_in_list(esk2_0,esk4_0,esk6_2(X1,esk2_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_44]) ).
cnf(c_0_47,lemma,
( check_cpq(triple(X1,esk2_0,X2))
| check_cpq(triple(X1,esk2_0,X3))
| ~ less_than(esk6_2(X1,esk2_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( less_than(X1,esk4_0)
| ~ pair_in_list(esk2_0,esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_25]),c_0_36])]) ).
cnf(c_0_49,lemma,
( check_cpq(triple(X1,esk2_0,X2))
| pair_in_list(esk2_0,esk4_0,esk6_2(X1,esk2_0)) ),
inference(ef,[status(thm)],[c_0_46]) ).
cnf(c_0_50,lemma,
( check_cpq(triple(X1,esk2_0,X2))
| ~ less_than(esk6_2(X1,esk2_0),esk4_0) ),
inference(ef,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_52,negated_conjecture,
check_cpq(triple(X1,esk2_0,X2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : SWV391+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n021.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Tue Oct 3 04:10:29 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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/tmp/tmp.kYRboHiANL/E---3.1_27260.p
% 0.93/0.65 # Version: 3.1pre001
% 0.93/0.65 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.65 # Starting sh5l with 300s (1) cores
% 0.93/0.65 # sh5l with pid 27341 completed with status 0
% 0.93/0.65 # Result found by sh5l
% 0.93/0.65 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.65 # Starting sh5l with 300s (1) cores
% 0.93/0.65 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.93/0.65 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.93/0.65 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.93/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.93/0.65 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 27346 completed with status 0
% 0.93/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.93/0.65 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.65 # Starting sh5l with 300s (1) cores
% 0.93/0.65 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.93/0.65 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.93/0.65 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.93/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.93/0.65 # Preprocessing time : 0.002 s
% 0.93/0.65 # Presaturation interreduction done
% 0.93/0.65
% 0.93/0.65 # Proof found!
% 0.93/0.65 # SZS status Theorem
% 0.93/0.65 # SZS output start CNFRefutation
% See solution above
% 0.93/0.65 # Parsed axioms : 46
% 0.93/0.65 # Removed by relevancy pruning/SinE : 3
% 0.93/0.65 # Initial clauses : 55
% 0.93/0.65 # Removed in clause preprocessing : 0
% 0.93/0.65 # Initial clauses in saturation : 55
% 0.93/0.65 # Processed clauses : 733
% 0.93/0.65 # ...of these trivial : 2
% 0.93/0.65 # ...subsumed : 349
% 0.93/0.65 # ...remaining for further processing : 382
% 0.93/0.65 # Other redundant clauses eliminated : 8
% 0.93/0.65 # Clauses deleted for lack of memory : 0
% 0.93/0.65 # Backward-subsumed : 35
% 0.93/0.65 # Backward-rewritten : 2
% 0.93/0.65 # Generated clauses : 4411
% 0.93/0.65 # ...of the previous two non-redundant : 4113
% 0.93/0.65 # ...aggressively subsumed : 0
% 0.93/0.65 # Contextual simplify-reflections : 8
% 0.93/0.65 # Paramodulations : 4334
% 0.93/0.65 # Factorizations : 70
% 0.93/0.65 # NegExts : 0
% 0.93/0.65 # Equation resolutions : 8
% 0.93/0.65 # Total rewrite steps : 510
% 0.93/0.65 # Propositional unsat checks : 0
% 0.93/0.65 # Propositional check models : 0
% 0.93/0.65 # Propositional check unsatisfiable : 0
% 0.93/0.65 # Propositional clauses : 0
% 0.93/0.65 # Propositional clauses after purity: 0
% 0.93/0.65 # Propositional unsat core size : 0
% 0.93/0.65 # Propositional preprocessing time : 0.000
% 0.93/0.65 # Propositional encoding time : 0.000
% 0.93/0.65 # Propositional solver time : 0.000
% 0.93/0.65 # Success case prop preproc time : 0.000
% 0.93/0.65 # Success case prop encoding time : 0.000
% 0.93/0.65 # Success case prop solver time : 0.000
% 0.93/0.65 # Current number of processed clauses : 288
% 0.93/0.65 # Positive orientable unit clauses : 24
% 0.93/0.65 # Positive unorientable unit clauses: 0
% 0.93/0.65 # Negative unit clauses : 24
% 0.93/0.65 # Non-unit-clauses : 240
% 0.93/0.65 # Current number of unprocessed clauses: 3371
% 0.93/0.65 # ...number of literals in the above : 14885
% 0.93/0.65 # Current number of archived formulas : 0
% 0.93/0.65 # Current number of archived clauses : 92
% 0.93/0.65 # Clause-clause subsumption calls (NU) : 11161
% 0.93/0.65 # Rec. Clause-clause subsumption calls : 6227
% 0.93/0.65 # Non-unit clause-clause subsumptions : 325
% 0.93/0.65 # Unit Clause-clause subsumption calls : 211
% 0.93/0.65 # Rewrite failures with RHS unbound : 0
% 0.93/0.65 # BW rewrite match attempts : 19
% 0.93/0.65 # BW rewrite match successes : 3
% 0.93/0.65 # Condensation attempts : 0
% 0.93/0.65 # Condensation successes : 0
% 0.93/0.65 # Termbank termtop insertions : 72661
% 0.93/0.65
% 0.93/0.65 # -------------------------------------------------
% 0.93/0.65 # User time : 0.093 s
% 0.93/0.65 # System time : 0.005 s
% 0.93/0.65 # Total time : 0.098 s
% 0.93/0.65 # Maximum resident set size: 2040 pages
% 0.93/0.65
% 0.93/0.65 # -------------------------------------------------
% 0.93/0.65 # User time : 0.095 s
% 0.93/0.65 # System time : 0.007 s
% 0.93/0.65 # Total time : 0.102 s
% 0.93/0.65 # Maximum resident set size: 1732 pages
% 0.93/0.65 % E---3.1 exiting
% 0.93/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------