TMTP Model File: SET779-1.004-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : ET---1.0
% Problem : SET779-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : do_ET %s
% Computer : n012.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16127.75MB
% OS : Linux 2.6.32-504.16.2.el6.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 12 20:19:29 EDT 2015
% Result : Satisfiable 0.03s
% Output : Saturation 0.03s
% Verified :
% Statistics : Number of clauses : 55 ( 83 expanded)
% Number of leaves : 12 ( 18 expanded)
% Depth : 6
% Number of atoms : 147 ( 222 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 4 ( 3 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: ET---1.0 format not known, defaulting to TPTP
cnf(c_0_0,axiom,
( member(h(X1,X2,X3),X3)
| intersection(X1,X2,X3)
| member(h(X1,X2,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom2)).
cnf(c_0_1,axiom,
( member(h(X1,X2,X3),X3)
| intersection(X1,X2,X3)
| member(h(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom1)).
cnf(c_0_2,axiom,
( intersection(X1,X2,X3)
| ~ member(h(X1,X2,X3),X3)
| ~ member(h(X1,X2,X3),X2)
| ~ member(h(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom3)).
cnf(c_0_3,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_axiom2)).
cnf(c_0_4,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_axiom1)).
cnf(c_0_5,axiom,
( equal_sets(X2,X1)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_are_set_equal_sets)).
cnf(c_0_6,axiom,
( member(X4,X3)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X2)
| ~ member(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_both_is_member_of_intersection)).
cnf(c_0_7,axiom,
( member(X4,X1)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set1)).
cnf(c_0_8,axiom,
( member(X4,X2)
| ~ intersection(X1,X2,X3)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set2)).
cnf(c_0_9,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',membership_in_subsets)).
cnf(c_0_10,axiom,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',set_equal_sets_are_subsets1)).
cnf(c_0_11,axiom,
( subset(X2,X1)
| ~ equal_sets(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',set_equal_sets_are_subsets2)).
cnf(c_0_12,axiom,
( intersection(X1,X2,X3)
| member(h(X1,X2,X3),X3)
| member(h(X1,X2,X3),X2) ),
c_0_0).
cnf(c_0_13,axiom,
( intersection(X1,X2,X3)
| member(h(X1,X2,X3),X3)
| member(h(X1,X2,X3),X1) ),
c_0_1).
cnf(c_0_14,axiom,
( intersection(X1,X2,X3)
| ~ member(h(X1,X2,X3),X3)
| ~ member(h(X1,X2,X3),X2)
| ~ member(h(X1,X2,X3),X1) ),
c_0_2).
cnf(c_0_15,plain,
( intersection(X1,X2,X3)
| member(h(X1,X2,X3),X2)
| member(h(X1,X2,X3),X3) ),
c_0_12).
cnf(c_0_16,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_3).
cnf(c_0_17,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
c_0_4).
cnf(c_0_18,plain,
( intersection(X1,X2,X3)
| member(h(X1,X2,X3),X1)
| member(h(X1,X2,X3),X3) ),
c_0_13).
cnf(c_0_19,plain,
( intersection(X1,X2,X3)
| ~ member(h(X1,X2,X3),X3)
| ~ member(h(X1,X2,X3),X2)
| ~ member(h(X1,X2,X3),X1) ),
c_0_14).
cnf(c_0_20,plain,
( intersection(X1,X2,X3)
| member(h(X1,X2,X3),X3)
| member(h(X1,X2,X3),X2) ),
c_0_15,
[final]).
cnf(c_0_21,axiom,
( equal_sets(X2,X1)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
c_0_5).
cnf(c_0_22,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_16).
cnf(c_0_23,plain,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
c_0_17).
cnf(c_0_24,plain,
( intersection(X1,X2,X3)
| member(h(X1,X2,X3),X3)
| member(h(X1,X2,X3),X1) ),
c_0_18,
[final]).
cnf(c_0_25,axiom,
( member(X4,X3)
| ~ member(X4,X2)
| ~ member(X4,X1)
| ~ intersection(X1,X2,X3) ),
c_0_6).
cnf(c_0_26,axiom,
( member(X4,X1)
| ~ member(X4,X3)
| ~ intersection(X1,X2,X3) ),
c_0_7).
cnf(c_0_27,axiom,
( member(X4,X2)
| ~ member(X4,X3)
| ~ intersection(X1,X2,X3) ),
c_0_8).
cnf(c_0_28,axiom,
( member(X1,X3)
| ~ member(X1,X2)
| ~ subset(X2,X3) ),
c_0_9).
cnf(c_0_29,axiom,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_10).
cnf(c_0_30,axiom,
( subset(X2,X1)
| ~ equal_sets(X1,X2) ),
c_0_11).
cnf(c_0_31,plain,
( intersection(X1,X2,X3)
| ~ member(h(X1,X2,X3),X3)
| ~ member(h(X1,X2,X3),X2)
| ~ member(h(X1,X2,X3),X1) ),
c_0_19,
[final]).
cnf(c_0_32,plain,
( intersection(X1,X2,X2)
| member(h(X1,X2,X2),X2) ),
inference(ef,[status(thm)],[c_0_20,theory(equality)]),
[final]).
cnf(c_0_33,plain,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_21).
cnf(c_0_34,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_22,
[final]).
cnf(c_0_35,plain,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
c_0_23,
[final]).
cnf(c_0_36,plain,
( intersection(X1,X2,X1)
| member(h(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_24,theory(equality)]),
[final]).
cnf(c_0_37,plain,
( member(X1,X2)
| ~ intersection(X3,X4,X2)
| ~ member(X1,X4)
| ~ member(X1,X3) ),
c_0_25).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ intersection(X2,X3,X4)
| ~ member(X1,X4) ),
c_0_26).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ intersection(X3,X2,X4)
| ~ member(X1,X4) ),
c_0_27).
cnf(c_0_40,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
c_0_28).
cnf(c_0_41,plain,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_29).
cnf(c_0_42,plain,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
c_0_30).
cnf(c_0_43,plain,
( intersection(X1,X2,X2)
| ~ member(h(X1,X2,X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32,theory(equality)]),c_0_32,theory(equality,[symmetry])]),
[final]).
cnf(c_0_44,plain,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_33,
[final]).
cnf(c_0_45,plain,
( subset(X1,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35,theory(equality)]),
[final]).
cnf(c_0_46,plain,
( intersection(X1,X2,X1)
| ~ member(h(X1,X2,X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36,theory(equality)]),c_0_36,theory(equality,[symmetry])]),
[final]).
cnf(c_0_47,plain,
( member(X1,X2)
| ~ intersection(X3,X4,X2)
| ~ member(X1,X4)
| ~ member(X1,X3) ),
c_0_37,
[final]).
cnf(c_0_48,plain,
( member(X1,X2)
| ~ intersection(X2,X3,X4)
| ~ member(X1,X4) ),
c_0_38,
[final]).
cnf(c_0_49,plain,
( member(X1,X2)
| ~ intersection(X3,X2,X4)
| ~ member(X1,X4) ),
c_0_39,
[final]).
cnf(c_0_50,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
c_0_40,
[final]).
cnf(c_0_51,plain,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_41,
[final]).
cnf(c_0_52,plain,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
c_0_42,
[final]).
cnf(c_0_53,plain,
( intersection(X1,X1,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_32,theory(equality)]),
[final]).
cnf(c_0_54,plain,
( equal_sets(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45,theory(equality)]),c_0_45,theory(equality)]),theory(equality,[symmetry])]),
[final]).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET779-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : do_ET %s
% 0.02/1.07 % Computer : n012.star.cs.uiowa.edu
% 0.02/1.07 % Model : x86_64 x86_64
% 0.02/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/1.07 % Memory : 16127.75MB
% 0.02/1.07 % OS : Linux 2.6.32-504.16.2.el6.x86_64
% 0.02/1.07 % CPULimit : 300
% 0.02/1.07 % DateTime : Fri Jun 12 13:54:37 CDT 2015
% 0.02/1.08 % CPUTime :
% 0.03/1.13 # No SInE strategy applied
% 0.03/1.13 # Trying AutoSched4 for 18 seconds
% 0.03/1.13 # AutoSched4-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.03/1.13 # and selection function SelectNewComplexAHPNS.
% 0.03/1.13 #
% 0.03/1.13 # Preprocessing time : 0.005 s
% 0.03/1.13 # Presaturation interreduction done
% 0.03/1.13
% 0.03/1.13 # No proof found!
% 0.03/1.13 # SZS status Satisfiable
% 0.03/1.13 # SZS output start Saturation.
% 0.03/1.13 cnf(c_0_0,axiom,(member(h(X1,X2,X3),X3)|intersection(X1,X2,X3)|member(h(X1,X2,X3),X2)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax', intersection_axiom2)).
% 0.03/1.13 cnf(c_0_1,axiom,(member(h(X1,X2,X3),X3)|intersection(X1,X2,X3)|member(h(X1,X2,X3),X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax', intersection_axiom1)).
% 0.03/1.13 cnf(c_0_2,axiom,(intersection(X1,X2,X3)|~member(h(X1,X2,X3),X3)|~member(h(X1,X2,X3),X2)|~member(h(X1,X2,X3),X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax', intersection_axiom3)).
% 0.03/1.13 cnf(c_0_3,axiom,(subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax', subsets_axiom2)).
% 0.03/1.13 cnf(c_0_4,axiom,(subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax', subsets_axiom1)).
% 0.03/1.13 cnf(c_0_5,axiom,(equal_sets(X2,X1)|~subset(X1,X2)|~subset(X2,X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax', subsets_are_set_equal_sets)).
% 0.03/1.13 cnf(c_0_6,axiom,(member(X4,X3)|~intersection(X1,X2,X3)|~member(X4,X2)|~member(X4,X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax', member_of_both_is_member_of_intersection)).
% 0.03/1.13 cnf(c_0_7,axiom,(member(X4,X1)|~intersection(X1,X2,X3)|~member(X4,X3)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax', member_of_intersection_is_member_of_set1)).
% 0.03/1.13 cnf(c_0_8,axiom,(member(X4,X2)|~intersection(X1,X2,X3)|~member(X4,X3)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax', member_of_intersection_is_member_of_set2)).
% 0.03/1.13 cnf(c_0_9,axiom,(member(X1,X3)|~member(X1,X2)|~subset(X2,X3)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax', membership_in_subsets)).
% 0.03/1.13 cnf(c_0_10,axiom,(subset(X1,X2)|~equal_sets(X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax', set_equal_sets_are_subsets1)).
% 0.03/1.13 cnf(c_0_11,axiom,(subset(X2,X1)|~equal_sets(X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax', set_equal_sets_are_subsets2)).
% 0.03/1.13 cnf(c_0_12,axiom,(intersection(X1,X2,X3)|member(h(X1,X2,X3),X3)|member(h(X1,X2,X3),X2)), c_0_0).
% 0.03/1.13 cnf(c_0_13,axiom,(intersection(X1,X2,X3)|member(h(X1,X2,X3),X3)|member(h(X1,X2,X3),X1)), c_0_1).
% 0.03/1.13 cnf(c_0_14,axiom,(intersection(X1,X2,X3)|~member(h(X1,X2,X3),X3)|~member(h(X1,X2,X3),X2)|~member(h(X1,X2,X3),X1)), c_0_2).
% 0.03/1.13 cnf(c_0_15,plain,(intersection(X1,X2,X3)|member(h(X1,X2,X3),X2)|member(h(X1,X2,X3),X3)), c_0_12).
% 0.03/1.13 cnf(c_0_16,axiom,(subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2)), c_0_3).
% 0.03/1.13 cnf(c_0_17,axiom,(subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1)), c_0_4).
% 0.03/1.13 cnf(c_0_18,plain,(intersection(X1,X2,X3)|member(h(X1,X2,X3),X1)|member(h(X1,X2,X3),X3)), c_0_13).
% 0.03/1.13 cnf(c_0_19,plain,(intersection(X1,X2,X3)|~member(h(X1,X2,X3),X3)|~member(h(X1,X2,X3),X2)|~member(h(X1,X2,X3),X1)), c_0_14).
% 0.03/1.13 cnf(c_0_20,plain,(intersection(X1,X2,X3)|member(h(X1,X2,X3),X3)|member(h(X1,X2,X3),X2)), c_0_15, ['final']).
% 0.03/1.13 cnf(c_0_21,axiom,(equal_sets(X2,X1)|~subset(X2,X1)|~subset(X1,X2)), c_0_5).
% 0.03/1.13 cnf(c_0_22,plain,(subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2)), c_0_16).
% 0.03/1.13 cnf(c_0_23,plain,(subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1)), c_0_17).
% 0.03/1.13 cnf(c_0_24,plain,(intersection(X1,X2,X3)|member(h(X1,X2,X3),X3)|member(h(X1,X2,X3),X1)), c_0_18, ['final']).
% 0.03/1.13 cnf(c_0_25,axiom,(member(X4,X3)|~member(X4,X2)|~member(X4,X1)|~intersection(X1,X2,X3)), c_0_6).
% 0.03/1.13 cnf(c_0_26,axiom,(member(X4,X1)|~member(X4,X3)|~intersection(X1,X2,X3)), c_0_7).
% 0.03/1.13 cnf(c_0_27,axiom,(member(X4,X2)|~member(X4,X3)|~intersection(X1,X2,X3)), c_0_8).
% 0.03/1.13 cnf(c_0_28,axiom,(member(X1,X3)|~member(X1,X2)|~subset(X2,X3)), c_0_9).
% 0.03/1.13 cnf(c_0_29,axiom,(subset(X1,X2)|~equal_sets(X1,X2)), c_0_10).
% 0.03/1.13 cnf(c_0_30,axiom,(subset(X2,X1)|~equal_sets(X1,X2)), c_0_11).
% 0.03/1.13 cnf(c_0_31,plain,(intersection(X1,X2,X3)|~member(h(X1,X2,X3),X3)|~member(h(X1,X2,X3),X2)|~member(h(X1,X2,X3),X1)), c_0_19, ['final']).
% 0.03/1.13 cnf(c_0_32,plain,(intersection(X1,X2,X2)|member(h(X1,X2,X2),X2)), inference(ef,[status(thm)],[c_0_20, theory(equality)]), ['final']).
% 0.03/1.13 cnf(c_0_33,plain,(equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1)), c_0_21).
% 0.03/1.13 cnf(c_0_34,plain,(subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2)), c_0_22, ['final']).
% 0.03/1.13 cnf(c_0_35,plain,(subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1)), c_0_23, ['final']).
% 0.03/1.13 cnf(c_0_36,plain,(intersection(X1,X2,X1)|member(h(X1,X2,X1),X1)), inference(ef,[status(thm)],[c_0_24, theory(equality)]), ['final']).
% 0.03/1.13 cnf(c_0_37,plain,(member(X1,X2)|~intersection(X3,X4,X2)|~member(X1,X4)|~member(X1,X3)), c_0_25).
% 0.03/1.13 cnf(c_0_38,plain,(member(X1,X2)|~intersection(X2,X3,X4)|~member(X1,X4)), c_0_26).
% 0.03/1.13 cnf(c_0_39,plain,(member(X1,X2)|~intersection(X3,X2,X4)|~member(X1,X4)), c_0_27).
% 0.03/1.13 cnf(c_0_40,plain,(member(X1,X2)|~subset(X3,X2)|~member(X1,X3)), c_0_28).
% 0.03/1.13 cnf(c_0_41,plain,(subset(X1,X2)|~equal_sets(X1,X2)), c_0_29).
% 0.03/1.13 cnf(c_0_42,plain,(subset(X1,X2)|~equal_sets(X2,X1)), c_0_30).
% 0.03/1.13 cnf(c_0_43,plain,(intersection(X1,X2,X2)|~member(h(X1,X2,X2),X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32, theory(equality)]), c_0_32, theory(equality,[symmetry])]), ['final']).
% 0.03/1.13 cnf(c_0_44,plain,(equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1)), c_0_33, ['final']).
% 0.03/1.13 cnf(c_0_45,plain,(subset(X1,X1)), inference(spm,[status(thm)],[c_0_34, c_0_35, theory(equality)]), ['final']).
% 0.03/1.13 cnf(c_0_46,plain,(intersection(X1,X2,X1)|~member(h(X1,X2,X1),X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_36, theory(equality)]), c_0_36, theory(equality,[symmetry])]), ['final']).
% 0.03/1.13 cnf(c_0_47,plain,(member(X1,X2)|~intersection(X3,X4,X2)|~member(X1,X4)|~member(X1,X3)), c_0_37, ['final']).
% 0.03/1.13 cnf(c_0_48,plain,(member(X1,X2)|~intersection(X2,X3,X4)|~member(X1,X4)), c_0_38, ['final']).
% 0.03/1.13 cnf(c_0_49,plain,(member(X1,X2)|~intersection(X3,X2,X4)|~member(X1,X4)), c_0_39, ['final']).
% 0.03/1.13 cnf(c_0_50,plain,(member(X1,X2)|~subset(X3,X2)|~member(X1,X3)), c_0_40, ['final']).
% 0.03/1.13 cnf(c_0_51,plain,(subset(X1,X2)|~equal_sets(X1,X2)), c_0_41, ['final']).
% 0.03/1.13 cnf(c_0_52,plain,(subset(X1,X2)|~equal_sets(X2,X1)), c_0_42, ['final']).
% 0.03/1.13 cnf(c_0_53,plain,(intersection(X1,X1,X1)), inference(spm,[status(thm)],[c_0_43, c_0_32, theory(equality)]), ['final']).
% 0.03/1.13 cnf(c_0_54,plain,(equal_sets(X1,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45, theory(equality)]), c_0_45, theory(equality)]), theory(equality,[symmetry])]), ['final']).
% 0.03/1.13 # SZS output end Saturation.
% 0.03/1.13 # Parsed axioms : 12
% 0.03/1.13 # Removed by relevancy pruning/SinE : 0
% 0.03/1.13 # Initial clauses : 12
% 0.03/1.13 # Removed in clause preprocessing : 0
% 0.03/1.13 # Initial clauses in saturation : 12
% 0.03/1.13 # Processed clauses : 36
% 0.03/1.13 # ...of these trivial : 1
% 0.03/1.13 # ...subsumed : 4
% 0.03/1.13 # ...remaining for further processing : 31
% 0.03/1.13 # Other redundant clauses eliminated : 0
% 0.03/1.13 # Clauses deleted for lack of memory : 0
% 0.03/1.13 # Backward-subsumed : 0
% 0.03/1.13 # Backward-rewritten : 0
% 0.03/1.13 # Generated clauses : 22
% 0.03/1.13 # ...of the previous two non-trivial : 12
% 0.03/1.13 # Contextual simplify-reflections : 2
% 0.03/1.13 # Paramodulations : 18
% 0.03/1.13 # Factorizations : 4
% 0.03/1.13 # Equation resolutions : 0
% 0.03/1.13 # Current number of processed clauses : 19
% 0.03/1.13 # Positive orientable unit clauses : 3
% 0.03/1.13 # Positive unorientable unit clauses: 0
% 0.03/1.13 # Negative unit clauses : 0
% 0.03/1.13 # Non-unit-clauses : 16
% 0.03/1.13 # Current number of unprocessed clauses: 0
% 0.03/1.13 # ...number of literals in the above : 0
% 0.03/1.13 # Clause-clause subsumption calls (NU) : 54
% 0.03/1.13 # Rec. Clause-clause subsumption calls : 42
% 0.03/1.13 # Non-unit clause-clause subsumptions : 6
% 0.03/1.13 # Unit Clause-clause subsumption calls : 13
% 0.03/1.13 # Rewrite failures with RHS unbound : 0
% 0.03/1.13 # BW rewrite match attempts : 11
% 0.03/1.13 # BW rewrite match successes : 0
% 0.03/1.13 # Condensation attempts : 0
% 0.03/1.13 # Condensation successes : 0
% 0.03/1.13
% 0.03/1.13 # -------------------------------------------------
% 0.03/1.13 # User time : 0.006 s
% 0.03/1.13 # System time : 0.000 s
% 0.03/1.13 # Total time : 0.006 s
% 0.03/1.13 # Maximum resident set size: 2480 pages
% 0.03/1.13
% 0.03/1.13 # -------------------------------------------------
% 0.03/1.13 # User time : 0.029 s
% 0.03/1.13 # System time : 0.004 s
% 0.03/1.13 # Total time : 0.033 s
% 0.03/1.13 # Maximum resident set size: 4012 pages
% 0.03/1.13 0.02user 0.00system 0:00.03elapsed 91%CPU (0avgtext+0avgdata 16048maxresident)k
% 0.03/1.13 0inputs+936outputs (0major+2913minor)pagefaults 0swaps
%------------------------------------------------------------------------------