TSTP Solution File: SEU262+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU262+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:25:33 EDT 2023
% Result : Theorem 0.13s 0.47s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 61 ( 11 unt; 0 def)
% Number of atoms : 178 ( 25 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 201 ( 84 ~; 88 |; 15 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 3 con; 0-3 aty)
% Number of variables : 159 ( 16 sgn; 66 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',t3_subset) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',dt_m2_relset_1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',t106_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',d5_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',d3_tarski) ).
fof(t12_relset_1,conjecture,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',t12_relset_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',commutativity_k2_tarski) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',d4_relat_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',cc1_relset_1) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RGBc4G1urb/E---3.1_9314.p',d5_relat_1) ).
fof(c_0_10,plain,
! [X70,X71] :
( ( ~ element(X70,powerset(X71))
| subset(X70,X71) )
& ( ~ subset(X70,X71)
| element(X70,powerset(X71)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_11,plain,
! [X40,X41,X42] :
( ~ relation_of2_as_subset(X42,X40,X41)
| element(X42,powerset(cartesian_product2(X40,X41))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
fof(c_0_12,plain,
! [X59,X60,X61,X62] :
( ( in(X59,X61)
| ~ in(ordered_pair(X59,X60),cartesian_product2(X61,X62)) )
& ( in(X60,X62)
| ~ in(ordered_pair(X59,X60),cartesian_product2(X61,X62)) )
& ( ~ in(X59,X61)
| ~ in(X60,X62)
| in(ordered_pair(X59,X60),cartesian_product2(X61,X62)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])]) ).
fof(c_0_13,plain,
! [X38,X39] : ordered_pair(X38,X39) = unordered_pair(unordered_pair(X38,X39),singleton(X38)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_14,plain,
! [X12,X13,X14,X15,X16] :
( ( ~ subset(X12,X13)
| ~ in(X14,X12)
| in(X14,X13) )
& ( in(esk1_2(X15,X16),X15)
| subset(X15,X16) )
& ( ~ in(esk1_2(X15,X16),X16)
| subset(X15,X16) ) ),
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)],[d3_tarski])])])])])]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
inference(assume_negation,[status(cth)],[t12_relset_1]) ).
cnf(c_0_18,plain,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X10,X11] : unordered_pair(X10,X11) = unordered_pair(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_21,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_23,negated_conjecture,
( relation_of2_as_subset(esk15_0,esk13_0,esk14_0)
& ( ~ subset(relation_dom(esk15_0),esk13_0)
| ~ subset(relation_rng(esk15_0),esk14_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_24,plain,
! [X18,X19,X20,X22,X23,X24,X26] :
( ( ~ in(X20,X19)
| in(ordered_pair(X20,esk2_3(X18,X19,X20)),X18)
| X19 != relation_dom(X18)
| ~ relation(X18) )
& ( ~ in(ordered_pair(X22,X23),X18)
| in(X22,X19)
| X19 != relation_dom(X18)
| ~ relation(X18) )
& ( ~ in(esk3_2(X18,X24),X24)
| ~ in(ordered_pair(esk3_2(X18,X24),X26),X18)
| X24 = relation_dom(X18)
| ~ relation(X18) )
& ( in(esk3_2(X18,X24),X24)
| in(ordered_pair(esk3_2(X18,X24),esk4_2(X18,X24)),X18)
| X24 = relation_dom(X18)
| ~ relation(X18) ) ),
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)],[d4_relat_1])])])])])]) ).
fof(c_0_25,plain,
! [X7,X8,X9] :
( ~ element(X9,powerset(cartesian_product2(X7,X8)))
| relation(X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
cnf(c_0_26,plain,
( in(X1,X2)
| ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
! [X28,X29,X30,X32,X33,X34,X36] :
( ( ~ in(X30,X29)
| in(ordered_pair(esk5_3(X28,X29,X30),X30),X28)
| X29 != relation_rng(X28)
| ~ relation(X28) )
& ( ~ in(ordered_pair(X33,X32),X28)
| in(X32,X29)
| X29 != relation_rng(X28)
| ~ relation(X28) )
& ( ~ in(esk6_2(X28,X34),X34)
| ~ in(ordered_pair(X36,esk6_2(X28,X34)),X28)
| X34 = relation_rng(X28)
| ~ relation(X28) )
& ( in(esk6_2(X28,X34),X34)
| in(ordered_pair(esk7_2(X28,X34),esk6_2(X28,X34)),X28)
| X34 = relation_rng(X28)
| ~ relation(X28) ) ),
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)],[d5_relat_1])])])])])]) ).
cnf(c_0_28,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( in(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X4,X2,X3)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
relation_of2_as_subset(esk15_0,esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( in(ordered_pair(X1,esk2_3(X3,X2,X1)),X3)
| ~ in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
inference(rw,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_35,plain,
( in(ordered_pair(esk5_3(X3,X2,X1),X1),X3)
| ~ in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
( in(X1,cartesian_product2(esk13_0,esk14_0))
| ~ in(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( in(unordered_pair(unordered_pair(X1,esk2_3(X3,X2,X1)),singleton(X1)),X3)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_39,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_40,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X3)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_41,plain,
( in(unordered_pair(unordered_pair(esk5_3(X3,X2,X1),X1),singleton(esk5_3(X3,X2,X1))),X3)
| X2 != relation_rng(X3)
| ~ relation(X3)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_42,negated_conjecture,
( in(X1,esk13_0)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk15_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk2_3(X2,X3,X1))),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
inference(rw,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_44,negated_conjecture,
relation(esk15_0),
inference(spm,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_45,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X1,X3)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_46,plain,
( in(unordered_pair(unordered_pair(X1,esk5_3(X2,X3,X1)),singleton(esk5_3(X2,X3,X1))),X2)
| X3 != relation_rng(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
inference(rw,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_47,negated_conjecture,
( in(X1,esk13_0)
| X2 != relation_dom(esk15_0)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
( in(X1,esk14_0)
| ~ in(unordered_pair(singleton(X2),unordered_pair(X1,X2)),esk15_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_49,plain,
( in(unordered_pair(singleton(esk5_3(X1,X2,X3)),unordered_pair(X3,esk5_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_29]) ).
cnf(c_0_50,negated_conjecture,
( in(X1,esk13_0)
| ~ in(X1,relation_dom(esk15_0)) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_51,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_52,negated_conjecture,
( in(X1,esk14_0)
| X2 != relation_rng(esk15_0)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_44])]) ).
cnf(c_0_53,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,negated_conjecture,
( subset(relation_dom(esk15_0),X1)
| in(esk1_2(relation_dom(esk15_0),X1),esk13_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( in(X1,esk14_0)
| ~ in(X1,relation_rng(esk15_0)) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( ~ subset(relation_dom(esk15_0),esk13_0)
| ~ subset(relation_rng(esk15_0),esk14_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_57,negated_conjecture,
subset(relation_dom(esk15_0),esk13_0),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( subset(relation_rng(esk15_0),X1)
| in(esk1_2(relation_rng(esk15_0),X1),esk14_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
~ subset(relation_rng(esk15_0),esk14_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.08 % Problem : SEU262+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 2400
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon Oct 2 09:33:34 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.09/0.36 Running first-order theorem proving
% 0.09/0.36 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.RGBc4G1urb/E---3.1_9314.p
% 0.13/0.47 # Version: 3.1pre001
% 0.13/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 # Starting sh5l with 300s (1) cores
% 0.13/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9425 completed with status 0
% 0.13/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 # No SInE strategy applied
% 0.13/0.47 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.13/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.47 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 647s (1) cores
% 0.13/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.47 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.13/0.47 # Starting G-E--_301_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.13/0.47 # G-E--_301_C18_F1_URBAN_S0Y with pid 9436 completed with status 0
% 0.13/0.47 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.13/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 # No SInE strategy applied
% 0.13/0.47 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.13/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.47 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 647s (1) cores
% 0.13/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.47 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.13/0.47 # Starting G-E--_301_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.13/0.47 # Preprocessing time : 0.001 s
% 0.13/0.47
% 0.13/0.47 # Proof found!
% 0.13/0.47 # SZS status Theorem
% 0.13/0.47 # SZS output start CNFRefutation
% See solution above
% 0.13/0.47 # Parsed axioms : 37
% 0.13/0.47 # Removed by relevancy pruning/SinE : 0
% 0.13/0.47 # Initial clauses : 50
% 0.13/0.47 # Removed in clause preprocessing : 11
% 0.13/0.47 # Initial clauses in saturation : 39
% 0.13/0.47 # Processed clauses : 722
% 0.13/0.47 # ...of these trivial : 5
% 0.13/0.47 # ...subsumed : 297
% 0.13/0.47 # ...remaining for further processing : 420
% 0.13/0.47 # Other redundant clauses eliminated : 0
% 0.13/0.47 # Clauses deleted for lack of memory : 0
% 0.13/0.47 # Backward-subsumed : 26
% 0.13/0.47 # Backward-rewritten : 47
% 0.13/0.47 # Generated clauses : 5093
% 0.13/0.47 # ...of the previous two non-redundant : 4910
% 0.13/0.47 # ...aggressively subsumed : 0
% 0.13/0.47 # Contextual simplify-reflections : 19
% 0.13/0.47 # Paramodulations : 5054
% 0.13/0.47 # Factorizations : 4
% 0.13/0.47 # NegExts : 0
% 0.13/0.47 # Equation resolutions : 34
% 0.13/0.47 # Total rewrite steps : 450
% 0.13/0.47 # Propositional unsat checks : 0
% 0.13/0.47 # Propositional check models : 0
% 0.13/0.47 # Propositional check unsatisfiable : 0
% 0.13/0.47 # Propositional clauses : 0
% 0.13/0.47 # Propositional clauses after purity: 0
% 0.13/0.47 # Propositional unsat core size : 0
% 0.13/0.47 # Propositional preprocessing time : 0.000
% 0.13/0.47 # Propositional encoding time : 0.000
% 0.13/0.47 # Propositional solver time : 0.000
% 0.13/0.47 # Success case prop preproc time : 0.000
% 0.13/0.47 # Success case prop encoding time : 0.000
% 0.13/0.47 # Success case prop solver time : 0.000
% 0.13/0.47 # Current number of processed clauses : 346
% 0.13/0.47 # Positive orientable unit clauses : 27
% 0.13/0.47 # Positive unorientable unit clauses: 1
% 0.13/0.47 # Negative unit clauses : 8
% 0.13/0.47 # Non-unit-clauses : 310
% 0.13/0.47 # Current number of unprocessed clauses: 4193
% 0.13/0.47 # ...number of literals in the above : 18038
% 0.13/0.47 # Current number of archived formulas : 0
% 0.13/0.47 # Current number of archived clauses : 75
% 0.13/0.47 # Clause-clause subsumption calls (NU) : 17830
% 0.13/0.47 # Rec. Clause-clause subsumption calls : 10488
% 0.13/0.47 # Non-unit clause-clause subsumptions : 294
% 0.13/0.47 # Unit Clause-clause subsumption calls : 850
% 0.13/0.47 # Rewrite failures with RHS unbound : 0
% 0.13/0.47 # BW rewrite match attempts : 25
% 0.13/0.47 # BW rewrite match successes : 10
% 0.13/0.47 # Condensation attempts : 0
% 0.13/0.47 # Condensation successes : 0
% 0.13/0.47 # Termbank termtop insertions : 86312
% 0.13/0.47
% 0.13/0.47 # -------------------------------------------------
% 0.13/0.47 # User time : 0.091 s
% 0.13/0.47 # System time : 0.010 s
% 0.13/0.47 # Total time : 0.100 s
% 0.13/0.47 # Maximum resident set size: 1856 pages
% 0.13/0.47
% 0.13/0.47 # -------------------------------------------------
% 0.13/0.47 # User time : 0.465 s
% 0.13/0.47 # System time : 0.030 s
% 0.13/0.47 # Total time : 0.495 s
% 0.13/0.47 # Maximum resident set size: 1700 pages
% 0.13/0.47 % E---3.1 exiting
% 0.13/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------