TSTP Solution File: NUM136-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM136-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 18:58:22 EDT 2023
% Result : Unsatisfiable 1975.81s 270.72s
% Output : CNFRefutation 1975.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 24
% Syntax : Number of clauses : 85 ( 35 unt; 16 nHn; 58 RR)
% Number of literals : 164 ( 37 equ; 68 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 8 con; 0-3 aty)
% Number of variables : 113 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',subclass_members) ).
cnf(ordinal_numbers2,axiom,
( subclass(sum_class(X1),X1)
| ~ member(X1,ordinal_numbers) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',ordinal_numbers2) ).
cnf(prove_transitivity_of_ordinals_1,negated_conjecture,
member(x,ordinal_numbers),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',prove_transitivity_of_ordinals_1) ).
cnf(domain2,axiom,
( restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',domain2) ).
cnf(sum_class_definition,axiom,
domain_of(restrict(element_relation,universal_class,X1)) = sum_class(X1),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',sum_class_definition) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',class_elements_are_sets) ).
cnf(prove_transitivity_of_ordinals_3,negated_conjecture,
member(z,y),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',prove_transitivity_of_ordinals_3) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',intersection3) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',restriction2) ).
cnf(prove_transitivity_of_ordinals_4,negated_conjecture,
~ member(z,x),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',prove_transitivity_of_ordinals_4) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',unordered_pair_member) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',singleton_set) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',unordered_pairs_in_universal) ).
cnf(choice2,axiom,
( X1 = null_class
| member(apply(choice,X1),X1)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',choice2) ).
cnf(cartesian_product3,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',cartesian_product3) ).
cnf(prove_transitivity_of_ordinals_2,negated_conjecture,
member(y,x),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',prove_transitivity_of_ordinals_2) ).
cnf(replacement,axiom,
( member(image(X1,X2),universal_class)
| ~ function(X1)
| ~ member(X2,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',replacement) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',unordered_pair3) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',complement1) ).
cnf(sum_class2,axiom,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',sum_class2) ).
cnf(apply,axiom,
sum_class(image(X1,singleton(X2))) = apply(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',apply) ).
cnf(choice1,axiom,
function(choice),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',choice1) ).
cnf(element_relation3,axiom,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',element_relation3) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p',ordered_pair) ).
cnf(c_0_24,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_25,axiom,
( subclass(sum_class(X1),X1)
| ~ member(X1,ordinal_numbers) ),
ordinal_numbers2 ).
cnf(c_0_26,plain,
( member(X1,X2)
| ~ member(X1,sum_class(X2))
| ~ member(X2,ordinal_numbers) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
member(x,ordinal_numbers),
prove_transitivity_of_ordinals_1 ).
cnf(c_0_28,axiom,
( restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2))
| ~ member(X1,universal_class) ),
domain2 ).
cnf(c_0_29,axiom,
domain_of(restrict(element_relation,universal_class,X1)) = sum_class(X1),
sum_class_definition ).
cnf(c_0_30,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_31,negated_conjecture,
( member(X1,x)
| ~ member(X1,sum_class(x)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( restrict(restrict(element_relation,universal_class,X1),singleton(X2),universal_class) = null_class
| member(X2,sum_class(X1))
| ~ member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
member(z,y),
prove_transitivity_of_ordinals_3 ).
cnf(c_0_35,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_36,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_37,negated_conjecture,
~ member(z,x),
prove_transitivity_of_ordinals_4 ).
cnf(c_0_38,negated_conjecture,
( restrict(restrict(element_relation,universal_class,x),singleton(X1),universal_class) = null_class
| member(X1,x)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
member(z,universal_class),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_41,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_42,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_43,plain,
( member(X1,restrict(X2,X3,X4))
| ~ member(X1,cross_product(X3,X4))
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
restrict(restrict(element_relation,universal_class,x),singleton(z),universal_class) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_45,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,axiom,
( X1 = null_class
| member(apply(choice,X1),X1)
| ~ member(X1,universal_class) ),
choice2 ).
cnf(c_0_47,plain,
member(singleton(X1),universal_class),
inference(spm,[status(thm)],[c_0_42,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( member(X1,null_class)
| ~ member(X1,cross_product(singleton(z),universal_class))
| ~ member(X1,restrict(element_relation,universal_class,x)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
cartesian_product3 ).
cnf(c_0_50,negated_conjecture,
member(y,x),
prove_transitivity_of_ordinals_2 ).
cnf(c_0_51,plain,
( apply(choice,singleton(X1)) = X1
| singleton(X1) = null_class ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_52,axiom,
( member(image(X1,X2),universal_class)
| ~ function(X1)
| ~ member(X2,universal_class) ),
replacement ).
cnf(c_0_53,negated_conjecture,
( member(ordered_pair(X1,X2),null_class)
| ~ member(ordered_pair(X1,X2),restrict(element_relation,universal_class,x))
| ~ member(X1,singleton(z))
| ~ member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_33,c_0_50]) ).
cnf(c_0_55,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_56,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_57,plain,
( singleton(X1) = null_class
| member(X1,singleton(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_51]),c_0_47])]) ).
cnf(c_0_58,axiom,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
sum_class2 ).
cnf(c_0_59,axiom,
sum_class(image(X1,singleton(X2))) = apply(X1,X2),
apply ).
cnf(c_0_60,plain,
( member(image(X1,singleton(X2)),universal_class)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_47]) ).
cnf(c_0_61,axiom,
function(choice),
choice1 ).
cnf(c_0_62,negated_conjecture,
( member(ordered_pair(X1,y),null_class)
| ~ member(ordered_pair(X1,y),restrict(element_relation,universal_class,x))
| ~ member(X1,singleton(z)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,plain,
( member(X1,singleton(X1))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_55,c_0_41]) ).
cnf(c_0_64,plain,
( complement(X1) = null_class
| ~ member(apply(choice,complement(X1)),X1)
| ~ member(complement(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_56,c_0_46]) ).
cnf(c_0_65,plain,
( singleton(X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_33,c_0_57]) ).
cnf(c_0_66,plain,
( member(apply(X1,X2),universal_class)
| ~ member(image(X1,singleton(X2)),universal_class) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,plain,
member(image(choice,singleton(X1)),universal_class),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( member(ordered_pair(z,y),null_class)
| ~ member(ordered_pair(z,y),restrict(element_relation,universal_class,x)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_39])]) ).
cnf(c_0_69,plain,
( singleton(complement(X1)) = null_class
| complement(X1) = null_class
| ~ member(apply(choice,complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,plain,
member(apply(choice,X1),universal_class),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( member(ordered_pair(z,y),null_class)
| ~ member(ordered_pair(z,y),cross_product(universal_class,x))
| ~ member(ordered_pair(z,y),element_relation) ),
inference(spm,[status(thm)],[c_0_68,c_0_43]) ).
cnf(c_0_72,axiom,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| ~ member(X1,X2) ),
element_relation3 ).
cnf(c_0_73,plain,
( singleton(complement(universal_class)) = null_class
| complement(universal_class) = null_class ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( member(ordered_pair(z,y),null_class)
| ~ member(ordered_pair(z,y),element_relation) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_49]),c_0_50]),c_0_39])]) ).
cnf(c_0_75,plain,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(X2,universal_class)
| ~ member(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_49]),c_0_33]) ).
cnf(c_0_76,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_77,plain,
( complement(universal_class) = null_class
| X1 = complement(universal_class)
| ~ member(X1,null_class) ),
inference(spm,[status(thm)],[c_0_45,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
member(ordered_pair(z,y),null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_54]),c_0_34])]) ).
cnf(c_0_79,plain,
member(ordered_pair(X1,X2),universal_class),
inference(spm,[status(thm)],[c_0_42,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
( ordered_pair(z,y) = complement(universal_class)
| complement(universal_class) = null_class ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
( complement(universal_class) = null_class
| member(complement(universal_class),universal_class) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_82,negated_conjecture,
complement(universal_class) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_81]),c_0_70])]) ).
cnf(c_0_83,negated_conjecture,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_82]),c_0_33]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_78,c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM136-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n009.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 13:39:44 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.GygzrFbwKE/E---3.1_21072.p
% 1975.81/270.72 # Version: 3.1pre001
% 1975.81/270.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1975.81/270.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1975.81/270.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1975.81/270.72 # Starting new_bool_3 with 300s (1) cores
% 1975.81/270.72 # Starting new_bool_1 with 300s (1) cores
% 1975.81/270.72 # Starting sh5l with 300s (1) cores
% 1975.81/270.72 # sh5l with pid 21152 completed with status 0
% 1975.81/270.72 # Result found by sh5l
% 1975.81/270.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1975.81/270.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1975.81/270.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1975.81/270.72 # Starting new_bool_3 with 300s (1) cores
% 1975.81/270.72 # Starting new_bool_1 with 300s (1) cores
% 1975.81/270.72 # Starting sh5l with 300s (1) cores
% 1975.81/270.72 # SinE strategy is gf500_gu_R04_F100_L20000
% 1975.81/270.72 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1975.81/270.72 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1975.81/270.72 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1975.81/270.72 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 21155 completed with status 7
% 1975.81/270.72 # Starting sh5l with 31s (1) cores
% 1975.81/270.72 # sh5l with pid 21162 completed with status 7
% 1975.81/270.72 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1975.81/270.72 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 21167 completed with status 7
% 1975.81/270.72 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1975.81/270.72 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 21172 completed with status 7
% 1975.81/270.72 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1975.81/270.72 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 21176 completed with status 7
% 1975.81/270.72 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1975.81/270.72 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 21180 completed with status 7
% 1975.81/270.72 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1975.81/270.72 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 21187 completed with status 7
% 1975.81/270.72 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1975.81/270.72 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 21191 completed with status 7
% 1975.81/270.72 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1975.81/270.72 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 21428 completed with status 7
% 1975.81/270.72 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1975.81/270.72 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 21926 completed with status 7
% 1975.81/270.72 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1975.81/270.72 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 21933 completed with status 7
% 1975.81/270.72 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1975.81/270.72 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with pid 21939 completed with status 0
% 1975.81/270.72 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I
% 1975.81/270.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1975.81/270.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1975.81/270.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1975.81/270.72 # Starting new_bool_3 with 300s (1) cores
% 1975.81/270.72 # Starting new_bool_1 with 300s (1) cores
% 1975.81/270.72 # Starting sh5l with 300s (1) cores
% 1975.81/270.72 # SinE strategy is gf500_gu_R04_F100_L20000
% 1975.81/270.72 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1975.81/270.72 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1975.81/270.72 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1975.81/270.72 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 21155 completed with status 7
% 1975.81/270.72 # Starting sh5l with 31s (1) cores
% 1975.81/270.72 # sh5l with pid 21162 completed with status 7
% 1975.81/270.72 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1975.81/270.72 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 21167 completed with status 7
% 1975.81/270.72 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1975.81/270.72 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 21172 completed with status 7
% 1975.81/270.72 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1975.81/270.72 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 21176 completed with status 7
% 1975.81/270.72 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1975.81/270.72 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 21180 completed with status 7
% 1975.81/270.72 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1975.81/270.72 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 21187 completed with status 7
% 1975.81/270.72 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1975.81/270.72 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 21191 completed with status 7
% 1975.81/270.72 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1975.81/270.72 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 21428 completed with status 7
% 1975.81/270.72 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1975.81/270.72 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 21926 completed with status 7
% 1975.81/270.72 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1975.81/270.72 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 21933 completed with status 7
% 1975.81/270.72 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1975.81/270.72 # Preprocessing time : 0.002 s
% 1975.81/270.72 # Presaturation interreduction done
% 1975.81/270.72
% 1975.81/270.72 # Proof found!
% 1975.81/270.72 # SZS status Unsatisfiable
% 1975.81/270.72 # SZS output start CNFRefutation
% See solution above
% 1975.81/270.72 # Parsed axioms : 162
% 1975.81/270.72 # Removed by relevancy pruning/SinE : 42
% 1975.81/270.72 # Initial clauses : 120
% 1975.81/270.72 # Removed in clause preprocessing : 0
% 1975.81/270.72 # Initial clauses in saturation : 120
% 1975.81/270.72 # Processed clauses : 5997
% 1975.81/270.72 # ...of these trivial : 18
% 1975.81/270.72 # ...subsumed : 1148
% 1975.81/270.72 # ...remaining for further processing : 4831
% 1975.81/270.72 # Other redundant clauses eliminated : 9
% 1975.81/270.72 # Clauses deleted for lack of memory : 0
% 1975.81/270.72 # Backward-subsumed : 301
% 1975.81/270.72 # Backward-rewritten : 591
% 1975.81/270.72 # Generated clauses : 83701
% 1975.81/270.72 # ...of the previous two non-redundant : 82368
% 1975.81/270.72 # ...aggressively subsumed : 0
% 1975.81/270.72 # Contextual simplify-reflections : 44
% 1975.81/270.72 # Paramodulations : 83687
% 1975.81/270.72 # Factorizations : 4
% 1975.81/270.72 # NegExts : 0
% 1975.81/270.72 # Equation resolutions : 9
% 1975.81/270.72 # Total rewrite steps : 5394
% 1975.81/270.72 # Propositional unsat checks : 0
% 1975.81/270.72 # Propositional check models : 0
% 1975.81/270.72 # Propositional check unsatisfiable : 0
% 1975.81/270.72 # Propositional clauses : 0
% 1975.81/270.72 # Propositional clauses after purity: 0
% 1975.81/270.72 # Propositional unsat core size : 0
% 1975.81/270.72 # Propositional preprocessing time : 0.000
% 1975.81/270.72 # Propositional encoding time : 0.000
% 1975.81/270.72 # Propositional solver time : 0.000
% 1975.81/270.72 # Success case prop preproc time : 0.000
% 1975.81/270.72 # Success case prop encoding time : 0.000
% 1975.81/270.72 # Success case prop solver time : 0.000
% 1975.81/270.72 # Current number of processed clauses : 3814
% 1975.81/270.72 # Positive orientable unit clauses : 425
% 1975.81/270.72 # Positive unorientable unit clauses: 4
% 1975.81/270.72 # Negative unit clauses : 11
% 1975.81/270.72 # Non-unit-clauses : 3374
% 1975.81/270.72 # Current number of unprocessed clauses: 76260
% 1975.81/270.72 # ...number of literals in the above : 203934
% 1975.81/270.72 # Current number of archived formulas : 0
% 1975.81/270.72 # Current number of archived clauses : 1012
% 1975.81/270.72 # Clause-clause subsumption calls (NU) : 1086948
% 1975.81/270.72 # Rec. Clause-clause subsumption calls : 946952
% 1975.81/270.72 # Non-unit clause-clause subsumptions : 1344
% 1975.81/270.72 # Unit Clause-clause subsumption calls : 41583
% 1975.81/270.72 # Rewrite failures with RHS unbound : 36
% 1975.81/270.72 # BW rewrite match attempts : 18230
% 1975.81/270.72 # BW rewrite match successes : 17
% 1975.81/270.72 # Condensation attempts : 0
% 1975.81/270.72 # Condensation successes : 0
% 1975.81/270.72 # Termbank termtop insertions : 2169323
% 1975.81/270.72
% 1975.81/270.72 # -------------------------------------------------
% 1975.81/270.72 # User time : 256.684 s
% 1975.81/270.72 # System time : 7.373 s
% 1975.81/270.72 # Total time : 264.057 s
% 1975.81/270.72 # Maximum resident set size: 2104 pages
% 1975.81/270.72
% 1975.81/270.72 # -------------------------------------------------
% 1975.81/270.72 # User time : 256.698 s
% 1975.81/270.72 # System time : 7.378 s
% 1975.81/270.72 # Total time : 264.076 s
% 1975.81/270.72 # Maximum resident set size: 1816 pages
% 1975.81/270.72 % E---3.1 exiting
%------------------------------------------------------------------------------