TSTP Solution File: SET282-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET282-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:19:01 EDT 2023
% Result : Unsatisfiable 1667.03s 222.32s
% Output : CNFRefutation 1667.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 21
% Syntax : Number of clauses : 88 ( 24 unt; 24 nHn; 53 RR)
% Number of literals : 176 ( 45 equ; 71 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 146 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',regularity1) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',unordered_pair_member) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',singleton_set) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',intersection3) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',regularity2) ).
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.6EQy1rRslw/E---3.1_28484.p',domain2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',restriction1) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',unordered_pair3) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',ordered_pair) ).
cnf(definition_of_domain_relation1,axiom,
subclass(domain_relation,cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',definition_of_domain_relation1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',not_subclass_members1) ).
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.6EQy1rRslw/E---3.1_28484.p',cartesian_product3) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',cartesian_product2) ).
cnf(definition_of_domain_relation3,axiom,
( member(ordered_pair(X1,domain_of(X1)),domain_relation)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',definition_of_domain_relation3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',complement2) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',not_subclass_members2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',subclass_implies_equal) ).
cnf(prove_domain_of_domain_relation_1,negated_conjecture,
domain_of(domain_relation) != universal_class,
file('/export/starexec/sandbox2/tmp/tmp.6EQy1rRslw/E---3.1_28484.p',prove_domain_of_domain_relation_1) ).
cnf(c_0_21,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_22,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_23,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_24,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_25,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_28,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_30,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_31,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_32,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_33,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_25]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( X1 = null_class
| ~ member(X2,regular(X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,plain,
( regular(singleton(X1)) = X1
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_34,c_0_24]) ).
cnf(c_0_37,plain,
( singleton(X1) = null_class
| ~ member(X2,singleton(X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,axiom,
( restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2))
| ~ member(X1,universal_class) ),
domain2 ).
cnf(c_0_39,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_40,plain,
( singleton(X1) = null_class
| ~ member(regular(singleton(X1)),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_41,plain,
( intersection(X1,cross_product(singleton(X2),universal_class)) = null_class
| member(X2,domain_of(X1))
| ~ member(X2,universal_class) ),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
null_class = singleton(universal_class),
inference(spm,[status(thm)],[c_0_40,c_0_27]) ).
cnf(c_0_43,plain,
( singleton(X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_44,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_45,plain,
( intersection(X1,cross_product(singleton(X2),universal_class)) = singleton(universal_class)
| member(X2,domain_of(X1))
| ~ member(X2,universal_class) ),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
~ member(X1,singleton(universal_class)),
inference(rw,[status(thm)],[c_0_33,c_0_42]) ).
cnf(c_0_47,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_48,plain,
( singleton(X1) = singleton(universal_class)
| member(X1,universal_class) ),
inference(rw,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_49,axiom,
subclass(domain_relation,cross_product(universal_class,universal_class)),
definition_of_domain_relation1 ).
cnf(c_0_50,plain,
( member(X1,singleton(X1))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_44,c_0_30]) ).
cnf(c_0_51,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_52,plain,
( member(X1,domain_of(X2))
| ~ member(X3,cross_product(singleton(X1),universal_class))
| ~ member(X1,universal_class)
| ~ member(X3,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_45]),c_0_46]) ).
cnf(c_0_53,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
cartesian_product3 ).
cnf(c_0_54,plain,
( member(X1,universal_class)
| ~ member(X2,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_43]) ).
cnf(c_0_55,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product2 ).
cnf(c_0_56,plain,
( ordered_pair(X1,X2) = ordered_pair(X1,universal_class)
| member(X2,universal_class) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_47]) ).
cnf(c_0_57,plain,
( member(X1,cross_product(universal_class,universal_class))
| ~ member(X1,domain_relation) ),
inference(spm,[status(thm)],[c_0_21,c_0_49]) ).
cnf(c_0_58,axiom,
( member(ordered_pair(X1,domain_of(X1)),domain_relation)
| ~ member(X1,universal_class) ),
definition_of_domain_relation3 ).
cnf(c_0_59,plain,
( singleton(X1) = null_class
| ~ member(X1,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_50]),c_0_43]) ).
cnf(c_0_60,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_51]) ).
cnf(c_0_61,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_62,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_51]) ).
cnf(c_0_63,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_64,plain,
( member(X1,domain_of(X2))
| ~ member(ordered_pair(X3,X4),X2)
| ~ member(X3,singleton(X1))
| ~ member(X4,universal_class) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_65,plain,
( member(X1,universal_class)
| member(universal_class,X2)
| ~ member(ordered_pair(X3,X1),cross_product(X4,X2)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,plain,
( member(ordered_pair(X1,domain_of(X1)),cross_product(universal_class,universal_class))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_67,plain,
~ member(X1,X1),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_59]),c_0_33]),c_0_25]) ).
cnf(c_0_68,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_69,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_61]),c_0_62]) ).
cnf(c_0_70,plain,
( member(X1,domain_of(domain_relation))
| ~ member(domain_of(X2),universal_class)
| ~ member(X2,singleton(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_58]),c_0_25]) ).
cnf(c_0_71,plain,
( member(domain_of(X1),universal_class)
| ~ member(X1,universal_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_72,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_73,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_63,c_0_68]) ).
cnf(c_0_74,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_69]) ).
cnf(c_0_75,plain,
( member(X1,domain_of(domain_relation))
| ~ member(X2,singleton(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_25]) ).
cnf(c_0_76,plain,
( complement(complement(X1)) = X1
| ~ subclass(X1,complement(complement(X1))) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_74,c_0_51]) ).
cnf(c_0_78,plain,
( complement(X1) = singleton(universal_class)
| ~ member(regular(complement(X1)),X1) ),
inference(rw,[status(thm)],[c_0_26,c_0_42]) ).
cnf(c_0_79,plain,
( member(X1,domain_of(domain_relation))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_75,c_0_50]) ).
cnf(c_0_80,plain,
( X1 = singleton(universal_class)
| member(regular(X1),universal_class) ),
inference(rw,[status(thm)],[c_0_27,c_0_42]) ).
cnf(c_0_81,plain,
( universal_class = X1
| ~ subclass(universal_class,X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_22]) ).
cnf(c_0_82,plain,
subclass(X1,complement(singleton(universal_class))),
inference(spm,[status(thm)],[c_0_46,c_0_69]) ).
cnf(c_0_83,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_84,plain,
complement(domain_of(domain_relation)) = singleton(universal_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]) ).
cnf(c_0_85,plain,
complement(singleton(universal_class)) = universal_class,
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_86,negated_conjecture,
domain_of(domain_relation) != universal_class,
prove_domain_of_domain_relation_1 ).
cnf(c_0_87,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SET282-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n004.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon Oct 2 16:27:30 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.24/0.51 Running first-order theorem proving
% 0.24/0.52 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.6EQy1rRslw/E---3.1_28484.p
% 1667.03/222.32 # Version: 3.1pre001
% 1667.03/222.32 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1667.03/222.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1667.03/222.32 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1667.03/222.32 # Starting new_bool_3 with 300s (1) cores
% 1667.03/222.32 # Starting new_bool_1 with 300s (1) cores
% 1667.03/222.32 # Starting sh5l with 300s (1) cores
% 1667.03/222.32 # sh5l with pid 28580 completed with status 0
% 1667.03/222.32 # Result found by sh5l
% 1667.03/222.32 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1667.03/222.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1667.03/222.32 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1667.03/222.32 # Starting new_bool_3 with 300s (1) cores
% 1667.03/222.32 # Starting new_bool_1 with 300s (1) cores
% 1667.03/222.32 # Starting sh5l with 300s (1) cores
% 1667.03/222.32 # SinE strategy is gf500_gu_R04_F100_L20000
% 1667.03/222.32 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1667.03/222.32 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1667.03/222.32 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1667.03/222.32 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 28583 completed with status 7
% 1667.03/222.32 # Starting sh5l with 31s (1) cores
% 1667.03/222.32 # sh5l with pid 28590 completed with status 7
% 1667.03/222.32 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1667.03/222.32 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 28591 completed with status 7
% 1667.03/222.32 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1667.03/222.32 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 28594 completed with status 7
% 1667.03/222.32 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1667.03/222.32 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 28595 completed with status 7
% 1667.03/222.32 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1667.03/222.32 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 28596 completed with status 7
% 1667.03/222.32 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1667.03/222.32 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 28599 completed with status 7
% 1667.03/222.32 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1667.03/222.32 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 28600 completed with status 7
% 1667.03/222.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1667.03/222.32 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 28668 completed with status 7
% 1667.03/222.32 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1667.03/222.32 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 28674 completed with status 0
% 1667.03/222.32 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y
% 1667.03/222.32 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1667.03/222.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1667.03/222.32 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1667.03/222.32 # Starting new_bool_3 with 300s (1) cores
% 1667.03/222.32 # Starting new_bool_1 with 300s (1) cores
% 1667.03/222.32 # Starting sh5l with 300s (1) cores
% 1667.03/222.32 # SinE strategy is gf500_gu_R04_F100_L20000
% 1667.03/222.32 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1667.03/222.32 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1667.03/222.32 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1667.03/222.32 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 28583 completed with status 7
% 1667.03/222.32 # Starting sh5l with 31s (1) cores
% 1667.03/222.32 # sh5l with pid 28590 completed with status 7
% 1667.03/222.32 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1667.03/222.32 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 28591 completed with status 7
% 1667.03/222.32 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1667.03/222.32 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 28594 completed with status 7
% 1667.03/222.32 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1667.03/222.32 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 28595 completed with status 7
% 1667.03/222.32 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1667.03/222.32 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 28596 completed with status 7
% 1667.03/222.32 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1667.03/222.32 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 28599 completed with status 7
% 1667.03/222.32 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1667.03/222.32 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 28600 completed with status 7
% 1667.03/222.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1667.03/222.32 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 28668 completed with status 7
% 1667.03/222.32 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1667.03/222.32 # Preprocessing time : 0.004 s
% 1667.03/222.32 # Presaturation interreduction done
% 1667.03/222.32
% 1667.03/222.32 # Proof found!
% 1667.03/222.32 # SZS status Unsatisfiable
% 1667.03/222.32 # SZS output start CNFRefutation
% See solution above
% 1667.03/222.32 # Parsed axioms : 113
% 1667.03/222.32 # Removed by relevancy pruning/SinE : 11
% 1667.03/222.32 # Initial clauses : 102
% 1667.03/222.32 # Removed in clause preprocessing : 0
% 1667.03/222.32 # Initial clauses in saturation : 102
% 1667.03/222.32 # Processed clauses : 3710
% 1667.03/222.32 # ...of these trivial : 10
% 1667.03/222.32 # ...subsumed : 2834
% 1667.03/222.32 # ...remaining for further processing : 866
% 1667.03/222.32 # Other redundant clauses eliminated : 8
% 1667.03/222.32 # Clauses deleted for lack of memory : 0
% 1667.03/222.32 # Backward-subsumed : 44
% 1667.03/222.32 # Backward-rewritten : 70
% 1667.03/222.32 # Generated clauses : 18682
% 1667.03/222.32 # ...of the previous two non-redundant : 16239
% 1667.03/222.32 # ...aggressively subsumed : 0
% 1667.03/222.32 # Contextual simplify-reflections : 28
% 1667.03/222.32 # Paramodulations : 18663
% 1667.03/222.32 # Factorizations : 8
% 1667.03/222.32 # NegExts : 0
% 1667.03/222.32 # Equation resolutions : 11
% 1667.03/222.32 # Total rewrite steps : 6649
% 1667.03/222.32 # Propositional unsat checks : 0
% 1667.03/222.32 # Propositional check models : 0
% 1667.03/222.32 # Propositional check unsatisfiable : 0
% 1667.03/222.32 # Propositional clauses : 0
% 1667.03/222.32 # Propositional clauses after purity: 0
% 1667.03/222.32 # Propositional unsat core size : 0
% 1667.03/222.32 # Propositional preprocessing time : 0.000
% 1667.03/222.32 # Propositional encoding time : 0.000
% 1667.03/222.32 # Propositional solver time : 0.000
% 1667.03/222.32 # Success case prop preproc time : 0.000
% 1667.03/222.32 # Success case prop encoding time : 0.000
% 1667.03/222.32 # Success case prop solver time : 0.000
% 1667.03/222.32 # Current number of processed clauses : 649
% 1667.03/222.32 # Positive orientable unit clauses : 66
% 1667.03/222.32 # Positive unorientable unit clauses: 1
% 1667.03/222.32 # Negative unit clauses : 20
% 1667.03/222.32 # Non-unit-clauses : 562
% 1667.03/222.32 # Current number of unprocessed clauses: 12466
% 1667.03/222.32 # ...number of literals in the above : 42521
% 1667.03/222.32 # Current number of archived formulas : 0
% 1667.03/222.32 # Current number of archived clauses : 215
% 1667.03/222.32 # Clause-clause subsumption calls (NU) : 80121
% 1667.03/222.32 # Rec. Clause-clause subsumption calls : 63795
% 1667.03/222.32 # Non-unit clause-clause subsumptions : 2271
% 1667.03/222.32 # Unit Clause-clause subsumption calls : 2415
% 1667.03/222.32 # Rewrite failures with RHS unbound : 0
% 1667.03/222.32 # BW rewrite match attempts : 60
% 1667.03/222.32 # BW rewrite match successes : 34
% 1667.03/222.32 # Condensation attempts : 0
% 1667.03/222.32 # Condensation successes : 0
% 1667.03/222.32 # Termbank termtop insertions : 305186
% 1667.03/222.32
% 1667.03/222.32 # -------------------------------------------------
% 1667.03/222.32 # User time : 210.293 s
% 1667.03/222.32 # System time : 5.771 s
% 1667.03/222.32 # Total time : 216.064 s
% 1667.03/222.32 # Maximum resident set size: 1980 pages
% 1667.03/222.32
% 1667.03/222.32 # -------------------------------------------------
% 1667.03/222.32 # User time : 210.302 s
% 1667.03/222.32 # System time : 5.777 s
% 1667.03/222.32 # Total time : 216.079 s
% 1667.03/222.32 # Maximum resident set size: 1768 pages
% 1667.03/222.32 % E---3.1 exiting
% 1667.03/222.33 % E---3.1 exiting
%------------------------------------------------------------------------------