TSTP Solution File: SET037-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET037-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:06 EDT 2023
% Result : Unsatisfiable 26.59s 3.86s
% Output : CNFRefutation 26.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 26
% Syntax : Number of clauses : 85 ( 26 unt; 12 nHn; 65 RR)
% Number of literals : 181 ( 54 equ; 87 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 124 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',ordered_pair) ).
cnf(singleton_set,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',singleton_set) ).
cnf(apply_for_functions1,axiom,
( apply(X3,X1) = X2
| ~ little_set(X1)
| ~ little_set(X2)
| ~ function(X3)
| ~ member(ordered_pair(X1,X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',apply_for_functions1) ).
cnf(ordered_pair_predicate3,axiom,
( X1 = ordered_pair(f2(X1),f3(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',ordered_pair_predicate3) ).
cnf(ordered_pair_predicate1,axiom,
( little_set(f2(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',ordered_pair_predicate1) ).
cnf(ordered_pair_predicate2,axiom,
( little_set(f3(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',ordered_pair_predicate2) ).
cnf(domain2,axiom,
( member(f8(X1,X2),X2)
| ~ member(X1,domain_of(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',domain2) ).
cnf(member_of_function_domain,hypothesis,
member(a,domain_of(a_function)),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',member_of_function_domain) ).
cnf(domain1,axiom,
( ordered_pair_predicate(f8(X1,X2))
| ~ member(X1,domain_of(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',domain1) ).
cnf(property_of_first,axiom,
( first(ordered_pair(X1,X2)) = X1
| ~ little_set(X1)
| ~ little_set(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',property_of_first) ).
cnf(property_of_second,axiom,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',property_of_second) ).
cnf(a_function,hypothesis,
function(a_function),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',a_function) ).
cnf(domain3,axiom,
( X1 = first(f8(X1,X2))
| ~ member(X1,domain_of(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',domain3) ).
cnf(image_and_substitution5,axiom,
( member(X1,image(X2,X3))
| ~ little_set(X1)
| ~ ordered_pair_predicate(X4)
| ~ member(X4,X3)
| ~ member(first(X4),X2)
| second(X4) != X1 ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',image_and_substitution5) ).
cnf(second_component_is_small,axiom,
( little_set(second(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',second_component_is_small) ).
cnf(applying_the_function,hypothesis,
apply(a_function,a) = b,
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',applying_the_function) ).
cnf(non_ordered_pair1,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,non_ordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',non_ordered_pair1) ).
cnf(regularity1,axiom,
( X1 = empty_set
| member(f24(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',regularity1) ).
cnf(disjoint1,axiom,
( ~ disjoint(X1,X2)
| ~ member(X3,X1)
| ~ member(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',disjoint1) ).
cnf(regularity2,axiom,
( X1 = empty_set
| disjoint(f24(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',regularity2) ).
cnf(image_and_apply2,axiom,
subset(image(singleton_set(X1),X2),apply(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',image_and_apply2) ).
cnf(subset1,axiom,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',subset1) ).
cnf(non_ordered_pair2,axiom,
( member(X1,non_ordered_pair(X2,X3))
| ~ little_set(X1)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',non_ordered_pair2) ).
cnf(function_values_are_small,axiom,
( little_set(apply(X1,X2))
| ~ function(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',function_values_are_small) ).
cnf(empty_set,axiom,
~ member(X1,empty_set),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',empty_set) ).
cnf(a2,axiom,
( little_set(X1)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Rphz28atcH/E---3.1_12703.p',a2) ).
cnf(c_0_26,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_27,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
singleton_set ).
cnf(c_0_28,axiom,
( apply(X3,X1) = X2
| ~ little_set(X1)
| ~ little_set(X2)
| ~ function(X3)
| ~ member(ordered_pair(X1,X2),X3) ),
apply_for_functions1 ).
cnf(c_0_29,plain,
ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
( X1 = ordered_pair(f2(X1),f3(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate3 ).
cnf(c_0_31,plain,
( apply(X3,X1) = X2
| ~ little_set(X2)
| ~ little_set(X1)
| ~ function(X3)
| ~ member(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),X3) ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( X1 = non_ordered_pair(non_ordered_pair(f2(X1),f2(X1)),non_ordered_pair(f2(X1),f3(X1)))
| ~ ordered_pair_predicate(X1) ),
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_33,axiom,
( little_set(f2(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate1 ).
cnf(c_0_34,axiom,
( little_set(f3(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate2 ).
cnf(c_0_35,axiom,
( member(f8(X1,X2),X2)
| ~ member(X1,domain_of(X2)) ),
domain2 ).
cnf(c_0_36,hypothesis,
member(a,domain_of(a_function)),
member_of_function_domain ).
cnf(c_0_37,axiom,
( ordered_pair_predicate(f8(X1,X2))
| ~ member(X1,domain_of(X2)) ),
domain1 ).
cnf(c_0_38,axiom,
( first(ordered_pair(X1,X2)) = X1
| ~ little_set(X1)
| ~ little_set(X2) ),
property_of_first ).
cnf(c_0_39,axiom,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
property_of_second ).
cnf(c_0_40,plain,
( apply(X1,f2(X2)) = f3(X2)
| ~ function(X1)
| ~ ordered_pair_predicate(X2)
| ~ member(X2,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_41,hypothesis,
member(f8(a,a_function),a_function),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,hypothesis,
function(a_function),
a_function ).
cnf(c_0_43,hypothesis,
ordered_pair_predicate(f8(a,a_function)),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_44,plain,
( first(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2))) = X1
| ~ little_set(X2)
| ~ little_set(X1) ),
inference(rw,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_45,axiom,
( X1 = first(f8(X1,X2))
| ~ member(X1,domain_of(X2)) ),
domain3 ).
cnf(c_0_46,axiom,
( member(X1,image(X2,X3))
| ~ little_set(X1)
| ~ ordered_pair_predicate(X4)
| ~ member(X4,X3)
| ~ member(first(X4),X2)
| second(X4) != X1 ),
image_and_substitution5 ).
cnf(c_0_47,axiom,
( little_set(second(X1))
| ~ ordered_pair_predicate(X1) ),
second_component_is_small ).
cnf(c_0_48,plain,
( second(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2))) = X2
| ~ little_set(X2)
| ~ little_set(X1) ),
inference(rw,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_49,hypothesis,
apply(a_function,f2(f8(a,a_function))) = f3(f8(a,a_function)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_50,plain,
( f2(X1) = first(X1)
| ~ ordered_pair_predicate(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_51,hypothesis,
first(f8(a,a_function)) = a,
inference(spm,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_52,hypothesis,
apply(a_function,a) = b,
applying_the_function ).
cnf(c_0_53,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,non_ordered_pair(X2,X3)) ),
non_ordered_pair1 ).
cnf(c_0_54,axiom,
( X1 = empty_set
| member(f24(X1),X1) ),
regularity1 ).
cnf(c_0_55,plain,
( member(second(X1),image(X2,X3))
| ~ ordered_pair_predicate(X1)
| ~ member(first(X1),X2)
| ~ member(X1,X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_47]) ).
cnf(c_0_56,plain,
( f3(X1) = second(X1)
| ~ ordered_pair_predicate(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_57,hypothesis,
f3(f8(a,a_function)) = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_43])]) ).
cnf(c_0_58,plain,
( f24(non_ordered_pair(X1,X2)) = X1
| f24(non_ordered_pair(X1,X2)) = X2
| non_ordered_pair(X1,X2) = empty_set ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,axiom,
( ~ disjoint(X1,X2)
| ~ member(X3,X1)
| ~ member(X3,X2) ),
disjoint1 ).
cnf(c_0_60,axiom,
( X1 = empty_set
| disjoint(f24(X1),X1) ),
regularity2 ).
cnf(c_0_61,axiom,
subset(image(singleton_set(X1),X2),apply(X2,X1)),
image_and_apply2 ).
cnf(c_0_62,hypothesis,
( member(second(f8(a,a_function)),image(X1,a_function))
| ~ member(a,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_41]),c_0_43]),c_0_51])]) ).
cnf(c_0_63,hypothesis,
second(f8(a,a_function)) = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_43])]) ).
cnf(c_0_64,plain,
( f24(non_ordered_pair(X1,X1)) = X1
| non_ordered_pair(X1,X1) = empty_set ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_58])]) ).
cnf(c_0_65,plain,
( X1 = empty_set
| ~ member(X2,f24(X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,axiom,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
subset1 ).
cnf(c_0_67,plain,
subset(image(non_ordered_pair(X1,X1),X2),apply(X2,X1)),
inference(rw,[status(thm)],[c_0_61,c_0_27]) ).
cnf(c_0_68,hypothesis,
( member(b,image(X1,a_function))
| ~ member(a,X1) ),
inference(rw,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
( non_ordered_pair(X1,X1) = empty_set
| member(X1,non_ordered_pair(X1,X1)) ),
inference(spm,[status(thm)],[c_0_54,c_0_64]) ).
cnf(c_0_70,plain,
( X1 = empty_set
| ~ member(f24(X1),f24(X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_54]) ).
cnf(c_0_71,plain,
( member(X1,apply(X2,X3))
| ~ member(X1,image(non_ordered_pair(X3,X3),X2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,hypothesis,
( non_ordered_pair(a,a) = empty_set
| member(b,image(non_ordered_pair(a,a),a_function)) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,axiom,
( member(X1,non_ordered_pair(X2,X3))
| ~ little_set(X1)
| X1 != X2 ),
non_ordered_pair2 ).
cnf(c_0_74,plain,
( non_ordered_pair(X1,X1) = empty_set
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_64]) ).
cnf(c_0_75,hypothesis,
( non_ordered_pair(a,a) = empty_set
| member(b,b) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_52]) ).
cnf(c_0_76,axiom,
( little_set(apply(X1,X2))
| ~ function(X1) ),
function_values_are_small ).
cnf(c_0_77,plain,
( member(X1,non_ordered_pair(X1,X2))
| ~ little_set(X1) ),
inference(er,[status(thm)],[c_0_73]) ).
cnf(c_0_78,hypothesis,
( non_ordered_pair(a,a) = empty_set
| non_ordered_pair(b,b) = empty_set ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,hypothesis,
little_set(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_52]),c_0_42])]) ).
cnf(c_0_80,axiom,
~ member(X1,empty_set),
empty_set ).
cnf(c_0_81,axiom,
( little_set(X1)
| ~ member(X1,X2) ),
a2 ).
cnf(c_0_82,hypothesis,
non_ordered_pair(a,a) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]),c_0_80]) ).
cnf(c_0_83,hypothesis,
little_set(a),
inference(spm,[status(thm)],[c_0_81,c_0_36]) ).
cnf(c_0_84,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_82]),c_0_83])]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET037-3 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n012.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 16:21:35 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.Rphz28atcH/E---3.1_12703.p
% 26.59/3.86 # Version: 3.1pre001
% 26.59/3.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 26.59/3.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.59/3.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 26.59/3.86 # Starting new_bool_3 with 300s (1) cores
% 26.59/3.86 # Starting new_bool_1 with 300s (1) cores
% 26.59/3.86 # Starting sh5l with 300s (1) cores
% 26.59/3.86 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12781 completed with status 0
% 26.59/3.86 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 26.59/3.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 26.59/3.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.59/3.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 26.59/3.86 # No SInE strategy applied
% 26.59/3.86 # Search class: FGHSM-FSLM31-MFFFFFNN
% 26.59/3.86 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.59/3.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 26.59/3.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 26.59/3.86 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 26.59/3.86 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 26.59/3.86 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 26.59/3.86 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 12788 completed with status 0
% 26.59/3.86 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 26.59/3.86 # Preprocessing class: FSLSSMSMSSSNFFN.
% 26.59/3.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.59/3.86 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 26.59/3.86 # No SInE strategy applied
% 26.59/3.86 # Search class: FGHSM-FSLM31-MFFFFFNN
% 26.59/3.86 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.59/3.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 26.59/3.86 # Preprocessing time : 0.003 s
% 26.59/3.86 # Presaturation interreduction done
% 26.59/3.86
% 26.59/3.86 # Proof found!
% 26.59/3.86 # SZS status Unsatisfiable
% 26.59/3.86 # SZS output start CNFRefutation
% See solution above
% 26.59/3.86 # Parsed axioms : 166
% 26.59/3.86 # Removed by relevancy pruning/SinE : 0
% 26.59/3.86 # Initial clauses : 166
% 26.59/3.86 # Removed in clause preprocessing : 6
% 26.59/3.86 # Initial clauses in saturation : 160
% 26.59/3.86 # Processed clauses : 13839
% 26.59/3.86 # ...of these trivial : 285
% 26.59/3.86 # ...subsumed : 7402
% 26.59/3.86 # ...remaining for further processing : 6152
% 26.59/3.86 # Other redundant clauses eliminated : 36
% 26.59/3.86 # Clauses deleted for lack of memory : 0
% 26.59/3.86 # Backward-subsumed : 324
% 26.59/3.86 # Backward-rewritten : 451
% 26.59/3.86 # Generated clauses : 119162
% 26.59/3.86 # ...of the previous two non-redundant : 113003
% 26.59/3.86 # ...aggressively subsumed : 0
% 26.59/3.86 # Contextual simplify-reflections : 98
% 26.59/3.86 # Paramodulations : 119047
% 26.59/3.86 # Factorizations : 76
% 26.59/3.86 # NegExts : 0
% 26.59/3.86 # Equation resolutions : 39
% 26.59/3.86 # Total rewrite steps : 26049
% 26.59/3.86 # Propositional unsat checks : 1
% 26.59/3.86 # Propositional check models : 0
% 26.59/3.86 # Propositional check unsatisfiable : 0
% 26.59/3.86 # Propositional clauses : 0
% 26.59/3.86 # Propositional clauses after purity: 0
% 26.59/3.86 # Propositional unsat core size : 0
% 26.59/3.86 # Propositional preprocessing time : 0.000
% 26.59/3.86 # Propositional encoding time : 0.204
% 26.59/3.86 # Propositional solver time : 0.177
% 26.59/3.86 # Success case prop preproc time : 0.000
% 26.59/3.86 # Success case prop encoding time : 0.000
% 26.59/3.86 # Success case prop solver time : 0.000
% 26.59/3.86 # Current number of processed clauses : 5205
% 26.59/3.86 # Positive orientable unit clauses : 597
% 26.59/3.86 # Positive unorientable unit clauses: 0
% 26.59/3.86 # Negative unit clauses : 1160
% 26.59/3.86 # Non-unit-clauses : 3448
% 26.59/3.86 # Current number of unprocessed clauses: 98658
% 26.59/3.86 # ...number of literals in the above : 275984
% 26.59/3.86 # Current number of archived formulas : 0
% 26.59/3.86 # Current number of archived clauses : 939
% 26.59/3.86 # Clause-clause subsumption calls (NU) : 1020368
% 26.59/3.86 # Rec. Clause-clause subsumption calls : 744404
% 26.59/3.86 # Non-unit clause-clause subsumptions : 3441
% 26.59/3.86 # Unit Clause-clause subsumption calls : 464690
% 26.59/3.86 # Rewrite failures with RHS unbound : 0
% 26.59/3.86 # BW rewrite match attempts : 1260
% 26.59/3.86 # BW rewrite match successes : 32
% 26.59/3.86 # Condensation attempts : 0
% 26.59/3.86 # Condensation successes : 0
% 26.59/3.86 # Termbank termtop insertions : 2697177
% 26.59/3.86
% 26.59/3.86 # -------------------------------------------------
% 26.59/3.86 # User time : 3.219 s
% 26.59/3.86 # System time : 0.103 s
% 26.59/3.86 # Total time : 3.322 s
% 26.59/3.86 # Maximum resident set size: 2084 pages
% 26.59/3.86
% 26.59/3.86 # -------------------------------------------------
% 26.59/3.86 # User time : 16.087 s
% 26.59/3.86 # System time : 0.635 s
% 26.59/3.86 # Total time : 16.722 s
% 26.59/3.86 # Maximum resident set size: 1820 pages
% 26.59/3.86 % E---3.1 exiting
% 26.59/3.86 % E---3.1 exiting
%------------------------------------------------------------------------------