TSTP Solution File: SET002-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n011.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 : Tue Jul 19 02:08:11 EDT 2022
% Result : Unsatisfiable 1.01s 1.18s
% Output : CNFRefutation 1.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 21
% Syntax : Number of formulae : 127 ( 13 unt; 0 def)
% Number of atoms : 340 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 382 ( 169 ~; 213 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 304 ( 14 sgn 102 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3] :
( ~ member(g(X3,X2,X1),X3)
| ~ member(g(X3,X2,X1),X1)
| union(X3,X2,X1) ),
file('<stdin>',union_axiom2) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( ~ member(g(X3,X2,X1),X2)
| ~ member(g(X3,X2,X1),X1)
| union(X3,X2,X1) ),
file('<stdin>',union_axiom3) ).
fof(c_0_2,axiom,
! [X1,X2,X3] :
( union(X3,X2,X1)
| member(g(X3,X2,X1),X3)
| member(g(X3,X2,X1),X2)
| member(g(X3,X2,X1),X1) ),
file('<stdin>',union_axiom1) ).
fof(c_0_3,axiom,
! [X1,X2,X3,X4] :
( ~ union(X3,X2,X1)
| ~ member(X4,X1)
| member(X4,X3)
| member(X4,X2) ),
file('<stdin>',member_of_union_is_member_of_one_set) ).
fof(c_0_4,axiom,
! [X1,X2,X3,X4] :
( ~ union(X3,X2,X1)
| ~ member(X4,X3)
| member(X4,X1) ),
file('<stdin>',member_of_set1_is_member_of_union) ).
fof(c_0_5,axiom,
! [X1,X2,X3,X4] :
( ~ union(X3,X2,X1)
| ~ member(X4,X2)
| member(X4,X1) ),
file('<stdin>',member_of_set2_is_member_of_union) ).
fof(c_0_6,axiom,
! [X5,X6] :
( ~ member(member_of_1_not_of_2(X6,X5),X5)
| subset(X6,X5) ),
file('<stdin>',subsets_axiom2) ).
fof(c_0_7,axiom,
! [X5,X6,X4] :
( ~ member(X4,X6)
| ~ subset(X6,X5)
| member(X4,X5) ),
file('<stdin>',membership_in_subsets) ).
fof(c_0_8,axiom,
! [X2,X3] :
( ~ subset(X3,X2)
| ~ subset(X2,X3)
| equal_sets(X2,X3) ),
file('<stdin>',subsets_are_set_equal_sets) ).
fof(c_0_9,axiom,
! [X5,X6] :
( subset(X6,X5)
| member(member_of_1_not_of_2(X6,X5),X6) ),
file('<stdin>',subsets_axiom1) ).
fof(c_0_10,axiom,
! [X5,X6] :
( ~ equal_sets(X6,X5)
| subset(X6,X5) ),
file('<stdin>',set_equal_sets_are_subsets1) ).
fof(c_0_11,axiom,
! [X5,X6] :
( ~ equal_sets(X5,X6)
| subset(X6,X5) ),
file('<stdin>',set_equal_sets_are_subsets2) ).
fof(c_0_12,plain,
! [X1,X2,X3] :
( ~ member(g(X3,X2,X1),X3)
| ~ member(g(X3,X2,X1),X1)
| union(X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_13,plain,
! [X1,X2,X3] :
( ~ member(g(X3,X2,X1),X2)
| ~ member(g(X3,X2,X1),X1)
| union(X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_14,axiom,
! [X1,X2,X3] :
( union(X3,X2,X1)
| member(g(X3,X2,X1),X3)
| member(g(X3,X2,X1),X2)
| member(g(X3,X2,X1),X1) ),
c_0_2 ).
fof(c_0_15,plain,
! [X1,X2,X3,X4] :
( ~ union(X3,X2,X1)
| ~ member(X4,X1)
| member(X4,X3)
| member(X4,X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_16,plain,
! [X1,X2,X3,X4] :
( ~ union(X3,X2,X1)
| ~ member(X4,X3)
| member(X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_17,plain,
! [X1,X2,X3,X4] :
( ~ union(X3,X2,X1)
| ~ member(X4,X2)
| member(X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_18,plain,
! [X5,X6] :
( ~ member(member_of_1_not_of_2(X6,X5),X5)
| subset(X6,X5) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_19,plain,
! [X5,X6,X4] :
( ~ member(X4,X6)
| ~ subset(X6,X5)
| member(X4,X5) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_20,plain,
! [X2,X3] :
( ~ subset(X3,X2)
| ~ subset(X2,X3)
| equal_sets(X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_21,axiom,
! [X5,X6] :
( subset(X6,X5)
| member(member_of_1_not_of_2(X6,X5),X6) ),
c_0_9 ).
fof(c_0_22,plain,
! [X5,X6] :
( ~ equal_sets(X6,X5)
| subset(X6,X5) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X5,X6] :
( ~ equal_sets(X5,X6)
| subset(X6,X5) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X4,X5,X6] :
( ~ member(g(X6,X5,X4),X6)
| ~ member(g(X6,X5,X4),X4)
| union(X6,X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X4,X5,X6] :
( ~ member(g(X6,X5,X4),X5)
| ~ member(g(X6,X5,X4),X4)
| union(X6,X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_26,plain,
! [X4,X5,X6] :
( union(X6,X5,X4)
| member(g(X6,X5,X4),X6)
| member(g(X6,X5,X4),X5)
| member(g(X6,X5,X4),X4) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_27,plain,
! [X5,X6,X7,X8] :
( ~ union(X7,X6,X5)
| ~ member(X8,X5)
| member(X8,X7)
| member(X8,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_15])])]) ).
fof(c_0_28,plain,
! [X5,X6,X7,X8] :
( ~ union(X7,X6,X5)
| ~ member(X8,X7)
| member(X8,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_16])])]) ).
fof(c_0_29,plain,
! [X5,X6,X7,X8] :
( ~ union(X7,X6,X5)
| ~ member(X8,X6)
| member(X8,X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_17])])]) ).
fof(c_0_30,plain,
! [X7,X8] :
( ~ member(member_of_1_not_of_2(X8,X7),X7)
| subset(X8,X7) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_31,plain,
! [X7,X8,X9] :
( ~ member(X9,X8)
| ~ subset(X8,X7)
| member(X9,X7) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
! [X4,X5] :
( ~ subset(X5,X4)
| ~ subset(X4,X5)
| equal_sets(X4,X5) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_33,plain,
! [X7,X8] :
( subset(X8,X7)
| member(member_of_1_not_of_2(X8,X7),X8) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_34,plain,
! [X7,X8] :
( ~ equal_sets(X8,X7)
| subset(X8,X7) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_35,plain,
! [X7,X8] :
( ~ equal_sets(X7,X8)
| subset(X8,X7) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( member(g(X1,X2,X3),X3)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,X4)
| ~ union(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ union(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ union(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,plain,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,plain,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_46,plain,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,plain,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_48,plain,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X1) ),
c_0_36,
[final] ).
cnf(c_0_49,plain,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X2) ),
c_0_37,
[final] ).
cnf(c_0_50,plain,
( member(g(X1,X2,X3),X3)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
c_0_38,
[final] ).
cnf(c_0_51,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,X4)
| ~ union(X3,X2,X4) ),
c_0_39,
[final] ).
cnf(c_0_52,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ union(X3,X4,X2) ),
c_0_40,
[final] ).
cnf(c_0_53,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ union(X4,X3,X2) ),
c_0_41,
[final] ).
cnf(c_0_54,plain,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
c_0_42,
[final] ).
cnf(c_0_55,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
c_0_43,
[final] ).
cnf(c_0_56,plain,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_44,
[final] ).
cnf(c_0_57,plain,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
c_0_45,
[final] ).
cnf(c_0_58,plain,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
c_0_46,
[final] ).
cnf(c_0_59,plain,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
c_0_47,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_48_0,axiom,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X1) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ member(g(X1,X2,X3),X3)
| union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X1) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ member(g(X1,X2,X3),X1)
| ~ member(g(X1,X2,X3),X3)
| union(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( ~ member(g(X1,X2,X3),X3)
| union(X1,X2,X3)
| ~ member(g(X1,X2,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_2,axiom,
( ~ member(g(X1,X2,X3),X2)
| ~ member(g(X1,X2,X3),X3)
| union(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_50_0,axiom,
( member(g(X1,X2,X3),X3)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_1,axiom,
( member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X3)
| member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_2,axiom,
( member(g(X1,X2,X3),X1)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X3)
| union(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_3,axiom,
( union(X1,X2,X3)
| member(g(X1,X2,X3),X1)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X3) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,X4)
| ~ union(X3,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_1,axiom,
( member(X1,X3)
| member(X1,X2)
| ~ member(X1,X4)
| ~ union(X3,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_2,axiom,
( ~ member(X1,X4)
| member(X1,X3)
| member(X1,X2)
| ~ union(X3,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_3,axiom,
( ~ union(X3,X2,X4)
| ~ member(X1,X4)
| member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_52_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ union(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ union(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_2,axiom,
( ~ union(X3,X4,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ union(X4,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ union(X4,X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_2,axiom,
( ~ union(X4,X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
( subset(X1,X2)
| ~ member(member_of_1_not_of_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_1,axiom,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_55_0,axiom,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_1,axiom,
( ~ subset(X3,X2)
| member(X1,X2)
| ~ member(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_2,axiom,
( ~ member(X1,X3)
| ~ subset(X3,X2)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_56_0,axiom,
( equal_sets(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_1,axiom,
( ~ subset(X1,X2)
| equal_sets(X1,X2)
| ~ subset(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_2,axiom,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_57_0,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_1,axiom,
( subset(X1,X2)
| member(member_of_1_not_of_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_58_0,axiom,
( subset(X1,X2)
| ~ equal_sets(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_1,axiom,
( ~ equal_sets(X1,X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_59_0,axiom,
( subset(X1,X2)
| ~ equal_sets(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_1,axiom,
( ~ equal_sets(X2,X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,hypothesis,
union(a,a,aUa),
file('<stdin>',a_union_a_is_aUa) ).
fof(c_0_1_002,negated_conjecture,
~ equal_sets(aUa,a),
file('<stdin>',prove_a_equals_aUa) ).
fof(c_0_2_003,hypothesis,
union(a,a,aUa),
c_0_0 ).
fof(c_0_3_004,negated_conjecture,
~ equal_sets(aUa,a),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4_005,hypothesis,
union(a,a,aUa),
c_0_2 ).
fof(c_0_5_006,negated_conjecture,
~ equal_sets(aUa,a),
c_0_3 ).
cnf(c_0_6_007,hypothesis,
union(a,a,aUa),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,negated_conjecture,
~ equal_sets(aUa,a),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,hypothesis,
union(a,a,aUa),
c_0_6,
[final] ).
cnf(c_0_9_010,negated_conjecture,
~ equal_sets(aUa,a),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_19,plain,
( member(X0,X1)
| ~ member(X0,X2)
| ~ union(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1a3dd2.p',c_0_53_2) ).
cnf(c_72,plain,
( member(X0,X1)
| ~ member(X0,X2)
| ~ union(X3,X2,X1) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_20347,plain,
( ~ union(X0,a,X1)
| ~ member(member_of_1_not_of_2(a,aUa),a)
| member(member_of_1_not_of_2(a,aUa),X1) ),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_20396,plain,
( ~ union(X0,a,aUa)
| member(member_of_1_not_of_2(a,aUa),aUa)
| ~ member(member_of_1_not_of_2(a,aUa),a) ),
inference(instantiation,[status(thm)],[c_20347]) ).
cnf(c_20397,plain,
( ~ union(a,a,aUa)
| member(member_of_1_not_of_2(a,aUa),aUa)
| ~ member(member_of_1_not_of_2(a,aUa),a) ),
inference(instantiation,[status(thm)],[c_20396]) ).
cnf(c_13,plain,
( member(X0,X1)
| member(X0,X2)
| ~ member(X0,X3)
| ~ union(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1a3dd2.p',c_0_51_3) ).
cnf(c_66,plain,
( member(X0,X1)
| member(X0,X2)
| ~ member(X0,X3)
| ~ union(X2,X1,X3) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_20294,plain,
( ~ union(X0,X1,aUa)
| ~ member(member_of_1_not_of_2(aUa,a),aUa)
| member(member_of_1_not_of_2(aUa,a),X1)
| member(member_of_1_not_of_2(aUa,a),X0) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_20295,plain,
( ~ union(a,a,aUa)
| ~ member(member_of_1_not_of_2(aUa,a),aUa)
| member(member_of_1_not_of_2(aUa,a),a) ),
inference(instantiation,[status(thm)],[c_20294]) ).
cnf(c_29,plain,
( member(member_of_1_not_of_2(X0,X1),X0)
| subset(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1a3dd2.p',c_0_57_1) ).
cnf(c_82,plain,
( member(member_of_1_not_of_2(X0,X1),X0)
| subset(X0,X1) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_20278,plain,
( member(member_of_1_not_of_2(a,aUa),a)
| subset(a,aUa) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_21,plain,
( subset(X0,X1)
| ~ member(member_of_1_not_of_2(X0,X1),X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1a3dd2.p',c_0_54_1) ).
cnf(c_74,plain,
( subset(X0,X1)
| ~ member(member_of_1_not_of_2(X0,X1),X1) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_20280,plain,
( ~ member(member_of_1_not_of_2(a,aUa),aUa)
| subset(a,aUa) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_20270,plain,
( member(member_of_1_not_of_2(aUa,a),aUa)
| subset(aUa,a) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_20272,plain,
( ~ member(member_of_1_not_of_2(aUa,a),a)
| subset(aUa,a) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_25,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_sets(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1a3dd2.p',c_0_56_0) ).
cnf(c_78,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_sets(X1,X0) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_20267,plain,
( ~ subset(aUa,a)
| ~ subset(a,aUa)
| equal_sets(aUa,a) ),
inference(instantiation,[status(thm)],[c_78]) ).
cnf(c_35,plain,
union(a,a,aUa),
file('/export/starexec/sandbox/tmp/iprover_modulo_1a3dd2.p',c_0_8) ).
cnf(c_34,negated_conjecture,
~ equal_sets(aUa,a),
file('/export/starexec/sandbox/tmp/iprover_modulo_1a3dd2.p',c_0_9) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_20397,c_20295,c_20278,c_20280,c_20270,c_20272,c_20267,c_35,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 10:00:42 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % 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/sandbox/tmp/iprover_proof_14e3bd.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_1a3dd2.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_5d4877 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_14e3bd.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.98/1.17 % --inst_prop_sim_new false
% 0.98/1.17 % --inst_orphan_elimination true
% 0.98/1.17 % --inst_learning_loop_flag true
% 0.98/1.17 % --inst_learning_start 3000
% 0.98/1.17 % --inst_learning_factor 2
% 0.98/1.17 % --inst_start_prop_sim_after_learn 3
% 0.98/1.17 % --inst_sel_renew solver
% 0.98/1.17 % --inst_lit_activity_flag true
% 0.98/1.17 % --inst_out_proof true
% 0.98/1.17
% 0.98/1.17 % ------ Resolution Options
% 0.98/1.17
% 0.98/1.17 % --resolution_flag true
% 0.98/1.17 % --res_lit_sel kbo_max
% 0.98/1.17 % --res_to_prop_solver none
% 0.98/1.17 % --res_prop_simpl_new false
% 0.98/1.17 % --res_prop_simpl_given false
% 0.98/1.17 % --res_passive_queue_type priority_queues
% 0.98/1.17 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.98/1.17 % --res_passive_queues_freq [15;5]
% 0.98/1.17 % --res_forward_subs full
% 0.98/1.17 % --res_backward_subs full
% 0.98/1.17 % --res_forward_subs_resolution true
% 0.98/1.17 % --res_backward_subs_resolution true
% 0.98/1.17 % --res_orphan_elimination false
% 0.98/1.17 % --res_time_limit 1000.
% 0.98/1.17 % --res_out_proof true
% 0.98/1.17 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_14e3bd.s
% 0.98/1.17 % --modulo true
% 0.98/1.17
% 0.98/1.17 % ------ Combination Options
% 0.98/1.17
% 0.98/1.17 % --comb_res_mult 1000
% 0.98/1.17 % --comb_inst_mult 300
% 0.98/1.17 % ------
% 0.98/1.17
% 0.98/1.17
% 0.98/1.17
% 0.98/1.17 % ------ Proving...
% 0.98/1.17 %
% 0.98/1.17
% 0.98/1.17
% 0.98/1.17 % ------ Statistics
% 0.98/1.17
% 0.98/1.17 % ------ General
% 0.98/1.17
% 0.98/1.17 % num_of_input_clauses: 36
% 0.98/1.17 % num_of_input_neg_conjectures: 1
% 0.98/1.17 % num_of_splits: 0
% 0.98/1.17 % num_of_split_atoms: 0
% 0.98/1.17 % num_of_sem_filtered_clauses: 0
% 0.98/1.17 % num_of_subtypes: 0
% 0.98/1.17 % monotx_restored_types: 0
% 0.98/1.17 % sat_num_of_epr_types: 0
% 0.98/1.17 % sat_num_of_non_cyclic_types: 0
% 0.98/1.17 % sat_guarded_non_collapsed_types: 0
% 0.98/1.17 % is_epr: 0
% 0.98/1.17 % is_horn: 0
% 0.98/1.17 % has_eq: 0
% 0.98/1.17 % num_pure_diseq_elim: 0
% 0.98/1.17 % simp_replaced_by: 0
% 0.98/1.17 % res_preprocessed: 3
% 0.98/1.17 % prep_upred: 0
% 0.98/1.17 % prep_unflattend: 0
% 0.98/1.17 % pred_elim_cands: 1
% 0.98/1.17 % pred_elim: 1
% 0.98/1.17 % pred_elim_cl: 1
% 0.98/1.17 % pred_elim_cycles: 2
% 0.98/1.17 % forced_gc_time: 0
% 0.98/1.17 % gc_basic_clause_elim: 0
% 0.98/1.17 % parsing_time: 0.001
% 0.98/1.17 % sem_filter_time: 0.
% 0.98/1.17 % pred_elim_time: 0.
% 0.98/1.17 % out_proof_time: 0.
% 0.98/1.17 % monotx_time: 0.
% 0.98/1.17 % subtype_inf_time: 0.
% 0.98/1.17 % unif_index_cands_time: 0.001
% 0.98/1.17 % unif_index_add_time: 0.001
% 0.98/1.17 % total_time: 0.765
% 0.98/1.17 % num_of_symbols: 33
% 0.98/1.17 % num_of_terms: 2320
% 0.98/1.17
% 0.98/1.17 % ------ Propositional Solver
% 0.98/1.17
% 0.98/1.17 % prop_solver_calls: 5
% 0.98/1.17 % prop_fast_solver_calls: 5
% 0.98/1.17 % prop_num_of_clauses: 62
% 0.98/1.17 % prop_preprocess_simplified: 291
% 0.98/1.17 % prop_fo_subsumed: 0
% 0.98/1.17 % prop_solver_time: 0.
% 0.98/1.17 % prop_fast_solver_time: 0.
% 0.98/1.17 % prop_unsat_core_time: 0.
% 0.98/1.17
% 0.98/1.17 % ------ QBF
% 0.98/1.17
% 0.98/1.17 % qbf_q_res: 0
% 0.98/1.17 % qbf_num_tautologies: 0
% 0.98/1.17 % qbf_prep_cycles: 0
% 0.98/1.17
% 0.98/1.17 % ------ BMC1
% 0.98/1.17
% 0.98/1.17 % bmc1_current_bound: -1
% 0.98/1.17 % bmc1_last_solved_bound: -1
% 0.98/1.17 % bmc1_unsat_core_size: -1
% 0.98/1.17 % bmc1_unsat_core_parents_size: -1
% 0.98/1.17 % bmc1_merge_next_fun: 0
% 0.98/1.17 % bmc1_unsat_core_clauses_time: 0.
% 0.98/1.17
% 0.98/1.17 % ------ Instantiation
% 0.98/1.17
% 0.98/1.17 % inst_num_of_clauses: 79
% 0.98/1.17 % inst_num_in_passive: 12
% 0.98/1.17 % inst_num_in_active: 55
% 0.98/1.17 % inst_num_in_unprocessed: 10
% 0.98/1.17 % inst_num_of_loops: 76
% 0.98/1.17 % inst_num_of_learning_restarts: 0
% 0.98/1.18 % inst_num_moves_active_passive: 14
% 0.98/1.18 % inst_lit_activity: 41
% 0.98/1.18 % inst_lit_activity_moves: 0
% 0.98/1.18 % inst_num_tautologies: 0
% 0.98/1.18 % inst_num_prop_implied: 0
% 0.98/1.18 % inst_num_existing_simplified: 0
% 0.98/1.18 % inst_num_eq_res_simplified: 0
% 0.98/1.18 % inst_num_child_elim: 0
% 0.98/1.18 % inst_num_of_dismatching_blockings: 0
% 0.98/1.18 % inst_num_of_non_proper_insts: 107
% 0.98/1.18 % inst_num_of_duplicates: 82
% 0.98/1.18 % inst_inst_num_from_inst_to_res: 0
% 0.98/1.18 % inst_dismatching_checking_time: 0.
% 0.98/1.18
% 0.98/1.18 % ------ Resolution
% 0.98/1.18
% 0.98/1.18 % res_num_of_clauses: 3987
% 0.98/1.18 % res_num_in_passive: 3104
% 0.98/1.18 % res_num_in_active: 863
% 0.98/1.18 % res_num_of_loops: 1000
% 0.98/1.18 % res_forward_subset_subsumed: 802
% 0.98/1.18 % res_backward_subset_subsumed: 0
% 0.98/1.18 % res_forward_subsumed: 145
% 0.98/1.18 % res_backward_subsumed: 1
% 0.98/1.18 % res_forward_subsumption_resolution: 109
% 0.98/1.18 % res_backward_subsumption_resolution: 0
% 0.98/1.18 % res_clause_to_clause_subsumption: 137653
% 0.98/1.18 % res_orphan_elimination: 0
% 0.98/1.18 % res_tautology_del: 535
% 0.98/1.18 % res_num_eq_res_simplified: 0
% 0.98/1.18 % res_num_sel_changes: 0
% 0.98/1.18 % res_moves_from_active_to_pass: 0
% 0.98/1.18
% 1.01/1.18 % Status Unsatisfiable
% 1.01/1.18 % SZS status Unsatisfiable
% 1.01/1.18 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------