TSTP Solution File: TOP004-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : TOP004-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n023.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 : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 21:26:57 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(set_theory_18,axiom,
equal_sets(intersection_of_sets(X,Y),intersection_of_sets(Y,X)),
input ).
fof(set_theory_18_0,plain,
! [X,Y] :
( equal_sets(intersection_of_sets(X,Y),intersection_of_sets(Y,X))
| $false ),
inference(orientation,[status(thm)],[set_theory_18]) ).
fof(def_lhs_atom1,axiom,
! [Y,X] :
( lhs_atom1(Y,X)
<=> equal_sets(intersection_of_sets(X,Y),intersection_of_sets(Y,X)) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X,Y] :
( lhs_atom1(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[set_theory_18_0,def_lhs_atom1]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_1,plain,
! [X1,X2] : lhs_atom1(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2,plain,
! [X3,X4] : lhs_atom1(X3,X4),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3,plain,
lhs_atom1(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
lhs_atom1(X1,X2),
c_0_3,
[final] ).
% End CNF derivation
cnf(c_0_4_0,axiom,
equal_sets(intersection_of_sets(X2,X1),intersection_of_sets(X1,X2)),
inference(unfold_definition,[status(thm)],[c_0_4,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X2,X3,X6,X8,X9] :
( ~ basis(X3,X6)
| ~ element_of_set(X2,X3)
| ~ element_of_collection(X9,X6)
| ~ element_of_collection(X8,X6)
| ~ element_of_set(X2,intersection_of_sets(X9,X8))
| subset_sets(f6(X3,X6,X2,X9,X8),intersection_of_sets(X9,X8)) ),
file('<stdin>',basis_for_topology_31) ).
fof(c_0_1_002,axiom,
! [X2,X3,X6,X8,X9] :
( ~ basis(X3,X6)
| ~ element_of_set(X2,X3)
| ~ element_of_collection(X9,X6)
| ~ element_of_collection(X8,X6)
| ~ element_of_set(X2,intersection_of_sets(X9,X8))
| element_of_set(X2,f6(X3,X6,X2,X9,X8)) ),
file('<stdin>',basis_for_topology_29) ).
fof(c_0_2_003,axiom,
! [X2,X3,X6,X8,X9] :
( ~ basis(X3,X6)
| ~ element_of_set(X2,X3)
| ~ element_of_collection(X9,X6)
| ~ element_of_collection(X8,X6)
| ~ element_of_set(X2,intersection_of_sets(X9,X8))
| element_of_collection(f6(X3,X6,X2,X9,X8),X6) ),
file('<stdin>',basis_for_topology_30) ).
fof(c_0_3_004,axiom,
! [X3,X6,X5] :
( ~ element_of_collection(X5,top_of_basis(X6))
| ~ element_of_set(X3,X5)
| element_of_set(X3,f10(X6,X5,X3)) ),
file('<stdin>',topology_generated_37) ).
fof(c_0_4_005,axiom,
! [X3,X6,X5] :
( ~ element_of_collection(X5,top_of_basis(X6))
| ~ element_of_set(X3,X5)
| element_of_collection(f10(X6,X5,X3),X6) ),
file('<stdin>',topology_generated_38) ).
fof(c_0_5,axiom,
! [X3,X6,X5] :
( ~ element_of_collection(X5,top_of_basis(X6))
| ~ element_of_set(X3,X5)
| subset_sets(f10(X6,X5,X3),X5) ),
file('<stdin>',topology_generated_39) ).
fof(c_0_6,axiom,
! [X6,X7,X5] :
( element_of_collection(X5,top_of_basis(X6))
| ~ element_of_set(f11(X6,X5),X7)
| ~ element_of_collection(X7,X6)
| ~ subset_sets(X7,X5) ),
file('<stdin>',topology_generated_41) ).
fof(c_0_7,axiom,
! [X2,X3,X4,X5] :
( ~ subset_sets(X3,X2)
| ~ subset_sets(X5,X4)
| subset_sets(intersection_of_sets(X3,X5),intersection_of_sets(X2,X4)) ),
file('<stdin>',set_theory_16) ).
fof(c_0_8,axiom,
! [X1,X2,X3] :
( element_of_set(X1,intersection_of_sets(X3,X2))
| ~ element_of_set(X1,X3)
| ~ element_of_set(X1,X2) ),
file('<stdin>',set_theory_15) ).
fof(c_0_9,axiom,
! [X1,X2,X3] :
( ~ element_of_set(X1,intersection_of_sets(X3,X2))
| element_of_set(X1,X3) ),
file('<stdin>',set_theory_13) ).
fof(c_0_10,axiom,
! [X1,X2,X3] :
( ~ element_of_set(X1,intersection_of_sets(X3,X2))
| element_of_set(X1,X2) ),
file('<stdin>',set_theory_14) ).
fof(c_0_11,axiom,
! [X6,X10,X5] :
( element_of_set(X5,union_of_members(X6))
| ~ element_of_set(X5,X10)
| ~ element_of_collection(X10,X6) ),
file('<stdin>',union_of_members_3) ).
fof(c_0_12,axiom,
! [X6,X5] :
( element_of_collection(X5,top_of_basis(X6))
| element_of_set(f11(X6,X5),X5) ),
file('<stdin>',topology_generated_40) ).
fof(c_0_13,axiom,
! [X1,X2,X3] :
( ~ subset_sets(X3,X2)
| ~ subset_sets(X2,X1)
| subset_sets(X3,X1) ),
file('<stdin>',set_theory_12) ).
fof(c_0_14,axiom,
! [X1,X2,X3] :
( ~ equal_sets(X3,X2)
| ~ element_of_set(X1,X3)
| element_of_set(X1,X2) ),
file('<stdin>',set_theory_17) ).
fof(c_0_15,axiom,
! [X3,X6] :
( ~ basis(X3,X6)
| equal_sets(union_of_members(X6),X3) ),
file('<stdin>',basis_for_topology_28) ).
fof(c_0_16,plain,
! [X2,X3,X6,X8,X9] :
( ~ basis(X3,X6)
| ~ element_of_set(X2,X3)
| ~ element_of_collection(X9,X6)
| ~ element_of_collection(X8,X6)
| ~ element_of_set(X2,intersection_of_sets(X9,X8))
| subset_sets(f6(X3,X6,X2,X9,X8),intersection_of_sets(X9,X8)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_17,plain,
! [X2,X3,X6,X8,X9] :
( ~ basis(X3,X6)
| ~ element_of_set(X2,X3)
| ~ element_of_collection(X9,X6)
| ~ element_of_collection(X8,X6)
| ~ element_of_set(X2,intersection_of_sets(X9,X8))
| element_of_set(X2,f6(X3,X6,X2,X9,X8)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_18,plain,
! [X2,X3,X6,X8,X9] :
( ~ basis(X3,X6)
| ~ element_of_set(X2,X3)
| ~ element_of_collection(X9,X6)
| ~ element_of_collection(X8,X6)
| ~ element_of_set(X2,intersection_of_sets(X9,X8))
| element_of_collection(f6(X3,X6,X2,X9,X8),X6) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_19,plain,
! [X3,X6,X5] :
( ~ element_of_collection(X5,top_of_basis(X6))
| ~ element_of_set(X3,X5)
| element_of_set(X3,f10(X6,X5,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_20,plain,
! [X3,X6,X5] :
( ~ element_of_collection(X5,top_of_basis(X6))
| ~ element_of_set(X3,X5)
| element_of_collection(f10(X6,X5,X3),X6) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_21,plain,
! [X3,X6,X5] :
( ~ element_of_collection(X5,top_of_basis(X6))
| ~ element_of_set(X3,X5)
| subset_sets(f10(X6,X5,X3),X5) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_22,plain,
! [X6,X7,X5] :
( element_of_collection(X5,top_of_basis(X6))
| ~ element_of_set(f11(X6,X5),X7)
| ~ element_of_collection(X7,X6)
| ~ subset_sets(X7,X5) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_23,plain,
! [X2,X3,X4,X5] :
( ~ subset_sets(X3,X2)
| ~ subset_sets(X5,X4)
| subset_sets(intersection_of_sets(X3,X5),intersection_of_sets(X2,X4)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_24,plain,
! [X1,X2,X3] :
( element_of_set(X1,intersection_of_sets(X3,X2))
| ~ element_of_set(X1,X3)
| ~ element_of_set(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_25,plain,
! [X1,X2,X3] :
( ~ element_of_set(X1,intersection_of_sets(X3,X2))
| element_of_set(X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_26,plain,
! [X1,X2,X3] :
( ~ element_of_set(X1,intersection_of_sets(X3,X2))
| element_of_set(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_27,plain,
! [X6,X10,X5] :
( element_of_set(X5,union_of_members(X6))
| ~ element_of_set(X5,X10)
| ~ element_of_collection(X10,X6) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_28,axiom,
! [X6,X5] :
( element_of_collection(X5,top_of_basis(X6))
| element_of_set(f11(X6,X5),X5) ),
c_0_12 ).
fof(c_0_29,plain,
! [X1,X2,X3] :
( ~ subset_sets(X3,X2)
| ~ subset_sets(X2,X1)
| subset_sets(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_30,plain,
! [X1,X2,X3] :
( ~ equal_sets(X3,X2)
| ~ element_of_set(X1,X3)
| element_of_set(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_31,plain,
! [X3,X6] :
( ~ basis(X3,X6)
| equal_sets(union_of_members(X6),X3) ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_32,plain,
! [X10,X11,X12,X13,X14] :
( ~ basis(X11,X12)
| ~ element_of_set(X10,X11)
| ~ element_of_collection(X14,X12)
| ~ element_of_collection(X13,X12)
| ~ element_of_set(X10,intersection_of_sets(X14,X13))
| subset_sets(f6(X11,X12,X10,X14,X13),intersection_of_sets(X14,X13)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_16])])]) ).
fof(c_0_33,plain,
! [X10,X11,X12,X13,X14] :
( ~ basis(X11,X12)
| ~ element_of_set(X10,X11)
| ~ element_of_collection(X14,X12)
| ~ element_of_collection(X13,X12)
| ~ element_of_set(X10,intersection_of_sets(X14,X13))
| element_of_set(X10,f6(X11,X12,X10,X14,X13)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_17])])]) ).
fof(c_0_34,plain,
! [X10,X11,X12,X13,X14] :
( ~ basis(X11,X12)
| ~ element_of_set(X10,X11)
| ~ element_of_collection(X14,X12)
| ~ element_of_collection(X13,X12)
| ~ element_of_set(X10,intersection_of_sets(X14,X13))
| element_of_collection(f6(X11,X12,X10,X14,X13),X12) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_18])])]) ).
fof(c_0_35,plain,
! [X7,X8,X9] :
( ~ element_of_collection(X9,top_of_basis(X8))
| ~ element_of_set(X7,X9)
| element_of_set(X7,f10(X8,X9,X7)) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_36,plain,
! [X7,X8,X9] :
( ~ element_of_collection(X9,top_of_basis(X8))
| ~ element_of_set(X7,X9)
| element_of_collection(f10(X8,X9,X7),X8) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_37,plain,
! [X7,X8,X9] :
( ~ element_of_collection(X9,top_of_basis(X8))
| ~ element_of_set(X7,X9)
| subset_sets(f10(X8,X9,X7),X9) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_38,plain,
! [X8,X9,X10] :
( element_of_collection(X10,top_of_basis(X8))
| ~ element_of_set(f11(X8,X10),X9)
| ~ element_of_collection(X9,X8)
| ~ subset_sets(X9,X10) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_39,plain,
! [X6,X7,X8,X9] :
( ~ subset_sets(X7,X6)
| ~ subset_sets(X9,X8)
| subset_sets(intersection_of_sets(X7,X9),intersection_of_sets(X6,X8)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_23])])]) ).
fof(c_0_40,plain,
! [X4,X5,X6] :
( element_of_set(X4,intersection_of_sets(X6,X5))
| ~ element_of_set(X4,X6)
| ~ element_of_set(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_41,plain,
! [X4,X5,X6] :
( ~ element_of_set(X4,intersection_of_sets(X6,X5))
| element_of_set(X4,X6) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_42,plain,
! [X4,X5,X6] :
( ~ element_of_set(X4,intersection_of_sets(X6,X5))
| element_of_set(X4,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_26])])]) ).
fof(c_0_43,plain,
! [X11,X12,X13] :
( element_of_set(X13,union_of_members(X11))
| ~ element_of_set(X13,X12)
| ~ element_of_collection(X12,X11) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_44,plain,
! [X7,X8] :
( element_of_collection(X8,top_of_basis(X7))
| element_of_set(f11(X7,X8),X8) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_45,plain,
! [X4,X5,X6] :
( ~ subset_sets(X6,X5)
| ~ subset_sets(X5,X4)
| subset_sets(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_46,plain,
! [X4,X5,X6] :
( ~ equal_sets(X6,X5)
| ~ element_of_set(X4,X6)
| element_of_set(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_47,plain,
! [X7,X8] :
( ~ basis(X7,X8)
| equal_sets(union_of_members(X8),X7) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
cnf(c_0_48,plain,
( subset_sets(f6(X1,X2,X3,X4,X5),intersection_of_sets(X4,X5))
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_49,plain,
( element_of_set(X1,f6(X2,X3,X1,X4,X5))
| ~ element_of_set(X1,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X3)
| ~ element_of_collection(X4,X3)
| ~ element_of_set(X1,X2)
| ~ basis(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_50,plain,
( element_of_collection(f6(X1,X2,X3,X4,X5),X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,plain,
( element_of_set(X1,f10(X2,X3,X1))
| ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,top_of_basis(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_52,plain,
( element_of_collection(f10(X1,X2,X3),X1)
| ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_53,plain,
( subset_sets(f10(X1,X2,X3),X2)
| ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_54,plain,
( element_of_collection(X2,top_of_basis(X3))
| ~ subset_sets(X1,X2)
| ~ element_of_collection(X1,X3)
| ~ element_of_set(f11(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_55,plain,
( subset_sets(intersection_of_sets(X1,X2),intersection_of_sets(X3,X4))
| ~ subset_sets(X2,X4)
| ~ subset_sets(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_56,plain,
( element_of_set(X1,intersection_of_sets(X3,X2))
| ~ element_of_set(X1,X2)
| ~ element_of_set(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_57,plain,
( element_of_set(X1,X2)
| ~ element_of_set(X1,intersection_of_sets(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_58,plain,
( element_of_set(X1,X2)
| ~ element_of_set(X1,intersection_of_sets(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_59,plain,
( element_of_set(X3,union_of_members(X2))
| ~ element_of_collection(X1,X2)
| ~ element_of_set(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_60,plain,
( element_of_set(f11(X1,X2),X2)
| element_of_collection(X2,top_of_basis(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_61,plain,
( subset_sets(X1,X2)
| ~ subset_sets(X3,X2)
| ~ subset_sets(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_62,plain,
( element_of_set(X1,X2)
| ~ element_of_set(X1,X3)
| ~ equal_sets(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_63,plain,
( equal_sets(union_of_members(X1),X2)
| ~ basis(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_64,plain,
( subset_sets(f6(X1,X2,X3,X4,X5),intersection_of_sets(X4,X5))
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
c_0_48,
[final] ).
cnf(c_0_65,plain,
( element_of_set(X1,f6(X2,X3,X1,X4,X5))
| ~ element_of_set(X1,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X3)
| ~ element_of_collection(X4,X3)
| ~ element_of_set(X1,X2)
| ~ basis(X2,X3) ),
c_0_49,
[final] ).
cnf(c_0_66,plain,
( element_of_collection(f6(X1,X2,X3,X4,X5),X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
c_0_50,
[final] ).
cnf(c_0_67,plain,
( element_of_set(X1,f10(X2,X3,X1))
| ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,top_of_basis(X2)) ),
c_0_51,
[final] ).
cnf(c_0_68,plain,
( element_of_collection(f10(X1,X2,X3),X1)
| ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
c_0_52,
[final] ).
cnf(c_0_69,plain,
( subset_sets(f10(X1,X2,X3),X2)
| ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
c_0_53,
[final] ).
cnf(c_0_70,plain,
( element_of_collection(X2,top_of_basis(X3))
| ~ subset_sets(X1,X2)
| ~ element_of_collection(X1,X3)
| ~ element_of_set(f11(X3,X2),X1) ),
c_0_54,
[final] ).
cnf(c_0_71,plain,
( subset_sets(intersection_of_sets(X1,X2),intersection_of_sets(X3,X4))
| ~ subset_sets(X2,X4)
| ~ subset_sets(X1,X3) ),
c_0_55,
[final] ).
cnf(c_0_72,plain,
( element_of_set(X1,intersection_of_sets(X3,X2))
| ~ element_of_set(X1,X2)
| ~ element_of_set(X1,X3) ),
c_0_56,
[final] ).
cnf(c_0_73,plain,
( element_of_set(X1,X2)
| ~ element_of_set(X1,intersection_of_sets(X2,X3)) ),
c_0_57,
[final] ).
cnf(c_0_74,plain,
( element_of_set(X1,X2)
| ~ element_of_set(X1,intersection_of_sets(X3,X2)) ),
c_0_58,
[final] ).
cnf(c_0_75,plain,
( element_of_set(X3,union_of_members(X2))
| ~ element_of_collection(X1,X2)
| ~ element_of_set(X3,X1) ),
c_0_59,
[final] ).
cnf(c_0_76,plain,
( element_of_set(f11(X1,X2),X2)
| element_of_collection(X2,top_of_basis(X1)) ),
c_0_60,
[final] ).
cnf(c_0_77,plain,
( subset_sets(X1,X2)
| ~ subset_sets(X3,X2)
| ~ subset_sets(X1,X3) ),
c_0_61,
[final] ).
cnf(c_0_78,plain,
( element_of_set(X1,X2)
| ~ element_of_set(X1,X3)
| ~ equal_sets(X3,X2) ),
c_0_62,
[final] ).
cnf(c_0_79,plain,
( equal_sets(union_of_members(X1),X2)
| ~ basis(X2,X1) ),
c_0_63,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_64_0,axiom,
( subset_sets(f6(X1,X2,X3,X4,X5),intersection_of_sets(X4,X5))
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_1,axiom,
( ~ element_of_set(X3,intersection_of_sets(X4,X5))
| subset_sets(f6(X1,X2,X3,X4,X5),intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_2,axiom,
( ~ element_of_collection(X5,X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| subset_sets(f6(X1,X2,X3,X4,X5),intersection_of_sets(X4,X5))
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_3,axiom,
( ~ element_of_collection(X4,X2)
| ~ element_of_collection(X5,X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| subset_sets(f6(X1,X2,X3,X4,X5),intersection_of_sets(X4,X5))
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_4,axiom,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X4,X2)
| ~ element_of_collection(X5,X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| subset_sets(f6(X1,X2,X3,X4,X5),intersection_of_sets(X4,X5))
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_5,axiom,
( ~ basis(X1,X2)
| ~ element_of_set(X3,X1)
| ~ element_of_collection(X4,X2)
| ~ element_of_collection(X5,X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| subset_sets(f6(X1,X2,X3,X4,X5),intersection_of_sets(X4,X5)) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_65_0,axiom,
( element_of_set(X1,f6(X2,X3,X1,X4,X5))
| ~ element_of_set(X1,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X3)
| ~ element_of_collection(X4,X3)
| ~ element_of_set(X1,X2)
| ~ basis(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_1,axiom,
( ~ element_of_set(X1,intersection_of_sets(X4,X5))
| element_of_set(X1,f6(X2,X3,X1,X4,X5))
| ~ element_of_collection(X5,X3)
| ~ element_of_collection(X4,X3)
| ~ element_of_set(X1,X2)
| ~ basis(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_2,axiom,
( ~ element_of_collection(X5,X3)
| ~ element_of_set(X1,intersection_of_sets(X4,X5))
| element_of_set(X1,f6(X2,X3,X1,X4,X5))
| ~ element_of_collection(X4,X3)
| ~ element_of_set(X1,X2)
| ~ basis(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_3,axiom,
( ~ element_of_collection(X4,X3)
| ~ element_of_collection(X5,X3)
| ~ element_of_set(X1,intersection_of_sets(X4,X5))
| element_of_set(X1,f6(X2,X3,X1,X4,X5))
| ~ element_of_set(X1,X2)
| ~ basis(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_4,axiom,
( ~ element_of_set(X1,X2)
| ~ element_of_collection(X4,X3)
| ~ element_of_collection(X5,X3)
| ~ element_of_set(X1,intersection_of_sets(X4,X5))
| element_of_set(X1,f6(X2,X3,X1,X4,X5))
| ~ basis(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_65_5,axiom,
( ~ basis(X2,X3)
| ~ element_of_set(X1,X2)
| ~ element_of_collection(X4,X3)
| ~ element_of_collection(X5,X3)
| ~ element_of_set(X1,intersection_of_sets(X4,X5))
| element_of_set(X1,f6(X2,X3,X1,X4,X5)) ),
inference(literals_permutation,[status(thm)],[c_0_65]) ).
cnf(c_0_66_0,axiom,
( element_of_collection(f6(X1,X2,X3,X4,X5),X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| ~ element_of_collection(X5,X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_1,axiom,
( ~ element_of_set(X3,intersection_of_sets(X4,X5))
| element_of_collection(f6(X1,X2,X3,X4,X5),X2)
| ~ element_of_collection(X5,X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_2,axiom,
( ~ element_of_collection(X5,X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| element_of_collection(f6(X1,X2,X3,X4,X5),X2)
| ~ element_of_collection(X4,X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_3,axiom,
( ~ element_of_collection(X4,X2)
| ~ element_of_collection(X5,X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| element_of_collection(f6(X1,X2,X3,X4,X5),X2)
| ~ element_of_set(X3,X1)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_4,axiom,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X4,X2)
| ~ element_of_collection(X5,X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| element_of_collection(f6(X1,X2,X3,X4,X5),X2)
| ~ basis(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_66_5,axiom,
( ~ basis(X1,X2)
| ~ element_of_set(X3,X1)
| ~ element_of_collection(X4,X2)
| ~ element_of_collection(X5,X2)
| ~ element_of_set(X3,intersection_of_sets(X4,X5))
| element_of_collection(f6(X1,X2,X3,X4,X5),X2) ),
inference(literals_permutation,[status(thm)],[c_0_66]) ).
cnf(c_0_67_0,axiom,
( element_of_set(X1,f10(X2,X3,X1))
| ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,top_of_basis(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_67_1,axiom,
( ~ element_of_set(X1,X3)
| element_of_set(X1,f10(X2,X3,X1))
| ~ element_of_collection(X3,top_of_basis(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_67_2,axiom,
( ~ element_of_collection(X3,top_of_basis(X2))
| ~ element_of_set(X1,X3)
| element_of_set(X1,f10(X2,X3,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_67]) ).
cnf(c_0_68_0,axiom,
( element_of_collection(f10(X1,X2,X3),X1)
| ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_1,axiom,
( ~ element_of_set(X3,X2)
| element_of_collection(f10(X1,X2,X3),X1)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_2,axiom,
( ~ element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(X3,X2)
| element_of_collection(f10(X1,X2,X3),X1) ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_69_0,axiom,
( subset_sets(f10(X1,X2,X3),X2)
| ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_69_1,axiom,
( ~ element_of_set(X3,X2)
| subset_sets(f10(X1,X2,X3),X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_69_2,axiom,
( ~ element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(X3,X2)
| subset_sets(f10(X1,X2,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_70_0,axiom,
( element_of_collection(X2,top_of_basis(X3))
| ~ subset_sets(X1,X2)
| ~ element_of_collection(X1,X3)
| ~ element_of_set(f11(X3,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_1,axiom,
( ~ subset_sets(X1,X2)
| element_of_collection(X2,top_of_basis(X3))
| ~ element_of_collection(X1,X3)
| ~ element_of_set(f11(X3,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_2,axiom,
( ~ element_of_collection(X1,X3)
| ~ subset_sets(X1,X2)
| element_of_collection(X2,top_of_basis(X3))
| ~ element_of_set(f11(X3,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_3,axiom,
( ~ element_of_set(f11(X3,X2),X1)
| ~ element_of_collection(X1,X3)
| ~ subset_sets(X1,X2)
| element_of_collection(X2,top_of_basis(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_71_0,axiom,
( subset_sets(intersection_of_sets(X1,X2),intersection_of_sets(X3,X4))
| ~ subset_sets(X2,X4)
| ~ subset_sets(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_1,axiom,
( ~ subset_sets(X2,X4)
| subset_sets(intersection_of_sets(X1,X2),intersection_of_sets(X3,X4))
| ~ subset_sets(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_2,axiom,
( ~ subset_sets(X1,X3)
| ~ subset_sets(X2,X4)
| subset_sets(intersection_of_sets(X1,X2),intersection_of_sets(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_72_0,axiom,
( element_of_set(X1,intersection_of_sets(X3,X2))
| ~ element_of_set(X1,X2)
| ~ element_of_set(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_1,axiom,
( ~ element_of_set(X1,X2)
| element_of_set(X1,intersection_of_sets(X3,X2))
| ~ element_of_set(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_2,axiom,
( ~ element_of_set(X1,X3)
| ~ element_of_set(X1,X2)
| element_of_set(X1,intersection_of_sets(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_73_0,axiom,
( element_of_set(X1,X2)
| ~ element_of_set(X1,intersection_of_sets(X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_1,axiom,
( ~ element_of_set(X1,intersection_of_sets(X2,X3))
| element_of_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_74_0,axiom,
( element_of_set(X1,X2)
| ~ element_of_set(X1,intersection_of_sets(X3,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_1,axiom,
( ~ element_of_set(X1,intersection_of_sets(X3,X2))
| element_of_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_75_0,axiom,
( element_of_set(X3,union_of_members(X2))
| ~ element_of_collection(X1,X2)
| ~ element_of_set(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_1,axiom,
( ~ element_of_collection(X1,X2)
| element_of_set(X3,union_of_members(X2))
| ~ element_of_set(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_2,axiom,
( ~ element_of_set(X3,X1)
| ~ element_of_collection(X1,X2)
| element_of_set(X3,union_of_members(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_76_0,axiom,
( element_of_set(f11(X1,X2),X2)
| element_of_collection(X2,top_of_basis(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_1,axiom,
( element_of_collection(X2,top_of_basis(X1))
| element_of_set(f11(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_77_0,axiom,
( subset_sets(X1,X2)
| ~ subset_sets(X3,X2)
| ~ subset_sets(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_1,axiom,
( ~ subset_sets(X3,X2)
| subset_sets(X1,X2)
| ~ subset_sets(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_2,axiom,
( ~ subset_sets(X1,X3)
| ~ subset_sets(X3,X2)
| subset_sets(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_78_0,axiom,
( element_of_set(X1,X2)
| ~ element_of_set(X1,X3)
| ~ equal_sets(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( ~ element_of_set(X1,X3)
| element_of_set(X1,X2)
| ~ equal_sets(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_2,axiom,
( ~ equal_sets(X3,X2)
| ~ element_of_set(X1,X3)
| element_of_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( equal_sets(union_of_members(X1),X2)
| ~ basis(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( ~ basis(X2,X1)
| equal_sets(union_of_members(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_006,negated_conjecture,
! [X2,X1] : ~ element_of_collection(intersection_of_sets(X1,X2),top_of_basis(f)),
file('<stdin>',lemma_1d_4) ).
fof(c_0_1_007,negated_conjecture,
! [X2] : element_of_collection(X2,top_of_basis(f)),
file('<stdin>',lemma_1d_3) ).
fof(c_0_2_008,negated_conjecture,
! [X1] : element_of_collection(X1,top_of_basis(f)),
file('<stdin>',lemma_1d_2) ).
fof(c_0_3_009,negated_conjecture,
basis(cx,f),
file('<stdin>',lemma_1d_1) ).
fof(c_0_4_010,negated_conjecture,
! [X2,X1] : ~ element_of_collection(intersection_of_sets(X1,X2),top_of_basis(f)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5_011,negated_conjecture,
! [X2] : element_of_collection(X2,top_of_basis(f)),
c_0_1 ).
fof(c_0_6_012,negated_conjecture,
! [X1] : element_of_collection(X1,top_of_basis(f)),
c_0_2 ).
fof(c_0_7_013,negated_conjecture,
basis(cx,f),
c_0_3 ).
fof(c_0_8_014,negated_conjecture,
! [X3,X4] : ~ element_of_collection(intersection_of_sets(X4,X3),top_of_basis(f)),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_9_015,negated_conjecture,
! [X3] : element_of_collection(X3,top_of_basis(f)),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_10_016,negated_conjecture,
! [X2] : element_of_collection(X2,top_of_basis(f)),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_11_017,negated_conjecture,
basis(cx,f),
c_0_7 ).
cnf(c_0_12_018,negated_conjecture,
~ element_of_collection(intersection_of_sets(X1,X2),top_of_basis(f)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_019,negated_conjecture,
element_of_collection(X1,top_of_basis(f)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14_020,negated_conjecture,
element_of_collection(X1,top_of_basis(f)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15_021,negated_conjecture,
basis(cx,f),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16_022,negated_conjecture,
~ element_of_collection(intersection_of_sets(X1,X2),top_of_basis(f)),
c_0_12,
[final] ).
cnf(c_0_17_023,negated_conjecture,
element_of_collection(X1,top_of_basis(f)),
c_0_13,
[final] ).
cnf(c_0_18_024,negated_conjecture,
element_of_collection(X1,top_of_basis(f)),
c_0_14,
[final] ).
cnf(c_0_19_025,negated_conjecture,
basis(cx,f),
c_0_15,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_55,negated_conjecture,
~ element_of_collection(intersection_of_sets(X0,X1),top_of_basis(f)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6fe883.p',c_0_16) ).
cnf(c_73,negated_conjecture,
~ element_of_collection(intersection_of_sets(X0,X1),top_of_basis(f)),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_89,negated_conjecture,
~ element_of_collection(intersection_of_sets(X0,X1),top_of_basis(f)),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_94,negated_conjecture,
~ element_of_collection(intersection_of_sets(X0,X1),top_of_basis(f)),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_95,negated_conjecture,
~ element_of_collection(intersection_of_sets(X0,X1),top_of_basis(f)),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_266,negated_conjecture,
~ element_of_collection(intersection_of_sets(X0,X1),top_of_basis(f)),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_56,negated_conjecture,
element_of_collection(X0,top_of_basis(f)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_6fe883.p',c_0_17) ).
cnf(c_75,negated_conjecture,
element_of_collection(X0,top_of_basis(f)),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_90,negated_conjecture,
element_of_collection(X0,top_of_basis(f)),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_93,negated_conjecture,
element_of_collection(X0,top_of_basis(f)),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_96,negated_conjecture,
element_of_collection(X0,top_of_basis(f)),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_268,negated_conjecture,
element_of_collection(X0,top_of_basis(f)),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_283,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_266,c_268]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : TOP004-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.33 % CPULimit : 300
% 0.18/0.33 % WCLimit : 600
% 0.18/0.33 % DateTime : Sun May 29 10:17:12 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.33 % Running in mono-core mode
% 0.18/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.18/0.39 % Orientation found
% 0.18/0.39 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fb6a04.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_6fe883.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_8cdfd2 | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.43 % --bmc1_ucm_extend_mode 1
% 0.19/0.43 % --bmc1_ucm_init_mode 2
% 0.19/0.43 % --bmc1_ucm_cone_mode none
% 0.19/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.43 % --bmc1_ucm_relax_model 4
% 0.19/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.43 % --bmc1_ucm_layered_model none
% 0.19/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.43
% 0.19/0.43 % ------ AIG Options
% 0.19/0.43
% 0.19/0.43 % --aig_mode false
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation Options
% 0.19/0.43
% 0.19/0.43 % --instantiation_flag true
% 0.19/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43 % --inst_solver_per_active 750
% 0.19/0.43 % --inst_solver_calls_frac 0.5
% 0.19/0.43 % --inst_passive_queue_type priority_queues
% 0.19/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 0.19/0.43 % --inst_prop_sim_given true
% 0.19/0.43 % --inst_prop_sim_new false
% 0.19/0.43 % --inst_orphan_elimination true
% 0.19/0.43 % --inst_learning_loop_flag true
% 0.19/0.43 % --inst_learning_start 3000
% 0.19/0.43 % --inst_learning_factor 2
% 0.19/0.43 % --inst_start_prop_sim_after_learn 3
% 0.19/0.43 % --inst_sel_renew solver
% 0.19/0.43 % --inst_lit_activity_flag true
% 0.19/0.43 % --inst_out_proof true
% 0.19/0.43
% 0.19/0.43 % ------ Resolution Options
% 0.19/0.43
% 0.19/0.43 % --resolution_flag true
% 0.19/0.43 % --res_lit_sel kbo_max
% 0.19/0.43 % --res_to_prop_solver none
% 0.19/0.43 % --res_prop_simpl_new false
% 0.19/0.43 % --res_prop_simpl_given false
% 0.19/0.43 % --res_passive_queue_type priority_queues
% 0.19/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.43 % --res_passive_queues_freq [15;5]
% 0.19/0.43 % --res_forward_subs full
% 0.19/0.43 % --res_backward_subs full
% 0.19/0.43 % --res_forward_subs_resolution true
% 0.19/0.43 % --res_backward_subs_resolution true
% 0.19/0.43 % --res_orphan_elimination false
% 0.19/0.43 % --res_time_limit 1000.
% 0.19/0.43 % --res_out_proof true
% 0.19/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fb6a04.s
% 0.19/0.43 % --modulo true
% 0.19/0.43
% 0.19/0.43 % ------ Combination Options
% 0.19/0.43
% 0.19/0.43 % --comb_res_mult 1000
% 0.19/0.43 % --comb_inst_mult 300
% 0.19/0.43 % ------
% 0.19/0.43
% 0.19/0.43 % ------ Parsing...% successful
% 0.19/0.43
% 0.19/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.43
% 0.19/0.43 % ------ Proving...
% 0.19/0.43 % ------ Problem Properties
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % EPR false
% 0.19/0.43 % Horn false
% 0.19/0.43 % Has equality false
% 0.19/0.43
% 0.19/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % % ------ Current options:
% 0.19/0.43
% 0.19/0.43 % ------ Input Options
% 0.19/0.43
% 0.19/0.43 % --out_options all
% 0.19/0.43 % --tptp_safe_out true
% 0.19/0.43 % --problem_path ""
% 0.19/0.43 % --include_path ""
% 0.19/0.43 % --clausifier .//eprover
% 0.19/0.43 % --clausifier_options --tstp-format
% 0.19/0.43 % --stdin false
% 0.19/0.43 % --dbg_backtrace false
% 0.19/0.43 % --dbg_dump_prop_clauses false
% 0.19/0.43 % --dbg_dump_prop_clauses_file -
% 0.19/0.43 % --dbg_out_stat false
% 0.19/0.43
% 0.19/0.43 % ------ General Options
% 0.19/0.43
% 0.19/0.43 % --fof false
% 0.19/0.43 % --time_out_real 150.
% 0.19/0.43 % --time_out_prep_mult 0.2
% 0.19/0.43 % --time_out_virtual -1.
% 0.19/0.43 % --schedule none
% 0.19/0.43 % --ground_splitting input
% 0.19/0.43 % --splitting_nvd 16
% 0.19/0.43 % --non_eq_to_eq false
% 0.19/0.43 % --prep_gs_sim true
% 0.19/0.43 % --prep_unflatten false
% 0.19/0.43 % --prep_res_sim true
% 0.19/0.43 % --prep_upred true
% 0.19/0.43 % --res_sim_input true
% 0.19/0.43 % --clause_weak_htbl true
% 0.19/0.43 % --gc_record_bc_elim false
% 0.19/0.43 % --symbol_type_check false
% 0.19/0.43 % --clausify_out false
% 0.19/0.43 % --large_theory_mode false
% 0.19/0.43 % --prep_sem_filter none
% 0.19/0.43 % --prep_sem_filter_out false
% 0.19/0.43 % --preprocessed_out false
% 0.19/0.43 % --sub_typing false
% 0.19/0.43 % --brand_transform false
% 0.19/0.43 % --pure_diseq_elim true
% 0.19/0.43 % --min_unsat_core false
% 0.19/0.43 % --pred_elim true
% 0.19/0.43 % --add_important_lit false
% 0.19/0.43 % --soft_assumptions false
% 0.19/0.43 % --reset_solvers false
% 0.19/0.43 % --bc_imp_inh []
% 0.19/0.43 % --conj_cone_tolerance 1.5
% 0.19/0.43 % --prolific_symb_bound 500
% 0.19/0.43 % --lt_threshold 2000
% 0.19/0.43
% 0.19/0.43 % ------ SAT Options
% 0.19/0.43
% 0.19/0.43 % --sat_mode false
% 0.19/0.43 % --sat_fm_restart_options ""
% 0.19/0.43 % --sat_gr_def false
% 0.19/0.43 % --sat_epr_types true
% 0.19/0.43 % --sat_non_cyclic_types false
% 0.19/0.43 % --sat_finite_models false
% 0.19/0.43 % --sat_fm_lemmas false
% 0.19/0.43 % --sat_fm_prep false
% 0.19/0.43 % --sat_fm_uc_incr true
% 0.19/0.43 % --sat_out_model small
% 0.19/0.43 % --sat_out_clauses false
% 0.19/0.43
% 0.19/0.43 % ------ QBF Options
% 0.19/0.43
% 0.19/0.43 % --qbf_mode false
% 0.19/0.43 % --qbf_elim_univ true
% 0.19/0.43 % --qbf_sk_in true
% 0.19/0.43 % --qbf_pred_elim true
% 0.19/0.43 % --qbf_split 32
% 0.19/0.43
% 0.19/0.43 % ------ BMC1 Options
% 0.19/0.43
% 0.19/0.43 % --bmc1_incremental false
% 0.19/0.43 % --bmc1_axioms reachable_all
% 0.19/0.43 % --bmc1_min_bound 0
% 0.19/0.43 % --bmc1_max_bound -1
% 0.19/0.43 % --bmc1_max_bound_default -1
% 0.19/0.43 % --bmc1_symbol_reachability true
% 0.19/0.43 % --bmc1_property_lemmas false
% 0.19/0.43 % --bmc1_k_induction false
% 0.19/0.43 % --bmc1_non_equiv_states false
% 0.19/0.43 % --bmc1_deadlock false
% 0.19/0.43 % --bmc1_ucm false
% 0.19/0.43 % --bmc1_add_unsat_core none
% 0.19/0.43 % --bmc1_unsat_core_children false
% 0.19/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.43 % --bmc1_out_stat full
% 0.19/0.43 % --bmc1_ground_init false
% 0.19/0.43 % --bmc1_pre_inst_next_state false
% 0.19/0.43 % --bmc1_pre_inst_state false
% 0.19/0.43 % --bmc1_pre_inst_reach_state false
% 0.19/0.43 % --bmc1_out_unsat_core false
% 0.19/0.43 % --bmc1_aig_witness_out false
% 0.19/0.43 % --bmc1_verbose false
% 0.19/0.43 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.43 % --bmc1_ucm_extend_mode 1
% 0.19/0.43 % --bmc1_ucm_init_mode 2
% 0.19/0.43 % --bmc1_ucm_cone_mode none
% 0.19/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.43 % --bmc1_ucm_relax_model 4
% 0.19/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.43 % --bmc1_ucm_layered_model none
% 0.19/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.43
% 0.19/0.43 % ------ AIG Options
% 0.19/0.43
% 0.19/0.43 % --aig_mode false
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation Options
% 0.19/0.43
% 0.19/0.43 % --instantiation_flag true
% 0.19/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43 % --inst_solver_per_active 750
% 0.19/0.43 % --inst_solver_calls_frac 0.5
% 0.19/0.43 % --inst_passive_queue_type priority_queues
% 0.19/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 0.19/0.43 % --inst_prop_sim_given true
% 0.19/0.43 % --inst_prop_sim_new false
% 0.19/0.43 % --inst_orphan_elimination true
% 0.19/0.43 % --inst_learning_loop_flag true
% 0.19/0.43 % --inst_learning_start 3000
% 0.19/0.43 % --inst_learning_factor 2
% 0.19/0.43 % --inst_start_prop_sim_after_learn 3
% 0.19/0.43 % --inst_sel_renew solver
% 0.19/0.43 % --inst_lit_activity_flag true
% 0.19/0.43 % --inst_out_proof true
% 0.19/0.43
% 0.19/0.43 % ------ Resolution Options
% 0.19/0.43
% 0.19/0.43 % --resolution_flag true
% 0.19/0.43 % --res_lit_sel kbo_max
% 0.19/0.43 % --res_to_prop_solver none
% 0.19/0.43 % --res_prop_simpl_new false
% 0.19/0.43 % --res_prop_simpl_given false
% 0.19/0.43 % --res_passive_queue_type priority_queues
% 0.19/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.43 % --res_passive_queues_freq [15;5]
% 0.19/0.43 % --res_forward_subs full
% 0.19/0.43 % --res_backward_subs full
% 0.19/0.43 % --res_forward_subs_resolution true
% 0.19/0.43 % --res_backward_subs_resolution true
% 0.19/0.43 % --res_orphan_elimination false
% 0.19/0.43 % --res_time_limit 1000.
% 0.19/0.43 % --res_out_proof true
% 0.19/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fb6a04.s
% 0.19/0.43 % --modulo true
% 0.19/0.43
% 0.19/0.43 % ------ Combination Options
% 0.19/0.43
% 0.19/0.43 % --comb_res_mult 1000
% 0.19/0.43 % --comb_inst_mult 300
% 0.19/0.43 % ------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % ------ Proving...
% 0.19/0.43 %
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % Resolution empty clause
% 0.19/0.43
% 0.19/0.43 % ------ Statistics
% 0.19/0.43
% 0.19/0.43 % ------ General
% 0.19/0.43
% 0.19/0.43 % num_of_input_clauses: 59
% 0.19/0.43 % num_of_input_neg_conjectures: 4
% 0.19/0.43 % num_of_splits: 0
% 0.19/0.43 % num_of_split_atoms: 0
% 0.19/0.43 % num_of_sem_filtered_clauses: 0
% 0.19/0.43 % num_of_subtypes: 0
% 0.19/0.43 % monotx_restored_types: 0
% 0.19/0.43 % sat_num_of_epr_types: 0
% 0.19/0.43 % sat_num_of_non_cyclic_types: 0
% 0.19/0.43 % sat_guarded_non_collapsed_types: 0
% 0.19/0.43 % is_epr: 0
% 0.19/0.43 % is_horn: 0
% 0.19/0.43 % has_eq: 0
% 0.19/0.43 % num_pure_diseq_elim: 0
% 0.19/0.43 % simp_replaced_by: 0
% 0.19/0.43 % res_preprocessed: 8
% 0.19/0.43 % prep_upred: 0
% 0.19/0.43 % prep_unflattend: 0
% 0.19/0.43 % pred_elim_cands: 0
% 0.19/0.43 % pred_elim: 0
% 0.19/0.43 % pred_elim_cl: 0
% 0.19/0.43 % pred_elim_cycles: 0
% 0.19/0.43 % forced_gc_time: 0
% 0.19/0.43 % gc_basic_clause_elim: 0
% 0.19/0.43 % parsing_time: 0.003
% 0.19/0.43 % sem_filter_time: 0.
% 0.19/0.43 % pred_elim_time: 0.
% 0.19/0.43 % out_proof_time: 0.
% 0.19/0.43 % monotx_time: 0.
% 0.19/0.43 % subtype_inf_time: 0.
% 0.19/0.43 % unif_index_cands_time: 0.
% 0.19/0.43 % unif_index_add_time: 0.
% 0.19/0.43 % total_time: 0.028
% 0.19/0.43 % num_of_symbols: 38
% 0.19/0.43 % num_of_terms: 212
% 0.19/0.43
% 0.19/0.43 % ------ Propositional Solver
% 0.19/0.43
% 0.19/0.43 % prop_solver_calls: 1
% 0.19/0.43 % prop_fast_solver_calls: 11
% 0.19/0.43 % prop_num_of_clauses: 46
% 0.19/0.43 % prop_preprocess_simplified: 236
% 0.19/0.43 % prop_fo_subsumed: 0
% 0.19/0.43 % prop_solver_time: 0.
% 0.19/0.43 % prop_fast_solver_time: 0.
% 0.19/0.43 % prop_unsat_core_time: 0.
% 0.19/0.43
% 0.19/0.43 % ------ QBF
% 0.19/0.43
% 0.19/0.43 % qbf_q_res: 0
% 0.19/0.43 % qbf_num_tautologies: 0
% 0.19/0.43 % qbf_prep_cycles: 0
% 0.19/0.43
% 0.19/0.43 % ------ BMC1
% 0.19/0.43
% 0.19/0.43 % bmc1_current_bound: -1
% 0.19/0.43 % bmc1_last_solved_bound: -1
% 0.19/0.43 % bmc1_unsat_core_size: -1
% 0.19/0.43 % bmc1_unsat_core_parents_size: -1
% 0.19/0.43 % bmc1_merge_next_fun: 0
% 0.19/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation
% 0.19/0.43
% 0.19/0.43 % inst_num_of_clauses: 58
% 0.19/0.43 % inst_num_in_passive: 0
% 0.19/0.43 % inst_num_in_active: 0
% 0.19/0.43 % inst_num_in_unprocessed: 58
% 0.19/0.43 % inst_num_of_loops: 0
% 0.19/0.43 % inst_num_of_learning_restarts: 0
% 0.19/0.43 % inst_num_moves_active_passive: 0
% 0.19/0.43 % inst_lit_activity: 0
% 0.19/0.43 % inst_lit_activity_moves: 0
% 0.19/0.43 % inst_num_tautologies: 0
% 0.19/0.43 % inst_num_prop_implied: 0
% 0.19/0.43 % inst_num_existing_simplified: 0
% 0.19/0.43 % inst_num_eq_res_simplified: 0
% 0.19/0.43 % inst_num_child_elim: 0
% 0.19/0.43 % inst_num_of_dismatching_blockings: 0
% 0.19/0.43 % inst_num_of_non_proper_insts: 0
% 0.19/0.43 % inst_num_of_duplicates: 0
% 0.19/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.19/0.43 % inst_dismatching_checking_time: 0.
% 0.19/0.43
% 0.19/0.43 % ------ Resolution
% 0.19/0.43
% 0.19/0.43 % res_num_of_clauses: 73
% 0.19/0.43 % res_num_in_passive: 3
% 0.19/0.43 % res_num_in_active: 27
% 0.19/0.43 % res_num_of_loops: 3
% 0.19/0.43 % res_forward_subset_subsumed: 30
% 0.19/0.43 % res_backward_subset_subsumed: 0
% 0.19/0.43 % res_forward_subsumed: 0
% 0.19/0.43 % res_backward_subsumed: 0
% 0.19/0.43 % res_forward_subsumption_resolution: 1
% 0.19/0.43 % res_backward_subsumption_resolution: 0
% 0.19/0.43 % res_clause_to_clause_subsumption: 1
% 0.19/0.43 % res_orphan_elimination: 0
% 0.19/0.43 % res_tautology_del: 0
% 0.19/0.43 % res_num_eq_res_simplified: 0
% 0.19/0.43 % res_num_sel_changes: 0
% 0.19/0.43 % res_moves_from_active_to_pass: 0
% 0.19/0.43
% 0.19/0.43 % Status Unsatisfiable
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------