TSTP Solution File: TOP005-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : TOP005-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 21:26:57 EDT 2022
% Result : Unsatisfiable 0.72s 0.91s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 23
% Syntax : Number of formulae : 124 ( 13 unt; 0 def)
% Number of atoms : 329 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 398 ( 193 ~; 205 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 267 ( 0 sgn 81 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X1,X2] :
( ~ element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(X3,X2)
| subset_sets(f10(X1,X2,X3),X2) ),
file('<stdin>',topology_generated_39) ).
fof(c_0_1,axiom,
! [X3,X1,X2] :
( ~ element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(X3,X2)
| element_of_collection(f10(X1,X2,X3),X1) ),
file('<stdin>',topology_generated_38) ).
fof(c_0_2,axiom,
! [X3,X1,X2] :
( ~ element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(X3,X2)
| element_of_set(X3,f10(X1,X2,X3)) ),
file('<stdin>',topology_generated_37) ).
fof(c_0_3,axiom,
! [X1,X4,X2] :
( element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(f11(X1,X2),X4)
| ~ element_of_collection(X4,X1)
| ~ subset_sets(X4,X2) ),
file('<stdin>',topology_generated_41) ).
fof(c_0_4,axiom,
! [X1,X2] :
( ~ element_of_set(X2,union_of_members(X1))
| element_of_collection(f1(X1,X2),X1) ),
file('<stdin>',union_of_members_2) ).
fof(c_0_5,axiom,
! [X1,X2] :
( ~ element_of_set(X2,union_of_members(X1))
| element_of_set(X2,f1(X1,X2)) ),
file('<stdin>',union_of_members_1) ).
fof(c_0_6,axiom,
! [X6,X5,X3] :
( ~ subset_sets(X3,X5)
| ~ element_of_collection(X5,X6)
| subset_sets(X3,union_of_members(X6)) ),
file('<stdin>',set_theory_20) ).
fof(c_0_7,axiom,
! [X1,X2] :
( element_of_collection(X2,top_of_basis(X1))
| element_of_set(f11(X1,X2),X2) ),
file('<stdin>',topology_generated_40) ).
fof(c_0_8,axiom,
! [X5,X3,X2] :
( ~ subset_collections(X3,X5)
| ~ element_of_collection(X2,X3)
| element_of_collection(X2,X5) ),
file('<stdin>',set_theory_21) ).
fof(c_0_9,axiom,
! [X5,X3,X2] :
( subset_sets(X3,X5)
| ~ element_of_set(X2,X3)
| element_of_set(X2,X5) ),
file('<stdin>',set_theory_19) ).
fof(c_0_10,plain,
! [X3,X1,X2] :
( ~ element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(X3,X2)
| subset_sets(f10(X1,X2,X3),X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_11,plain,
! [X3,X1,X2] :
( ~ element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(X3,X2)
| element_of_collection(f10(X1,X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_12,plain,
! [X3,X1,X2] :
( ~ element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(X3,X2)
| element_of_set(X3,f10(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_13,plain,
! [X1,X4,X2] :
( element_of_collection(X2,top_of_basis(X1))
| ~ element_of_set(f11(X1,X2),X4)
| ~ element_of_collection(X4,X1)
| ~ subset_sets(X4,X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_14,plain,
! [X1,X2] :
( ~ element_of_set(X2,union_of_members(X1))
| element_of_collection(f1(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_15,plain,
! [X1,X2] :
( ~ element_of_set(X2,union_of_members(X1))
| element_of_set(X2,f1(X1,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_16,plain,
! [X6,X5,X3] :
( ~ subset_sets(X3,X5)
| ~ element_of_collection(X5,X6)
| subset_sets(X3,union_of_members(X6)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_17,axiom,
! [X1,X2] :
( element_of_collection(X2,top_of_basis(X1))
| element_of_set(f11(X1,X2),X2) ),
c_0_7 ).
fof(c_0_18,plain,
! [X5,X3,X2] :
( ~ subset_collections(X3,X5)
| ~ element_of_collection(X2,X3)
| element_of_collection(X2,X5) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_19,plain,
! [X5,X3,X2] :
( subset_sets(X3,X5)
| ~ element_of_set(X2,X3)
| element_of_set(X2,X5) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_20,plain,
! [X4,X5,X6] :
( ~ element_of_collection(X6,top_of_basis(X5))
| ~ element_of_set(X4,X6)
| subset_sets(f10(X5,X6,X4),X6) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_21,plain,
! [X4,X5,X6] :
( ~ element_of_collection(X6,top_of_basis(X5))
| ~ element_of_set(X4,X6)
| element_of_collection(f10(X5,X6,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( ~ element_of_collection(X6,top_of_basis(X5))
| ~ element_of_set(X4,X6)
| element_of_set(X4,f10(X5,X6,X4)) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_23,plain,
! [X5,X6,X7] :
( element_of_collection(X7,top_of_basis(X5))
| ~ element_of_set(f11(X5,X7),X6)
| ~ element_of_collection(X6,X5)
| ~ subset_sets(X6,X7) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_24,plain,
! [X3,X4] :
( ~ element_of_set(X4,union_of_members(X3))
| element_of_collection(f1(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ element_of_set(X4,union_of_members(X3))
| element_of_set(X4,f1(X3,X4)) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_26,plain,
! [X7,X8,X9] :
( ~ subset_sets(X9,X8)
| ~ element_of_collection(X8,X7)
| subset_sets(X9,union_of_members(X7)) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_27,plain,
! [X3,X4] :
( element_of_collection(X4,top_of_basis(X3))
| element_of_set(f11(X3,X4),X4) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_28,plain,
! [X6,X7,X8] :
( ~ subset_collections(X7,X6)
| ~ element_of_collection(X8,X7)
| element_of_collection(X8,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_18])])]) ).
fof(c_0_29,plain,
! [X6,X7,X8] :
( subset_sets(X7,X6)
| ~ element_of_set(X8,X7)
| element_of_set(X8,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_19])])]) ).
cnf(c_0_30,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_20]) ).
cnf(c_0_31,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_21]) ).
cnf(c_0_32,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_22]) ).
cnf(c_0_33,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_23]) ).
cnf(c_0_34,plain,
( element_of_collection(f1(X1,X2),X1)
| ~ element_of_set(X2,union_of_members(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
( subset_sets(X1,union_of_members(X2))
| ~ element_of_collection(X3,X2)
| ~ subset_sets(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
( element_of_set(f11(X1,X2),X2)
| element_of_collection(X2,top_of_basis(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
( element_of_collection(X1,X2)
| ~ element_of_collection(X1,X3)
| ~ subset_collections(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
( element_of_set(X1,X2)
| subset_sets(X3,X2)
| ~ element_of_set(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( subset_sets(f10(X1,X2,X3),X2)
| ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
c_0_30,
[final] ).
cnf(c_0_41,plain,
( element_of_collection(f10(X1,X2,X3),X1)
| ~ element_of_set(X3,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
c_0_31,
[final] ).
cnf(c_0_42,plain,
( element_of_set(X1,f10(X2,X3,X1))
| ~ element_of_set(X1,X3)
| ~ element_of_collection(X3,top_of_basis(X2)) ),
c_0_32,
[final] ).
cnf(c_0_43,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_33,
[final] ).
cnf(c_0_44,plain,
( element_of_collection(f1(X1,X2),X1)
| ~ element_of_set(X2,union_of_members(X1)) ),
c_0_34,
[final] ).
cnf(c_0_45,plain,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
c_0_35,
[final] ).
cnf(c_0_46,plain,
( subset_sets(X1,union_of_members(X2))
| ~ element_of_collection(X3,X2)
| ~ subset_sets(X1,X3) ),
c_0_36,
[final] ).
cnf(c_0_47,plain,
( element_of_set(f11(X1,X2),X2)
| element_of_collection(X2,top_of_basis(X1)) ),
c_0_37,
[final] ).
cnf(c_0_48,plain,
( element_of_collection(X1,X2)
| ~ element_of_collection(X1,X3)
| ~ subset_collections(X3,X2) ),
c_0_38,
[final] ).
cnf(c_0_49,plain,
( element_of_set(X1,X2)
| subset_sets(X3,X2)
| ~ element_of_set(X1,X3) ),
c_0_39,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_40_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_40]) ).
cnf(c_0_40_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_40]) ).
cnf(c_0_40_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_40]) ).
cnf(c_0_41_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_41]) ).
cnf(c_0_41_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_41]) ).
cnf(c_0_41_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_41]) ).
cnf(c_0_42_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_42]) ).
cnf(c_0_42_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_42]) ).
cnf(c_0_42_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_42]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_43_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_43]) ).
cnf(c_0_44_0,axiom,
( element_of_collection(f1(X1,X2),X1)
| ~ element_of_set(X2,union_of_members(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( ~ element_of_set(X2,union_of_members(X1))
| element_of_collection(f1(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( element_of_set(X1,f1(X2,X1))
| ~ element_of_set(X1,union_of_members(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( ~ element_of_set(X1,union_of_members(X2))
| element_of_set(X1,f1(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( subset_sets(X1,union_of_members(X2))
| ~ element_of_collection(X3,X2)
| ~ subset_sets(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( ~ element_of_collection(X3,X2)
| subset_sets(X1,union_of_members(X2))
| ~ subset_sets(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_2,axiom,
( ~ subset_sets(X1,X3)
| ~ element_of_collection(X3,X2)
| subset_sets(X1,union_of_members(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_47_0,axiom,
( element_of_set(f11(X1,X2),X2)
| element_of_collection(X2,top_of_basis(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_1,axiom,
( element_of_collection(X2,top_of_basis(X1))
| element_of_set(f11(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_48_0,axiom,
( element_of_collection(X1,X2)
| ~ element_of_collection(X1,X3)
| ~ subset_collections(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ element_of_collection(X1,X3)
| element_of_collection(X1,X2)
| ~ subset_collections(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ subset_collections(X3,X2)
| ~ element_of_collection(X1,X3)
| element_of_collection(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( element_of_set(X1,X2)
| subset_sets(X3,X2)
| ~ element_of_set(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( subset_sets(X3,X2)
| element_of_set(X1,X2)
| ~ element_of_set(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_2,axiom,
( ~ element_of_set(X1,X3)
| subset_sets(X3,X2)
| element_of_set(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
file('<stdin>',lemma_1e_3) ).
fof(c_0_1_002,negated_conjecture,
subset_collections(g,top_of_basis(f)),
file('<stdin>',lemma_1e_2) ).
fof(c_0_2_003,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_004,negated_conjecture,
subset_collections(g,top_of_basis(f)),
c_0_1 ).
fof(c_0_4_005,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
c_0_2 ).
fof(c_0_5_006,negated_conjecture,
subset_collections(g,top_of_basis(f)),
c_0_3 ).
cnf(c_0_6_007,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,negated_conjecture,
subset_collections(g,top_of_basis(f)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
c_0_6,
[final] ).
cnf(c_0_9_010,negated_conjecture,
subset_collections(g,top_of_basis(f)),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_15,plain,
( element_of_collection(X0,top_of_basis(X1))
| ~ subset_sets(X2,X0)
| ~ element_of_collection(X2,X1)
| ~ element_of_set(f11(X1,X0),X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_43_3) ).
cnf(c_67,plain,
( element_of_collection(X0,top_of_basis(X1))
| ~ subset_sets(X2,X0)
| ~ element_of_collection(X2,X1)
| ~ element_of_set(f11(X1,X0),X2) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_11207,plain,
( ~ element_of_set(f11(f,union_of_members(g)),X0)
| ~ subset_sets(X0,union_of_members(g))
| element_of_collection(union_of_members(g),top_of_basis(f))
| ~ element_of_collection(X0,f) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_11312,plain,
( ~ element_of_set(f11(f,union_of_members(g)),f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))))
| ~ subset_sets(f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),union_of_members(g))
| element_of_collection(union_of_members(g),top_of_basis(f))
| ~ element_of_collection(f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),f) ),
inference(instantiation,[status(thm)],[c_11207]) ).
cnf(c_8,plain,
( subset_sets(X0,union_of_members(X1))
| ~ element_of_collection(X2,X1)
| ~ subset_sets(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_46_2) ).
cnf(c_60,plain,
( subset_sets(X0,union_of_members(X1))
| ~ element_of_collection(X2,X1)
| ~ subset_sets(X0,X2) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_11234,plain,
( subset_sets(X0,union_of_members(g))
| ~ subset_sets(X0,f1(g,f11(f,union_of_members(g))))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),g) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_11308,plain,
( subset_sets(f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),union_of_members(g))
| ~ subset_sets(f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),f1(g,f11(f,union_of_members(g))))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),g) ),
inference(instantiation,[status(thm)],[c_11234]) ).
cnf(c_3,plain,
( element_of_collection(X0,X1)
| ~ element_of_collection(X0,X2)
| ~ subset_collections(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_48_2) ).
cnf(c_55,plain,
( element_of_collection(X0,X1)
| ~ element_of_collection(X0,X2)
| ~ subset_collections(X2,X1) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_11232,plain,
( ~ subset_collections(g,X0)
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),g)
| element_of_collection(f1(g,f11(f,union_of_members(g))),X0) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_11285,plain,
( ~ subset_collections(g,top_of_basis(f))
| element_of_collection(f1(g,f11(f,union_of_members(g))),top_of_basis(f))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),g) ),
inference(instantiation,[status(thm)],[c_11232]) ).
cnf(c_27,plain,
( ~ element_of_collection(X0,top_of_basis(X1))
| ~ element_of_set(X2,X0)
| subset_sets(f10(X1,X0,X2),X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_40_0) ).
cnf(c_79,plain,
( ~ element_of_collection(X0,top_of_basis(X1))
| ~ element_of_set(X2,X0)
| subset_sets(f10(X1,X0,X2),X0) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_11242,plain,
( ~ element_of_set(f11(f,union_of_members(g)),f1(g,f11(f,union_of_members(g))))
| subset_sets(f10(X0,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),f1(g,f11(f,union_of_members(g))))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),top_of_basis(X0)) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_11249,plain,
( ~ element_of_set(f11(f,union_of_members(g)),f1(g,f11(f,union_of_members(g))))
| subset_sets(f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),f1(g,f11(f,union_of_members(g))))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),top_of_basis(f)) ),
inference(instantiation,[status(thm)],[c_11242]) ).
cnf(c_24,plain,
( ~ element_of_collection(X0,top_of_basis(X1))
| ~ element_of_set(X2,X0)
| element_of_collection(f10(X1,X0,X2),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_41_0) ).
cnf(c_76,plain,
( ~ element_of_collection(X0,top_of_basis(X1))
| ~ element_of_set(X2,X0)
| element_of_collection(f10(X1,X0,X2),X1) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_11244,plain,
( ~ element_of_set(f11(f,union_of_members(g)),f1(g,f11(f,union_of_members(g))))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),top_of_basis(X0))
| element_of_collection(f10(X0,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),X0) ),
inference(instantiation,[status(thm)],[c_76]) ).
cnf(c_11248,plain,
( ~ element_of_set(f11(f,union_of_members(g)),f1(g,f11(f,union_of_members(g))))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),top_of_basis(f))
| element_of_collection(f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),f) ),
inference(instantiation,[status(thm)],[c_11244]) ).
cnf(c_19,plain,
( element_of_set(X0,f10(X1,X2,X0))
| ~ element_of_set(X0,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_42_2) ).
cnf(c_71,plain,
( element_of_set(X0,f10(X1,X2,X0))
| ~ element_of_set(X0,X2)
| ~ element_of_collection(X2,top_of_basis(X1)) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_11240,plain,
( ~ element_of_set(f11(f,union_of_members(g)),f1(g,f11(f,union_of_members(g))))
| element_of_set(f11(f,union_of_members(g)),f10(X0,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),top_of_basis(X0)) ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_11241,plain,
( ~ element_of_set(f11(f,union_of_members(g)),f1(g,f11(f,union_of_members(g))))
| element_of_set(f11(f,union_of_members(g)),f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))))
| ~ element_of_collection(f1(g,f11(f,union_of_members(g))),top_of_basis(f)) ),
inference(instantiation,[status(thm)],[c_11240]) ).
cnf(c_14,plain,
( ~ element_of_set(X0,union_of_members(X1))
| element_of_collection(f1(X1,X0),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_44_0) ).
cnf(c_66,plain,
( ~ element_of_set(X0,union_of_members(X1))
| element_of_collection(f1(X1,X0),X1) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_11217,plain,
( ~ element_of_set(f11(f,union_of_members(g)),union_of_members(g))
| element_of_collection(f1(g,f11(f,union_of_members(g))),g) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_12,plain,
( ~ element_of_set(X0,union_of_members(X1))
| element_of_set(X0,f1(X1,X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_45_0) ).
cnf(c_64,plain,
( ~ element_of_set(X0,union_of_members(X1))
| element_of_set(X0,f1(X1,X0)) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_11218,plain,
( ~ element_of_set(f11(f,union_of_members(g)),union_of_members(g))
| element_of_set(f11(f,union_of_members(g)),f1(g,f11(f,union_of_members(g)))) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_6,plain,
( element_of_set(f11(X0,X1),X1)
| element_of_collection(X1,top_of_basis(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_47_1) ).
cnf(c_58,plain,
( element_of_set(f11(X0,X1),X1)
| element_of_collection(X1,top_of_basis(X0)) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_11196,plain,
( element_of_set(f11(f,union_of_members(g)),union_of_members(g))
| element_of_collection(union_of_members(g),top_of_basis(f)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_28,negated_conjecture,
~ element_of_collection(union_of_members(g),top_of_basis(f)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_8) ).
cnf(c_29,negated_conjecture,
subset_collections(g,top_of_basis(f)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p',c_0_9) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_11312,c_11308,c_11285,c_11249,c_11248,c_11241,c_11217,c_11218,c_11196,c_28,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : TOP005-2 : TPTP v8.1.0. Released v1.0.0.
% 0.14/0.13 % Command : iprover_modulo %s %d
% 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 : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun May 29 12:27:56 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % Orientation found
% 0.21/0.41 % 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_3a5aa5.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_e087fe | grep -v "SZS"
% 0.21/0.43
% 0.21/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ iProver source info
% 0.21/0.43
% 0.21/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.43 % git: non_committed_changes: true
% 0.21/0.43 % git: last_make_outside_of_git: true
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3a5aa5.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...% successful
% 0.21/0.44
% 0.21/0.44 % ------ 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.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % ------ Problem Properties
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % EPR false
% 0.21/0.44 % Horn false
% 0.21/0.44 % Has equality false
% 0.21/0.44
% 0.21/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % % ------ Current options:
% 0.21/0.44
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3a5aa5.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % warning: shown sat in sat incomplete mode
% 0.21/0.44 %
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 cnf(c_28,negated_conjecture,
% 0.21/0.44 ( ~ element_of_collection(union_of_members(g),top_of_basis(f)) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_8) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_38,negated_conjecture,
% 0.21/0.44 ( ~ element_of_collection(union_of_members(g),top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_28]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_46,negated_conjecture,
% 0.21/0.44 ( ~ element_of_collection(union_of_members(g),top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_38]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_49,negated_conjecture,
% 0.21/0.44 ( ~ element_of_collection(union_of_members(g),top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_46]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_50,negated_conjecture,
% 0.21/0.44 ( ~ element_of_collection(union_of_members(g),top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_49]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_138,negated_conjecture,
% 0.21/0.44 ( ~ element_of_collection(union_of_members(g),top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_50]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_9,plain,
% 0.21/0.44 ( ~ element_of_set(f11(X0,X1),X2)
% 0.21/0.44 | ~ element_of_collection(X2,X0)
% 0.21/0.44 | ~ subset_sets(X2,X1)
% 0.21/0.44 | element_of_collection(X1,top_of_basis(X0)) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_43_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_100,plain,
% 0.21/0.44 ( ~ element_of_set(f11(X0,X1),X2)
% 0.21/0.44 | ~ element_of_collection(X2,X0)
% 0.21/0.44 | ~ subset_sets(X2,X1)
% 0.21/0.44 | element_of_collection(X1,top_of_basis(X0)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_9]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_101,plain,
% 0.21/0.44 ( ~ element_of_set(f11(X0,X1),X2)
% 0.21/0.44 | element_of_collection(X1,top_of_basis(X0))
% 0.21/0.44 | ~ element_of_collection(X2,X0)
% 0.21/0.44 | ~ subset_sets(X2,X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_100]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_146,plain,
% 0.21/0.44 ( ~ element_of_set(f11(f,union_of_members(g)),X0)
% 0.21/0.44 | ~ element_of_collection(X0,f)
% 0.21/0.44 | ~ subset_sets(X0,union_of_members(g)) ),
% 0.21/0.44 inference(resolution,[status(thm)],[c_138,c_101]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_147,plain,
% 0.21/0.44 ( ~ element_of_set(f11(f,union_of_members(g)),X0)
% 0.21/0.44 | ~ element_of_collection(X0,f)
% 0.21/0.44 | ~ subset_sets(X0,union_of_members(g)) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_146]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_13,plain,
% 0.21/0.44 ( ~ element_of_set(X0,union_of_members(X1))
% 0.21/0.44 | element_of_set(X0,f1(X1,X0)) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_44_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_108,plain,
% 0.21/0.44 ( ~ element_of_set(X0,union_of_members(X1))
% 0.21/0.44 | element_of_set(X0,f1(X1,X0)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_13]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_109,plain,
% 0.21/0.44 ( element_of_set(X0,f1(X1,X0))
% 0.21/0.44 | ~ element_of_set(X0,union_of_members(X1)) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_108]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_160,plain,
% 0.21/0.44 ( ~ element_of_set(f11(f,union_of_members(g)),union_of_members(X0))
% 0.21/0.44 | ~ element_of_collection(f1(X0,f11(f,union_of_members(g))),f)
% 0.21/0.44 | ~ subset_sets(f1(X0,f11(f,union_of_members(g))),union_of_members(g)) ),
% 0.21/0.44 inference(resolution,[status(thm)],[c_147,c_109]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_161,plain,
% 0.21/0.44 ( ~ element_of_set(f11(f,union_of_members(g)),union_of_members(X0))
% 0.21/0.44 | ~ element_of_collection(f1(X0,f11(f,union_of_members(g))),f)
% 0.21/0.44 | ~ subset_sets(f1(X0,f11(f,union_of_members(g))),union_of_members(g)) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_160]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_25,plain,
% 0.21/0.44 ( ~ element_of_set(X0,X1) | subset_sets(X1,X2) | element_of_set(X0,X2) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_49_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_132,plain,
% 0.21/0.44 ( ~ element_of_set(X0,X1) | subset_sets(X1,X2) | element_of_set(X0,X2) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_25]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_133,plain,
% 0.21/0.44 ( ~ element_of_set(X0,X1) | element_of_set(X0,X2) | subset_sets(X1,X2) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_132]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_156,plain,
% 0.21/0.44 ( ~ element_of_set(f11(f,union_of_members(g)),X0)
% 0.21/0.44 | ~ element_of_collection(X1,f)
% 0.21/0.44 | ~ subset_sets(X1,union_of_members(g))
% 0.21/0.44 | subset_sets(X0,X1) ),
% 0.21/0.44 inference(resolution,[status(thm)],[c_147,c_133]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_157,plain,
% 0.21/0.44 ( ~ element_of_set(f11(f,union_of_members(g)),X0)
% 0.21/0.44 | ~ element_of_collection(X1,f)
% 0.21/0.44 | ~ subset_sets(X1,union_of_members(g))
% 0.21/0.44 | subset_sets(X0,X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_156]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_27,plain,
% 0.21/0.44 ( element_of_set(X0,X1) | subset_sets(X2,X1) | ~ element_of_set(X0,X2) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_49_2) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_136,plain,
% 0.21/0.44 ( element_of_set(X0,X1) | subset_sets(X2,X1) | ~ element_of_set(X0,X2) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_27]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_137,plain,
% 0.21/0.44 ( element_of_set(X0,X1) | ~ element_of_set(X0,X2) | subset_sets(X2,X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_136]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_22,plain,
% 0.21/0.44 ( ~ subset_collections(X0,X1)
% 0.21/0.44 | ~ element_of_collection(X2,X0)
% 0.21/0.44 | element_of_collection(X2,X1) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_48_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_126,plain,
% 0.21/0.44 ( ~ subset_collections(X0,X1)
% 0.21/0.44 | ~ element_of_collection(X2,X0)
% 0.21/0.44 | element_of_collection(X2,X1) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_22]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_127,plain,
% 0.21/0.44 ( ~ element_of_collection(X0,X1)
% 0.21/0.44 | element_of_collection(X0,X2)
% 0.21/0.44 | ~ subset_collections(X1,X2) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_126]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_17,plain,
% 0.21/0.44 ( ~ subset_sets(X0,X1)
% 0.21/0.44 | ~ element_of_collection(X1,X2)
% 0.21/0.44 | subset_sets(X0,union_of_members(X2)) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_46_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_116,plain,
% 0.21/0.44 ( ~ subset_sets(X0,X1)
% 0.21/0.44 | ~ element_of_collection(X1,X2)
% 0.21/0.44 | subset_sets(X0,union_of_members(X2)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_17]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_117,plain,
% 0.21/0.44 ( ~ element_of_collection(X0,X1)
% 0.21/0.44 | subset_sets(X2,union_of_members(X1))
% 0.21/0.44 | ~ subset_sets(X2,X0) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_116]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_6,plain,
% 0.21/0.44 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.21/0.44 | ~ element_of_set(X2,X0)
% 0.21/0.44 | subset_sets(f10(X1,X0,X2),X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_42_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_94,plain,
% 0.21/0.44 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.21/0.44 | ~ element_of_set(X2,X0)
% 0.21/0.44 | subset_sets(f10(X1,X0,X2),X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_6]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_95,plain,
% 0.21/0.44 ( ~ element_of_set(X0,X1)
% 0.21/0.44 | ~ element_of_collection(X1,top_of_basis(X2))
% 0.21/0.44 | subset_sets(f10(X2,X1,X0),X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_94]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_3,plain,
% 0.21/0.44 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.21/0.44 | ~ element_of_set(X2,X0)
% 0.21/0.44 | element_of_collection(f10(X1,X0,X2),X1) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_41_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_88,plain,
% 0.21/0.44 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.21/0.44 | ~ element_of_set(X2,X0)
% 0.21/0.44 | element_of_collection(f10(X1,X0,X2),X1) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_3]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_89,plain,
% 0.21/0.44 ( ~ element_of_set(X0,X1)
% 0.21/0.44 | element_of_collection(f10(X2,X1,X0),X2)
% 0.21/0.44 | ~ element_of_collection(X1,top_of_basis(X2)) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_88]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_29,negated_conjecture,
% 0.21/0.44 ( subset_collections(g,top_of_basis(f)) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_9) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_40,negated_conjecture,
% 0.21/0.44 ( subset_collections(g,top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_29]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_47,negated_conjecture,
% 0.21/0.44 ( subset_collections(g,top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_40]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_48,negated_conjecture,
% 0.21/0.44 ( subset_collections(g,top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_47]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_51,negated_conjecture,
% 0.21/0.44 ( subset_collections(g,top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_48]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_140,negated_conjecture,
% 0.21/0.44 ( subset_collections(g,top_of_basis(f)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_51]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_23,plain,
% 0.21/0.44 ( ~ subset_collections(X0,X1)
% 0.21/0.44 | element_of_collection(X2,X1)
% 0.21/0.44 | ~ element_of_collection(X2,X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_48_1) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_128,plain,
% 0.21/0.44 ( ~ subset_collections(X0,X1)
% 0.21/0.44 | element_of_collection(X2,X1)
% 0.21/0.44 | ~ element_of_collection(X2,X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_23]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_129,plain,
% 0.21/0.44 ( element_of_collection(X0,X1)
% 0.21/0.44 | ~ element_of_collection(X0,X2)
% 0.21/0.44 | ~ subset_collections(X2,X1) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_128]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_20,plain,
% 0.21/0.44 ( element_of_collection(X0,top_of_basis(X1))
% 0.21/0.44 | element_of_set(f11(X1,X0),X0) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_47_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_122,plain,
% 0.21/0.44 ( element_of_collection(X0,top_of_basis(X1))
% 0.21/0.44 | element_of_set(f11(X1,X0),X0) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_20]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_123,plain,
% 0.21/0.44 ( element_of_set(f11(X0,X1),X1)
% 0.21/0.44 | element_of_collection(X1,top_of_basis(X0)) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_122]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_15,plain,
% 0.21/0.44 ( ~ element_of_set(X0,union_of_members(X1))
% 0.21/0.44 | element_of_collection(f1(X1,X0),X1) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_45_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_112,plain,
% 0.21/0.44 ( ~ element_of_set(X0,union_of_members(X1))
% 0.21/0.44 | element_of_collection(f1(X1,X0),X1) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_15]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_0,plain,
% 0.21/0.44 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.21/0.44 | ~ element_of_set(X2,X0)
% 0.21/0.44 | element_of_set(X2,f10(X1,X0,X2)) ),
% 0.21/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p', c_0_40_0) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_82,plain,
% 0.21/0.44 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.21/0.44 | ~ element_of_set(X2,X0)
% 0.21/0.44 | element_of_set(X2,f10(X1,X0,X2)) ),
% 0.21/0.44 inference(copy,[status(esa)],[c_0]) ).
% 0.21/0.44
% 0.21/0.44 cnf(c_83,plain,
% 0.21/0.44 ( element_of_set(X0,f10(X1,X2,X0))
% 0.21/0.44 | ~ element_of_set(X0,X2)
% 0.21/0.44 | ~ element_of_collection(X2,top_of_basis(X1)) ),
% 0.21/0.44 inference(rewriting,[status(thm)],[c_82]) ).
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % ------ Statistics
% 0.21/0.44
% 0.21/0.44 % ------ General
% 0.21/0.44
% 0.21/0.44 % num_of_input_clauses: 30
% 0.21/0.44 % num_of_input_neg_conjectures: 2
% 0.21/0.44 % num_of_splits: 0
% 0.21/0.44 % num_of_split_atoms: 0
% 0.21/0.44 % num_of_sem_filtered_clauses: 0
% 0.21/0.44 % num_of_subtypes: 0
% 0.21/0.44 % monotx_restored_types: 0
% 0.21/0.44 % sat_num_of_epr_types: 0
% 0.21/0.44 % sat_num_of_non_cyclic_types: 0
% 0.21/0.44 % sat_guarded_non_collapsed_types: 0
% 0.21/0.44 % is_epr: 0
% 0.21/0.44 % is_horn: 0
% 0.21/0.44 % has_eq: 0
% 0.21/0.44 % num_pure_diseq_elim: 0
% 0.21/0.44 % simp_replaced_by: 0
% 0.21/0.44 % res_preprocessed: 4
% 0.21/0.44 % prep_upred: 0
% 0.21/0.44 % prep_unflattend: 0
% 0.21/0.44 % pred_elim_cands: 0
% 0.21/0.44 % pred_elim: 0
% 0.21/0.44 % pred_elim_cl: 0
% 0.21/0.44 % pred_elim_cycles: 0
% 0.21/0.44 % forced_gc_time: 0
% 0.21/0.44 % gc_basic_clause_elim: 0
% 0.21/0.44 % parsing_time: 0.002
% 0.21/0.44 % sem_filter_time: 0.
% 0.21/0.44 % pred_elim_time: 0.
% 0.21/0.44 % out_proof_time: 0.
% 0.21/0.44 % monotx_time: 0.
% 0.21/0.44 % subtype_inf_time: 0.
% 0.21/0.44 % unif_index_cands_time: 0.
% 0.21/0.44 % unif_index_add_time: 0.
% 0.21/0.44 % total_time: 0.026
% 0.21/0.44 % num_of_symbols: 36
% 0.21/0.44 % num_of_terms: 184
% 0.21/0.44
% 0.21/0.44 % ------ Propositional Solver
% 0.21/0.44
% 0.21/0.44 % prop_solver_calls: 1
% 0.21/0.44 % prop_fast_solver_calls: 6
% 0.21/0.44 % prop_num_of_clauses: 29
% 0.21/0.44 % prop_preprocess_simplified: 103
% 0.21/0.44 % prop_fo_subsumed: 0
% 0.21/0.44 % prop_solver_time: 0.
% 0.21/0.44 % prop_fast_solver_time: 0.
% 0.21/0.44 % prop_unsat_core_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ QBF
% 0.21/0.44
% 0.21/0.44 % qbf_q_res: 0
% 0.21/0.44 % qbf_num_tautologies: 0
% 0.21/0.44 % qbf_prep_cycles: 0
% 0.21/0.44
% 0.21/0.44 % ------ BMC1
% 0.21/0.44
% 0.21/0.44 % bmc1_current_bound: -1
% 0.21/0.44 % bmc1_last_solved_bound: -1
% 0.21/0.44 % bmc1_unsat_core_size: -1
% 0.21/0.44 % bmc1_unsat_core_parents_size: -1
% 0.21/0.44 % bmc1_merge_next_fun: 0
% 0.21/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation
% 0.21/0.44
% 0.21/0.44 % inst_num_of_clauses: 30
% 0.21/0.44 % inst_num_in_passive: 0
% 0.21/0.44 % inst_num_in_active: 0
% 0.21/0.44 % inst_num_in_unprocessed: 30
% 0.21/0.44 % inst_num_of_loops: 0
% 0.21/0.44 % inst_num_of_learning_restarts: 0
% 0.21/0.44 % inst_num_moves_active_passive: 0
% 0.21/0.44 % inst_lit_activity: 0
% 0.21/0.44 % inst_lit_activity_moves: 0
% 0.21/0.44 % inst_num_tautologies: 0
% 0.21/0.44 % inst_num_prop_implied: 0
% 0.21/0.44 % inst_num_existing_simplified: 0
% 0.21/0.44 % inst_num_eq_res_simplified: 0
% 0.21/0.44 % inst_num_child_elim: 0
% 0.21/0.44 % inst_num_of_dismatching_blockings: 0
% 0.21/0.44 % inst_num_of_non_proper_insts: 0
% 0.21/0.44 % inst_num_of_duplicates: 0
% 0.21/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.44 % inst_dismatching_checking_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Resolution
% 0.21/0.44
% 0.21/0.44 % res_num_of_clauses: 39
% 0.21/0.44 % res_num_in_passive: 0
% 0.21/0.44 % res_num_in_active: 17
% 0.21/0.45 % res_num_of_loops: 12
% 0.21/0.45 % res_forward_subset_subsumed: 16
% 0.21/0.45 % res_backward_subset_subsumed: 0
% 0.21/0.45 % res_forward_subsumed: 6
% 0.21/0.45 % res_backward_subsumed: 0
% 0.21/0.45 % res_forward_subsumption_resolution: 0
% 0.21/0.45 % res_backward_subsumption_resolution: 0
% 0.21/0.45 % res_clause_to_clause_subsumption: 13
% 0.21/0.45 % res_orphan_elimination: 0
% 0.21/0.45 % res_tautology_del: 0
% 0.21/0.45 % res_num_eq_res_simplified: 0
% 0.21/0.45 % res_num_sel_changes: 0
% 0.21/0.45 % res_moves_from_active_to_pass: 0
% 0.21/0.45
% 0.21/0.45 % Status Unknown
% 0.21/0.49 % Orienting using strategy ClausalAll
% 0.21/0.49 % Orientation found
% 0.21/0.49 % 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_3a5aa5.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_4d4e3a.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_c6f442 | grep -v "SZS"
% 0.21/0.51
% 0.21/0.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % ------ iProver source info
% 0.21/0.51
% 0.21/0.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.51 % git: non_committed_changes: true
% 0.21/0.51 % git: last_make_outside_of_git: true
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % ------ Input Options
% 0.21/0.51
% 0.21/0.51 % --out_options all
% 0.21/0.51 % --tptp_safe_out true
% 0.21/0.51 % --problem_path ""
% 0.21/0.51 % --include_path ""
% 0.21/0.51 % --clausifier .//eprover
% 0.21/0.51 % --clausifier_options --tstp-format
% 0.21/0.51 % --stdin false
% 0.21/0.51 % --dbg_backtrace false
% 0.21/0.51 % --dbg_dump_prop_clauses false
% 0.21/0.51 % --dbg_dump_prop_clauses_file -
% 0.21/0.51 % --dbg_out_stat false
% 0.21/0.51
% 0.21/0.51 % ------ General Options
% 0.21/0.51
% 0.21/0.51 % --fof false
% 0.21/0.51 % --time_out_real 150.
% 0.21/0.51 % --time_out_prep_mult 0.2
% 0.21/0.51 % --time_out_virtual -1.
% 0.21/0.51 % --schedule none
% 0.21/0.51 % --ground_splitting input
% 0.21/0.51 % --splitting_nvd 16
% 0.21/0.51 % --non_eq_to_eq false
% 0.21/0.51 % --prep_gs_sim true
% 0.21/0.51 % --prep_unflatten false
% 0.21/0.51 % --prep_res_sim true
% 0.21/0.51 % --prep_upred true
% 0.21/0.51 % --res_sim_input true
% 0.21/0.51 % --clause_weak_htbl true
% 0.21/0.51 % --gc_record_bc_elim false
% 0.21/0.51 % --symbol_type_check false
% 0.21/0.51 % --clausify_out false
% 0.21/0.51 % --large_theory_mode false
% 0.21/0.51 % --prep_sem_filter none
% 0.21/0.51 % --prep_sem_filter_out false
% 0.21/0.51 % --preprocessed_out false
% 0.21/0.51 % --sub_typing false
% 0.21/0.51 % --brand_transform false
% 0.21/0.51 % --pure_diseq_elim true
% 0.21/0.51 % --min_unsat_core false
% 0.21/0.51 % --pred_elim true
% 0.21/0.51 % --add_important_lit false
% 0.21/0.51 % --soft_assumptions false
% 0.21/0.51 % --reset_solvers false
% 0.21/0.51 % --bc_imp_inh []
% 0.21/0.51 % --conj_cone_tolerance 1.5
% 0.21/0.51 % --prolific_symb_bound 500
% 0.21/0.51 % --lt_threshold 2000
% 0.21/0.51
% 0.21/0.51 % ------ SAT Options
% 0.21/0.51
% 0.21/0.51 % --sat_mode false
% 0.21/0.51 % --sat_fm_restart_options ""
% 0.21/0.51 % --sat_gr_def false
% 0.21/0.51 % --sat_epr_types true
% 0.21/0.51 % --sat_non_cyclic_types false
% 0.21/0.51 % --sat_finite_models false
% 0.21/0.51 % --sat_fm_lemmas false
% 0.21/0.51 % --sat_fm_prep false
% 0.21/0.51 % --sat_fm_uc_incr true
% 0.21/0.51 % --sat_out_model small
% 0.21/0.51 % --sat_out_clauses false
% 0.21/0.51
% 0.21/0.51 % ------ QBF Options
% 0.21/0.51
% 0.21/0.51 % --qbf_mode false
% 0.21/0.51 % --qbf_elim_univ true
% 0.21/0.51 % --qbf_sk_in true
% 0.21/0.51 % --qbf_pred_elim true
% 0.21/0.51 % --qbf_split 32
% 0.21/0.51
% 0.21/0.51 % ------ BMC1 Options
% 0.21/0.51
% 0.21/0.51 % --bmc1_incremental false
% 0.21/0.51 % --bmc1_axioms reachable_all
% 0.21/0.51 % --bmc1_min_bound 0
% 0.21/0.51 % --bmc1_max_bound -1
% 0.21/0.51 % --bmc1_max_bound_default -1
% 0.21/0.51 % --bmc1_symbol_reachability true
% 0.21/0.51 % --bmc1_property_lemmas false
% 0.21/0.51 % --bmc1_k_induction false
% 0.21/0.51 % --bmc1_non_equiv_states false
% 0.21/0.51 % --bmc1_deadlock false
% 0.21/0.51 % --bmc1_ucm false
% 0.21/0.51 % --bmc1_add_unsat_core none
% 0.21/0.51 % --bmc1_unsat_core_children false
% 0.21/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.51 % --bmc1_out_stat full
% 0.21/0.51 % --bmc1_ground_init false
% 0.21/0.51 % --bmc1_pre_inst_next_state false
% 0.21/0.51 % --bmc1_pre_inst_state false
% 0.21/0.51 % --bmc1_pre_inst_reach_state false
% 0.21/0.51 % --bmc1_out_unsat_core false
% 0.21/0.51 % --bmc1_aig_witness_out false
% 0.21/0.51 % --bmc1_verbose false
% 0.21/0.51 % --bmc1_dump_clauses_tptp false
% 0.21/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.52 % --bmc1_dump_file -
% 0.21/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.52 % --bmc1_ucm_extend_mode 1
% 0.21/0.52 % --bmc1_ucm_init_mode 2
% 0.21/0.52 % --bmc1_ucm_cone_mode none
% 0.21/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.52 % --bmc1_ucm_relax_model 4
% 0.21/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.52 % --bmc1_ucm_layered_model none
% 0.21/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.52
% 0.21/0.52 % ------ AIG Options
% 0.21/0.52
% 0.21/0.52 % --aig_mode false
% 0.21/0.52
% 0.21/0.52 % ------ Instantiation Options
% 0.21/0.52
% 0.21/0.52 % --instantiation_flag true
% 0.21/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.52 % --inst_solver_per_active 750
% 0.21/0.52 % --inst_solver_calls_frac 0.5
% 0.21/0.52 % --inst_passive_queue_type priority_queues
% 0.21/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.52 % --inst_passive_queues_freq [25;2]
% 0.21/0.52 % --inst_dismatching true
% 0.21/0.52 % --inst_eager_unprocessed_to_passive true
% 0.21/0.52 % --inst_prop_sim_given true
% 0.21/0.52 % --inst_prop_sim_new false
% 0.21/0.52 % --inst_orphan_elimination true
% 0.21/0.52 % --inst_learning_loop_flag true
% 0.21/0.52 % --inst_learning_start 3000
% 0.21/0.52 % --inst_learning_factor 2
% 0.21/0.52 % --inst_start_prop_sim_after_learn 3
% 0.21/0.52 % --inst_sel_renew solver
% 0.21/0.52 % --inst_lit_activity_flag true
% 0.21/0.52 % --inst_out_proof true
% 0.21/0.52
% 0.21/0.52 % ------ Resolution Options
% 0.21/0.52
% 0.21/0.52 % --resolution_flag true
% 0.21/0.52 % --res_lit_sel kbo_max
% 0.21/0.52 % --res_to_prop_solver none
% 0.21/0.52 % --res_prop_simpl_new false
% 0.21/0.52 % --res_prop_simpl_given false
% 0.21/0.52 % --res_passive_queue_type priority_queues
% 0.21/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.52 % --res_passive_queues_freq [15;5]
% 0.21/0.52 % --res_forward_subs full
% 0.21/0.52 % --res_backward_subs full
% 0.21/0.52 % --res_forward_subs_resolution true
% 0.21/0.52 % --res_backward_subs_resolution true
% 0.21/0.52 % --res_orphan_elimination false
% 0.21/0.52 % --res_time_limit 1000.
% 0.21/0.52 % --res_out_proof true
% 0.21/0.52 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3a5aa5.s
% 0.21/0.52 % --modulo true
% 0.21/0.52
% 0.21/0.52 % ------ Combination Options
% 0.21/0.52
% 0.21/0.52 % --comb_res_mult 1000
% 0.21/0.52 % --comb_inst_mult 300
% 0.21/0.52 % ------
% 0.21/0.52
% 0.21/0.52 % ------ Parsing...% successful
% 0.21/0.52
% 0.21/0.52 % ------ 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.21/0.52
% 0.21/0.52 % ------ Proving...
% 0.21/0.52 % ------ Problem Properties
% 0.21/0.52
% 0.21/0.52 %
% 0.21/0.52 % EPR false
% 0.21/0.52 % Horn false
% 0.21/0.52 % Has equality false
% 0.21/0.52
% 0.21/0.52 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 % % ------ Current options:
% 0.21/0.52
% 0.21/0.52 % ------ Input Options
% 0.21/0.52
% 0.21/0.52 % --out_options all
% 0.21/0.52 % --tptp_safe_out true
% 0.21/0.52 % --problem_path ""
% 0.21/0.52 % --include_path ""
% 0.21/0.52 % --clausifier .//eprover
% 0.21/0.52 % --clausifier_options --tstp-format
% 0.21/0.52 % --stdin false
% 0.21/0.52 % --dbg_backtrace false
% 0.21/0.52 % --dbg_dump_prop_clauses false
% 0.21/0.52 % --dbg_dump_prop_clauses_file -
% 0.21/0.52 % --dbg_out_stat false
% 0.21/0.52
% 0.21/0.52 % ------ General Options
% 0.21/0.52
% 0.21/0.52 % --fof false
% 0.21/0.52 % --time_out_real 150.
% 0.21/0.52 % --time_out_prep_mult 0.2
% 0.21/0.52 % --time_out_virtual -1.
% 0.21/0.52 % --schedule none
% 0.21/0.52 % --ground_splitting input
% 0.21/0.52 % --splitting_nvd 16
% 0.21/0.52 % --non_eq_to_eq false
% 0.21/0.52 % --prep_gs_sim true
% 0.21/0.52 % --prep_unflatten false
% 0.21/0.52 % --prep_res_sim true
% 0.21/0.52 % --prep_upred true
% 0.21/0.52 % --res_sim_input true
% 0.21/0.52 % --clause_weak_htbl true
% 0.21/0.52 % --gc_record_bc_elim false
% 0.21/0.52 % --symbol_type_check false
% 0.21/0.52 % --clausify_out false
% 0.21/0.52 % --large_theory_mode false
% 0.21/0.52 % --prep_sem_filter none
% 0.21/0.52 % --prep_sem_filter_out false
% 0.21/0.52 % --preprocessed_out false
% 0.21/0.52 % --sub_typing false
% 0.21/0.52 % --brand_transform false
% 0.21/0.52 % --pure_diseq_elim true
% 0.21/0.52 % --min_unsat_core false
% 0.21/0.52 % --pred_elim true
% 0.21/0.52 % --add_important_lit false
% 0.21/0.52 % --soft_assumptions false
% 0.21/0.52 % --reset_solvers false
% 0.21/0.52 % --bc_imp_inh []
% 0.21/0.52 % --conj_cone_tolerance 1.5
% 0.21/0.52 % --prolific_symb_bound 500
% 0.21/0.52 % --lt_threshold 2000
% 0.21/0.52
% 0.21/0.52 % ------ SAT Options
% 0.21/0.52
% 0.21/0.52 % --sat_mode false
% 0.21/0.52 % --sat_fm_restart_options ""
% 0.21/0.52 % --sat_gr_def false
% 0.21/0.52 % --sat_epr_types true
% 0.21/0.52 % --sat_non_cyclic_types false
% 0.21/0.52 % --sat_finite_models false
% 0.21/0.52 % --sat_fm_lemmas false
% 0.21/0.52 % --sat_fm_prep false
% 0.21/0.52 % --sat_fm_uc_incr true
% 0.21/0.52 % --sat_out_model small
% 0.21/0.52 % --sat_out_clauses false
% 0.21/0.52
% 0.21/0.52 % ------ QBF Options
% 0.21/0.52
% 0.21/0.52 % --qbf_mode false
% 0.21/0.52 % --qbf_elim_univ true
% 0.21/0.52 % --qbf_sk_in true
% 0.21/0.52 % --qbf_pred_elim true
% 0.21/0.52 % --qbf_split 32
% 0.21/0.52
% 0.21/0.52 % ------ BMC1 Options
% 0.21/0.52
% 0.21/0.52 % --bmc1_incremental false
% 0.21/0.52 % --bmc1_axioms reachable_all
% 0.21/0.52 % --bmc1_min_bound 0
% 0.21/0.52 % --bmc1_max_bound -1
% 0.21/0.52 % --bmc1_max_bound_default -1
% 0.21/0.52 % --bmc1_symbol_reachability true
% 0.21/0.52 % --bmc1_property_lemmas false
% 0.21/0.52 % --bmc1_k_induction false
% 0.21/0.52 % --bmc1_non_equiv_states false
% 0.21/0.52 % --bmc1_deadlock false
% 0.21/0.52 % --bmc1_ucm false
% 0.21/0.52 % --bmc1_add_unsat_core none
% 0.21/0.52 % --bmc1_unsat_core_children false
% 0.21/0.52 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.52 % --bmc1_out_stat full
% 0.21/0.52 % --bmc1_ground_init false
% 0.21/0.52 % --bmc1_pre_inst_next_state false
% 0.21/0.52 % --bmc1_pre_inst_state false
% 0.21/0.52 % --bmc1_pre_inst_reach_state false
% 0.21/0.52 % --bmc1_out_unsat_core false
% 0.21/0.52 % --bmc1_aig_witness_out false
% 0.21/0.52 % --bmc1_verbose false
% 0.21/0.52 % --bmc1_dump_clauses_tptp false
% 0.21/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.52 % --bmc1_dump_file -
% 0.21/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.52 % --bmc1_ucm_extend_mode 1
% 0.21/0.52 % --bmc1_ucm_init_mode 2
% 0.21/0.52 % --bmc1_ucm_cone_mode none
% 0.21/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.52 % --bmc1_ucm_relax_model 4
% 0.21/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.52 % --bmc1_ucm_layered_model none
% 0.21/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.52
% 0.21/0.52 % ------ AIG Options
% 0.21/0.52
% 0.21/0.52 % --aig_mode false
% 0.21/0.52
% 0.21/0.52 % ------ Instantiation Options
% 0.21/0.52
% 0.21/0.52 % --instantiation_flag true
% 0.21/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.52 % --inst_solver_per_active 750
% 0.21/0.52 % --inst_solver_calls_frac 0.5
% 0.21/0.52 % --inst_passive_queue_type priority_queues
% 0.21/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.52 % --inst_passive_queues_freq [25;2]
% 0.21/0.52 % --inst_dismatching true
% 0.21/0.52 % --inst_eager_unprocessed_to_passive true
% 0.21/0.52 % --inst_prop_sim_given true
% 0.72/0.91 % --inst_prop_sim_new false
% 0.72/0.91 % --inst_orphan_elimination true
% 0.72/0.91 % --inst_learning_loop_flag true
% 0.72/0.91 % --inst_learning_start 3000
% 0.72/0.91 % --inst_learning_factor 2
% 0.72/0.91 % --inst_start_prop_sim_after_learn 3
% 0.72/0.91 % --inst_sel_renew solver
% 0.72/0.91 % --inst_lit_activity_flag true
% 0.72/0.91 % --inst_out_proof true
% 0.72/0.91
% 0.72/0.91 % ------ Resolution Options
% 0.72/0.91
% 0.72/0.91 % --resolution_flag true
% 0.72/0.91 % --res_lit_sel kbo_max
% 0.72/0.91 % --res_to_prop_solver none
% 0.72/0.91 % --res_prop_simpl_new false
% 0.72/0.91 % --res_prop_simpl_given false
% 0.72/0.91 % --res_passive_queue_type priority_queues
% 0.72/0.91 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.72/0.91 % --res_passive_queues_freq [15;5]
% 0.72/0.91 % --res_forward_subs full
% 0.72/0.91 % --res_backward_subs full
% 0.72/0.91 % --res_forward_subs_resolution true
% 0.72/0.91 % --res_backward_subs_resolution true
% 0.72/0.91 % --res_orphan_elimination false
% 0.72/0.91 % --res_time_limit 1000.
% 0.72/0.91 % --res_out_proof true
% 0.72/0.91 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3a5aa5.s
% 0.72/0.91 % --modulo true
% 0.72/0.91
% 0.72/0.91 % ------ Combination Options
% 0.72/0.91
% 0.72/0.91 % --comb_res_mult 1000
% 0.72/0.91 % --comb_inst_mult 300
% 0.72/0.91 % ------
% 0.72/0.91
% 0.72/0.91
% 0.72/0.91
% 0.72/0.91 % ------ Proving...
% 0.72/0.91 %
% 0.72/0.91
% 0.72/0.91
% 0.72/0.91 % ------ Statistics
% 0.72/0.91
% 0.72/0.91 % ------ General
% 0.72/0.91
% 0.72/0.91 % num_of_input_clauses: 30
% 0.72/0.91 % num_of_input_neg_conjectures: 2
% 0.72/0.91 % num_of_splits: 0
% 0.72/0.91 % num_of_split_atoms: 0
% 0.72/0.91 % num_of_sem_filtered_clauses: 0
% 0.72/0.91 % num_of_subtypes: 0
% 0.72/0.91 % monotx_restored_types: 0
% 0.72/0.91 % sat_num_of_epr_types: 0
% 0.72/0.91 % sat_num_of_non_cyclic_types: 0
% 0.72/0.91 % sat_guarded_non_collapsed_types: 0
% 0.72/0.91 % is_epr: 0
% 0.72/0.91 % is_horn: 0
% 0.72/0.91 % has_eq: 0
% 0.72/0.91 % num_pure_diseq_elim: 0
% 0.72/0.91 % simp_replaced_by: 0
% 0.72/0.91 % res_preprocessed: 4
% 0.72/0.91 % prep_upred: 0
% 0.72/0.91 % prep_unflattend: 0
% 0.72/0.91 % pred_elim_cands: 0
% 0.72/0.91 % pred_elim: 0
% 0.72/0.91 % pred_elim_cl: 0
% 0.72/0.91 % pred_elim_cycles: 0
% 0.72/0.91 % forced_gc_time: 0
% 0.72/0.91 % gc_basic_clause_elim: 0
% 0.72/0.91 % parsing_time: 0.002
% 0.72/0.91 % sem_filter_time: 0.
% 0.72/0.91 % pred_elim_time: 0.
% 0.72/0.91 % out_proof_time: 0.001
% 0.72/0.91 % monotx_time: 0.
% 0.72/0.91 % subtype_inf_time: 0.
% 0.72/0.91 % unif_index_cands_time: 0.001
% 0.72/0.91 % unif_index_add_time: 0.001
% 0.72/0.91 % total_time: 0.416
% 0.72/0.91 % num_of_symbols: 36
% 0.72/0.91 % num_of_terms: 1349
% 0.72/0.91
% 0.72/0.91 % ------ Propositional Solver
% 0.72/0.91
% 0.72/0.91 % prop_solver_calls: 6
% 0.72/0.91 % prop_fast_solver_calls: 6
% 0.72/0.91 % prop_num_of_clauses: 89
% 0.72/0.91 % prop_preprocess_simplified: 236
% 0.72/0.91 % prop_fo_subsumed: 0
% 0.72/0.91 % prop_solver_time: 0.
% 0.72/0.91 % prop_fast_solver_time: 0.
% 0.72/0.91 % prop_unsat_core_time: 0.
% 0.72/0.91
% 0.72/0.91 % ------ QBF
% 0.72/0.91
% 0.72/0.91 % qbf_q_res: 0
% 0.72/0.91 % qbf_num_tautologies: 0
% 0.72/0.91 % qbf_prep_cycles: 0
% 0.72/0.91
% 0.72/0.91 % ------ BMC1
% 0.72/0.91
% 0.72/0.91 % bmc1_current_bound: -1
% 0.72/0.91 % bmc1_last_solved_bound: -1
% 0.72/0.91 % bmc1_unsat_core_size: -1
% 0.72/0.91 % bmc1_unsat_core_parents_size: -1
% 0.72/0.91 % bmc1_merge_next_fun: 0
% 0.72/0.91 % bmc1_unsat_core_clauses_time: 0.
% 0.72/0.91
% 0.72/0.91 % ------ Instantiation
% 0.72/0.91
% 0.72/0.91 % inst_num_of_clauses: 72
% 0.72/0.91 % inst_num_in_passive: 16
% 0.72/0.91 % inst_num_in_active: 49
% 0.72/0.91 % inst_num_in_unprocessed: 5
% 0.72/0.91 % inst_num_of_loops: 57
% 0.72/0.91 % inst_num_of_learning_restarts: 0
% 0.72/0.91 % inst_num_moves_active_passive: 3
% 0.72/0.91 % inst_lit_activity: 25
% 0.72/0.91 % inst_lit_activity_moves: 0
% 0.72/0.91 % inst_num_tautologies: 0
% 0.72/0.91 % inst_num_prop_implied: 0
% 0.72/0.91 % inst_num_existing_simplified: 0
% 0.72/0.91 % inst_num_eq_res_simplified: 0
% 0.72/0.91 % inst_num_child_elim: 0
% 0.72/0.91 % inst_num_of_dismatching_blockings: 4
% 0.72/0.91 % inst_num_of_non_proper_insts: 94
% 0.72/0.91 % inst_num_of_duplicates: 46
% 0.72/0.91 % inst_inst_num_from_inst_to_res: 0
% 0.72/0.91 % inst_dismatching_checking_time: 0.
% 0.72/0.91
% 0.72/0.91 % ------ Resolution
% 0.72/0.91
% 0.72/0.91 % res_num_of_clauses: 1994
% 0.72/0.91 % res_num_in_passive: 1497
% 0.72/0.91 % res_num_in_active: 476
% 0.72/0.91 % res_num_of_loops: 1000
% 0.72/0.91 % res_forward_subset_subsumed: 469
% 0.72/0.91 % res_backward_subset_subsumed: 0
% 0.72/0.91 % res_forward_subsumed: 536
% 0.72/0.91 % res_backward_subsumed: 0
% 0.72/0.91 % res_forward_subsumption_resolution: 0
% 0.72/0.91 % res_backward_subsumption_resolution: 0
% 0.72/0.91 % res_clause_to_clause_subsumption: 32091
% 0.72/0.91 % res_orphan_elimination: 0
% 0.72/0.91 % res_tautology_del: 0
% 0.72/0.91 % res_num_eq_res_simplified: 0
% 0.72/0.91 % res_num_sel_changes: 0
% 0.72/0.91 % res_moves_from_active_to_pass: 0
% 0.72/0.91
% 0.72/0.91 % Status Unsatisfiable
% 0.72/0.91 % SZS status Unsatisfiable
% 0.72/0.91 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------