TSTP Solution File: SET208-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET208-6 : TPTP v8.1.2. Bugfixed v2.1.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:18:53 EDT 2023
% Result : Unsatisfiable 1912.61s 265.91s
% Output : CNFRefutation 1912.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of clauses : 74 ( 25 unt; 13 nHn; 55 RR)
% Number of literals : 135 ( 26 equ; 60 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 125 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',unordered_pair_member) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',singleton_set) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',intersection2) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',regularity1) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',class_elements_are_sets) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',complement1) ).
cnf(prove_cross_product_is_monotonic1_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',prove_cross_product_is_monotonic1_1) ).
cnf(prove_cross_product_is_monotonic1_2,negated_conjecture,
~ subclass(cross_product(x,z),cross_product(y,z)),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',prove_cross_product_is_monotonic1_2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',not_subclass_members1) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',not_subclass_members2) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',cartesian_product4) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',intersection3) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',restriction2) ).
cnf(cartesian_product1,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',cartesian_product1) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',cartesian_product2) ).
cnf(cartesian_product3,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',cartesian_product3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',complement2) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.kje4Bo0aQB/E---3.1_26146.p',unordered_pair3) ).
cnf(c_0_20,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_21,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_22,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_23,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_24,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_25,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_26,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_27,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_30,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
subclass(x,y),
prove_cross_product_is_monotonic1_1 ).
cnf(c_0_32,negated_conjecture,
~ subclass(cross_product(x,z),cross_product(y,z)),
prove_cross_product_is_monotonic1_2 ).
cnf(c_0_33,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_34,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_35,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_36,plain,
( regular(intersection(X1,singleton(X2))) = X2
| intersection(X1,singleton(X2)) = null_class ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_38,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_39,plain,
( intersection(X1,complement(X2)) = null_class
| ~ member(regular(intersection(X1,complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_40,negated_conjecture,
( member(X1,y)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_41,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_42,negated_conjecture,
member(not_subclass_element(cross_product(x,z),cross_product(y,z)),cross_product(x,z)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_43,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_44,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_45,negated_conjecture,
~ member(not_subclass_element(cross_product(x,z),cross_product(y,z)),cross_product(y,z)),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_46,plain,
( intersection(X1,singleton(X2)) = null_class
| member(X2,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_47,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( intersection(X1,complement(y)) = null_class
| ~ member(regular(intersection(X1,complement(y))),x) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product1 ).
cnf(c_0_50,negated_conjecture,
ordered_pair(first(not_subclass_element(cross_product(x,z),cross_product(y,z))),second(not_subclass_element(cross_product(x,z),cross_product(y,z)))) = not_subclass_element(cross_product(x,z),cross_product(y,z)),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,plain,
( member(X1,restrict(X2,X3,X4))
| ~ member(X1,cross_product(X3,X4))
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
restrict(singleton(not_subclass_element(cross_product(x,z),cross_product(y,z))),y,z) = null_class,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_44]) ).
cnf(c_0_53,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_47]),c_0_30]) ).
cnf(c_0_54,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product2 ).
cnf(c_0_55,negated_conjecture,
intersection(x,complement(y)) = null_class,
inference(spm,[status(thm)],[c_0_48,c_0_35]) ).
cnf(c_0_56,negated_conjecture,
( member(first(not_subclass_element(cross_product(x,z),cross_product(y,z))),X1)
| ~ member(not_subclass_element(cross_product(x,z),cross_product(y,z)),cross_product(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
( ~ member(X1,singleton(not_subclass_element(cross_product(x,z),cross_product(y,z))))
| ~ member(X1,cross_product(y,z)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_58,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
cartesian_product3 ).
cnf(c_0_59,negated_conjecture,
( member(second(not_subclass_element(cross_product(x,z),cross_product(y,z))),X1)
| ~ member(not_subclass_element(cross_product(x,z),cross_product(y,z)),cross_product(X2,X1)) ),
inference(spm,[status(thm)],[c_0_54,c_0_50]) ).
cnf(c_0_60,negated_conjecture,
( ~ member(X1,complement(y))
| ~ member(X1,x) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_55]),c_0_53]) ).
cnf(c_0_61,negated_conjecture,
member(first(not_subclass_element(cross_product(x,z),cross_product(y,z))),x),
inference(spm,[status(thm)],[c_0_56,c_0_42]) ).
cnf(c_0_62,negated_conjecture,
( ~ member(ordered_pair(X1,X2),singleton(not_subclass_element(cross_product(x,z),cross_product(y,z))))
| ~ member(X2,z)
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
member(second(not_subclass_element(cross_product(x,z),cross_product(y,z))),z),
inference(spm,[status(thm)],[c_0_59,c_0_42]) ).
cnf(c_0_64,negated_conjecture,
~ member(first(not_subclass_element(cross_product(x,z),cross_product(y,z))),complement(y)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_66,negated_conjecture,
member(first(not_subclass_element(cross_product(x,z),cross_product(y,z))),universal_class),
inference(spm,[status(thm)],[c_0_30,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
( ~ member(ordered_pair(X1,second(not_subclass_element(cross_product(x,z),cross_product(y,z)))),singleton(not_subclass_element(cross_product(x,z),cross_product(y,z))))
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
member(first(not_subclass_element(cross_product(x,z),cross_product(y,z))),y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_69,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_70,negated_conjecture,
~ member(not_subclass_element(cross_product(x,z),cross_product(y,z)),singleton(not_subclass_element(cross_product(x,z),cross_product(y,z)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_50]) ).
cnf(c_0_71,plain,
( member(X1,singleton(X1))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_69,c_0_21]) ).
cnf(c_0_72,negated_conjecture,
member(not_subclass_element(cross_product(x,z),cross_product(y,z)),universal_class),
inference(spm,[status(thm)],[c_0_30,c_0_42]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET208-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 17:53:29 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.kje4Bo0aQB/E---3.1_26146.p
% 1912.61/265.91 # Version: 3.1pre001
% 1912.61/265.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1912.61/265.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1912.61/265.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1912.61/265.91 # Starting new_bool_3 with 300s (1) cores
% 1912.61/265.91 # Starting new_bool_1 with 300s (1) cores
% 1912.61/265.91 # Starting sh5l with 300s (1) cores
% 1912.61/265.91 # new_bool_3 with pid 26226 completed with status 8
% 1912.61/265.91 # new_bool_1 with pid 26227 completed with status 8
% 1912.61/265.91 # sh5l with pid 26228 completed with status 0
% 1912.61/265.91 # Result found by sh5l
% 1912.61/265.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1912.61/265.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1912.61/265.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1912.61/265.91 # Starting new_bool_3 with 300s (1) cores
% 1912.61/265.91 # Starting new_bool_1 with 300s (1) cores
% 1912.61/265.91 # Starting sh5l with 300s (1) cores
% 1912.61/265.91 # SinE strategy is gf500_gu_R04_F100_L20000
% 1912.61/265.91 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1912.61/265.91 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1912.61/265.91 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1912.61/265.91 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 26231 completed with status 7
% 1912.61/265.91 # Starting sh5l with 31s (1) cores
% 1912.61/265.91 # sh5l with pid 26243 completed with status 7
% 1912.61/265.91 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1912.61/265.91 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 26248 completed with status 7
% 1912.61/265.91 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1912.61/265.91 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 26254 completed with status 7
% 1912.61/265.91 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1912.61/265.91 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 26260 completed with status 7
% 1912.61/265.91 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1912.61/265.91 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 26266 completed with status 7
% 1912.61/265.91 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1912.61/265.91 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 26275 completed with status 7
% 1912.61/265.91 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1912.61/265.91 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 26279 completed with status 7
% 1912.61/265.91 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1912.61/265.91 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 26285 completed with status 7
% 1912.61/265.91 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1912.61/265.91 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 27202 completed with status 7
% 1912.61/265.91 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1912.61/265.91 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 28606 completed with status 7
% 1912.61/265.91 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1912.61/265.91 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with pid 29288 completed with status 0
% 1912.61/265.91 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I
% 1912.61/265.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1912.61/265.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1912.61/265.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1912.61/265.91 # Starting new_bool_3 with 300s (1) cores
% 1912.61/265.91 # Starting new_bool_1 with 300s (1) cores
% 1912.61/265.91 # Starting sh5l with 300s (1) cores
% 1912.61/265.91 # SinE strategy is gf500_gu_R04_F100_L20000
% 1912.61/265.91 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1912.61/265.91 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1912.61/265.91 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1912.61/265.91 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 26231 completed with status 7
% 1912.61/265.91 # Starting sh5l with 31s (1) cores
% 1912.61/265.91 # sh5l with pid 26243 completed with status 7
% 1912.61/265.91 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1912.61/265.91 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 26248 completed with status 7
% 1912.61/265.91 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1912.61/265.91 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 26254 completed with status 7
% 1912.61/265.91 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1912.61/265.91 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 26260 completed with status 7
% 1912.61/265.91 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1912.61/265.91 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 26266 completed with status 7
% 1912.61/265.91 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1912.61/265.91 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 26275 completed with status 7
% 1912.61/265.91 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1912.61/265.91 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 26279 completed with status 7
% 1912.61/265.91 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1912.61/265.91 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 26285 completed with status 7
% 1912.61/265.91 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1912.61/265.91 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 27202 completed with status 7
% 1912.61/265.91 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1912.61/265.91 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 28606 completed with status 7
% 1912.61/265.91 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1912.61/265.91 # Preprocessing time : 0.004 s
% 1912.61/265.91 # Presaturation interreduction done
% 1912.61/265.91
% 1912.61/265.91 # Proof found!
% 1912.61/265.91 # SZS status Unsatisfiable
% 1912.61/265.91 # SZS output start CNFRefutation
% See solution above
% 1912.61/265.91 # Parsed axioms : 114
% 1912.61/265.91 # Removed by relevancy pruning/SinE : 14
% 1912.61/265.91 # Initial clauses : 100
% 1912.61/265.91 # Removed in clause preprocessing : 0
% 1912.61/265.91 # Initial clauses in saturation : 100
% 1912.61/265.91 # Processed clauses : 10388
% 1912.61/265.91 # ...of these trivial : 124
% 1912.61/265.91 # ...subsumed : 6785
% 1912.61/265.91 # ...remaining for further processing : 3479
% 1912.61/265.91 # Other redundant clauses eliminated : 11
% 1912.61/265.91 # Clauses deleted for lack of memory : 0
% 1912.61/265.91 # Backward-subsumed : 71
% 1912.61/265.91 # Backward-rewritten : 100
% 1912.61/265.91 # Generated clauses : 113146
% 1912.61/265.91 # ...of the previous two non-redundant : 102705
% 1912.61/265.91 # ...aggressively subsumed : 0
% 1912.61/265.91 # Contextual simplify-reflections : 135
% 1912.61/265.91 # Paramodulations : 113109
% 1912.61/265.91 # Factorizations : 26
% 1912.61/265.91 # NegExts : 0
% 1912.61/265.91 # Equation resolutions : 11
% 1912.61/265.91 # Total rewrite steps : 39871
% 1912.61/265.91 # Propositional unsat checks : 0
% 1912.61/265.91 # Propositional check models : 0
% 1912.61/265.91 # Propositional check unsatisfiable : 0
% 1912.61/265.91 # Propositional clauses : 0
% 1912.61/265.92 # Propositional clauses after purity: 0
% 1912.61/265.92 # Propositional unsat core size : 0
% 1912.61/265.92 # Propositional preprocessing time : 0.000
% 1912.61/265.92 # Propositional encoding time : 0.000
% 1912.61/265.92 # Propositional solver time : 0.000
% 1912.61/265.92 # Success case prop preproc time : 0.000
% 1912.61/265.92 # Success case prop encoding time : 0.000
% 1912.61/265.92 # Success case prop solver time : 0.000
% 1912.61/265.92 # Current number of processed clauses : 3206
% 1912.61/265.92 # Positive orientable unit clauses : 447
% 1912.61/265.92 # Positive unorientable unit clauses: 3
% 1912.61/265.92 # Negative unit clauses : 140
% 1912.61/265.92 # Non-unit-clauses : 2616
% 1912.61/265.92 # Current number of unprocessed clauses: 91999
% 1912.61/265.92 # ...number of literals in the above : 249115
% 1912.61/265.92 # Current number of archived formulas : 0
% 1912.61/265.92 # Current number of archived clauses : 270
% 1912.61/265.92 # Clause-clause subsumption calls (NU) : 640766
% 1912.61/265.92 # Rec. Clause-clause subsumption calls : 486596
% 1912.61/265.92 # Non-unit clause-clause subsumptions : 2492
% 1912.61/265.92 # Unit Clause-clause subsumption calls : 46415
% 1912.61/265.92 # Rewrite failures with RHS unbound : 57
% 1912.61/265.92 # BW rewrite match attempts : 857
% 1912.61/265.92 # BW rewrite match successes : 54
% 1912.61/265.92 # Condensation attempts : 0
% 1912.61/265.92 # Condensation successes : 0
% 1912.61/265.92 # Termbank termtop insertions : 1830198
% 1912.61/265.92
% 1912.61/265.92 # -------------------------------------------------
% 1912.61/265.92 # User time : 255.043 s
% 1912.61/265.92 # System time : 8.257 s
% 1912.61/265.92 # Total time : 263.301 s
% 1912.61/265.92 # Maximum resident set size: 1996 pages
% 1912.61/265.92
% 1912.61/265.92 # -------------------------------------------------
% 1912.61/265.92 # User time : 700.671 s
% 1912.61/265.92 # System time : 8.732 s
% 1912.61/265.92 # Total time : 709.404 s
% 1912.61/265.92 # Maximum resident set size: 1776 pages
% 1912.61/265.92 % E---3.1 exiting
% 1912.61/265.92 % E---3.1 exiting
%------------------------------------------------------------------------------