TSTP Solution File: SEU375+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU375+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:31:52 EDT 2023
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 25 unt; 0 def)
% Number of atoms : 212 ( 14 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 247 ( 94 ~; 83 |; 34 &)
% ( 1 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 83 ( 0 sgn; 55 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_yellow_6,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( ( ~ empty_carrier(X3)
& full_subnetstr(X3,X1,X2)
& subnetstr(X3,X1,X2) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( X4 = X6
& X5 = X7
& related(X2,X4,X5) )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',t21_yellow_6) ).
fof(t61_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( ( full_subrelstr(X2,X1)
& subrelstr(X2,X1) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( X5 = X3
& X6 = X4
& related(X1,X3,X4)
& in(X5,the_carrier(X2))
& in(X6,the_carrier(X2)) )
=> related(X2,X5,X6) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',t61_yellow_0) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',t1_subset) ).
fof(dt_l1_waybel_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',dt_l1_waybel_0) ).
fof(d9_yellow_6,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> ( full_subnetstr(X3,X1,X2)
<=> ( full_subrelstr(X3,X2)
& subrelstr(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',d9_yellow_6) ).
fof(dt_m1_yellow_6,axiom,
! [X1,X2] :
( ( one_sorted_str(X1)
& net_str(X2,X1) )
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> net_str(X3,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',dt_m1_yellow_6) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',t2_subset) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',fc1_struct_0) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p',dt_l1_orders_2) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( ( ~ empty_carrier(X3)
& full_subnetstr(X3,X1,X2)
& subnetstr(X3,X1,X2) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( X4 = X6
& X5 = X7
& related(X2,X4,X5) )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t21_yellow_6])]) ).
fof(c_0_10,plain,
! [X15,X16,X17,X18,X19,X20] :
( ~ rel_str(X15)
| ~ full_subrelstr(X16,X15)
| ~ subrelstr(X16,X15)
| ~ element(X17,the_carrier(X15))
| ~ element(X18,the_carrier(X15))
| ~ element(X19,the_carrier(X16))
| ~ element(X20,the_carrier(X16))
| X19 != X17
| X20 != X18
| ~ related(X15,X17,X18)
| ~ in(X19,the_carrier(X16))
| ~ in(X20,the_carrier(X16))
| related(X16,X19,X20) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_yellow_0])])]) ).
fof(c_0_11,plain,
! [X23,X24] :
( ~ in(X23,X24)
| element(X23,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_12,negated_conjecture,
( one_sorted_str(esk1_0)
& ~ empty_carrier(esk2_0)
& net_str(esk2_0,esk1_0)
& ~ empty_carrier(esk3_0)
& full_subnetstr(esk3_0,esk1_0,esk2_0)
& subnetstr(esk3_0,esk1_0,esk2_0)
& element(esk4_0,the_carrier(esk2_0))
& element(esk5_0,the_carrier(esk2_0))
& element(esk6_0,the_carrier(esk3_0))
& element(esk7_0,the_carrier(esk3_0))
& esk4_0 = esk6_0
& esk5_0 = esk7_0
& related(esk2_0,esk4_0,esk5_0)
& ~ related(esk3_0,esk6_0,esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_13,plain,
! [X38,X39] :
( ~ one_sorted_str(X38)
| ~ net_str(X39,X38)
| rel_str(X39) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_waybel_0])])]) ).
cnf(c_0_14,plain,
( related(X2,X5,X6)
| ~ rel_str(X1)
| ~ full_subrelstr(X2,X1)
| ~ subrelstr(X2,X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X4,the_carrier(X1))
| ~ element(X5,the_carrier(X2))
| ~ element(X6,the_carrier(X2))
| X5 != X3
| X6 != X4
| ~ related(X1,X3,X4)
| ~ in(X5,the_carrier(X2))
| ~ in(X6,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
related(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
element(esk5_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( rel_str(X2)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X34,X35,X36] :
( ( full_subrelstr(X36,X35)
| ~ full_subnetstr(X36,X34,X35)
| ~ subnetstr(X36,X34,X35)
| ~ net_str(X35,X34)
| ~ one_sorted_str(X34) )
& ( subrelstr(X36,X35)
| ~ full_subnetstr(X36,X34,X35)
| ~ subnetstr(X36,X34,X35)
| ~ net_str(X35,X34)
| ~ one_sorted_str(X34) )
& ( ~ full_subrelstr(X36,X35)
| ~ subrelstr(X36,X35)
| full_subnetstr(X36,X34,X35)
| ~ subnetstr(X36,X34,X35)
| ~ net_str(X35,X34)
| ~ one_sorted_str(X34) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_yellow_6])])])]) ).
fof(c_0_23,plain,
! [X28,X29,X30] :
( ~ one_sorted_str(X28)
| ~ net_str(X29,X28)
| ~ subnetstr(X30,X28,X29)
| net_str(X30,X28) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_6])])]) ).
cnf(c_0_24,plain,
( related(X1,X2,X3)
| ~ related(X4,X2,X3)
| ~ element(X3,the_carrier(X4))
| ~ element(X2,the_carrier(X4))
| ~ subrelstr(X1,X4)
| ~ full_subrelstr(X1,X4)
| ~ rel_str(X4)
| ~ in(X3,the_carrier(X1))
| ~ in(X2,the_carrier(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_15]),c_0_15])])]) ).
cnf(c_0_25,negated_conjecture,
related(esk2_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
element(esk7_0,the_carrier(esk2_0)),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_27,negated_conjecture,
element(esk4_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_29,plain,
( full_subrelstr(X1,X2)
| ~ full_subnetstr(X1,X3,X2)
| ~ subnetstr(X1,X3,X2)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
full_subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,plain,
( subrelstr(X1,X2)
| ~ full_subnetstr(X1,X3,X2)
| ~ subnetstr(X1,X3,X2)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
~ related(esk3_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
esk4_0 = esk6_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_35,plain,
! [X25,X26] :
( ~ element(X25,X26)
| empty(X26)
| in(X25,X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_36,negated_conjecture,
element(esk6_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,plain,
( net_str(X3,X1)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ subnetstr(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_38,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
cnf(c_0_39,negated_conjecture,
( related(X1,esk4_0,esk7_0)
| ~ subrelstr(X1,esk2_0)
| ~ full_subrelstr(X1,esk2_0)
| ~ in(esk7_0,the_carrier(X1))
| ~ in(esk4_0,the_carrier(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_40,negated_conjecture,
full_subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_20]),c_0_21])]) ).
cnf(c_0_41,negated_conjecture,
subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_31]),c_0_20]),c_0_21])]) ).
cnf(c_0_42,negated_conjecture,
~ related(esk3_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,negated_conjecture,
element(esk7_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
element(esk4_0,the_carrier(esk3_0)),
inference(rw,[status(thm)],[c_0_36,c_0_34]) ).
fof(c_0_46,plain,
! [X42] :
( ~ rel_str(X42)
| one_sorted_str(X42) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])]) ).
cnf(c_0_47,negated_conjecture,
net_str(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_20]),c_0_21])]) ).
fof(c_0_48,plain,
! [X27] :
( empty_carrier(X27)
| ~ one_sorted_str(X27)
| ~ empty(the_carrier(X27)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])]) ).
cnf(c_0_49,negated_conjecture,
( ~ in(esk7_0,the_carrier(esk3_0))
| ~ in(esk4_0,the_carrier(esk3_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( empty(the_carrier(esk3_0))
| in(esk7_0,the_carrier(esk3_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( empty(the_carrier(esk3_0))
| in(esk4_0,the_carrier(esk3_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_45]) ).
cnf(c_0_52,plain,
( one_sorted_str(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
rel_str(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_21])]) ).
cnf(c_0_54,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,negated_conjecture,
empty(the_carrier(esk3_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_56,negated_conjecture,
one_sorted_str(esk3_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
~ empty_carrier(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SEU375+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n015.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 09:46:30 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.AXHbX4Cpi7/E---3.1_10801.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 10889 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.16/0.45 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 10892 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 40
% 0.16/0.45 # Removed by relevancy pruning/SinE : 17
% 0.16/0.45 # Initial clauses : 41
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 41
% 0.16/0.45 # Processed clauses : 174
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 28
% 0.16/0.45 # ...remaining for further processing : 146
% 0.16/0.45 # Other redundant clauses eliminated : 2
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 4
% 0.16/0.45 # Generated clauses : 189
% 0.16/0.45 # ...of the previous two non-redundant : 176
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 3
% 0.16/0.45 # Paramodulations : 188
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 2
% 0.16/0.45 # Total rewrite steps : 59
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 100
% 0.16/0.45 # Positive orientable unit clauses : 43
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 5
% 0.16/0.45 # Non-unit-clauses : 52
% 0.16/0.45 # Current number of unprocessed clauses: 81
% 0.16/0.45 # ...number of literals in the above : 297
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 45
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 555
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 302
% 0.16/0.45 # Non-unit clause-clause subsumptions : 31
% 0.16/0.45 # Unit Clause-clause subsumption calls : 16
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 5
% 0.16/0.45 # BW rewrite match successes : 1
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 4575
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.011 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.013 s
% 0.16/0.45 # Maximum resident set size: 1884 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.012 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.016 s
% 0.16/0.45 # Maximum resident set size: 1732 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------