TSTP Solution File: SEU123+2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n012.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 10:25:03 EDT 2022
% Result : Theorem 0.21s 0.57s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ),
input ).
fof(t6_boole_0,plain,
! [A] :
( ~ empty(A)
| A = empty_set ),
inference(orientation,[status(thm)],[t6_boole]) ).
fof(symmetry_r1_xboole_0,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ),
input ).
fof(symmetry_r1_xboole_0_0,plain,
! [A,B] :
( ~ disjoint(A,B)
| disjoint(B,A) ),
inference(orientation,[status(thm)],[symmetry_r1_xboole_0]) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
input ).
fof(reflexivity_r1_tarski_0,plain,
! [A] :
( subset(A,A)
| $false ),
inference(orientation,[status(thm)],[reflexivity_r1_tarski]) ).
fof(idempotence_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,A) = A,
input ).
fof(idempotence_k3_xboole_0_0,plain,
! [A] :
( set_intersection2(A,A) = A
| $false ),
inference(orientation,[status(thm)],[idempotence_k3_xboole_0]) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
input ).
fof(fc1_xboole_0_0,plain,
( empty(empty_set)
| $false ),
inference(orientation,[status(thm)],[fc1_xboole_0]) ).
fof(dt_k3_xboole_0,axiom,
$true,
input ).
fof(dt_k3_xboole_0_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_k3_xboole_0]) ).
fof(dt_k1_xboole_0,axiom,
$true,
input ).
fof(dt_k1_xboole_0_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_k1_xboole_0]) ).
fof(d7_xboole_0,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_intersection2(A,B) = empty_set ),
input ).
fof(d7_xboole_0_0,plain,
! [A,B] :
( disjoint(A,B)
| set_intersection2(A,B) != empty_set ),
inference(orientation,[status(thm)],[d7_xboole_0]) ).
fof(d7_xboole_0_1,plain,
! [A,B] :
( ~ disjoint(A,B)
| set_intersection2(A,B) = empty_set ),
inference(orientation,[status(thm)],[d7_xboole_0]) ).
fof(d3_xboole_0,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
input ).
fof(d3_xboole_0_0,plain,
! [A,B,C] :
( C = set_intersection2(A,B)
| ~ ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
inference(orientation,[status(thm)],[d3_xboole_0]) ).
fof(d3_xboole_0_1,plain,
! [A,B,C] :
( C != set_intersection2(A,B)
| ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
inference(orientation,[status(thm)],[d3_xboole_0]) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
input ).
fof(d3_tarski_0,plain,
! [A,B] :
( subset(A,B)
| ~ ! [C] :
( in(C,A)
=> in(C,B) ) ),
inference(orientation,[status(thm)],[d3_tarski]) ).
fof(d3_tarski_1,plain,
! [A,B] :
( ~ subset(A,B)
| ! [C] :
( in(C,A)
=> in(C,B) ) ),
inference(orientation,[status(thm)],[d3_tarski]) ).
fof(d1_xboole_0,axiom,
! [A] :
( A = empty_set
<=> ! [B] : ~ in(B,A) ),
input ).
fof(d1_xboole_0_0,plain,
! [A] :
( A = empty_set
| ~ ! [B] : ~ in(B,A) ),
inference(orientation,[status(thm)],[d1_xboole_0]) ).
fof(d1_xboole_0_1,plain,
! [A] :
( A != empty_set
| ! [B] : ~ in(B,A) ),
inference(orientation,[status(thm)],[d1_xboole_0]) ).
fof(d10_xboole_0,axiom,
! [A,B] :
( A = B
<=> ( subset(A,B)
& subset(B,A) ) ),
input ).
fof(d10_xboole_0_0,plain,
! [A,B] :
( A = B
| ~ ( subset(A,B)
& subset(B,A) ) ),
inference(orientation,[status(thm)],[d10_xboole_0]) ).
fof(d10_xboole_0_1,plain,
! [A,B] :
( A != B
| ( subset(A,B)
& subset(B,A) ) ),
inference(orientation,[status(thm)],[d10_xboole_0]) ).
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
input ).
fof(commutativity_k3_xboole_0_0,plain,
! [A,B] :
( set_intersection2(A,B) = set_intersection2(B,A)
| $false ),
inference(orientation,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
input ).
fof(antisymmetry_r2_hidden_0,plain,
! [A,B] :
( ~ in(A,B)
| ~ in(B,A) ),
inference(orientation,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(def_lhs_atom1,axiom,
! [B,A] :
( lhs_atom1(B,A)
<=> ~ in(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [A,B] :
( lhs_atom1(B,A)
| ~ in(B,A) ),
inference(fold_definition,[status(thm)],[antisymmetry_r2_hidden_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [B,A] :
( lhs_atom2(B,A)
<=> set_intersection2(A,B) = set_intersection2(B,A) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [A,B] :
( lhs_atom2(B,A)
| $false ),
inference(fold_definition,[status(thm)],[commutativity_k3_xboole_0_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [B,A] :
( lhs_atom3(B,A)
<=> A != B ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [A,B] :
( lhs_atom3(B,A)
| ( subset(A,B)
& subset(B,A) ) ),
inference(fold_definition,[status(thm)],[d10_xboole_0_1,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [B,A] :
( lhs_atom4(B,A)
<=> A = B ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [A,B] :
( lhs_atom4(B,A)
| ~ ( subset(A,B)
& subset(B,A) ) ),
inference(fold_definition,[status(thm)],[d10_xboole_0_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [A] :
( lhs_atom5(A)
<=> A != empty_set ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [A] :
( lhs_atom5(A)
| ! [B] : ~ in(B,A) ),
inference(fold_definition,[status(thm)],[d1_xboole_0_1,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [A] :
( lhs_atom6(A)
<=> A = empty_set ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [A] :
( lhs_atom6(A)
| ~ ! [B] : ~ in(B,A) ),
inference(fold_definition,[status(thm)],[d1_xboole_0_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [B,A] :
( lhs_atom7(B,A)
<=> ~ subset(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [A,B] :
( lhs_atom7(B,A)
| ! [C] :
( in(C,A)
=> in(C,B) ) ),
inference(fold_definition,[status(thm)],[d3_tarski_1,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [B,A] :
( lhs_atom8(B,A)
<=> subset(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
! [A,B] :
( lhs_atom8(B,A)
| ~ ! [C] :
( in(C,A)
=> in(C,B) ) ),
inference(fold_definition,[status(thm)],[d3_tarski_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [C,B,A] :
( lhs_atom9(C,B,A)
<=> C != set_intersection2(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
! [A,B,C] :
( lhs_atom9(C,B,A)
| ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
inference(fold_definition,[status(thm)],[d3_xboole_0_1,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [C,B,A] :
( lhs_atom10(C,B,A)
<=> C = set_intersection2(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
! [A,B,C] :
( lhs_atom10(C,B,A)
| ~ ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
inference(fold_definition,[status(thm)],[d3_xboole_0_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [B,A] :
( lhs_atom11(B,A)
<=> ~ disjoint(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
! [A,B] :
( lhs_atom11(B,A)
| set_intersection2(A,B) = empty_set ),
inference(fold_definition,[status(thm)],[d7_xboole_0_1,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
! [B,A] :
( lhs_atom12(B,A)
<=> disjoint(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
! [A,B] :
( lhs_atom12(B,A)
| set_intersection2(A,B) != empty_set ),
inference(fold_definition,[status(thm)],[d7_xboole_0_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
( lhs_atom13
<=> $true ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
( lhs_atom13
| $false ),
inference(fold_definition,[status(thm)],[dt_k1_xboole_0_0,def_lhs_atom13]) ).
fof(to_be_clausified_13,plain,
( lhs_atom13
| $false ),
inference(fold_definition,[status(thm)],[dt_k3_xboole_0_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
( lhs_atom14
<=> empty(empty_set) ),
inference(definition,[],]) ).
fof(to_be_clausified_14,plain,
( lhs_atom14
| $false ),
inference(fold_definition,[status(thm)],[fc1_xboole_0_0,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
! [A] :
( lhs_atom15(A)
<=> set_intersection2(A,A) = A ),
inference(definition,[],]) ).
fof(to_be_clausified_15,plain,
! [A] :
( lhs_atom15(A)
| $false ),
inference(fold_definition,[status(thm)],[idempotence_k3_xboole_0_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
! [A] :
( lhs_atom16(A)
<=> subset(A,A) ),
inference(definition,[],]) ).
fof(to_be_clausified_16,plain,
! [A] :
( lhs_atom16(A)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_r1_tarski_0,def_lhs_atom16]) ).
fof(to_be_clausified_17,plain,
! [A,B] :
( lhs_atom11(B,A)
| disjoint(B,A) ),
inference(fold_definition,[status(thm)],[symmetry_r1_xboole_0_0,def_lhs_atom11]) ).
fof(def_lhs_atom17,axiom,
! [A] :
( lhs_atom17(A)
<=> ~ empty(A) ),
inference(definition,[],]) ).
fof(to_be_clausified_18,plain,
! [A] :
( lhs_atom17(A)
| A = empty_set ),
inference(fold_definition,[status(thm)],[t6_boole_0,def_lhs_atom17]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X1,X2] :
( lhs_atom10(X3,X1,X2)
| ~ ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_1,axiom,
! [X3,X1,X2] :
( lhs_atom9(X3,X1,X2)
| ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_2,axiom,
! [X1,X2] :
( lhs_atom8(X1,X2)
| ~ ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_3,axiom,
! [X1,X2] :
( lhs_atom4(X1,X2)
| ~ ( subset(X2,X1)
& subset(X1,X2) ) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_4,axiom,
! [X1,X2] :
( lhs_atom7(X1,X2)
| ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_5,axiom,
! [X1,X2] :
( lhs_atom12(X1,X2)
| set_intersection2(X2,X1) != empty_set ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_6,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_7,axiom,
! [X1,X2] :
( lhs_atom11(X1,X2)
| disjoint(X1,X2) ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_8,axiom,
! [X1,X2] :
( lhs_atom11(X1,X2)
| set_intersection2(X2,X1) = empty_set ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_9,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| ( subset(X2,X1)
& subset(X1,X2) ) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_10,axiom,
! [X2] :
( lhs_atom5(X2)
| ! [X1] : ~ in(X1,X2) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_11,axiom,
! [X2] :
( lhs_atom6(X2)
| ~ ! [X1] : ~ in(X1,X2) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_12,axiom,
! [X1,X2] :
( lhs_atom2(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_13,axiom,
! [X2] :
( lhs_atom17(X2)
| X2 = empty_set ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_14,axiom,
! [X2] :
( lhs_atom16(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_15,axiom,
! [X2] :
( lhs_atom15(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_16,axiom,
( lhs_atom14
| ~ $true ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_17,axiom,
( lhs_atom13
| ~ $true ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_18,axiom,
( lhs_atom13
| ~ $true ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_19,axiom,
! [X3,X1,X2] :
( lhs_atom10(X3,X1,X2)
| ~ ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
c_0_0 ).
fof(c_0_20,axiom,
! [X3,X1,X2] :
( lhs_atom9(X3,X1,X2)
| ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
c_0_1 ).
fof(c_0_21,axiom,
! [X1,X2] :
( lhs_atom8(X1,X2)
| ~ ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
c_0_2 ).
fof(c_0_22,axiom,
! [X1,X2] :
( lhs_atom4(X1,X2)
| ~ ( subset(X2,X1)
& subset(X1,X2) ) ),
c_0_3 ).
fof(c_0_23,axiom,
! [X1,X2] :
( lhs_atom7(X1,X2)
| ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
c_0_4 ).
fof(c_0_24,plain,
! [X1,X2] :
( lhs_atom12(X1,X2)
| set_intersection2(X2,X1) != empty_set ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_25,plain,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_26,axiom,
! [X1,X2] :
( lhs_atom11(X1,X2)
| disjoint(X1,X2) ),
c_0_7 ).
fof(c_0_27,axiom,
! [X1,X2] :
( lhs_atom11(X1,X2)
| set_intersection2(X2,X1) = empty_set ),
c_0_8 ).
fof(c_0_28,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| ( subset(X2,X1)
& subset(X1,X2) ) ),
c_0_9 ).
fof(c_0_29,plain,
! [X2] :
( lhs_atom5(X2)
| ! [X1] : ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
! [X2] :
( lhs_atom6(X2)
| ~ ! [X1] : ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
! [X1,X2] : lhs_atom2(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_32,axiom,
! [X2] :
( lhs_atom17(X2)
| X2 = empty_set ),
c_0_13 ).
fof(c_0_33,plain,
! [X2] : lhs_atom16(X2),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_34,plain,
! [X2] : lhs_atom15(X2),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_35,plain,
lhs_atom14,
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_36,plain,
lhs_atom13,
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_37,plain,
lhs_atom13,
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_38,plain,
! [X5,X6,X7] :
( ( ~ in(esk3_3(X5,X6,X7),X5)
| ~ in(esk3_3(X5,X6,X7),X7)
| ~ in(esk3_3(X5,X6,X7),X6)
| lhs_atom10(X5,X6,X7) )
& ( in(esk3_3(X5,X6,X7),X7)
| in(esk3_3(X5,X6,X7),X5)
| lhs_atom10(X5,X6,X7) )
& ( in(esk3_3(X5,X6,X7),X6)
| in(esk3_3(X5,X6,X7),X5)
| lhs_atom10(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
fof(c_0_39,plain,
! [X5,X6,X7,X8,X9] :
( ( in(X8,X7)
| ~ in(X8,X5)
| lhs_atom9(X5,X6,X7) )
& ( in(X8,X6)
| ~ in(X8,X5)
| lhs_atom9(X5,X6,X7) )
& ( ~ in(X9,X7)
| ~ in(X9,X6)
| in(X9,X5)
| lhs_atom9(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])]) ).
fof(c_0_40,plain,
! [X4,X5] :
( ( in(esk2_2(X4,X5),X5)
| lhs_atom8(X4,X5) )
& ( ~ in(esk2_2(X4,X5),X4)
| lhs_atom8(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_41,plain,
! [X3,X4] :
( lhs_atom4(X3,X4)
| ~ subset(X4,X3)
| ~ subset(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
fof(c_0_42,plain,
! [X4,X5,X6] :
( lhs_atom7(X4,X5)
| ~ in(X6,X5)
| in(X6,X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
fof(c_0_43,plain,
! [X3,X4] :
( lhs_atom12(X3,X4)
| set_intersection2(X4,X3) != empty_set ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_44,plain,
! [X3,X4] :
( lhs_atom1(X3,X4)
| ~ in(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_45,plain,
! [X3,X4] :
( lhs_atom11(X3,X4)
| disjoint(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_46,plain,
! [X3,X4] :
( lhs_atom11(X3,X4)
| set_intersection2(X4,X3) = empty_set ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_47,plain,
! [X3,X4] :
( ( subset(X4,X3)
| lhs_atom3(X3,X4) )
& ( subset(X3,X4)
| lhs_atom3(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
fof(c_0_48,plain,
! [X3,X4] :
( lhs_atom5(X3)
| ~ in(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_29])]) ).
fof(c_0_49,plain,
! [X3] :
( lhs_atom6(X3)
| in(esk1_1(X3),X3) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
fof(c_0_50,plain,
! [X3,X4] : lhs_atom2(X3,X4),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_51,plain,
! [X3] :
( lhs_atom17(X3)
| X3 = empty_set ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_52,plain,
! [X3] : lhs_atom16(X3),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_53,plain,
! [X3] : lhs_atom15(X3),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_54,plain,
lhs_atom14,
c_0_35 ).
fof(c_0_55,plain,
lhs_atom13,
c_0_36 ).
fof(c_0_56,plain,
lhs_atom13,
c_0_37 ).
cnf(c_0_57,plain,
( lhs_atom10(X1,X2,X3)
| ~ in(esk3_3(X1,X2,X3),X2)
| ~ in(esk3_3(X1,X2,X3),X3)
| ~ in(esk3_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_58,plain,
( lhs_atom10(X1,X2,X3)
| in(esk3_3(X1,X2,X3),X1)
| in(esk3_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_59,plain,
( lhs_atom10(X1,X2,X3)
| in(esk3_3(X1,X2,X3),X1)
| in(esk3_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_60,plain,
( lhs_atom9(X1,X2,X3)
| in(X4,X1)
| ~ in(X4,X2)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_61,plain,
( lhs_atom9(X1,X2,X3)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_62,plain,
( lhs_atom9(X1,X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_63,plain,
( lhs_atom8(X1,X2)
| ~ in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_64,plain,
( lhs_atom4(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_65,plain,
( lhs_atom8(X1,X2)
| in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_66,plain,
( in(X1,X2)
| lhs_atom7(X2,X3)
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_67,plain,
( lhs_atom12(X2,X1)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_68,plain,
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_69,plain,
( disjoint(X1,X2)
| lhs_atom11(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_70,plain,
( set_intersection2(X1,X2) = empty_set
| lhs_atom11(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_71,plain,
( lhs_atom3(X1,X2)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_72,plain,
( lhs_atom3(X1,X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_73,plain,
( lhs_atom5(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_74,plain,
( in(esk1_1(X1),X1)
| lhs_atom6(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_75,plain,
lhs_atom2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_76,plain,
( X1 = empty_set
| lhs_atom17(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_77,plain,
lhs_atom16(X1),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_78,plain,
lhs_atom15(X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_79,plain,
lhs_atom14,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_80,plain,
lhs_atom13,
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_81,plain,
lhs_atom13,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_82,plain,
( lhs_atom10(X1,X2,X3)
| ~ in(esk3_3(X1,X2,X3),X2)
| ~ in(esk3_3(X1,X2,X3),X3)
| ~ in(esk3_3(X1,X2,X3),X1) ),
c_0_57,
[final] ).
cnf(c_0_83,plain,
( lhs_atom10(X1,X2,X3)
| in(esk3_3(X1,X2,X3),X1)
| in(esk3_3(X1,X2,X3),X3) ),
c_0_58,
[final] ).
cnf(c_0_84,plain,
( lhs_atom10(X1,X2,X3)
| in(esk3_3(X1,X2,X3),X1)
| in(esk3_3(X1,X2,X3),X2) ),
c_0_59,
[final] ).
cnf(c_0_85,plain,
( lhs_atom9(X1,X2,X3)
| in(X4,X1)
| ~ in(X4,X2)
| ~ in(X4,X3) ),
c_0_60,
[final] ).
cnf(c_0_86,plain,
( lhs_atom9(X1,X2,X3)
| in(X4,X3)
| ~ in(X4,X1) ),
c_0_61,
[final] ).
cnf(c_0_87,plain,
( lhs_atom9(X1,X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
c_0_62,
[final] ).
cnf(c_0_88,plain,
( lhs_atom8(X1,X2)
| ~ in(esk2_2(X1,X2),X1) ),
c_0_63,
[final] ).
cnf(c_0_89,plain,
( lhs_atom4(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
c_0_64,
[final] ).
cnf(c_0_90,plain,
( lhs_atom8(X1,X2)
| in(esk2_2(X1,X2),X2) ),
c_0_65,
[final] ).
cnf(c_0_91,plain,
( in(X1,X2)
| lhs_atom7(X2,X3)
| ~ in(X1,X3) ),
c_0_66,
[final] ).
cnf(c_0_92,plain,
( lhs_atom12(X2,X1)
| set_intersection2(X1,X2) != empty_set ),
c_0_67,
[final] ).
cnf(c_0_93,plain,
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
c_0_68,
[final] ).
cnf(c_0_94,plain,
( disjoint(X1,X2)
| lhs_atom11(X1,X2) ),
c_0_69,
[final] ).
cnf(c_0_95,plain,
( set_intersection2(X1,X2) = empty_set
| lhs_atom11(X2,X1) ),
c_0_70,
[final] ).
cnf(c_0_96,plain,
( lhs_atom3(X1,X2)
| subset(X2,X1) ),
c_0_71,
[final] ).
cnf(c_0_97,plain,
( lhs_atom3(X1,X2)
| subset(X1,X2) ),
c_0_72,
[final] ).
cnf(c_0_98,plain,
( lhs_atom5(X2)
| ~ in(X1,X2) ),
c_0_73,
[final] ).
cnf(c_0_99,plain,
( in(esk1_1(X1),X1)
| lhs_atom6(X1) ),
c_0_74,
[final] ).
cnf(c_0_100,plain,
lhs_atom2(X1,X2),
c_0_75,
[final] ).
cnf(c_0_101,plain,
( X1 = empty_set
| lhs_atom17(X1) ),
c_0_76,
[final] ).
cnf(c_0_102,plain,
lhs_atom16(X1),
c_0_77,
[final] ).
cnf(c_0_103,plain,
lhs_atom15(X1),
c_0_78,
[final] ).
cnf(c_0_104,plain,
lhs_atom14,
c_0_79,
[final] ).
cnf(c_0_105,plain,
lhs_atom13,
c_0_80,
[final] ).
cnf(c_0_106,plain,
lhs_atom13,
c_0_81,
[final] ).
% End CNF derivation
cnf(c_0_82_0,axiom,
( X1 = set_intersection2(X3,X2)
| ~ in(sk1_esk3_3(X1,X2,X3),X2)
| ~ in(sk1_esk3_3(X1,X2,X3),X3)
| ~ in(sk1_esk3_3(X1,X2,X3),X1) ),
inference(unfold_definition,[status(thm)],[c_0_82,def_lhs_atom10]) ).
cnf(c_0_83_0,axiom,
( X1 = set_intersection2(X3,X2)
| in(sk1_esk3_3(X1,X2,X3),X1)
| in(sk1_esk3_3(X1,X2,X3),X3) ),
inference(unfold_definition,[status(thm)],[c_0_83,def_lhs_atom10]) ).
cnf(c_0_84_0,axiom,
( X1 = set_intersection2(X3,X2)
| in(sk1_esk3_3(X1,X2,X3),X1)
| in(sk1_esk3_3(X1,X2,X3),X2) ),
inference(unfold_definition,[status(thm)],[c_0_84,def_lhs_atom10]) ).
cnf(c_0_85_0,axiom,
( X1 != set_intersection2(X3,X2)
| in(X4,X1)
| ~ in(X4,X2)
| ~ in(X4,X3) ),
inference(unfold_definition,[status(thm)],[c_0_85,def_lhs_atom9]) ).
cnf(c_0_86_0,axiom,
( X1 != set_intersection2(X3,X2)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(unfold_definition,[status(thm)],[c_0_86,def_lhs_atom9]) ).
cnf(c_0_87_0,axiom,
( X1 != set_intersection2(X3,X2)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(unfold_definition,[status(thm)],[c_0_87,def_lhs_atom9]) ).
cnf(c_0_88_0,axiom,
( subset(X2,X1)
| ~ in(sk1_esk2_2(X1,X2),X1) ),
inference(unfold_definition,[status(thm)],[c_0_88,def_lhs_atom8]) ).
cnf(c_0_89_0,axiom,
( X2 = X1
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_89,def_lhs_atom4]) ).
cnf(c_0_90_0,axiom,
( subset(X2,X1)
| in(sk1_esk2_2(X1,X2),X2) ),
inference(unfold_definition,[status(thm)],[c_0_90,def_lhs_atom8]) ).
cnf(c_0_91_0,axiom,
( ~ subset(X3,X2)
| in(X1,X2)
| ~ in(X1,X3) ),
inference(unfold_definition,[status(thm)],[c_0_91,def_lhs_atom7]) ).
cnf(c_0_92_0,axiom,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(unfold_definition,[status(thm)],[c_0_92,def_lhs_atom12]) ).
cnf(c_0_93_0,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_93,def_lhs_atom1]) ).
cnf(c_0_94_0,axiom,
( ~ disjoint(X2,X1)
| disjoint(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_94,def_lhs_atom11]) ).
cnf(c_0_95_0,axiom,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(unfold_definition,[status(thm)],[c_0_95,def_lhs_atom11]) ).
cnf(c_0_96_0,axiom,
( X2 != X1
| subset(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_96,def_lhs_atom3]) ).
cnf(c_0_97_0,axiom,
( X2 != X1
| subset(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_97,def_lhs_atom3]) ).
cnf(c_0_98_0,axiom,
( X2 != empty_set
| ~ in(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_98,def_lhs_atom5]) ).
cnf(c_0_99_0,axiom,
( X1 = empty_set
| in(sk1_esk1_1(X1),X1) ),
inference(unfold_definition,[status(thm)],[c_0_99,def_lhs_atom6]) ).
cnf(c_0_101_0,axiom,
( ~ empty(X1)
| X1 = empty_set ),
inference(unfold_definition,[status(thm)],[c_0_101,def_lhs_atom17]) ).
cnf(c_0_100_0,axiom,
set_intersection2(X2,X1) = set_intersection2(X1,X2),
inference(unfold_definition,[status(thm)],[c_0_100,def_lhs_atom2]) ).
cnf(c_0_102_0,axiom,
subset(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_102,def_lhs_atom16]) ).
cnf(c_0_103_0,axiom,
set_intersection2(X1,X1) = X1,
inference(unfold_definition,[status(thm)],[c_0_103,def_lhs_atom15]) ).
cnf(c_0_104_0,axiom,
empty(empty_set),
inference(unfold_definition,[status(thm)],[c_0_104,def_lhs_atom14]) ).
cnf(c_0_105_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_105,def_lhs_atom13]) ).
cnf(c_0_106_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_106,def_lhs_atom13]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('<stdin>',t7_boole) ).
fof(c_0_1_002,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('<stdin>',t8_boole) ).
fof(c_0_2_003,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_3_004,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_4_005,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
c_0_0 ).
fof(c_0_5_006,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
c_0_1 ).
fof(c_0_6_007,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_7_008,axiom,
? [X1] : empty(X1),
c_0_3 ).
fof(c_0_8_009,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_9_010,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_10_011,plain,
~ empty(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_11_012,plain,
empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
cnf(c_0_12_013,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_014,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14_015,plain,
~ empty(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15_016,plain,
empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16_017,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
c_0_12,
[final] ).
cnf(c_0_17_018,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
c_0_13,
[final] ).
cnf(c_0_18_019,plain,
~ empty(esk1_0),
c_0_14,
[final] ).
cnf(c_0_19_020,plain,
empty(esk2_0),
c_0_15,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_16_0,axiom,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).
cnf(c_0_16_1,axiom,
( ~ in(X2,X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).
cnf(c_0_17_0,axiom,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).
cnf(c_0_17_1,axiom,
( ~ empty(X1)
| X2 = X1
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).
cnf(c_0_17_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| X2 = X1 ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).
cnf(c_0_18_0,axiom,
~ empty(sk2_esk1_0),
inference(literals_permutation,[status(thm)],[c_0_18]) ).
cnf(c_0_19_0,axiom,
empty(sk2_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_19]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_021,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('<stdin>',t4_xboole_0) ).
fof(c_0_1_022,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('<stdin>',t3_xboole_0) ).
fof(c_0_2_023,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('<stdin>',t1_xboole_1) ).
fof(c_0_3_024,lemma,
! [X1] : subset(empty_set,X1),
file('<stdin>',t2_xboole_1) ).
fof(c_0_4_025,conjecture,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('<stdin>',t3_xboole_1) ).
fof(c_0_5_026,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_6_027,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_7_028,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
c_0_2 ).
fof(c_0_8_029,lemma,
! [X1] : subset(empty_set,X1),
c_0_3 ).
fof(c_0_9_030,negated_conjecture,
~ ! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[c_0_4]) ).
fof(c_0_10_031,lemma,
! [X4,X5,X7,X8,X9] :
( ( disjoint(X4,X5)
| in(esk3_2(X4,X5),set_intersection2(X4,X5)) )
& ( ~ in(X9,set_intersection2(X7,X8))
| ~ disjoint(X7,X8) ) ),
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_5])])])])]) ).
fof(c_0_11_032,lemma,
! [X4,X5,X7,X8,X9] :
( ( in(esk1_2(X4,X5),X4)
| disjoint(X4,X5) )
& ( in(esk1_2(X4,X5),X5)
| disjoint(X4,X5) )
& ( ~ in(X9,X7)
| ~ in(X9,X8)
| ~ disjoint(X7,X8) ) ),
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_6])])])])])]) ).
fof(c_0_12_033,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_13_034,lemma,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_14_035,negated_conjecture,
( subset(esk2_0,empty_set)
& esk2_0 != empty_set ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_15_036,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16_037,lemma,
( in(esk3_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17_038,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18_039,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19_040,lemma,
( disjoint(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20_041,lemma,
( disjoint(X1,X2)
| in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21_042,lemma,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22_043,negated_conjecture,
subset(esk2_0,empty_set),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23_044,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24_045,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
c_0_15,
[final] ).
cnf(c_0_25_046,lemma,
( in(esk3_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
c_0_16,
[final] ).
cnf(c_0_26_047,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
c_0_17,
[final] ).
cnf(c_0_27_048,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
c_0_18,
[final] ).
cnf(c_0_28_049,lemma,
( disjoint(X1,X2)
| in(esk1_2(X1,X2),X1) ),
c_0_19,
[final] ).
cnf(c_0_29_050,lemma,
( disjoint(X1,X2)
| in(esk1_2(X1,X2),X2) ),
c_0_20,
[final] ).
cnf(c_0_30_051,lemma,
subset(empty_set,X1),
c_0_21,
[final] ).
cnf(c_0_31_052,negated_conjecture,
subset(esk2_0,empty_set),
c_0_22,
[final] ).
cnf(c_0_32_053,negated_conjecture,
esk2_0 != empty_set,
c_0_23,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_39,plain,
subset(empty_set,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_07e0f7.p',c_0_30) ).
cnf(c_68,plain,
subset(empty_set,X0),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_85,plain,
subset(empty_set,X0),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_88,plain,
subset(empty_set,X0),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_182,plain,
subset(empty_set,X0),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_301,plain,
subset(empty_set,X0),
inference(copy,[status(esa)],[c_182]) ).
cnf(c_38,negated_conjecture,
sk3_esk2_0 != empty_set,
file('/export/starexec/sandbox/tmp/iprover_modulo_07e0f7.p',c_0_32) ).
cnf(c_70,negated_conjecture,
sk3_esk2_0 != empty_set,
inference(copy,[status(esa)],[c_38]) ).
cnf(c_84,negated_conjecture,
sk3_esk2_0 != empty_set,
inference(copy,[status(esa)],[c_70]) ).
cnf(c_89,negated_conjecture,
sk3_esk2_0 != empty_set,
inference(copy,[status(esa)],[c_84]) ).
cnf(c_181,negated_conjecture,
sk3_esk2_0 != empty_set,
inference(copy,[status(esa)],[c_89]) ).
cnf(c_299,negated_conjecture,
sk3_esk2_0 != empty_set,
inference(copy,[status(esa)],[c_181]) ).
cnf(c_24,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_07e0f7.p',c_0_89_0) ).
cnf(c_273,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_313,plain,
( ~ subset(empty_set,sk3_esk2_0)
| ~ subset(sk3_esk2_0,empty_set) ),
inference(resolution,[status(thm)],[c_299,c_273]) ).
cnf(c_316,plain,
( ~ subset(empty_set,sk3_esk2_0)
| ~ subset(sk3_esk2_0,empty_set) ),
inference(rewriting,[status(thm)],[c_313]) ).
cnf(c_40,negated_conjecture,
subset(sk3_esk2_0,empty_set),
file('/export/starexec/sandbox/tmp/iprover_modulo_07e0f7.p',c_0_31) ).
cnf(c_72,negated_conjecture,
subset(sk3_esk2_0,empty_set),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_86,negated_conjecture,
subset(sk3_esk2_0,empty_set),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_87,negated_conjecture,
subset(sk3_esk2_0,empty_set),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_183,negated_conjecture,
subset(sk3_esk2_0,empty_set),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_303,negated_conjecture,
subset(sk3_esk2_0,empty_set),
inference(copy,[status(esa)],[c_183]) ).
cnf(c_336,plain,
~ subset(empty_set,sk3_esk2_0),
inference(forward_subsumption_resolution,[status(thm)],[c_316,c_303]) ).
cnf(c_337,plain,
~ subset(empty_set,sk3_esk2_0),
inference(rewriting,[status(thm)],[c_336]) ).
cnf(c_361,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_301,c_337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 16:56:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Running in mono-core mode
% 0.21/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.43 % FOF problem with conjecture
% 0.21/0.43 % 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_5a9199.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_07e0f7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_3b8afb | grep -v "SZS"
% 0.21/0.45
% 0.21/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % ------ iProver source info
% 0.21/0.45
% 0.21/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.45 % git: non_committed_changes: true
% 0.21/0.45 % git: last_make_outside_of_git: true
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % ------ Input Options
% 0.21/0.45
% 0.21/0.45 % --out_options all
% 0.21/0.45 % --tptp_safe_out true
% 0.21/0.45 % --problem_path ""
% 0.21/0.45 % --include_path ""
% 0.21/0.45 % --clausifier .//eprover
% 0.21/0.45 % --clausifier_options --tstp-format
% 0.21/0.45 % --stdin false
% 0.21/0.45 % --dbg_backtrace false
% 0.21/0.45 % --dbg_dump_prop_clauses false
% 0.21/0.45 % --dbg_dump_prop_clauses_file -
% 0.21/0.45 % --dbg_out_stat false
% 0.21/0.45
% 0.21/0.45 % ------ General Options
% 0.21/0.45
% 0.21/0.45 % --fof false
% 0.21/0.45 % --time_out_real 150.
% 0.21/0.45 % --time_out_prep_mult 0.2
% 0.21/0.45 % --time_out_virtual -1.
% 0.21/0.45 % --schedule none
% 0.21/0.45 % --ground_splitting input
% 0.21/0.45 % --splitting_nvd 16
% 0.21/0.45 % --non_eq_to_eq false
% 0.21/0.45 % --prep_gs_sim true
% 0.21/0.45 % --prep_unflatten false
% 0.21/0.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.56 % --bmc1_dump_file -
% 0.21/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.56 % --bmc1_ucm_extend_mode 1
% 0.21/0.56 % --bmc1_ucm_init_mode 2
% 0.21/0.56 % --bmc1_ucm_cone_mode none
% 0.21/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.56 % --bmc1_ucm_relax_model 4
% 0.21/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.56 % --bmc1_ucm_layered_model none
% 0.21/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.56
% 0.21/0.56 % ------ AIG Options
% 0.21/0.56
% 0.21/0.56 % --aig_mode false
% 0.21/0.56
% 0.21/0.56 % ------ Instantiation Options
% 0.21/0.56
% 0.21/0.56 % --instantiation_flag true
% 0.21/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.56 % --inst_solver_per_active 750
% 0.21/0.56 % --inst_solver_calls_frac 0.5
% 0.21/0.56 % --inst_passive_queue_type priority_queues
% 0.21/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.56 % --inst_passive_queues_freq [25;2]
% 0.21/0.56 % --inst_dismatching true
% 0.21/0.56 % --inst_eager_unprocessed_to_passive true
% 0.21/0.56 % --inst_prop_sim_given true
% 0.21/0.56 % --inst_prop_sim_new false
% 0.21/0.56 % --inst_orphan_elimination true
% 0.21/0.56 % --inst_learning_loop_flag true
% 0.21/0.56 % --inst_learning_start 3000
% 0.21/0.56 % --inst_learning_factor 2
% 0.21/0.56 % --inst_start_prop_sim_after_learn 3
% 0.21/0.56 % --inst_sel_renew solver
% 0.21/0.56 % --inst_lit_activity_flag true
% 0.21/0.56 % --inst_out_proof true
% 0.21/0.56
% 0.21/0.56 % ------ Resolution Options
% 0.21/0.56
% 0.21/0.56 % --resolution_flag true
% 0.21/0.56 % --res_lit_sel kbo_max
% 0.21/0.56 % --res_to_prop_solver none
% 0.21/0.56 % --res_prop_simpl_new false
% 0.21/0.56 % --res_prop_simpl_given false
% 0.21/0.56 % --res_passive_queue_type priority_queues
% 0.21/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.56 % --res_passive_queues_freq [15;5]
% 0.21/0.56 % --res_forward_subs full
% 0.21/0.56 % --res_backward_subs full
% 0.21/0.56 % --res_forward_subs_resolution true
% 0.21/0.56 % --res_backward_subs_resolution true
% 0.21/0.56 % --res_orphan_elimination false
% 0.21/0.56 % --res_time_limit 1000.
% 0.21/0.56 % --res_out_proof true
% 0.21/0.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5a9199.s
% 0.21/0.56 % --modulo true
% 0.21/0.56
% 0.21/0.56 % ------ Combination Options
% 0.21/0.56
% 0.21/0.56 % --comb_res_mult 1000
% 0.21/0.56 % --comb_inst_mult 300
% 0.21/0.56 % ------
% 0.21/0.56
% 0.21/0.56 % ------ Parsing...% successful
% 0.21/0.56
% 0.21/0.56 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.56
% 0.21/0.56 % ------ Proving...
% 0.21/0.56 % ------ Problem Properties
% 0.21/0.56
% 0.21/0.56 %
% 0.21/0.56 % EPR false
% 0.21/0.56 % Horn false
% 0.21/0.56 % Has equality true
% 0.21/0.56
% 0.21/0.56 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.56
% 0.21/0.56
% 0.21/0.56 Compiling...
% 0.21/0.56 Loading plugin: done.
% 0.21/0.56 % % ------ Current options:
% 0.21/0.56
% 0.21/0.56 % ------ Input Options
% 0.21/0.56
% 0.21/0.56 % --out_options all
% 0.21/0.56 % --tptp_safe_out true
% 0.21/0.56 % --problem_path ""
% 0.21/0.56 % --include_path ""
% 0.21/0.56 % --clausifier .//eprover
% 0.21/0.56 % --clausifier_options --tstp-format
% 0.21/0.56 % --stdin false
% 0.21/0.56 % --dbg_backtrace false
% 0.21/0.56 % --dbg_dump_prop_clauses false
% 0.21/0.56 % --dbg_dump_prop_clauses_file -
% 0.21/0.56 % --dbg_out_stat false
% 0.21/0.56
% 0.21/0.56 % ------ General Options
% 0.21/0.56
% 0.21/0.56 % --fof false
% 0.21/0.56 % --time_out_real 150.
% 0.21/0.56 % --time_out_prep_mult 0.2
% 0.21/0.56 % --time_out_virtual -1.
% 0.21/0.56 % --schedule none
% 0.21/0.56 % --ground_splitting input
% 0.21/0.56 % --splitting_nvd 16
% 0.21/0.56 % --non_eq_to_eq false
% 0.21/0.56 % --prep_gs_sim true
% 0.21/0.56 % --prep_unflatten false
% 0.21/0.56 % --prep_res_sim true
% 0.21/0.56 % --prep_upred true
% 0.21/0.56 % --res_sim_input true
% 0.21/0.56 % --clause_weak_htbl true
% 0.21/0.56 % --gc_record_bc_elim false
% 0.21/0.56 % --symbol_type_check false
% 0.21/0.56 % --clausify_out false
% 0.21/0.56 % --large_theory_mode false
% 0.21/0.56 % --prep_sem_filter none
% 0.21/0.56 % --prep_sem_filter_out false
% 0.21/0.56 % --preprocessed_out false
% 0.21/0.56 % --sub_typing false
% 0.21/0.56 % --brand_transform false
% 0.21/0.56 % --pure_diseq_elim true
% 0.21/0.56 % --min_unsat_core false
% 0.21/0.56 % --pred_elim true
% 0.21/0.56 % --add_important_lit false
% 0.21/0.56 % --soft_assumptions false
% 0.21/0.56 % --reset_solvers false
% 0.21/0.56 % --bc_imp_inh []
% 0.21/0.56 % --conj_cone_tolerance 1.5
% 0.21/0.56 % --prolific_symb_bound 500
% 0.21/0.56 % --lt_threshold 2000
% 0.21/0.56
% 0.21/0.56 % ------ SAT Options
% 0.21/0.56
% 0.21/0.56 % --sat_mode false
% 0.21/0.56 % --sat_fm_restart_options ""
% 0.21/0.56 % --sat_gr_def false
% 0.21/0.56 % --sat_epr_types true
% 0.21/0.56 % --sat_non_cyclic_types false
% 0.21/0.56 % --sat_finite_models false
% 0.21/0.56 % --sat_fm_lemmas false
% 0.21/0.56 % --sat_fm_prep false
% 0.21/0.56 % --sat_fm_uc_incr true
% 0.21/0.56 % --sat_out_model small
% 0.21/0.56 % --sat_out_clauses false
% 0.21/0.56
% 0.21/0.56 % ------ QBF Options
% 0.21/0.56
% 0.21/0.56 % --qbf_mode false
% 0.21/0.56 % --qbf_elim_univ true
% 0.21/0.56 % --qbf_sk_in true
% 0.21/0.56 % --qbf_pred_elim true
% 0.21/0.56 % --qbf_split 32
% 0.21/0.56
% 0.21/0.56 % ------ BMC1 Options
% 0.21/0.56
% 0.21/0.56 % --bmc1_incremental false
% 0.21/0.56 % --bmc1_axioms reachable_all
% 0.21/0.56 % --bmc1_min_bound 0
% 0.21/0.56 % --bmc1_max_bound -1
% 0.21/0.56 % --bmc1_max_bound_default -1
% 0.21/0.56 % --bmc1_symbol_reachability true
% 0.21/0.56 % --bmc1_property_lemmas false
% 0.21/0.56 % --bmc1_k_induction false
% 0.21/0.56 % --bmc1_non_equiv_states false
% 0.21/0.56 % --bmc1_deadlock false
% 0.21/0.56 % --bmc1_ucm false
% 0.21/0.56 % --bmc1_add_unsat_core none
% 0.21/0.56 % --bmc1_unsat_core_children false
% 0.21/0.56 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.56 % --bmc1_out_stat full
% 0.21/0.56 % --bmc1_ground_init false
% 0.21/0.56 % --bmc1_pre_inst_next_state false
% 0.21/0.56 % --bmc1_pre_inst_state false
% 0.21/0.56 % --bmc1_pre_inst_reach_state false
% 0.21/0.56 % --bmc1_out_unsat_core false
% 0.21/0.56 % --bmc1_aig_witness_out false
% 0.21/0.56 % --bmc1_verbose false
% 0.21/0.56 % --bmc1_dump_clauses_tptp false
% 0.21/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.56 % --bmc1_dump_file -
% 0.21/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.56 % --bmc1_ucm_extend_mode 1
% 0.21/0.56 % --bmc1_ucm_init_mode 2
% 0.21/0.56 % --bmc1_ucm_cone_mode none
% 0.21/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.56 % --bmc1_ucm_relax_model 4
% 0.21/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.56 % --bmc1_ucm_layered_model none
% 0.21/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.56
% 0.21/0.56 % ------ AIG Options
% 0.21/0.56
% 0.21/0.56 % --aig_mode false
% 0.21/0.56
% 0.21/0.56 % ------ Instantiation Options
% 0.21/0.56
% 0.21/0.56 % --instantiation_flag true
% 0.21/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.56 % --inst_solver_per_active 750
% 0.21/0.56 % --inst_solver_calls_frac 0.5
% 0.21/0.56 % --inst_passive_queue_type priority_queues
% 0.21/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.56 % --inst_passive_queues_freq [25;2]
% 0.21/0.56 % --inst_dismatching true
% 0.21/0.56 % --inst_eager_unprocessed_to_passive true
% 0.21/0.56 % --inst_prop_sim_given true
% 0.21/0.56 % --inst_prop_sim_new false
% 0.21/0.56 % --inst_orphan_elimination true
% 0.21/0.56 % --inst_learning_loop_flag true
% 0.21/0.56 % --inst_learning_start 3000
% 0.21/0.56 % --inst_learning_factor 2
% 0.21/0.56 % --inst_start_prop_sim_after_learn 3
% 0.21/0.56 % --inst_sel_renew solver
% 0.21/0.56 % --inst_lit_activity_flag true
% 0.21/0.56 % --inst_out_proof true
% 0.21/0.56
% 0.21/0.56 % ------ Resolution Options
% 0.21/0.56
% 0.21/0.56 % --resolution_flag true
% 0.21/0.56 % --res_lit_sel kbo_max
% 0.21/0.56 % --res_to_prop_solver none
% 0.21/0.56 % --res_prop_simpl_new false
% 0.21/0.56 % --res_prop_simpl_given false
% 0.21/0.56 % --res_passive_queue_type priority_queues
% 0.21/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.56 % --res_passive_queues_freq [15;5]
% 0.21/0.56 % --res_forward_subs full
% 0.21/0.56 % --res_backward_subs full
% 0.21/0.56 % --res_forward_subs_resolution true
% 0.21/0.56 % --res_backward_subs_resolution true
% 0.21/0.56 % --res_orphan_elimination false
% 0.21/0.56 % --res_time_limit 1000.
% 0.21/0.56 % --res_out_proof true
% 0.21/0.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5a9199.s
% 0.21/0.56 % --modulo true
% 0.21/0.56
% 0.21/0.56 % ------ Combination Options
% 0.21/0.56
% 0.21/0.56 % --comb_res_mult 1000
% 0.21/0.56 % --comb_inst_mult 300
% 0.21/0.56 % ------
% 0.21/0.56
% 0.21/0.56
% 0.21/0.56
% 0.21/0.56 % ------ Proving...
% 0.21/0.56 %
% 0.21/0.56
% 0.21/0.56
% 0.21/0.56 % Resolution empty clause
% 0.21/0.56
% 0.21/0.56 % ------ Statistics
% 0.21/0.56
% 0.21/0.56 % ------ General
% 0.21/0.56
% 0.21/0.56 % num_of_input_clauses: 41
% 0.21/0.56 % num_of_input_neg_conjectures: 2
% 0.21/0.56 % num_of_splits: 0
% 0.21/0.56 % num_of_split_atoms: 0
% 0.21/0.56 % num_of_sem_filtered_clauses: 0
% 0.21/0.56 % num_of_subtypes: 0
% 0.21/0.56 % monotx_restored_types: 0
% 0.21/0.56 % sat_num_of_epr_types: 0
% 0.21/0.56 % sat_num_of_non_cyclic_types: 0
% 0.21/0.56 % sat_guarded_non_collapsed_types: 0
% 0.21/0.56 % is_epr: 0
% 0.21/0.56 % is_horn: 0
% 0.21/0.56 % has_eq: 1
% 0.21/0.56 % num_pure_diseq_elim: 0
% 0.21/0.56 % simp_replaced_by: 0
% 0.21/0.56 % res_preprocessed: 11
% 0.21/0.56 % prep_upred: 0
% 0.21/0.56 % prep_unflattend: 12
% 0.21/0.56 % pred_elim_cands: 2
% 0.21/0.56 % pred_elim: 0
% 0.21/0.56 % pred_elim_cl: 0
% 0.21/0.56 % pred_elim_cycles: 1
% 0.21/0.56 % forced_gc_time: 0
% 0.21/0.56 % gc_basic_clause_elim: 0
% 0.21/0.56 % parsing_time: 0.002
% 0.21/0.56 % sem_filter_time: 0.
% 0.21/0.56 % pred_elim_time: 0.001
% 0.21/0.56 % out_proof_time: 0.
% 0.21/0.56 % monotx_time: 0.
% 0.21/0.56 % subtype_inf_time: 0.
% 0.21/0.56 % unif_index_cands_time: 0.
% 0.21/0.56 % unif_index_add_time: 0.
% 0.21/0.56 % total_time: 0.127
% 0.21/0.56 % num_of_symbols: 39
% 0.21/0.56 % num_of_terms: 219
% 0.21/0.56
% 0.21/0.56 % ------ Propositional Solver
% 0.21/0.56
% 0.21/0.56 % prop_solver_calls: 1
% 0.21/0.56 % prop_fast_solver_calls: 51
% 0.21/0.56 % prop_num_of_clauses: 61
% 0.21/0.56 % prop_preprocess_simplified: 211
% 0.21/0.56 % prop_fo_subsumed: 0
% 0.21/0.56 % prop_solver_time: 0.
% 0.21/0.56 % prop_fast_solver_time: 0.
% 0.21/0.56 % prop_unsat_core_time: 0.
% 0.21/0.56
% 0.21/0.56 % ------ QBF
% 0.21/0.56
% 0.21/0.56 % qbf_q_res: 0
% 0.21/0.56 % qbf_num_tautologies: 0
% 0.21/0.56 % qbf_prep_cycles: 0
% 0.21/0.56
% 0.21/0.56 % ------ BMC1
% 0.21/0.56
% 0.21/0.56 % bmc1_current_bound: -1
% 0.21/0.56 % bmc1_last_solved_bound: -1
% 0.21/0.56 % bmc1_unsat_core_size: -1
% 0.21/0.56 % bmc1_unsat_core_parents_size: -1
% 0.21/0.56 % bmc1_merge_next_fun: 0
% 0.21/0.56 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.56
% 0.21/0.56 % ------ Instantiation
% 0.21/0.56
% 0.21/0.56 % inst_num_of_clauses: 40
% 0.21/0.56 % inst_num_in_passive: 0
% 0.21/0.56 % inst_num_in_active: 0
% 0.21/0.56 % inst_num_in_unprocessed: 41
% 0.21/0.57 % inst_num_of_loops: 0
% 0.21/0.57 % inst_num_of_learning_restarts: 0
% 0.21/0.57 % inst_num_moves_active_passive: 0
% 0.21/0.57 % inst_lit_activity: 0
% 0.21/0.57 % inst_lit_activity_moves: 0
% 0.21/0.57 % inst_num_tautologies: 0
% 0.21/0.57 % inst_num_prop_implied: 0
% 0.21/0.57 % inst_num_existing_simplified: 0
% 0.21/0.57 % inst_num_eq_res_simplified: 0
% 0.21/0.57 % inst_num_child_elim: 0
% 0.21/0.57 % inst_num_of_dismatching_blockings: 0
% 0.21/0.57 % inst_num_of_non_proper_insts: 0
% 0.21/0.57 % inst_num_of_duplicates: 0
% 0.21/0.57 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.57 % inst_dismatching_checking_time: 0.
% 0.21/0.57
% 0.21/0.57 % ------ Resolution
% 0.21/0.57
% 0.21/0.57 % res_num_of_clauses: 54
% 0.21/0.57 % res_num_in_passive: 6
% 0.21/0.57 % res_num_in_active: 40
% 0.21/0.57 % res_num_of_loops: 13
% 0.21/0.57 % res_forward_subset_subsumed: 3
% 0.21/0.57 % res_backward_subset_subsumed: 0
% 0.21/0.57 % res_forward_subsumed: 0
% 0.21/0.57 % res_backward_subsumed: 0
% 0.21/0.57 % res_forward_subsumption_resolution: 2
% 0.21/0.57 % res_backward_subsumption_resolution: 1
% 0.21/0.57 % res_clause_to_clause_subsumption: 17
% 0.21/0.57 % res_orphan_elimination: 0
% 0.21/0.57 % res_tautology_del: 0
% 0.21/0.57 % res_num_eq_res_simplified: 0
% 0.21/0.57 % res_num_sel_changes: 0
% 0.21/0.57 % res_moves_from_active_to_pass: 0
% 0.21/0.57
% 0.21/0.57 % Status Unsatisfiable
% 0.21/0.57 % SZS status Theorem
% 0.21/0.57 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------