TSTP Solution File: SEU375+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU375+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:26:13 EDT 2023
% Result : Theorem 59.73s 8.20s
% Output : CNFRefutation 59.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 26 unt; 0 def)
% Number of atoms : 228 ( 14 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 270 ( 100 ~; 89 |; 38 &)
% ( 6 <=>; 37 =>; 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 : 85 ( 0 sgn; 56 !; 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/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',t21_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/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',dt_m1_yellow_6) ).
fof(d1_struct_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( empty_carrier(X1)
<=> empty(the_carrier(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',d1_struct_0) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',dt_l1_orders_2) ).
fof(dt_l1_waybel_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',dt_l1_waybel_0) ).
fof(t61_yellow_0,lemma,
! [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/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',t61_yellow_0) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',t1_subset) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',d2_subset_1) ).
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/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p',d9_yellow_6) ).
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,
! [X39,X40,X41] :
( ~ one_sorted_str(X39)
| ~ net_str(X40,X39)
| ~ subnetstr(X41,X39,X40)
| net_str(X41,X39) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_6])])]) ).
fof(c_0_11,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_12,plain,
! [X62] :
( ( ~ empty_carrier(X62)
| empty(the_carrier(X62))
| ~ one_sorted_str(X62) )
& ( ~ empty(the_carrier(X62))
| empty_carrier(X62)
| ~ one_sorted_str(X62) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_struct_0])])]) ).
fof(c_0_13,plain,
! [X63] :
( ~ rel_str(X63)
| one_sorted_str(X63) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])]) ).
fof(c_0_14,plain,
! [X58,X59] :
( ~ one_sorted_str(X58)
| ~ net_str(X59,X58)
| rel_str(X59) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_waybel_0])])]) ).
cnf(c_0_15,plain,
( net_str(X3,X1)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ subnetstr(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,lemma,
! [X136,X137,X138,X139,X140,X141] :
( ~ rel_str(X136)
| ~ full_subrelstr(X137,X136)
| ~ subrelstr(X137,X136)
| ~ element(X138,the_carrier(X136))
| ~ element(X139,the_carrier(X136))
| ~ element(X140,the_carrier(X137))
| ~ element(X141,the_carrier(X137))
| X140 != X138
| X141 != X139
| ~ related(X136,X138,X139)
| ~ in(X140,the_carrier(X137))
| ~ in(X141,the_carrier(X137))
| related(X137,X140,X141) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_yellow_0])])]) ).
fof(c_0_20,plain,
! [X37,X38] :
( ~ in(X37,X38)
| element(X37,X38) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_21,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
cnf(c_0_22,plain,
( empty_carrier(X1)
| ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( one_sorted_str(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
( rel_str(X2)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,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_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_26,lemma,
( 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_19]) ).
cnf(c_0_27,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
related(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
element(esk5_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
! [X55,X56,X57] :
( ( full_subrelstr(X57,X56)
| ~ full_subnetstr(X57,X55,X56)
| ~ subnetstr(X57,X55,X56)
| ~ net_str(X56,X55)
| ~ one_sorted_str(X55) )
& ( subrelstr(X57,X56)
| ~ full_subnetstr(X57,X55,X56)
| ~ subnetstr(X57,X55,X56)
| ~ net_str(X56,X55)
| ~ one_sorted_str(X55) )
& ( ~ full_subrelstr(X57,X56)
| ~ subrelstr(X57,X56)
| full_subnetstr(X57,X55,X56)
| ~ subnetstr(X57,X55,X56)
| ~ net_str(X56,X55)
| ~ one_sorted_str(X55) ) ),
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_32,plain,
! [X144,X145] :
( ( ~ element(X145,X144)
| in(X145,X144)
| empty(X144) )
& ( ~ in(X145,X144)
| element(X145,X144)
| empty(X144) )
& ( ~ element(X145,X144)
| empty(X145)
| ~ empty(X144) )
& ( ~ empty(X145)
| element(X145,X144)
| ~ empty(X144) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_33,negated_conjecture,
~ empty_carrier(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,plain,
( empty_carrier(X1)
| ~ empty(the_carrier(X1))
| ~ rel_str(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_35,negated_conjecture,
rel_str(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18])]) ).
cnf(c_0_36,negated_conjecture,
element(esk6_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_37,negated_conjecture,
esk4_0 = esk6_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_38,lemma,
( related(X1,X2,X3)
| ~ full_subrelstr(X1,X4)
| ~ subrelstr(X1,X4)
| ~ related(X4,X2,X3)
| ~ element(X3,the_carrier(X4))
| ~ element(X2,the_carrier(X4))
| ~ in(X3,the_carrier(X1))
| ~ in(X2,the_carrier(X1))
| ~ rel_str(X4) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_26,c_0_27]),c_0_27])])]) ).
cnf(c_0_39,negated_conjecture,
related(esk2_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_40,negated_conjecture,
element(esk7_0,the_carrier(esk2_0)),
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_41,negated_conjecture,
element(esk4_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_18])]) ).
cnf(c_0_43,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_31]) ).
cnf(c_0_44,negated_conjecture,
full_subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_45,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_31]) ).
cnf(c_0_46,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_47,negated_conjecture,
element(esk7_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_48,negated_conjecture,
~ empty(the_carrier(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_49,negated_conjecture,
element(esk4_0,the_carrier(esk3_0)),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_50,negated_conjecture,
~ related(esk3_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_51,negated_conjecture,
( related(X1,esk4_0,esk7_0)
| ~ full_subrelstr(X1,esk2_0)
| ~ 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_38,c_0_39]),c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_52,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_43,c_0_44]),c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_53,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_45,c_0_44]),c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_54,negated_conjecture,
in(esk7_0,the_carrier(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_55,negated_conjecture,
in(esk4_0,the_carrier(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_49]),c_0_48]) ).
cnf(c_0_56,negated_conjecture,
~ related(esk3_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_50,c_0_37]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54]),c_0_55])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SEU375+2 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 09:07:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.56 Running first-order theorem proving
% 0.21/0.56 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.vDJDSV3hxM/E---3.1_26786.p
% 59.73/8.20 # Version: 3.1pre001
% 59.73/8.20 # Preprocessing class: FSLMSMSSSSSNFFN.
% 59.73/8.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.73/8.20 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 59.73/8.20 # Starting new_bool_3 with 600s (2) cores
% 59.73/8.20 # Starting new_bool_1 with 600s (2) cores
% 59.73/8.20 # Starting sh5l with 300s (1) cores
% 59.73/8.20 # new_bool_1 with pid 26970 completed with status 0
% 59.73/8.20 # Result found by new_bool_1
% 59.73/8.20 # Preprocessing class: FSLMSMSSSSSNFFN.
% 59.73/8.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.73/8.20 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 59.73/8.20 # Starting new_bool_3 with 600s (2) cores
% 59.73/8.20 # Starting new_bool_1 with 600s (2) cores
% 59.73/8.20 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 59.73/8.20 # Search class: FGHSM-FSLM31-SFFFFFNN
% 59.73/8.20 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 59.73/8.20 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 325s (1) cores
% 59.73/8.20 # Starting new_bool_1 with 61s (1) cores
% 59.73/8.20 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 26978 completed with status 0
% 59.73/8.20 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 59.73/8.20 # Preprocessing class: FSLMSMSSSSSNFFN.
% 59.73/8.20 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.73/8.20 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 59.73/8.20 # Starting new_bool_3 with 600s (2) cores
% 59.73/8.20 # Starting new_bool_1 with 600s (2) cores
% 59.73/8.20 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 59.73/8.20 # Search class: FGHSM-FSLM31-SFFFFFNN
% 59.73/8.20 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 59.73/8.20 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 325s (1) cores
% 59.73/8.20 # Preprocessing time : 0.006 s
% 59.73/8.20
% 59.73/8.20 # Proof found!
% 59.73/8.20 # SZS status Theorem
% 59.73/8.20 # SZS output start CNFRefutation
% See solution above
% 59.73/8.20 # Parsed axioms : 769
% 59.73/8.20 # Removed by relevancy pruning/SinE : 686
% 59.73/8.20 # Initial clauses : 284
% 59.73/8.20 # Removed in clause preprocessing : 2
% 59.73/8.20 # Initial clauses in saturation : 282
% 59.73/8.20 # Processed clauses : 6851
% 59.73/8.20 # ...of these trivial : 25
% 59.73/8.20 # ...subsumed : 3970
% 59.73/8.20 # ...remaining for further processing : 2856
% 59.73/8.20 # Other redundant clauses eliminated : 46
% 59.73/8.20 # Clauses deleted for lack of memory : 0
% 59.73/8.20 # Backward-subsumed : 58
% 59.73/8.20 # Backward-rewritten : 13
% 59.73/8.20 # Generated clauses : 222625
% 59.73/8.20 # ...of the previous two non-redundant : 220134
% 59.73/8.20 # ...aggressively subsumed : 0
% 59.73/8.20 # Contextual simplify-reflections : 331
% 59.73/8.20 # Paramodulations : 222495
% 59.73/8.20 # Factorizations : 6
% 59.73/8.20 # NegExts : 0
% 59.73/8.20 # Equation resolutions : 127
% 59.73/8.20 # Total rewrite steps : 8161
% 59.73/8.20 # Propositional unsat checks : 0
% 59.73/8.20 # Propositional check models : 0
% 59.73/8.20 # Propositional check unsatisfiable : 0
% 59.73/8.20 # Propositional clauses : 0
% 59.73/8.20 # Propositional clauses after purity: 0
% 59.73/8.20 # Propositional unsat core size : 0
% 59.73/8.20 # Propositional preprocessing time : 0.000
% 59.73/8.20 # Propositional encoding time : 0.000
% 59.73/8.20 # Propositional solver time : 0.000
% 59.73/8.20 # Success case prop preproc time : 0.000
% 59.73/8.20 # Success case prop encoding time : 0.000
% 59.73/8.20 # Success case prop solver time : 0.000
% 59.73/8.20 # Current number of processed clauses : 2744
% 59.73/8.20 # Positive orientable unit clauses : 72
% 59.73/8.20 # Positive unorientable unit clauses: 0
% 59.73/8.20 # Negative unit clauses : 45
% 59.73/8.20 # Non-unit-clauses : 2627
% 59.73/8.20 # Current number of unprocessed clauses: 213348
% 59.73/8.20 # ...number of literals in the above : 2108581
% 59.73/8.20 # Current number of archived formulas : 0
% 59.73/8.20 # Current number of archived clauses : 71
% 59.73/8.20 # Clause-clause subsumption calls (NU) : 2836673
% 59.73/8.20 # Rec. Clause-clause subsumption calls : 215128
% 59.73/8.20 # Non-unit clause-clause subsumptions : 2594
% 59.73/8.20 # Unit Clause-clause subsumption calls : 9555
% 59.73/8.20 # Rewrite failures with RHS unbound : 0
% 59.73/8.20 # BW rewrite match attempts : 71
% 59.73/8.20 # BW rewrite match successes : 6
% 59.73/8.20 # Condensation attempts : 0
% 59.73/8.20 # Condensation successes : 0
% 59.73/8.20 # Termbank termtop insertions : 8839027
% 59.73/8.20
% 59.73/8.20 # -------------------------------------------------
% 59.73/8.20 # User time : 7.345 s
% 59.73/8.20 # System time : 0.177 s
% 59.73/8.20 # Total time : 7.522 s
% 59.73/8.20 # Maximum resident set size: 3528 pages
% 59.73/8.20
% 59.73/8.20 # -------------------------------------------------
% 59.73/8.20 # User time : 14.753 s
% 59.73/8.20 # System time : 0.182 s
% 59.73/8.20 # Total time : 14.935 s
% 59.73/8.20 # Maximum resident set size: 2768 pages
% 59.73/8.20 % E---3.1 exiting
% 59.73/8.20 % E---3.1 exiting
%------------------------------------------------------------------------------