TSTP Solution File: SET983+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n028.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:19:02 EDT 2022
% Result : Theorem 54.53s 54.74s
% Output : CNFRefutation 54.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 93 ( 43 unt; 0 def)
% Number of atoms : 222 ( 66 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 233 ( 104 ~; 110 |; 11 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-3 aty)
% Number of variables : 220 ( 13 sgn 56 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('<stdin>',d3_xboole_0) ).
fof(c_0_1,axiom,
! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('<stdin>',t123_zfmisc_1) ).
fof(c_0_2,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('<stdin>',antisymmetry_r2_hidden) ).
fof(c_0_3,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('<stdin>',commutativity_k3_xboole_0) ).
fof(c_0_4,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('<stdin>',idempotence_k3_xboole_0) ).
fof(c_0_5,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_6,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_7,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
c_0_0 ).
fof(c_0_8,axiom,
! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
c_0_1 ).
fof(c_0_9,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
c_0_3 ).
fof(c_0_11,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
c_0_4 ).
fof(c_0_12,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_13,axiom,
? [X1] : empty(X1),
c_0_6 ).
fof(c_0_14,plain,
! [X5,X6,X7,X8,X9,X10,X11,X12] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X9,X5)
| ~ in(X9,X6)
| in(X9,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk1_3(X10,X11,X12),X12)
| ~ in(esk1_3(X10,X11,X12),X10)
| ~ in(esk1_3(X10,X11,X12),X11)
| X12 = set_intersection2(X10,X11) )
& ( in(esk1_3(X10,X11,X12),X10)
| in(esk1_3(X10,X11,X12),X12)
| X12 = set_intersection2(X10,X11) )
& ( in(esk1_3(X10,X11,X12),X11)
| in(esk1_3(X10,X11,X12),X12)
| X12 = set_intersection2(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
fof(c_0_15,plain,
! [X5,X6,X7,X8] : cartesian_product2(set_intersection2(X5,X6),set_intersection2(X7,X8)) = set_intersection2(cartesian_product2(X5,X7),cartesian_product2(X6,X8)),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
fof(c_0_17,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X3,X4] : set_intersection2(X3,X3) = X3,
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
~ empty(esk3_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
fof(c_0_20,plain,
empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
cnf(c_0_21,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk1_3(X2,X3,X1),X3)
| ~ in(esk1_3(X2,X3,X1),X2)
| ~ in(esk1_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( X1 = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( X1 = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,plain,
~ empty(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_32,plain,
empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk1_3(X2,X3,X1),X3)
| ~ in(esk1_3(X2,X3,X1),X2)
| ~ in(esk1_3(X2,X3,X1),X1) ),
c_0_21,
[final] ).
cnf(c_0_34,plain,
( X1 = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X2) ),
c_0_22,
[final] ).
cnf(c_0_35,plain,
( X1 = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X3) ),
c_0_23,
[final] ).
cnf(c_0_36,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
c_0_24,
[final] ).
cnf(c_0_37,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
c_0_25,
[final] ).
cnf(c_0_38,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
c_0_26,
[final] ).
cnf(c_0_39,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
c_0_27,
[final] ).
cnf(c_0_40,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_28,
[final] ).
cnf(c_0_41,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
c_0_29,
[final] ).
cnf(c_0_42,plain,
set_intersection2(X1,X1) = X1,
c_0_30,
[final] ).
cnf(c_0_43,plain,
~ empty(esk3_0),
c_0_31,
[final] ).
cnf(c_0_44,plain,
empty(esk2_0),
c_0_32,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_33_0,axiom,
( X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk1_3(X2,X3,X1),X3)
| ~ in(sk1_esk1_3(X2,X3,X1),X2)
| ~ in(sk1_esk1_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_1,axiom,
( ~ in(sk1_esk1_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk1_3(X2,X3,X1),X2)
| ~ in(sk1_esk1_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_2,axiom,
( ~ in(sk1_esk1_3(X2,X3,X1),X2)
| ~ in(sk1_esk1_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3)
| ~ in(sk1_esk1_3(X2,X3,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_33_3,axiom,
( ~ in(sk1_esk1_3(X2,X3,X1),X1)
| ~ in(sk1_esk1_3(X2,X3,X1),X2)
| ~ in(sk1_esk1_3(X2,X3,X1),X3)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_33]) ).
cnf(c_0_34_0,axiom,
( X1 = set_intersection2(X2,X3)
| in(sk1_esk1_3(X2,X3,X1),X1)
| in(sk1_esk1_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_1,axiom,
( in(sk1_esk1_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3)
| in(sk1_esk1_3(X2,X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_34_2,axiom,
( in(sk1_esk1_3(X2,X3,X1),X2)
| in(sk1_esk1_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_34]) ).
cnf(c_0_35_0,axiom,
( X1 = set_intersection2(X2,X3)
| in(sk1_esk1_3(X2,X3,X1),X1)
| in(sk1_esk1_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_1,axiom,
( in(sk1_esk1_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3)
| in(sk1_esk1_3(X2,X3,X1),X3) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_35_2,axiom,
( in(sk1_esk1_3(X2,X3,X1),X3)
| in(sk1_esk1_3(X2,X3,X1),X1)
| X1 = set_intersection2(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_35]) ).
cnf(c_0_37_0,axiom,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X1)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_2,axiom,
( ~ in(X4,X3)
| X1 != set_intersection2(X2,X3)
| in(X4,X1)
| ~ in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_3,axiom,
( ~ in(X4,X2)
| ~ in(X4,X3)
| X1 != set_intersection2(X2,X3)
| in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_38_0,axiom,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_2,axiom,
( ~ in(X4,X1)
| X1 != set_intersection2(X2,X3)
| in(X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_39_0,axiom,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_1,axiom,
( X1 != set_intersection2(X2,X3)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_2,axiom,
( ~ in(X4,X1)
| X1 != set_intersection2(X2,X3)
| in(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_40_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_43_0,axiom,
~ empty(sk1_esk3_0),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_36_0,axiom,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_41_0,axiom,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_42_0,axiom,
set_intersection2(X1,X1) = X1,
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_44_0,axiom,
empty(sk1_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2,X3,X4,X5] :
( ( in(X1,cartesian_product2(X2,X3))
& in(X1,cartesian_product2(X4,X5)) )
=> in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5))) ),
file('<stdin>',t137_zfmisc_1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2,X3,X4,X5] :
( ( in(X1,cartesian_product2(X2,X3))
& in(X1,cartesian_product2(X4,X5)) )
=> in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5))) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( in(esk1_0,cartesian_product2(esk2_0,esk3_0))
& in(esk1_0,cartesian_product2(esk4_0,esk5_0))
& ~ in(esk1_0,cartesian_product2(set_intersection2(esk2_0,esk4_0),set_intersection2(esk3_0,esk5_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
~ in(esk1_0,cartesian_product2(set_intersection2(esk2_0,esk4_0),set_intersection2(esk3_0,esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
in(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
in(esk1_0,cartesian_product2(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
~ in(esk1_0,cartesian_product2(set_intersection2(esk2_0,esk4_0),set_intersection2(esk3_0,esk5_0))),
c_0_3,
[final] ).
cnf(c_0_7_008,negated_conjecture,
in(esk1_0,cartesian_product2(esk2_0,esk3_0)),
c_0_4,
[final] ).
cnf(c_0_8_009,negated_conjecture,
in(esk1_0,cartesian_product2(esk4_0,esk5_0)),
c_0_5,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,plain,
cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p',c_0_36_0) ).
cnf(c_60,plain,
cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_89370,plain,
cartesian_product2(set_intersection2(sk2_esk2_0,sk2_esk4_0),set_intersection2(sk2_esk3_0,sk2_esk5_0)) = set_intersection2(cartesian_product2(sk2_esk2_0,sk2_esk3_0),cartesian_product2(sk2_esk4_0,sk2_esk5_0)),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_13,plain,
( in(X0,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X0,X3)
| ~ in(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p',c_0_37_3) ).
cnf(c_70,plain,
( in(X0,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X0,X3)
| ~ in(X0,X2) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_89236,plain,
( ~ in(sk2_esk1_0,cartesian_product2(sk2_esk4_0,sk2_esk5_0))
| in(sk2_esk1_0,X0)
| ~ in(sk2_esk1_0,X1)
| X0 != set_intersection2(X1,cartesian_product2(sk2_esk4_0,sk2_esk5_0)) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_89291,plain,
( ~ in(sk2_esk1_0,cartesian_product2(sk2_esk2_0,sk2_esk3_0))
| ~ in(sk2_esk1_0,cartesian_product2(sk2_esk4_0,sk2_esk5_0))
| in(sk2_esk1_0,X0)
| X0 != set_intersection2(cartesian_product2(sk2_esk2_0,sk2_esk3_0),cartesian_product2(sk2_esk4_0,sk2_esk5_0)) ),
inference(instantiation,[status(thm)],[c_89236]) ).
cnf(c_89369,plain,
( in(sk2_esk1_0,cartesian_product2(set_intersection2(sk2_esk2_0,sk2_esk4_0),set_intersection2(sk2_esk3_0,sk2_esk5_0)))
| ~ in(sk2_esk1_0,cartesian_product2(sk2_esk2_0,sk2_esk3_0))
| ~ in(sk2_esk1_0,cartesian_product2(sk2_esk4_0,sk2_esk5_0))
| cartesian_product2(set_intersection2(sk2_esk2_0,sk2_esk4_0),set_intersection2(sk2_esk3_0,sk2_esk5_0)) != set_intersection2(cartesian_product2(sk2_esk2_0,sk2_esk3_0),cartesian_product2(sk2_esk4_0,sk2_esk5_0)) ),
inference(instantiation,[status(thm)],[c_89291]) ).
cnf(c_27,negated_conjecture,
~ in(sk2_esk1_0,cartesian_product2(set_intersection2(sk2_esk2_0,sk2_esk4_0),set_intersection2(sk2_esk3_0,sk2_esk5_0))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p',c_0_6) ).
cnf(c_28,negated_conjecture,
in(sk2_esk1_0,cartesian_product2(sk2_esk2_0,sk2_esk3_0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p',c_0_7) ).
cnf(c_29,negated_conjecture,
in(sk2_esk1_0,cartesian_product2(sk2_esk4_0,sk2_esk5_0)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p',c_0_8) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_89370,c_89369,c_27,c_28,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 15:19:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % FOF problem with conjecture
% 0.12/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/sandbox2/tmp/iprover_proof_22e567.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_79d86e | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.40/0.63 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.63 % --bmc1_dump_file -
% 0.40/0.63 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.63 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.63 % --bmc1_ucm_extend_mode 1
% 0.40/0.63 % --bmc1_ucm_init_mode 2
% 0.40/0.63 % --bmc1_ucm_cone_mode none
% 0.40/0.63 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.63 % --bmc1_ucm_relax_model 4
% 0.40/0.63 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.63 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.63 % --bmc1_ucm_layered_model none
% 0.40/0.63 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.63
% 0.40/0.63 % ------ AIG Options
% 0.40/0.63
% 0.40/0.63 % --aig_mode false
% 0.40/0.63
% 0.40/0.63 % ------ Instantiation Options
% 0.40/0.63
% 0.40/0.63 % --instantiation_flag true
% 0.40/0.63 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.63 % --inst_solver_per_active 750
% 0.40/0.63 % --inst_solver_calls_frac 0.5
% 0.40/0.63 % --inst_passive_queue_type priority_queues
% 0.40/0.63 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/0.63 % --inst_passive_queues_freq [25;2]
% 0.45/0.63 % --inst_dismatching true
% 0.45/0.63 % --inst_eager_unprocessed_to_passive true
% 0.45/0.63 % --inst_prop_sim_given true
% 0.45/0.63 % --inst_prop_sim_new false
% 0.45/0.63 % --inst_orphan_elimination true
% 0.45/0.63 % --inst_learning_loop_flag true
% 0.45/0.63 % --inst_learning_start 3000
% 0.45/0.63 % --inst_learning_factor 2
% 0.45/0.63 % --inst_start_prop_sim_after_learn 3
% 0.45/0.63 % --inst_sel_renew solver
% 0.45/0.63 % --inst_lit_activity_flag true
% 0.45/0.63 % --inst_out_proof true
% 0.45/0.63
% 0.45/0.63 % ------ Resolution Options
% 0.45/0.63
% 0.45/0.63 % --resolution_flag true
% 0.45/0.63 % --res_lit_sel kbo_max
% 0.45/0.63 % --res_to_prop_solver none
% 0.45/0.63 % --res_prop_simpl_new false
% 0.45/0.63 % --res_prop_simpl_given false
% 0.45/0.63 % --res_passive_queue_type priority_queues
% 0.45/0.63 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.45/0.63 % --res_passive_queues_freq [15;5]
% 0.45/0.63 % --res_forward_subs full
% 0.45/0.63 % --res_backward_subs full
% 0.45/0.63 % --res_forward_subs_resolution true
% 0.45/0.63 % --res_backward_subs_resolution true
% 0.45/0.63 % --res_orphan_elimination false
% 0.45/0.63 % --res_time_limit 1000.
% 0.45/0.63 % --res_out_proof true
% 0.45/0.63 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_22e567.s
% 0.45/0.63 % --modulo true
% 0.45/0.63
% 0.45/0.63 % ------ Combination Options
% 0.45/0.63
% 0.45/0.63 % --comb_res_mult 1000
% 0.45/0.63 % --comb_inst_mult 300
% 0.45/0.63 % ------
% 0.45/0.63
% 0.45/0.63 % ------ Parsing...% successful
% 0.45/0.63
% 0.45/0.63 % ------ 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.45/0.63
% 0.45/0.63 % ------ Proving...
% 0.45/0.63 % ------ Problem Properties
% 0.45/0.63
% 0.45/0.63 %
% 0.45/0.63 % EPR false
% 0.45/0.63 % Horn false
% 0.45/0.63 % Has equality true
% 0.45/0.63
% 0.45/0.63 % % ------ Input Options Time Limit: Unbounded
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 Compiling...
% 0.45/0.63 Loading plugin: done.
% 0.45/0.63 Compiling...
% 0.45/0.63 Loading plugin: done.
% 0.45/0.63 % % ------ Current options:
% 0.45/0.63
% 0.45/0.63 % ------ Input Options
% 0.45/0.63
% 0.45/0.63 % --out_options all
% 0.45/0.63 % --tptp_safe_out true
% 0.45/0.63 % --problem_path ""
% 0.45/0.63 % --include_path ""
% 0.45/0.63 % --clausifier .//eprover
% 0.45/0.63 % --clausifier_options --tstp-format
% 0.45/0.63 % --stdin false
% 0.45/0.63 % --dbg_backtrace false
% 0.45/0.63 % --dbg_dump_prop_clauses false
% 0.45/0.63 % --dbg_dump_prop_clauses_file -
% 0.45/0.63 % --dbg_out_stat false
% 0.45/0.63
% 0.45/0.63 % ------ General Options
% 0.45/0.63
% 0.45/0.63 % --fof false
% 0.45/0.63 % --time_out_real 150.
% 0.45/0.63 % --time_out_prep_mult 0.2
% 0.45/0.63 % --time_out_virtual -1.
% 0.45/0.63 % --schedule none
% 0.45/0.63 % --ground_splitting input
% 0.45/0.63 % --splitting_nvd 16
% 0.45/0.63 % --non_eq_to_eq false
% 0.45/0.63 % --prep_gs_sim true
% 0.45/0.63 % --prep_unflatten false
% 0.45/0.63 % --prep_res_sim true
% 0.45/0.63 % --prep_upred true
% 0.45/0.63 % --res_sim_input true
% 0.45/0.63 % --clause_weak_htbl true
% 0.45/0.63 % --gc_record_bc_elim false
% 0.45/0.63 % --symbol_type_check false
% 0.45/0.63 % --clausify_out false
% 0.45/0.63 % --large_theory_mode false
% 0.45/0.63 % --prep_sem_filter none
% 0.45/0.63 % --prep_sem_filter_out false
% 0.45/0.63 % --preprocessed_out false
% 0.45/0.63 % --sub_typing false
% 0.45/0.63 % --brand_transform false
% 0.45/0.63 % --pure_diseq_elim true
% 0.45/0.63 % --min_unsat_core false
% 0.45/0.63 % --pred_elim true
% 0.45/0.63 % --add_important_lit false
% 0.45/0.63 % --soft_assumptions false
% 0.45/0.63 % --reset_solvers false
% 0.45/0.63 % --bc_imp_inh []
% 0.45/0.63 % --conj_cone_tolerance 1.5
% 0.45/0.63 % --prolific_symb_bound 500
% 0.45/0.63 % --lt_threshold 2000
% 0.45/0.63
% 0.45/0.63 % ------ SAT Options
% 0.45/0.63
% 0.45/0.63 % --sat_mode false
% 0.45/0.63 % --sat_fm_restart_options ""
% 0.45/0.63 % --sat_gr_def false
% 0.45/0.63 % --sat_epr_types true
% 0.45/0.63 % --sat_non_cyclic_types false
% 0.45/0.63 % --sat_finite_models false
% 0.45/0.63 % --sat_fm_lemmas false
% 0.45/0.63 % --sat_fm_prep false
% 0.45/0.63 % --sat_fm_uc_incr true
% 0.45/0.63 % --sat_out_model small
% 0.45/0.63 % --sat_out_clauses false
% 0.45/0.63
% 0.45/0.63 % ------ QBF Options
% 0.45/0.63
% 0.45/0.63 % --qbf_mode false
% 0.45/0.63 % --qbf_elim_univ true
% 0.45/0.63 % --qbf_sk_in true
% 0.45/0.63 % --qbf_pred_elim true
% 0.45/0.63 % --qbf_split 32
% 0.45/0.63
% 0.45/0.63 % ------ BMC1 Options
% 0.45/0.63
% 0.45/0.63 % --bmc1_incremental false
% 0.45/0.63 % --bmc1_axioms reachable_all
% 0.45/0.63 % --bmc1_min_bound 0
% 0.45/0.63 % --bmc1_max_bound -1
% 0.45/0.63 % --bmc1_max_bound_default -1
% 0.45/0.63 % --bmc1_symbol_reachability true
% 0.45/0.63 % --bmc1_property_lemmas false
% 0.45/0.63 % --bmc1_k_induction false
% 0.45/0.63 % --bmc1_non_equiv_states false
% 0.45/0.63 % --bmc1_deadlock false
% 0.45/0.63 % --bmc1_ucm false
% 0.45/0.63 % --bmc1_add_unsat_core none
% 0.45/0.63 % --bmc1_unsat_core_children false
% 0.45/0.63 % --bmc1_unsat_core_extrapolate_axioms false
% 0.45/0.63 % --bmc1_out_stat full
% 0.45/0.63 % --bmc1_ground_init false
% 0.45/0.63 % --bmc1_pre_inst_next_state false
% 0.45/0.63 % --bmc1_pre_inst_state false
% 0.45/0.63 % --bmc1_pre_inst_reach_state false
% 0.45/0.63 % --bmc1_out_unsat_core false
% 0.45/0.63 % --bmc1_aig_witness_out false
% 0.45/0.63 % --bmc1_verbose false
% 0.45/0.63 % --bmc1_dump_clauses_tptp false
% 0.45/0.63 % --bmc1_dump_unsat_core_tptp false
% 0.45/0.63 % --bmc1_dump_file -
% 0.45/0.63 % --bmc1_ucm_expand_uc_limit 128
% 0.45/0.63 % --bmc1_ucm_n_expand_iterations 6
% 0.45/0.63 % --bmc1_ucm_extend_mode 1
% 0.45/0.63 % --bmc1_ucm_init_mode 2
% 0.45/0.63 % --bmc1_ucm_cone_mode none
% 0.45/0.63 % --bmc1_ucm_reduced_relation_type 0
% 0.45/0.63 % --bmc1_ucm_relax_model 4
% 0.45/0.63 % --bmc1_ucm_full_tr_after_sat true
% 0.45/0.63 % --bmc1_ucm_expand_neg_assumptions false
% 0.45/0.63 % --bmc1_ucm_layered_model none
% 0.45/0.63 % --bmc1_ucm_max_lemma_size 10
% 0.45/0.63
% 0.45/0.63 % ------ AIG Options
% 0.45/0.63
% 0.45/0.63 % --aig_mode false
% 0.45/0.63
% 0.45/0.63 % ------ Instantiation Options
% 0.45/0.63
% 0.45/0.63 % --instantiation_flag true
% 0.45/0.63 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.45/0.63 % --inst_solver_per_active 750
% 0.45/0.63 % --inst_solver_calls_frac 0.5
% 0.45/0.63 % --inst_passive_queue_type priority_queues
% 0.45/0.63 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/0.63 % --inst_passive_queues_freq [25;2]
% 0.45/0.63 % --inst_dismatching true
% 0.45/0.63 % --inst_eager_unprocessed_to_passive true
% 0.45/0.63 % --inst_prop_sim_given true
% 0.45/0.63 % --inst_prop_sim_new false
% 0.45/0.63 % --inst_orphan_elimination true
% 0.45/0.63 % --inst_learning_loop_flag true
% 0.45/0.63 % --inst_learning_start 3000
% 0.45/0.63 % --inst_learning_factor 2
% 0.45/0.63 % --inst_start_prop_sim_after_learn 3
% 0.45/0.63 % --inst_sel_renew solver
% 0.45/0.63 % --inst_lit_activity_flag true
% 0.45/0.63 % --inst_out_proof true
% 0.45/0.63
% 0.45/0.63 % ------ Resolution Options
% 0.45/0.63
% 0.45/0.63 % --resolution_flag true
% 0.45/0.63 % --res_lit_sel kbo_max
% 0.45/0.63 % --res_to_prop_solver none
% 0.45/0.63 % --res_prop_simpl_new false
% 0.45/0.63 % --res_prop_simpl_given false
% 0.45/0.63 % --res_passive_queue_type priority_queues
% 0.45/0.63 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.45/0.63 % --res_passive_queues_freq [15;5]
% 0.45/0.63 % --res_forward_subs full
% 0.45/0.63 % --res_backward_subs full
% 0.45/0.63 % --res_forward_subs_resolution true
% 0.45/0.63 % --res_backward_subs_resolution true
% 0.45/0.63 % --res_orphan_elimination false
% 0.45/0.63 % --res_time_limit 1000.
% 0.45/0.63 % --res_out_proof true
% 0.45/0.63 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_22e567.s
% 0.45/0.63 % --modulo true
% 0.45/0.63
% 0.45/0.63 % ------ Combination Options
% 0.45/0.63
% 0.45/0.63 % --comb_res_mult 1000
% 0.45/0.63 % --comb_inst_mult 300
% 0.45/0.63 % ------
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 % ------ Proving...
% 0.45/0.63 % warning: shown sat in sat incomplete mode
% 0.45/0.63 %
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 cnf(c_14,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk4_0,sk3_esk5_0)) ),
% 0.45/0.63 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_8) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_25,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk4_0,sk3_esk5_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_14]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_35,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk4_0,sk3_esk5_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_25]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_36,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk4_0,sk3_esk5_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_35]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_41,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk4_0,sk3_esk5_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_36]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_83,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk4_0,sk3_esk5_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_41]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_5,plain,
% 0.45/0.63 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.45/0.63 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_35_0) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_65,plain,
% 0.45/0.63 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_5]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_91,plain,
% 0.45/0.63 ( ~ in(cartesian_product2(sk3_esk4_0,sk3_esk5_0),sk3_esk1_0) ),
% 0.45/0.63 inference(resolution,[status(thm)],[c_83,c_65]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_92,plain,
% 0.45/0.63 ( ~ in(cartesian_product2(sk3_esk4_0,sk3_esk5_0),sk3_esk1_0) ),
% 0.45/0.63 inference(rewriting,[status(thm)],[c_91]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_13,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk2_0,sk3_esk3_0)) ),
% 0.45/0.63 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_7) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_23,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk2_0,sk3_esk3_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_13]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_34,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk2_0,sk3_esk3_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_23]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_37,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk2_0,sk3_esk3_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_34]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_40,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk2_0,sk3_esk3_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_37]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_81,negated_conjecture,
% 0.45/0.63 ( in(sk3_esk1_0,cartesian_product2(sk3_esk2_0,sk3_esk3_0)) ),
% 0.45/0.63 inference(copy,[status(esa)],[c_40]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_87,plain,
% 0.45/0.63 ( ~ in(cartesian_product2(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0) ),
% 0.45/0.63 inference(resolution,[status(thm)],[c_81,c_65]) ).
% 0.45/0.63
% 0.45/0.63 cnf(c_88,plain,
% 0.45/0.63 ( ~ in(cartesian_product2(sk3_esk2_0,sk3_esk3_0),sk3_esk1_0) ),
% 0.45/0.63 inference(rewriting,[status(thm)],[c_87]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_12,negated_conjecture,
% 0.45/0.64 ( ~ in(sk3_esk1_0,cartesian_product2(set_intersection2(sk3_esk2_0,sk3_esk4_0),set_intersection2(sk3_esk3_0,sk3_esk5_0))) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_6) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_21,negated_conjecture,
% 0.45/0.64 ( ~ in(sk3_esk1_0,cartesian_product2(set_intersection2(sk3_esk2_0,sk3_esk4_0),set_intersection2(sk3_esk3_0,sk3_esk5_0))) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_12]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_33,negated_conjecture,
% 0.45/0.64 ( ~ in(sk3_esk1_0,cartesian_product2(set_intersection2(sk3_esk2_0,sk3_esk4_0),set_intersection2(sk3_esk3_0,sk3_esk5_0))) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_21]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_38,negated_conjecture,
% 0.45/0.64 ( ~ in(sk3_esk1_0,cartesian_product2(set_intersection2(sk3_esk2_0,sk3_esk4_0),set_intersection2(sk3_esk3_0,sk3_esk5_0))) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_33]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_39,negated_conjecture,
% 0.45/0.64 ( ~ in(sk3_esk1_0,cartesian_product2(set_intersection2(sk3_esk2_0,sk3_esk4_0),set_intersection2(sk3_esk3_0,sk3_esk5_0))) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_38]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_79,negated_conjecture,
% 0.45/0.64 ( ~ in(sk3_esk1_0,cartesian_product2(set_intersection2(sk3_esk2_0,sk3_esk4_0),set_intersection2(sk3_esk3_0,sk3_esk5_0))) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_39]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_11,plain,
% 0.45/0.64 ( ~ in(sk1_esk1_3(X0,X1,X2),X0)
% 0.45/0.64 | ~ in(sk1_esk1_3(X0,X1,X2),X2)
% 0.45/0.64 | ~ in(sk1_esk1_3(X0,X1,X2),X1)
% 0.45/0.64 | X0 = set_intersection2(X2,X1) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_28_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_77,plain,
% 0.45/0.64 ( ~ in(sk1_esk1_3(X0,X1,X2),X0)
% 0.45/0.64 | ~ in(sk1_esk1_3(X0,X1,X2),X2)
% 0.45/0.64 | ~ in(sk1_esk1_3(X0,X1,X2),X1)
% 0.45/0.64 | X0 = set_intersection2(X2,X1) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_11]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_10,plain,
% 0.45/0.64 ( in(sk1_esk1_3(X0,X1,X2),X2)
% 0.45/0.64 | in(sk1_esk1_3(X0,X1,X2),X0)
% 0.45/0.64 | X0 = set_intersection2(X2,X1) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_29_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_75,plain,
% 0.45/0.64 ( in(sk1_esk1_3(X0,X1,X2),X2)
% 0.45/0.64 | in(sk1_esk1_3(X0,X1,X2),X0)
% 0.45/0.64 | X0 = set_intersection2(X2,X1) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_10]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_9,plain,
% 0.45/0.64 ( in(sk1_esk1_3(X0,X1,X2),X1)
% 0.45/0.64 | in(sk1_esk1_3(X0,X1,X2),X0)
% 0.45/0.64 | X0 = set_intersection2(X2,X1) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_30_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_73,plain,
% 0.45/0.64 ( in(sk1_esk1_3(X0,X1,X2),X1)
% 0.45/0.64 | in(sk1_esk1_3(X0,X1,X2),X0)
% 0.45/0.64 | X0 = set_intersection2(X2,X1) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_9]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_8,plain,
% 0.45/0.64 ( ~ in(X0,X1)
% 0.45/0.64 | ~ in(X0,X2)
% 0.45/0.64 | in(X0,X3)
% 0.45/0.64 | X3 != set_intersection2(X1,X2) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_32_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_71,plain,
% 0.45/0.64 ( ~ in(X0,X1)
% 0.45/0.64 | ~ in(X0,X2)
% 0.45/0.64 | in(X0,X3)
% 0.45/0.64 | X3 != set_intersection2(X1,X2) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_8]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_7,plain,
% 0.45/0.64 ( ~ in(X0,X1) | in(X0,X2) | X1 != set_intersection2(X2,X3) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_33_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_69,plain,
% 0.45/0.64 ( ~ in(X0,X1) | in(X0,X2) | X1 != set_intersection2(X2,X3) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_7]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_6,plain,
% 0.45/0.64 ( ~ in(X0,X1) | in(X0,X2) | X1 != set_intersection2(X3,X2) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_34_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_67,plain,
% 0.45/0.64 ( ~ in(X0,X1) | in(X0,X2) | X1 != set_intersection2(X3,X2) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_6]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_3,plain,
% 0.45/0.64 ( set_intersection2(X0,X1) = set_intersection2(X1,X0) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_36_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_62,plain,
% 0.45/0.64 ( set_intersection2(X0,X1) = set_intersection2(X1,X0) ),
% 0.45/0.64 inference(copy,[status(esa)],[c_3]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_1,plain,
% 0.45/0.64 ( empty(sk2_esk2_0) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_9_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_59,plain,( empty(sk2_esk2_0) ),inference(copy,[status(esa)],[c_1]) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_0,plain,
% 0.45/0.64 ( ~ empty(sk2_esk1_0) ),
% 0.45/0.64 file('/export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p', c_0_8_0) ).
% 0.45/0.64
% 0.45/0.64 cnf(c_57,plain,( ~ empty(sk2_esk1_0) ),inference(copy,[status(esa)],[c_0]) ).
% 0.45/0.64
% 0.45/0.64
% 0.45/0.64
% 0.45/0.64 % ------ Statistics
% 0.45/0.64
% 0.45/0.64 % ------ General
% 0.45/0.64
% 0.45/0.64 % num_of_input_clauses: 15
% 0.45/0.64 % num_of_input_neg_conjectures: 3
% 0.45/0.64 % num_of_splits: 0
% 0.45/0.64 % num_of_split_atoms: 0
% 0.45/0.64 % num_of_sem_filtered_clauses: 0
% 0.45/0.64 % num_of_subtypes: 0
% 0.45/0.64 % monotx_restored_types: 0
% 0.45/0.64 % sat_num_of_epr_types: 0
% 0.45/0.64 % sat_num_of_non_cyclic_types: 0
% 0.45/0.64 % sat_guarded_non_collapsed_types: 0
% 0.45/0.64 % is_epr: 0
% 0.45/0.64 % is_horn: 0
% 0.45/0.64 % has_eq: 1
% 0.45/0.64 % num_pure_diseq_elim: 0
% 0.45/0.64 % simp_replaced_by: 0
% 0.45/0.64 % res_preprocessed: 6
% 0.45/0.64 % prep_upred: 0
% 0.45/0.64 % prep_unflattend: 0
% 0.45/0.64 % pred_elim_cands: 0
% 0.45/0.64 % pred_elim: 0
% 0.45/0.64 % pred_elim_cl: 0
% 0.45/0.64 % pred_elim_cycles: 0
% 0.45/0.64 % forced_gc_time: 0
% 0.45/0.64 % gc_basic_clause_elim: 0
% 0.45/0.64 % parsing_time: 0.
% 0.45/0.64 % sem_filter_time: 0.
% 0.45/0.64 % pred_elim_time: 0.
% 0.45/0.64 % out_proof_time: 0.
% 0.45/0.64 % monotx_time: 0.
% 0.45/0.64 % subtype_inf_time: 0.
% 0.45/0.64 % unif_index_cands_time: 0.
% 0.45/0.64 % unif_index_add_time: 0.
% 0.45/0.64 % total_time: 0.231
% 0.45/0.64 % num_of_symbols: 37
% 0.45/0.64 % num_of_terms: 108
% 0.45/0.64
% 0.45/0.64 % ------ Propositional Solver
% 0.45/0.64
% 0.45/0.64 % prop_solver_calls: 1
% 0.45/0.64 % prop_fast_solver_calls: 9
% 0.45/0.64 % prop_num_of_clauses: 21
% 0.45/0.64 % prop_preprocess_simplified: 53
% 0.45/0.64 % prop_fo_subsumed: 0
% 0.45/0.64 % prop_solver_time: 0.
% 0.45/0.64 % prop_fast_solver_time: 0.
% 0.45/0.64 % prop_unsat_core_time: 0.
% 0.45/0.64
% 0.45/0.64 % ------ QBF
% 0.45/0.64
% 0.45/0.64 % qbf_q_res: 0
% 0.45/0.64 % qbf_num_tautologies: 0
% 0.45/0.64 % qbf_prep_cycles: 0
% 0.45/0.64
% 0.45/0.64 % ------ BMC1
% 0.45/0.64
% 0.45/0.64 % bmc1_current_bound: -1
% 0.45/0.64 % bmc1_last_solved_bound: -1
% 0.45/0.64 % bmc1_unsat_core_size: -1
% 0.45/0.64 % bmc1_unsat_core_parents_size: -1
% 0.45/0.64 % bmc1_merge_next_fun: 0
% 0.45/0.64 % bmc1_unsat_core_clauses_time: 0.
% 0.45/0.64
% 0.45/0.64 % ------ Instantiation
% 0.45/0.64
% 0.45/0.64 % inst_num_of_clauses: 15
% 0.45/0.64 % inst_num_in_passive: 0
% 0.45/0.64 % inst_num_in_active: 0
% 0.45/0.64 % inst_num_in_unprocessed: 15
% 0.45/0.64 % inst_num_of_loops: 0
% 0.45/0.64 % inst_num_of_learning_restarts: 0
% 0.45/0.64 % inst_num_moves_active_passive: 0
% 0.45/0.64 % inst_lit_activity: 0
% 0.45/0.64 % inst_lit_activity_moves: 0
% 0.45/0.64 % inst_num_tautologies: 0
% 0.45/0.64 % inst_num_prop_implied: 0
% 0.45/0.64 % inst_num_existing_simplified: 0
% 0.45/0.64 % inst_num_eq_res_simplified: 0
% 0.45/0.64 % inst_num_child_elim: 0
% 0.45/0.64 % inst_num_of_dismatching_blockings: 0
% 0.45/0.64 % inst_num_of_non_proper_insts: 0
% 0.45/0.64 % inst_num_of_duplicates: 0
% 0.45/0.64 % inst_inst_num_from_inst_to_res: 0
% 0.45/0.64 % inst_dismatching_checking_time: 0.
% 0.45/0.64
% 0.45/0.64 % ------ Resolution
% 0.45/0.64
% 0.45/0.64 % res_num_of_clauses: 17
% 0.45/0.64 % res_num_in_passive: 0
% 0.45/0.64 % res_num_in_active: 15
% 0.45/0.64 % res_num_of_loops: 6
% 0.45/0.64 % res_forward_subset_subsumed: 0
% 0.45/0.64 % res_backward_subset_subsumed: 0
% 0.45/0.64 % res_forward_subsumed: 0
% 0.45/0.64 % res_backward_subsumed: 0
% 0.45/0.64 % res_forward_subsumption_resolution: 0
% 0.45/0.64 % res_backward_subsumption_resolution: 0
% 0.45/0.64 % res_clause_to_clause_subsumption: 4
% 0.45/0.64 % res_orphan_elimination: 0
% 0.45/0.64 % res_tautology_del: 0
% 0.45/0.64 % res_num_eq_res_simplified: 0
% 0.45/0.64 % res_num_sel_changes: 0
% 0.45/0.64 % res_moves_from_active_to_pass: 0
% 0.45/0.64
% 0.45/0.64 % Status Unknown
% 0.45/0.68 % Orienting using strategy ClausalAll
% 0.45/0.68 % FOF problem with conjecture
% 0.45/0.68 % 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_22e567.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_8089ec.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_0f5231 | grep -v "SZS"
% 0.45/0.70
% 0.45/0.70 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.45/0.70
% 0.45/0.70 %
% 0.45/0.70 % ------ iProver source info
% 0.45/0.70
% 0.45/0.70 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.45/0.70 % git: non_committed_changes: true
% 0.45/0.70 % git: last_make_outside_of_git: true
% 0.45/0.70
% 0.45/0.70 %
% 0.45/0.70 % ------ Input Options
% 0.45/0.70
% 0.45/0.70 % --out_options all
% 0.45/0.70 % --tptp_safe_out true
% 0.45/0.70 % --problem_path ""
% 0.45/0.70 % --include_path ""
% 0.45/0.70 % --clausifier .//eprover
% 0.45/0.70 % --clausifier_options --tstp-format
% 0.45/0.70 % --stdin false
% 0.45/0.70 % --dbg_backtrace false
% 0.45/0.70 % --dbg_dump_prop_clauses false
% 0.45/0.70 % --dbg_dump_prop_clauses_file -
% 0.45/0.70 % --dbg_out_stat false
% 0.45/0.70
% 0.45/0.70 % ------ General Options
% 0.45/0.70
% 0.45/0.70 % --fof false
% 0.45/0.70 % --time_out_real 150.
% 0.45/0.70 % --time_out_prep_mult 0.2
% 0.45/0.70 % --time_out_virtual -1.
% 0.45/0.70 % --schedule none
% 0.45/0.70 % --ground_splitting input
% 0.45/0.70 % --splitting_nvd 16
% 0.45/0.70 % --non_eq_to_eq false
% 0.45/0.70 % --prep_gs_sim true
% 0.45/0.70 % --prep_unflatten false
% 0.45/0.70 % --prep_res_sim true
% 0.45/0.70 % --prep_upred true
% 0.45/0.70 % --res_sim_input true
% 0.45/0.70 % --clause_weak_htbl true
% 0.45/0.70 % --gc_record_bc_elim false
% 0.45/0.70 % --symbol_type_check false
% 0.45/0.70 % --clausify_out false
% 0.45/0.70 % --large_theory_mode false
% 0.45/0.70 % --prep_sem_filter none
% 0.45/0.70 % --prep_sem_filter_out false
% 0.45/0.70 % --preprocessed_out false
% 0.45/0.70 % --sub_typing false
% 0.45/0.70 % --brand_transform false
% 0.45/0.70 % --pure_diseq_elim true
% 0.45/0.70 % --min_unsat_core false
% 0.45/0.70 % --pred_elim true
% 0.45/0.70 % --add_important_lit false
% 0.45/0.70 % --soft_assumptions false
% 0.45/0.70 % --reset_solvers false
% 0.45/0.70 % --bc_imp_inh []
% 0.45/0.70 % --conj_cone_tolerance 1.5
% 0.45/0.70 % --prolific_symb_bound 500
% 0.45/0.70 % --lt_threshold 2000
% 0.45/0.70
% 0.45/0.70 % ------ SAT Options
% 0.45/0.70
% 0.45/0.70 % --sat_mode false
% 0.45/0.70 % --sat_fm_restart_options ""
% 0.45/0.70 % --sat_gr_def false
% 0.45/0.70 % --sat_epr_types true
% 0.45/0.70 % --sat_non_cyclic_types false
% 0.45/0.70 % --sat_finite_models false
% 0.45/0.70 % --sat_fm_lemmas false
% 0.45/0.70 % --sat_fm_prep false
% 0.45/0.70 % --sat_fm_uc_incr true
% 0.45/0.70 % --sat_out_model small
% 0.45/0.70 % --sat_out_clauses false
% 0.45/0.70
% 0.45/0.70 % ------ QBF Options
% 0.45/0.70
% 0.45/0.70 % --qbf_mode false
% 0.45/0.70 % --qbf_elim_univ true
% 0.45/0.70 % --qbf_sk_in true
% 0.45/0.70 % --qbf_pred_elim true
% 0.45/0.70 % --qbf_split 32
% 0.45/0.70
% 0.45/0.70 % ------ BMC1 Options
% 0.45/0.70
% 0.45/0.70 % --bmc1_incremental false
% 0.45/0.70 % --bmc1_axioms reachable_all
% 0.45/0.70 % --bmc1_min_bound 0
% 0.45/0.70 % --bmc1_max_bound -1
% 0.45/0.70 % --bmc1_max_bound_default -1
% 0.45/0.70 % --bmc1_symbol_reachability true
% 0.45/0.70 % --bmc1_property_lemmas false
% 0.45/0.70 % --bmc1_k_induction false
% 0.45/0.70 % --bmc1_non_equiv_states false
% 0.45/0.70 % --bmc1_deadlock false
% 0.45/0.70 % --bmc1_ucm false
% 0.45/0.70 % --bmc1_add_unsat_core none
% 0.45/0.70 % --bmc1_unsat_core_children false
% 0.45/0.70 % --bmc1_unsat_core_extrapolate_axioms false
% 0.45/0.70 % --bmc1_out_stat full
% 0.45/0.70 % --bmc1_ground_init false
% 0.45/0.70 % --bmc1_pre_inst_next_state false
% 0.45/0.70 % --bmc1_pre_inst_state false
% 0.45/0.70 % --bmc1_pre_inst_reach_state false
% 0.45/0.70 % --bmc1_out_unsat_core false
% 0.45/0.70 % --bmc1_aig_witness_out false
% 0.45/0.70 % --bmc1_verbose false
% 0.45/0.70 % --bmc1_dump_clauses_tptp false
% 0.51/0.89 % --bmc1_dump_unsat_core_tptp false
% 0.51/0.89 % --bmc1_dump_file -
% 0.51/0.89 % --bmc1_ucm_expand_uc_limit 128
% 0.51/0.89 % --bmc1_ucm_n_expand_iterations 6
% 0.51/0.89 % --bmc1_ucm_extend_mode 1
% 0.51/0.89 % --bmc1_ucm_init_mode 2
% 0.51/0.89 % --bmc1_ucm_cone_mode none
% 0.51/0.89 % --bmc1_ucm_reduced_relation_type 0
% 0.51/0.89 % --bmc1_ucm_relax_model 4
% 0.51/0.89 % --bmc1_ucm_full_tr_after_sat true
% 0.51/0.89 % --bmc1_ucm_expand_neg_assumptions false
% 0.51/0.89 % --bmc1_ucm_layered_model none
% 0.51/0.89 % --bmc1_ucm_max_lemma_size 10
% 0.51/0.89
% 0.51/0.89 % ------ AIG Options
% 0.51/0.89
% 0.51/0.89 % --aig_mode false
% 0.51/0.89
% 0.51/0.89 % ------ Instantiation Options
% 0.51/0.89
% 0.51/0.89 % --instantiation_flag true
% 0.51/0.89 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.51/0.89 % --inst_solver_per_active 750
% 0.51/0.89 % --inst_solver_calls_frac 0.5
% 0.51/0.89 % --inst_passive_queue_type priority_queues
% 0.51/0.89 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.51/0.89 % --inst_passive_queues_freq [25;2]
% 0.51/0.89 % --inst_dismatching true
% 0.51/0.89 % --inst_eager_unprocessed_to_passive true
% 0.51/0.89 % --inst_prop_sim_given true
% 0.51/0.89 % --inst_prop_sim_new false
% 0.51/0.89 % --inst_orphan_elimination true
% 0.51/0.89 % --inst_learning_loop_flag true
% 0.51/0.89 % --inst_learning_start 3000
% 0.51/0.89 % --inst_learning_factor 2
% 0.51/0.89 % --inst_start_prop_sim_after_learn 3
% 0.51/0.89 % --inst_sel_renew solver
% 0.51/0.89 % --inst_lit_activity_flag true
% 0.51/0.89 % --inst_out_proof true
% 0.51/0.89
% 0.51/0.89 % ------ Resolution Options
% 0.51/0.89
% 0.51/0.89 % --resolution_flag true
% 0.51/0.89 % --res_lit_sel kbo_max
% 0.51/0.89 % --res_to_prop_solver none
% 0.51/0.89 % --res_prop_simpl_new false
% 0.51/0.89 % --res_prop_simpl_given false
% 0.51/0.89 % --res_passive_queue_type priority_queues
% 0.51/0.89 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.51/0.89 % --res_passive_queues_freq [15;5]
% 0.51/0.89 % --res_forward_subs full
% 0.51/0.89 % --res_backward_subs full
% 0.51/0.89 % --res_forward_subs_resolution true
% 0.51/0.89 % --res_backward_subs_resolution true
% 0.51/0.89 % --res_orphan_elimination false
% 0.51/0.89 % --res_time_limit 1000.
% 0.51/0.89 % --res_out_proof true
% 0.51/0.89 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_22e567.s
% 0.51/0.89 % --modulo true
% 0.51/0.89
% 0.51/0.89 % ------ Combination Options
% 0.51/0.89
% 0.51/0.89 % --comb_res_mult 1000
% 0.51/0.89 % --comb_inst_mult 300
% 0.51/0.89 % ------
% 0.51/0.89
% 0.51/0.89 % ------ Parsing...% successful
% 0.51/0.89
% 0.51/0.89 % ------ 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.51/0.89
% 0.51/0.89 % ------ Proving...
% 0.51/0.89 % ------ Problem Properties
% 0.51/0.89
% 0.51/0.89 %
% 0.51/0.89 % EPR false
% 0.51/0.89 % Horn false
% 0.51/0.89 % Has equality true
% 0.51/0.89
% 0.51/0.89 % % ------ Input Options Time Limit: Unbounded
% 0.51/0.89
% 0.51/0.89
% 0.51/0.89 Compiling...
% 0.51/0.89 Loading plugin: done.
% 0.51/0.89 Compiling...
% 0.51/0.89 Loading plugin: done.
% 0.51/0.89 % % ------ Current options:
% 0.51/0.89
% 0.51/0.89 % ------ Input Options
% 0.51/0.89
% 0.51/0.89 % --out_options all
% 0.51/0.89 % --tptp_safe_out true
% 0.51/0.89 % --problem_path ""
% 0.51/0.89 % --include_path ""
% 0.51/0.89 % --clausifier .//eprover
% 0.51/0.89 % --clausifier_options --tstp-format
% 0.51/0.89 % --stdin false
% 0.51/0.89 % --dbg_backtrace false
% 0.51/0.89 % --dbg_dump_prop_clauses false
% 0.51/0.89 % --dbg_dump_prop_clauses_file -
% 0.51/0.89 % --dbg_out_stat false
% 0.51/0.89
% 0.51/0.89 % ------ General Options
% 0.51/0.89
% 0.51/0.89 % --fof false
% 0.51/0.89 % --time_out_real 150.
% 0.51/0.89 % --time_out_prep_mult 0.2
% 0.51/0.89 % --time_out_virtual -1.
% 0.51/0.89 % --schedule none
% 0.51/0.89 % --ground_splitting input
% 0.51/0.89 % --splitting_nvd 16
% 0.51/0.89 % --non_eq_to_eq false
% 0.51/0.89 % --prep_gs_sim true
% 0.51/0.89 % --prep_unflatten false
% 0.51/0.89 % --prep_res_sim true
% 0.51/0.89 % --prep_upred true
% 0.51/0.89 % --res_sim_input true
% 0.51/0.89 % --clause_weak_htbl true
% 0.51/0.89 % --gc_record_bc_elim false
% 0.51/0.89 % --symbol_type_check false
% 0.51/0.89 % --clausify_out false
% 0.51/0.89 % --large_theory_mode false
% 0.51/0.89 % --prep_sem_filter none
% 0.51/0.89 % --prep_sem_filter_out false
% 0.51/0.89 % --preprocessed_out false
% 0.51/0.89 % --sub_typing false
% 0.51/0.89 % --brand_transform false
% 0.51/0.89 % --pure_diseq_elim true
% 0.51/0.89 % --min_unsat_core false
% 0.51/0.89 % --pred_elim true
% 0.51/0.89 % --add_important_lit false
% 0.51/0.89 % --soft_assumptions false
% 0.51/0.89 % --reset_solvers false
% 0.51/0.89 % --bc_imp_inh []
% 0.51/0.89 % --conj_cone_tolerance 1.5
% 0.51/0.89 % --prolific_symb_bound 500
% 0.51/0.89 % --lt_threshold 2000
% 0.51/0.89
% 0.51/0.89 % ------ SAT Options
% 0.51/0.89
% 0.51/0.89 % --sat_mode false
% 0.51/0.89 % --sat_fm_restart_options ""
% 0.51/0.89 % --sat_gr_def false
% 0.51/0.89 % --sat_epr_types true
% 0.51/0.89 % --sat_non_cyclic_types false
% 0.51/0.89 % --sat_finite_models false
% 0.51/0.89 % --sat_fm_lemmas false
% 0.51/0.89 % --sat_fm_prep false
% 0.51/0.89 % --sat_fm_uc_incr true
% 0.51/0.89 % --sat_out_model small
% 0.51/0.89 % --sat_out_clauses false
% 0.51/0.89
% 0.51/0.89 % ------ QBF Options
% 0.51/0.89
% 0.51/0.89 % --qbf_mode false
% 0.51/0.89 % --qbf_elim_univ true
% 0.51/0.89 % --qbf_sk_in true
% 0.51/0.89 % --qbf_pred_elim true
% 0.51/0.89 % --qbf_split 32
% 0.51/0.89
% 0.51/0.89 % ------ BMC1 Options
% 0.51/0.89
% 0.51/0.89 % --bmc1_incremental false
% 0.51/0.89 % --bmc1_axioms reachable_all
% 0.51/0.89 % --bmc1_min_bound 0
% 0.51/0.89 % --bmc1_max_bound -1
% 0.51/0.89 % --bmc1_max_bound_default -1
% 0.51/0.89 % --bmc1_symbol_reachability true
% 0.51/0.89 % --bmc1_property_lemmas false
% 0.51/0.89 % --bmc1_k_induction false
% 0.51/0.89 % --bmc1_non_equiv_states false
% 0.51/0.89 % --bmc1_deadlock false
% 0.51/0.89 % --bmc1_ucm false
% 0.51/0.89 % --bmc1_add_unsat_core none
% 0.51/0.89 % --bmc1_unsat_core_children false
% 0.51/0.89 % --bmc1_unsat_core_extrapolate_axioms false
% 0.51/0.89 % --bmc1_out_stat full
% 0.51/0.89 % --bmc1_ground_init false
% 0.51/0.89 % --bmc1_pre_inst_next_state false
% 0.51/0.89 % --bmc1_pre_inst_state false
% 0.51/0.89 % --bmc1_pre_inst_reach_state false
% 0.51/0.89 % --bmc1_out_unsat_core false
% 0.51/0.89 % --bmc1_aig_witness_out false
% 0.51/0.89 % --bmc1_verbose false
% 0.51/0.89 % --bmc1_dump_clauses_tptp false
% 0.51/0.89 % --bmc1_dump_unsat_core_tptp false
% 0.51/0.89 % --bmc1_dump_file -
% 0.51/0.89 % --bmc1_ucm_expand_uc_limit 128
% 0.51/0.89 % --bmc1_ucm_n_expand_iterations 6
% 0.51/0.89 % --bmc1_ucm_extend_mode 1
% 0.51/0.89 % --bmc1_ucm_init_mode 2
% 0.51/0.89 % --bmc1_ucm_cone_mode none
% 0.51/0.89 % --bmc1_ucm_reduced_relation_type 0
% 0.51/0.89 % --bmc1_ucm_relax_model 4
% 0.51/0.89 % --bmc1_ucm_full_tr_after_sat true
% 0.51/0.89 % --bmc1_ucm_expand_neg_assumptions false
% 0.51/0.89 % --bmc1_ucm_layered_model none
% 0.51/0.89 % --bmc1_ucm_max_lemma_size 10
% 0.51/0.89
% 0.51/0.89 % ------ AIG Options
% 0.51/0.89
% 0.51/0.89 % --aig_mode false
% 0.51/0.89
% 0.51/0.89 % ------ Instantiation Options
% 0.51/0.89
% 0.51/0.89 % --instantiation_flag true
% 0.51/0.89 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.51/0.89 % --inst_solver_per_active 750
% 0.51/0.89 % --inst_solver_calls_frac 0.5
% 0.51/0.89 % --inst_passive_queue_type priority_queues
% 0.51/0.89 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.51/0.89 % --inst_passive_queues_freq [25;2]
% 0.51/0.89 % --inst_dismatching true
% 54.53/54.73 % --inst_eager_unprocessed_to_passive true
% 54.53/54.73 % --inst_prop_sim_given true
% 54.53/54.73 % --inst_prop_sim_new false
% 54.53/54.73 % --inst_orphan_elimination true
% 54.53/54.73 % --inst_learning_loop_flag true
% 54.53/54.73 % --inst_learning_start 3000
% 54.53/54.73 % --inst_learning_factor 2
% 54.53/54.73 % --inst_start_prop_sim_after_learn 3
% 54.53/54.73 % --inst_sel_renew solver
% 54.53/54.73 % --inst_lit_activity_flag true
% 54.53/54.73 % --inst_out_proof true
% 54.53/54.73
% 54.53/54.73 % ------ Resolution Options
% 54.53/54.73
% 54.53/54.73 % --resolution_flag true
% 54.53/54.73 % --res_lit_sel kbo_max
% 54.53/54.73 % --res_to_prop_solver none
% 54.53/54.73 % --res_prop_simpl_new false
% 54.53/54.73 % --res_prop_simpl_given false
% 54.53/54.73 % --res_passive_queue_type priority_queues
% 54.53/54.73 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 54.53/54.73 % --res_passive_queues_freq [15;5]
% 54.53/54.73 % --res_forward_subs full
% 54.53/54.73 % --res_backward_subs full
% 54.53/54.73 % --res_forward_subs_resolution true
% 54.53/54.73 % --res_backward_subs_resolution true
% 54.53/54.73 % --res_orphan_elimination false
% 54.53/54.73 % --res_time_limit 1000.
% 54.53/54.73 % --res_out_proof true
% 54.53/54.73 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_22e567.s
% 54.53/54.73 % --modulo true
% 54.53/54.73
% 54.53/54.73 % ------ Combination Options
% 54.53/54.73
% 54.53/54.73 % --comb_res_mult 1000
% 54.53/54.73 % --comb_inst_mult 300
% 54.53/54.73 % ------
% 54.53/54.73
% 54.53/54.73
% 54.53/54.73
% 54.53/54.73 % ------ Proving...
% 54.53/54.73 %
% 54.53/54.73
% 54.53/54.73
% 54.53/54.73 % ------ Statistics
% 54.53/54.73
% 54.53/54.73 % ------ General
% 54.53/54.73
% 54.53/54.73 % num_of_input_clauses: 30
% 54.53/54.73 % num_of_input_neg_conjectures: 3
% 54.53/54.73 % num_of_splits: 0
% 54.53/54.73 % num_of_split_atoms: 0
% 54.53/54.73 % num_of_sem_filtered_clauses: 0
% 54.53/54.73 % num_of_subtypes: 0
% 54.53/54.73 % monotx_restored_types: 0
% 54.53/54.73 % sat_num_of_epr_types: 0
% 54.53/54.73 % sat_num_of_non_cyclic_types: 0
% 54.53/54.73 % sat_guarded_non_collapsed_types: 0
% 54.53/54.73 % is_epr: 0
% 54.53/54.73 % is_horn: 0
% 54.53/54.73 % has_eq: 1
% 54.53/54.73 % num_pure_diseq_elim: 0
% 54.53/54.73 % simp_replaced_by: 0
% 54.53/54.73 % res_preprocessed: 6
% 54.53/54.73 % prep_upred: 0
% 54.53/54.73 % prep_unflattend: 0
% 54.53/54.73 % pred_elim_cands: 0
% 54.53/54.73 % pred_elim: 0
% 54.53/54.73 % pred_elim_cl: 0
% 54.53/54.73 % pred_elim_cycles: 0
% 54.53/54.73 % forced_gc_time: 0
% 54.53/54.73 % gc_basic_clause_elim: 0
% 54.53/54.73 % parsing_time: 0.001
% 54.53/54.73 % sem_filter_time: 0.
% 54.53/54.73 % pred_elim_time: 0.
% 54.53/54.73 % out_proof_time: 0.
% 54.53/54.73 % monotx_time: 0.
% 54.53/54.73 % subtype_inf_time: 0.
% 54.53/54.73 % unif_index_cands_time: 0.001
% 54.53/54.73 % unif_index_add_time: 0.007
% 54.53/54.73 % total_time: 54.052
% 54.53/54.73 % num_of_symbols: 37
% 54.53/54.73 % num_of_terms: 3210
% 54.53/54.73
% 54.53/54.73 % ------ Propositional Solver
% 54.53/54.73
% 54.53/54.73 % prop_solver_calls: 4
% 54.53/54.73 % prop_fast_solver_calls: 9
% 54.53/54.73 % prop_num_of_clauses: 108
% 54.53/54.73 % prop_preprocess_simplified: 258
% 54.53/54.73 % prop_fo_subsumed: 0
% 54.53/54.73 % prop_solver_time: 0.
% 54.53/54.73 % prop_fast_solver_time: 0.
% 54.53/54.73 % prop_unsat_core_time: 0.
% 54.53/54.73
% 54.53/54.73 % ------ QBF
% 54.53/54.73
% 54.53/54.73 % qbf_q_res: 0
% 54.53/54.73 % qbf_num_tautologies: 0
% 54.53/54.73 % qbf_prep_cycles: 0
% 54.53/54.73
% 54.53/54.73 % ------ BMC1
% 54.53/54.73
% 54.53/54.73 % bmc1_current_bound: -1
% 54.53/54.73 % bmc1_last_solved_bound: -1
% 54.53/54.73 % bmc1_unsat_core_size: -1
% 54.53/54.73 % bmc1_unsat_core_parents_size: -1
% 54.53/54.73 % bmc1_merge_next_fun: 0
% 54.53/54.73 % bmc1_unsat_core_clauses_time: 0.
% 54.53/54.73
% 54.53/54.73 % ------ Instantiation
% 54.53/54.73
% 54.53/54.73 % inst_num_of_clauses: 88
% 54.53/54.73 % inst_num_in_passive: 25
% 54.53/54.73 % inst_num_in_active: 47
% 54.53/54.73 % inst_num_in_unprocessed: 13
% 54.53/54.73 % inst_num_of_loops: 51
% 54.53/54.73 % inst_num_of_learning_restarts: 0
% 54.53/54.73 % inst_num_moves_active_passive: 0
% 54.53/54.73 % inst_lit_activity: 23
% 54.53/54.73 % inst_lit_activity_moves: 0
% 54.53/54.73 % inst_num_tautologies: 0
% 54.53/54.73 % inst_num_prop_implied: 0
% 54.53/54.73 % inst_num_existing_simplified: 0
% 54.53/54.73 % inst_num_eq_res_simplified: 0
% 54.53/54.73 % inst_num_child_elim: 0
% 54.53/54.73 % inst_num_of_dismatching_blockings: 0
% 54.53/54.73 % inst_num_of_non_proper_insts: 37
% 54.53/54.73 % inst_num_of_duplicates: 70
% 54.53/54.73 % inst_inst_num_from_inst_to_res: 0
% 54.53/54.73 % inst_dismatching_checking_time: 0.
% 54.53/54.73
% 54.53/54.73 % ------ Resolution
% 54.53/54.73
% 54.53/54.73 % res_num_of_clauses: 1035
% 54.53/54.73 % res_num_in_passive: 9
% 54.53/54.73 % res_num_in_active: 1010
% 54.53/54.73 % res_num_of_loops: 1000
% 54.53/54.73 % res_forward_subset_subsumed: 329
% 54.53/54.73 % res_backward_subset_subsumed: 0
% 54.53/54.73 % res_forward_subsumed: 8
% 54.53/54.73 % res_backward_subsumed: 0
% 54.53/54.73 % res_forward_subsumption_resolution: 0
% 54.53/54.73 % res_backward_subsumption_resolution: 0
% 54.53/54.73 % res_clause_to_clause_subsumption: 241709
% 54.53/54.73 % res_orphan_elimination: 0
% 54.53/54.73 % res_tautology_del: 164
% 54.53/54.73 % res_num_eq_res_simplified: 0
% 54.53/54.73 % res_num_sel_changes: 0
% 54.53/54.73 % res_moves_from_active_to_pass: 0
% 54.53/54.73
% 54.53/54.74 % Status Unsatisfiable
% 54.53/54.74 % SZS status Theorem
% 54.53/54.74 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------