TSTP Solution File: NUM061-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM061-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:45:51 EDT 2023
% Result : Unsatisfiable 1994.47s 266.84s
% Output : CNFRefutation 1994.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 22
% Syntax : Number of clauses : 77 ( 34 unt; 16 nHn; 50 RR)
% Number of literals : 144 ( 38 equ; 57 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; 7 con; 0-3 aty)
% Number of variables : 107 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',class_elements_are_sets) ).
cnf(domain2,axiom,
( restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',domain2) ).
cnf(segment,axiom,
segment(X1,X2,X3) = domain_of(restrict(X1,X2,singleton(X3))),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',segment) ).
cnf(prove_segments_property5_2,negated_conjecture,
member(u,y),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',prove_segments_property5_2) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',unordered_pair_member) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',singleton_set) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',unordered_pairs_in_universal) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',intersection3) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',restriction2) ).
cnf(prove_segments_property5_4,negated_conjecture,
~ member(u,segment(xr,y,z)),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',prove_segments_property5_4) ).
cnf(choice2,axiom,
( X1 = null_class
| member(apply(choice,X1),X1)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',choice2) ).
cnf(replacement,axiom,
( member(image(X1,X2),universal_class)
| ~ function(X1)
| ~ member(X2,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',replacement) ).
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.5KO4cwCYcD/E---3.1_3651.p',cartesian_product3) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',complement1) ).
cnf(sum_class2,axiom,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',sum_class2) ).
cnf(apply,axiom,
sum_class(image(X1,singleton(X2))) = apply(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',apply) ).
cnf(choice1,axiom,
function(choice),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',choice1) ).
cnf(prove_segments_property5_3,negated_conjecture,
member(z,universal_class),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',prove_segments_property5_3) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',unordered_pair3) ).
cnf(prove_segments_property5_1,negated_conjecture,
member(ordered_pair(u,z),xr),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',prove_segments_property5_1) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.5KO4cwCYcD/E---3.1_3651.p',ordered_pair) ).
cnf(c_0_22,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_23,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_24,axiom,
( restrict(X2,singleton(X1),universal_class) = null_class
| member(X1,domain_of(X2))
| ~ member(X1,universal_class) ),
domain2 ).
cnf(c_0_25,axiom,
segment(X1,X2,X3) = domain_of(restrict(X1,X2,singleton(X3))),
segment ).
cnf(c_0_26,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
member(u,y),
prove_segments_property5_2 ).
cnf(c_0_28,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_29,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_30,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_31,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_32,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_33,negated_conjecture,
~ member(u,segment(xr,y,z)),
prove_segments_property5_4 ).
cnf(c_0_34,plain,
( restrict(restrict(X1,X2,singleton(X3)),singleton(X4),universal_class) = null_class
| member(X4,segment(X1,X2,X3))
| ~ member(X4,universal_class) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
member(u,universal_class),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,axiom,
( X1 = null_class
| member(apply(choice,X1),X1)
| ~ member(X1,universal_class) ),
choice2 ).
cnf(c_0_38,plain,
member(singleton(X1),universal_class),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_39,plain,
( member(X1,restrict(X2,X3,X4))
| ~ member(X1,cross_product(X3,X4))
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
restrict(restrict(xr,y,singleton(z)),singleton(u),universal_class) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_41,plain,
( apply(choice,singleton(X1)) = X1
| singleton(X1) = null_class ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_42,axiom,
( member(image(X1,X2),universal_class)
| ~ function(X1)
| ~ member(X2,universal_class) ),
replacement ).
cnf(c_0_43,negated_conjecture,
( member(X1,null_class)
| ~ member(X1,restrict(xr,y,singleton(z)))
| ~ member(X1,cross_product(singleton(u),universal_class)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
cartesian_product3 ).
cnf(c_0_45,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_46,plain,
( singleton(X1) = null_class
| member(X1,singleton(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41]),c_0_38])]) ).
cnf(c_0_47,axiom,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
sum_class2 ).
cnf(c_0_48,axiom,
sum_class(image(X1,singleton(X2))) = apply(X1,X2),
apply ).
cnf(c_0_49,plain,
( member(image(X1,singleton(X2)),universal_class)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_38]) ).
cnf(c_0_50,axiom,
function(choice),
choice1 ).
cnf(c_0_51,negated_conjecture,
( member(ordered_pair(X1,X2),null_class)
| ~ member(ordered_pair(X1,X2),restrict(xr,y,singleton(z)))
| ~ member(X1,singleton(u))
| ~ member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
member(z,universal_class),
prove_segments_property5_3 ).
cnf(c_0_53,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_54,plain,
( complement(X1) = null_class
| ~ member(apply(choice,complement(X1)),X1)
| ~ member(complement(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_55,plain,
( singleton(X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_26,c_0_46]) ).
cnf(c_0_56,plain,
( member(apply(X1,X2),universal_class)
| ~ member(image(X1,singleton(X2)),universal_class) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_57,plain,
member(image(choice,singleton(X1)),universal_class),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( member(ordered_pair(X1,z),null_class)
| ~ member(ordered_pair(X1,z),restrict(xr,y,singleton(z)))
| ~ member(X1,singleton(u)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,plain,
( member(X1,singleton(X1))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_53,c_0_29]) ).
cnf(c_0_60,plain,
( singleton(complement(X1)) = null_class
| complement(X1) = null_class
| ~ member(apply(choice,complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
member(apply(choice,X1),universal_class),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( member(ordered_pair(u,z),null_class)
| ~ member(ordered_pair(u,z),restrict(xr,y,singleton(z))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_35])]) ).
cnf(c_0_63,negated_conjecture,
member(ordered_pair(u,z),xr),
prove_segments_property5_1 ).
cnf(c_0_64,plain,
( singleton(complement(universal_class)) = null_class
| complement(universal_class) = null_class ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( member(ordered_pair(u,z),null_class)
| ~ member(ordered_pair(u,z),cross_product(y,singleton(z))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_39]),c_0_63])]) ).
cnf(c_0_66,plain,
( complement(universal_class) = null_class
| X1 = complement(universal_class)
| ~ member(X1,null_class) ),
inference(spm,[status(thm)],[c_0_36,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( member(ordered_pair(u,z),null_class)
| ~ member(z,singleton(z)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_44]),c_0_27])]) ).
cnf(c_0_68,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_69,negated_conjecture,
( ordered_pair(u,z) = complement(universal_class)
| complement(universal_class) = null_class
| ~ member(z,singleton(z)) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,plain,
member(ordered_pair(X1,X2),universal_class),
inference(spm,[status(thm)],[c_0_30,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
( ordered_pair(u,z) = complement(universal_class)
| complement(universal_class) = null_class ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_59]),c_0_52])]) ).
cnf(c_0_72,negated_conjecture,
( complement(universal_class) = null_class
| member(complement(universal_class),universal_class) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,negated_conjecture,
complement(universal_class) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_72]),c_0_61])]) ).
cnf(c_0_74,negated_conjecture,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_73]),c_0_26]) ).
cnf(c_0_75,negated_conjecture,
~ member(z,singleton(z)),
inference(spm,[status(thm)],[c_0_74,c_0_67]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_59]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM061-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 14:51:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.5KO4cwCYcD/E---3.1_3651.p
% 1994.47/266.84 # Version: 3.1pre001
% 1994.47/266.84 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1994.47/266.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1994.47/266.84 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1994.47/266.84 # Starting new_bool_3 with 300s (1) cores
% 1994.47/266.84 # Starting new_bool_1 with 300s (1) cores
% 1994.47/266.84 # Starting sh5l with 300s (1) cores
% 1994.47/266.84 # sh5l with pid 3732 completed with status 0
% 1994.47/266.84 # Result found by sh5l
% 1994.47/266.84 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1994.47/266.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1994.47/266.84 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1994.47/266.84 # Starting new_bool_3 with 300s (1) cores
% 1994.47/266.84 # Starting new_bool_1 with 300s (1) cores
% 1994.47/266.84 # Starting sh5l with 300s (1) cores
% 1994.47/266.84 # SinE strategy is gf500_gu_R04_F100_L20000
% 1994.47/266.84 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1994.47/266.84 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1994.47/266.84 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1994.47/266.84 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 3735 completed with status 7
% 1994.47/266.84 # Starting sh5l with 31s (1) cores
% 1994.47/266.84 # sh5l with pid 3744 completed with status 7
% 1994.47/266.84 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1994.47/266.84 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 3748 completed with status 7
% 1994.47/266.84 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1994.47/266.84 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 3754 completed with status 7
% 1994.47/266.84 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1994.47/266.84 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3756 completed with status 7
% 1994.47/266.84 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1994.47/266.84 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 3994 completed with status 7
% 1994.47/266.84 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1994.47/266.84 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 5031 completed with status 7
% 1994.47/266.84 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1994.47/266.84 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 5800 completed with status 7
% 1994.47/266.84 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1994.47/266.84 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 5803 completed with status 7
% 1994.47/266.84 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1994.47/266.84 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 5806 completed with status 7
% 1994.47/266.84 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1994.47/266.84 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 5808 completed with status 7
% 1994.47/266.84 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1994.47/266.84 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with pid 5858 completed with status 0
% 1994.47/266.84 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I
% 1994.47/266.84 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1994.47/266.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1994.47/266.84 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1994.47/266.84 # Starting new_bool_3 with 300s (1) cores
% 1994.47/266.84 # Starting new_bool_1 with 300s (1) cores
% 1994.47/266.84 # Starting sh5l with 300s (1) cores
% 1994.47/266.84 # SinE strategy is gf500_gu_R04_F100_L20000
% 1994.47/266.84 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1994.47/266.84 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1994.47/266.84 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1994.47/266.84 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 3735 completed with status 7
% 1994.47/266.84 # Starting sh5l with 31s (1) cores
% 1994.47/266.84 # sh5l with pid 3744 completed with status 7
% 1994.47/266.84 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1994.47/266.84 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 3748 completed with status 7
% 1994.47/266.84 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1994.47/266.84 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 3754 completed with status 7
% 1994.47/266.84 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1994.47/266.84 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3756 completed with status 7
% 1994.47/266.84 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1994.47/266.84 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 3994 completed with status 7
% 1994.47/266.84 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1994.47/266.84 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 5031 completed with status 7
% 1994.47/266.84 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1994.47/266.84 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 5800 completed with status 7
% 1994.47/266.84 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1994.47/266.84 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 5803 completed with status 7
% 1994.47/266.84 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1994.47/266.84 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 5806 completed with status 7
% 1994.47/266.84 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1994.47/266.84 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 5808 completed with status 7
% 1994.47/266.84 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1994.47/266.84 # Preprocessing time : 0.003 s
% 1994.47/266.84 # Presaturation interreduction done
% 1994.47/266.84
% 1994.47/266.84 # Proof found!
% 1994.47/266.84 # SZS status Unsatisfiable
% 1994.47/266.84 # SZS output start CNFRefutation
% See solution above
% 1994.47/266.84 # Parsed axioms : 162
% 1994.47/266.84 # Removed by relevancy pruning/SinE : 42
% 1994.47/266.84 # Initial clauses : 120
% 1994.47/266.84 # Removed in clause preprocessing : 0
% 1994.47/266.84 # Initial clauses in saturation : 120
% 1994.47/266.84 # Processed clauses : 1225
% 1994.47/266.84 # ...of these trivial : 4
% 1994.47/266.84 # ...subsumed : 179
% 1994.47/266.84 # ...remaining for further processing : 1042
% 1994.47/266.84 # Other redundant clauses eliminated : 9
% 1994.47/266.84 # Clauses deleted for lack of memory : 0
% 1994.47/266.84 # Backward-subsumed : 66
% 1994.47/266.84 # Backward-rewritten : 109
% 1994.47/266.84 # Generated clauses : 6769
% 1994.47/266.84 # ...of the previous two non-redundant : 6388
% 1994.47/266.84 # ...aggressively subsumed : 0
% 1994.47/266.84 # Contextual simplify-reflections : 7
% 1994.47/266.84 # Paramodulations : 6756
% 1994.47/266.84 # Factorizations : 4
% 1994.47/266.84 # NegExts : 0
% 1994.47/266.84 # Equation resolutions : 9
% 1994.47/266.84 # Total rewrite steps : 730
% 1994.47/266.84 # Propositional unsat checks : 0
% 1994.47/266.84 # Propositional check models : 0
% 1994.47/266.84 # Propositional check unsatisfiable : 0
% 1994.47/266.84 # Propositional clauses : 0
% 1994.47/266.84 # Propositional clauses after purity: 0
% 1994.47/266.84 # Propositional unsat core size : 0
% 1994.47/266.84 # Propositional preprocessing time : 0.000
% 1994.47/266.84 # Propositional encoding time : 0.000
% 1994.47/266.84 # Propositional solver time : 0.000
% 1994.47/266.84 # Success case prop preproc time : 0.000
% 1994.47/266.84 # Success case prop encoding time : 0.000
% 1994.47/266.84 # Success case prop solver time : 0.000
% 1994.47/266.84 # Current number of processed clauses : 743
% 1994.47/266.84 # Positive orientable unit clauses : 140
% 1994.47/266.84 # Positive unorientable unit clauses: 4
% 1994.47/266.84 # Negative unit clauses : 3
% 1994.47/266.84 # Non-unit-clauses : 596
% 1994.47/266.84 # Current number of unprocessed clauses: 5393
% 1994.47/266.84 # ...number of literals in the above : 13883
% 1994.47/266.84 # Current number of archived formulas : 0
% 1994.47/266.84 # Current number of archived clauses : 294
% 1994.47/266.84 # Clause-clause subsumption calls (NU) : 47664
% 1994.47/266.84 # Rec. Clause-clause subsumption calls : 38176
% 1994.47/266.84 # Non-unit clause-clause subsumptions : 204
% 1994.47/266.84 # Unit Clause-clause subsumption calls : 2883
% 1994.47/266.84 # Rewrite failures with RHS unbound : 20
% 1994.47/266.84 # BW rewrite match attempts : 815
% 1994.47/266.84 # BW rewrite match successes : 10
% 1994.47/266.84 # Condensation attempts : 0
% 1994.47/266.84 # Condensation successes : 0
% 1994.47/266.84 # Termbank termtop insertions : 143074
% 1994.47/266.84
% 1994.47/266.84 # -------------------------------------------------
% 1994.47/266.84 # User time : 254.350 s
% 1994.47/266.84 # System time : 7.863 s
% 1994.47/266.84 # Total time : 262.213 s
% 1994.47/266.84 # Maximum resident set size: 2108 pages
% 1994.47/266.84
% 1994.47/266.84 # -------------------------------------------------
% 1994.47/266.84 # User time : 254.359 s
% 1994.47/266.84 # System time : 7.866 s
% 1994.47/266.84 # Total time : 262.225 s
% 1994.47/266.84 # Maximum resident set size: 1816 pages
% 1994.47/266.84 % E---3.1 exiting
% 1994.47/266.84 % E---3.1 exiting
%------------------------------------------------------------------------------