TSTP Solution File: SEU120+2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.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:01 EDT 2022
% Result : Theorem 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
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(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(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(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,
! [A] :
( lhs_atom3(A)
<=> A != empty_set ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [A] :
( lhs_atom3(A)
| ! [B] : ~ in(B,A) ),
inference(fold_definition,[status(thm)],[d1_xboole_0_1,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [A] :
( lhs_atom4(A)
<=> A = empty_set ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [A] :
( lhs_atom4(A)
| ~ ! [B] : ~ in(B,A) ),
inference(fold_definition,[status(thm)],[d1_xboole_0_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [C,B,A] :
( lhs_atom5(C,B,A)
<=> C != set_intersection2(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [A,B,C] :
( lhs_atom5(C,B,A)
| ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
inference(fold_definition,[status(thm)],[d3_xboole_0_1,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [C,B,A] :
( lhs_atom6(C,B,A)
<=> C = set_intersection2(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_5,plain,
! [A,B,C] :
( lhs_atom6(C,B,A)
| ~ ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
inference(fold_definition,[status(thm)],[d3_xboole_0_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [B,A] :
( lhs_atom7(B,A)
<=> ~ disjoint(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [A,B] :
( lhs_atom7(B,A)
| set_intersection2(A,B) = empty_set ),
inference(fold_definition,[status(thm)],[d7_xboole_0_1,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [B,A] :
( lhs_atom8(B,A)
<=> disjoint(A,B) ),
inference(definition,[],]) ).
fof(to_be_clausified_7,plain,
! [A,B] :
( lhs_atom8(B,A)
| set_intersection2(A,B) != empty_set ),
inference(fold_definition,[status(thm)],[d7_xboole_0_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
( lhs_atom9
<=> $true ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
( lhs_atom9
| $false ),
inference(fold_definition,[status(thm)],[dt_k1_xboole_0_0,def_lhs_atom9]) ).
fof(to_be_clausified_9,plain,
( lhs_atom9
| $false ),
inference(fold_definition,[status(thm)],[dt_k3_xboole_0_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
( lhs_atom10
<=> empty(empty_set) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
( lhs_atom10
| $false ),
inference(fold_definition,[status(thm)],[fc1_xboole_0_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [A] :
( lhs_atom11(A)
<=> set_intersection2(A,A) = A ),
inference(definition,[],]) ).
fof(to_be_clausified_11,plain,
! [A] :
( lhs_atom11(A)
| $false ),
inference(fold_definition,[status(thm)],[idempotence_k3_xboole_0_0,def_lhs_atom11]) ).
fof(to_be_clausified_12,plain,
! [A,B] :
( lhs_atom7(B,A)
| disjoint(B,A) ),
inference(fold_definition,[status(thm)],[symmetry_r1_xboole_0_0,def_lhs_atom7]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X1,X2] :
( lhs_atom6(X3,X1,X2)
| ~ ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_1,axiom,
! [X3,X1,X2] :
( lhs_atom5(X3,X1,X2)
| ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_2,axiom,
! [X1,X2] :
( lhs_atom8(X1,X2)
| set_intersection2(X2,X1) != empty_set ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_3,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_4,axiom,
! [X1,X2] :
( lhs_atom7(X1,X2)
| disjoint(X1,X2) ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_5,axiom,
! [X1,X2] :
( lhs_atom7(X1,X2)
| set_intersection2(X2,X1) = empty_set ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_6,axiom,
! [X2] :
( lhs_atom3(X2)
| ! [X1] : ~ in(X1,X2) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_7,axiom,
! [X2] :
( lhs_atom4(X2)
| ~ ! [X1] : ~ in(X1,X2) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_8,axiom,
! [X1,X2] :
( lhs_atom2(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_9,axiom,
! [X2] :
( lhs_atom11(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_10,axiom,
( lhs_atom10
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_11,axiom,
( lhs_atom9
| ~ $true ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_12,axiom,
( lhs_atom9
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_13,axiom,
! [X3,X1,X2] :
( lhs_atom6(X3,X1,X2)
| ~ ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
c_0_0 ).
fof(c_0_14,axiom,
! [X3,X1,X2] :
( lhs_atom5(X3,X1,X2)
| ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
c_0_1 ).
fof(c_0_15,plain,
! [X1,X2] :
( lhs_atom8(X1,X2)
| set_intersection2(X2,X1) != empty_set ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_16,plain,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_17,axiom,
! [X1,X2] :
( lhs_atom7(X1,X2)
| disjoint(X1,X2) ),
c_0_4 ).
fof(c_0_18,axiom,
! [X1,X2] :
( lhs_atom7(X1,X2)
| set_intersection2(X2,X1) = empty_set ),
c_0_5 ).
fof(c_0_19,plain,
! [X2] :
( lhs_atom3(X2)
| ! [X1] : ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_20,plain,
! [X2] :
( lhs_atom4(X2)
| ~ ! [X1] : ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_21,plain,
! [X1,X2] : lhs_atom2(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_22,plain,
! [X2] : lhs_atom11(X2),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_23,plain,
lhs_atom10,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
lhs_atom9,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
lhs_atom9,
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X5,X6,X7] :
( ( ~ in(esk2_3(X5,X6,X7),X5)
| ~ in(esk2_3(X5,X6,X7),X7)
| ~ in(esk2_3(X5,X6,X7),X6)
| lhs_atom6(X5,X6,X7) )
& ( in(esk2_3(X5,X6,X7),X7)
| in(esk2_3(X5,X6,X7),X5)
| lhs_atom6(X5,X6,X7) )
& ( in(esk2_3(X5,X6,X7),X6)
| in(esk2_3(X5,X6,X7),X5)
| lhs_atom6(X5,X6,X7) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_27,plain,
! [X5,X6,X7,X8,X9] :
( ( in(X8,X7)
| ~ in(X8,X5)
| lhs_atom5(X5,X6,X7) )
& ( in(X8,X6)
| ~ in(X8,X5)
| lhs_atom5(X5,X6,X7) )
& ( ~ in(X9,X7)
| ~ in(X9,X6)
| in(X9,X5)
| lhs_atom5(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_14])])])])]) ).
fof(c_0_28,plain,
! [X3,X4] :
( lhs_atom8(X3,X4)
| set_intersection2(X4,X3) != empty_set ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_29,plain,
! [X3,X4] :
( lhs_atom1(X3,X4)
| ~ in(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_30,plain,
! [X3,X4] :
( lhs_atom7(X3,X4)
| disjoint(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_31,plain,
! [X3,X4] :
( lhs_atom7(X3,X4)
| set_intersection2(X4,X3) = empty_set ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_32,plain,
! [X3,X4] :
( lhs_atom3(X3)
| ~ in(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_19])]) ).
fof(c_0_33,plain,
! [X3] :
( lhs_atom4(X3)
| in(esk1_1(X3),X3) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
fof(c_0_34,plain,
! [X3,X4] : lhs_atom2(X3,X4),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_35,plain,
! [X3] : lhs_atom11(X3),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_36,plain,
lhs_atom10,
c_0_23 ).
fof(c_0_37,plain,
lhs_atom9,
c_0_24 ).
fof(c_0_38,plain,
lhs_atom9,
c_0_25 ).
cnf(c_0_39,plain,
( lhs_atom6(X1,X2,X3)
| ~ in(esk2_3(X1,X2,X3),X2)
| ~ in(esk2_3(X1,X2,X3),X3)
| ~ in(esk2_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,plain,
( lhs_atom6(X1,X2,X3)
| in(esk2_3(X1,X2,X3),X1)
| in(esk2_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_41,plain,
( lhs_atom6(X1,X2,X3)
| in(esk2_3(X1,X2,X3),X1)
| in(esk2_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42,plain,
( lhs_atom5(X1,X2,X3)
| in(X4,X1)
| ~ in(X4,X2)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_43,plain,
( lhs_atom5(X1,X2,X3)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_44,plain,
( lhs_atom5(X1,X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_45,plain,
( lhs_atom8(X2,X1)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_46,plain,
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_47,plain,
( disjoint(X1,X2)
| lhs_atom7(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_48,plain,
( set_intersection2(X1,X2) = empty_set
| lhs_atom7(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_49,plain,
( lhs_atom3(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_50,plain,
( in(esk1_1(X1),X1)
| lhs_atom4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_51,plain,
lhs_atom2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,plain,
lhs_atom11(X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,plain,
lhs_atom10,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_54,plain,
lhs_atom9,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_55,plain,
lhs_atom9,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_56,plain,
( lhs_atom6(X1,X2,X3)
| ~ in(esk2_3(X1,X2,X3),X2)
| ~ in(esk2_3(X1,X2,X3),X3)
| ~ in(esk2_3(X1,X2,X3),X1) ),
c_0_39,
[final] ).
cnf(c_0_57,plain,
( lhs_atom6(X1,X2,X3)
| in(esk2_3(X1,X2,X3),X1)
| in(esk2_3(X1,X2,X3),X3) ),
c_0_40,
[final] ).
cnf(c_0_58,plain,
( lhs_atom6(X1,X2,X3)
| in(esk2_3(X1,X2,X3),X1)
| in(esk2_3(X1,X2,X3),X2) ),
c_0_41,
[final] ).
cnf(c_0_59,plain,
( lhs_atom5(X1,X2,X3)
| in(X4,X1)
| ~ in(X4,X2)
| ~ in(X4,X3) ),
c_0_42,
[final] ).
cnf(c_0_60,plain,
( lhs_atom5(X1,X2,X3)
| in(X4,X3)
| ~ in(X4,X1) ),
c_0_43,
[final] ).
cnf(c_0_61,plain,
( lhs_atom5(X1,X2,X3)
| in(X4,X2)
| ~ in(X4,X1) ),
c_0_44,
[final] ).
cnf(c_0_62,plain,
( lhs_atom8(X2,X1)
| set_intersection2(X1,X2) != empty_set ),
c_0_45,
[final] ).
cnf(c_0_63,plain,
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
c_0_46,
[final] ).
cnf(c_0_64,plain,
( disjoint(X1,X2)
| lhs_atom7(X1,X2) ),
c_0_47,
[final] ).
cnf(c_0_65,plain,
( set_intersection2(X1,X2) = empty_set
| lhs_atom7(X2,X1) ),
c_0_48,
[final] ).
cnf(c_0_66,plain,
( lhs_atom3(X2)
| ~ in(X1,X2) ),
c_0_49,
[final] ).
cnf(c_0_67,plain,
( in(esk1_1(X1),X1)
| lhs_atom4(X1) ),
c_0_50,
[final] ).
cnf(c_0_68,plain,
lhs_atom2(X1,X2),
c_0_51,
[final] ).
cnf(c_0_69,plain,
lhs_atom11(X1),
c_0_52,
[final] ).
cnf(c_0_70,plain,
lhs_atom10,
c_0_53,
[final] ).
cnf(c_0_71,plain,
lhs_atom9,
c_0_54,
[final] ).
cnf(c_0_72,plain,
lhs_atom9,
c_0_55,
[final] ).
% End CNF derivation
cnf(c_0_56_0,axiom,
( X1 = set_intersection2(X3,X2)
| ~ in(sk1_esk2_3(X1,X2,X3),X2)
| ~ in(sk1_esk2_3(X1,X2,X3),X3)
| ~ in(sk1_esk2_3(X1,X2,X3),X1) ),
inference(unfold_definition,[status(thm)],[c_0_56,def_lhs_atom6]) ).
cnf(c_0_57_0,axiom,
( X1 = set_intersection2(X3,X2)
| in(sk1_esk2_3(X1,X2,X3),X1)
| in(sk1_esk2_3(X1,X2,X3),X3) ),
inference(unfold_definition,[status(thm)],[c_0_57,def_lhs_atom6]) ).
cnf(c_0_58_0,axiom,
( X1 = set_intersection2(X3,X2)
| in(sk1_esk2_3(X1,X2,X3),X1)
| in(sk1_esk2_3(X1,X2,X3),X2) ),
inference(unfold_definition,[status(thm)],[c_0_58,def_lhs_atom6]) ).
cnf(c_0_59_0,axiom,
( X1 != set_intersection2(X3,X2)
| in(X4,X1)
| ~ in(X4,X2)
| ~ in(X4,X3) ),
inference(unfold_definition,[status(thm)],[c_0_59,def_lhs_atom5]) ).
cnf(c_0_60_0,axiom,
( X1 != set_intersection2(X3,X2)
| in(X4,X3)
| ~ in(X4,X1) ),
inference(unfold_definition,[status(thm)],[c_0_60,def_lhs_atom5]) ).
cnf(c_0_61_0,axiom,
( X1 != set_intersection2(X3,X2)
| in(X4,X2)
| ~ in(X4,X1) ),
inference(unfold_definition,[status(thm)],[c_0_61,def_lhs_atom5]) ).
cnf(c_0_62_0,axiom,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(unfold_definition,[status(thm)],[c_0_62,def_lhs_atom8]) ).
cnf(c_0_63_0,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_63,def_lhs_atom1]) ).
cnf(c_0_64_0,axiom,
( ~ disjoint(X2,X1)
| disjoint(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_64,def_lhs_atom7]) ).
cnf(c_0_65_0,axiom,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(unfold_definition,[status(thm)],[c_0_65,def_lhs_atom7]) ).
cnf(c_0_66_0,axiom,
( X2 != empty_set
| ~ in(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_66,def_lhs_atom3]) ).
cnf(c_0_67_0,axiom,
( X1 = empty_set
| in(sk1_esk1_1(X1),X1) ),
inference(unfold_definition,[status(thm)],[c_0_67,def_lhs_atom4]) ).
cnf(c_0_68_0,axiom,
set_intersection2(X2,X1) = set_intersection2(X1,X2),
inference(unfold_definition,[status(thm)],[c_0_68,def_lhs_atom2]) ).
cnf(c_0_69_0,axiom,
set_intersection2(X1,X1) = X1,
inference(unfold_definition,[status(thm)],[c_0_69,def_lhs_atom11]) ).
cnf(c_0_70_0,axiom,
empty(empty_set),
inference(unfold_definition,[status(thm)],[c_0_70,def_lhs_atom10]) ).
cnf(c_0_71_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_71,def_lhs_atom9]) ).
cnf(c_0_72_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_72,def_lhs_atom9]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_1_002,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_2_003,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_004,axiom,
? [X1] : empty(X1),
c_0_1 ).
fof(c_0_4_005,plain,
~ empty(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_2])]) ).
fof(c_0_5_006,plain,
empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_3])]) ).
cnf(c_0_6_007,plain,
~ empty(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,plain,
empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,plain,
~ empty(esk1_0),
c_0_6,
[final] ).
cnf(c_0_9_010,plain,
empty(esk2_0),
c_0_7,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_8_0,axiom,
~ empty(sk2_esk1_0),
inference(literals_permutation,[status(thm)],[c_0_8]) ).
cnf(c_0_9_0,axiom,
empty(sk2_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_9]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_011,conjecture,
! [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_012,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_013,negated_conjecture,
~ ! [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)],[inference(assume_negation,[status(cth)],[c_0_0])]) ).
fof(c_0_3_014,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_4_015,negated_conjecture,
! [X6] :
( ( in(esk6_0,set_intersection2(esk4_0,esk5_0))
| ~ disjoint(esk2_0,esk3_0) )
& ( disjoint(esk4_0,esk5_0)
| ~ disjoint(esk2_0,esk3_0) )
& ( in(esk6_0,set_intersection2(esk4_0,esk5_0))
| ~ in(X6,set_intersection2(esk2_0,esk3_0)) )
& ( disjoint(esk4_0,esk5_0)
| ~ in(X6,set_intersection2(esk2_0,esk3_0)) ) ),
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_2])])])])])]) ).
fof(c_0_5_016,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_3])])])])])]) ).
cnf(c_0_6_017,negated_conjecture,
( in(esk6_0,set_intersection2(esk4_0,esk5_0))
| ~ in(X1,set_intersection2(esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_018,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_019,negated_conjecture,
( disjoint(esk4_0,esk5_0)
| ~ in(X1,set_intersection2(esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9_020,lemma,
( disjoint(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10_021,lemma,
( disjoint(X1,X2)
| in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11_022,negated_conjecture,
( in(esk6_0,set_intersection2(esk4_0,esk5_0))
| ~ disjoint(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12_023,negated_conjecture,
( disjoint(esk4_0,esk5_0)
| ~ disjoint(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13_024,negated_conjecture,
( in(esk6_0,set_intersection2(esk4_0,esk5_0))
| ~ in(X1,set_intersection2(esk2_0,esk3_0)) ),
c_0_6,
[final] ).
cnf(c_0_14_025,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
c_0_7,
[final] ).
cnf(c_0_15_026,negated_conjecture,
( disjoint(esk4_0,esk5_0)
| ~ in(X1,set_intersection2(esk2_0,esk3_0)) ),
c_0_8,
[final] ).
cnf(c_0_16_027,lemma,
( disjoint(X1,X2)
| in(esk1_2(X1,X2),X1) ),
c_0_9,
[final] ).
cnf(c_0_17_028,lemma,
( disjoint(X1,X2)
| in(esk1_2(X1,X2),X2) ),
c_0_10,
[final] ).
cnf(c_0_18_029,negated_conjecture,
( in(esk6_0,set_intersection2(esk4_0,esk5_0))
| ~ disjoint(esk2_0,esk3_0) ),
c_0_11,
[final] ).
cnf(c_0_19_030,negated_conjecture,
( disjoint(esk4_0,esk5_0)
| ~ disjoint(esk2_0,esk3_0) ),
c_0_12,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_25,negated_conjecture,
( disjoint(sk3_esk4_0,sk3_esk5_0)
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_96196b.p',c_0_19) ).
cnf(c_50,negated_conjecture,
( disjoint(sk3_esk4_0,sk3_esk5_0)
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_66,negated_conjecture,
( disjoint(sk3_esk4_0,sk3_esk5_0)
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_67,negated_conjecture,
( disjoint(sk3_esk4_0,sk3_esk5_0)
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_80,negated_conjecture,
( disjoint(sk3_esk4_0,sk3_esk5_0)
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_156,negated_conjecture,
( disjoint(sk3_esk4_0,sk3_esk5_0)
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_12,plain,
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_96196b.p',c_0_62_0) ).
cnf(c_130,plain,
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_131,plain,
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(rewriting,[status(thm)],[c_130]) ).
cnf(c_162,plain,
( disjoint(sk3_esk4_0,sk3_esk5_0)
| set_intersection2(sk3_esk2_0,sk3_esk3_0) != empty_set ),
inference(resolution,[status(thm)],[c_156,c_131]) ).
cnf(c_163,plain,
( disjoint(sk3_esk4_0,sk3_esk5_0)
| set_intersection2(sk3_esk2_0,sk3_esk3_0) != empty_set ),
inference(rewriting,[status(thm)],[c_162]) ).
cnf(c_7,plain,
( in(sk1_esk1_1(X0),X0)
| X0 = empty_set ),
file('/export/starexec/sandbox/tmp/iprover_modulo_96196b.p',c_0_67_0) ).
cnf(c_120,plain,
( in(sk1_esk1_1(X0),X0)
| X0 = empty_set ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_182,plain,
( in(sk1_esk1_1(set_intersection2(sk3_esk2_0,sk3_esk3_0)),set_intersection2(sk3_esk2_0,sk3_esk3_0))
| disjoint(sk3_esk4_0,sk3_esk5_0) ),
inference(resolution,[status(thm)],[c_163,c_120]) ).
cnf(c_183,plain,
( in(sk1_esk1_1(set_intersection2(sk3_esk2_0,sk3_esk3_0)),set_intersection2(sk3_esk2_0,sk3_esk3_0))
| disjoint(sk3_esk4_0,sk3_esk5_0) ),
inference(rewriting,[status(thm)],[c_182]) ).
cnf(c_21,negated_conjecture,
( ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0))
| disjoint(sk3_esk4_0,sk3_esk5_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_96196b.p',c_0_15) ).
cnf(c_46,negated_conjecture,
( ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0))
| disjoint(sk3_esk4_0,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_62,negated_conjecture,
( ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0))
| disjoint(sk3_esk4_0,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_71,negated_conjecture,
( ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0))
| disjoint(sk3_esk4_0,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_76,negated_conjecture,
( ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0))
| disjoint(sk3_esk4_0,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_148,negated_conjecture,
( ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0))
| disjoint(sk3_esk4_0,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_190,plain,
disjoint(sk3_esk4_0,sk3_esk5_0),
inference(forward_subsumption_resolution,[status(thm)],[c_183,c_148]) ).
cnf(c_191,negated_conjecture,
disjoint(sk3_esk4_0,sk3_esk5_0),
inference(rewriting,[status(thm)],[c_190]) ).
cnf(c_9,plain,
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_96196b.p',c_0_65_0) ).
cnf(c_124,plain,
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_125,plain,
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(rewriting,[status(thm)],[c_124]) ).
cnf(c_193,plain,
set_intersection2(sk3_esk4_0,sk3_esk5_0) = empty_set,
inference(resolution,[status(thm)],[c_191,c_125]) ).
cnf(c_194,plain,
set_intersection2(sk3_esk4_0,sk3_esk5_0) = empty_set,
inference(rewriting,[status(thm)],[c_193]) ).
cnf(c_8,plain,
( ~ in(X0,X1)
| X1 != empty_set ),
file('/export/starexec/sandbox/tmp/iprover_modulo_96196b.p',c_0_66_0) ).
cnf(c_122,plain,
( ~ in(X0,X1)
| X1 != empty_set ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_205,plain,
~ in(X0,set_intersection2(sk3_esk4_0,sk3_esk5_0)),
inference(resolution,[status(thm)],[c_194,c_122]) ).
cnf(c_206,plain,
~ in(X0,set_intersection2(sk3_esk4_0,sk3_esk5_0)),
inference(rewriting,[status(thm)],[c_205]) ).
cnf(c_24,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_96196b.p',c_0_18) ).
cnf(c_48,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_65,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_68,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_79,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_154,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ disjoint(sk3_esk2_0,sk3_esk3_0) ),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_213,negated_conjecture,
~ disjoint(sk3_esk2_0,sk3_esk3_0),
inference(backward_subsumption_resolution,[status(thm)],[c_206,c_154]) ).
cnf(c_216,plain,
~ disjoint(sk3_esk2_0,sk3_esk3_0),
inference(rewriting,[status(thm)],[c_213]) ).
cnf(c_219,plain,
set_intersection2(sk3_esk2_0,sk3_esk3_0) != empty_set,
inference(resolution,[status(thm)],[c_216,c_131]) ).
cnf(c_220,plain,
set_intersection2(sk3_esk2_0,sk3_esk3_0) != empty_set,
inference(rewriting,[status(thm)],[c_219]) ).
cnf(c_225,plain,
in(sk1_esk1_1(set_intersection2(sk3_esk2_0,sk3_esk3_0)),set_intersection2(sk3_esk2_0,sk3_esk3_0)),
inference(resolution,[status(thm)],[c_220,c_120]) ).
cnf(c_226,plain,
in(sk1_esk1_1(set_intersection2(sk3_esk2_0,sk3_esk3_0)),set_intersection2(sk3_esk2_0,sk3_esk3_0)),
inference(rewriting,[status(thm)],[c_225]) ).
cnf(c_19,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_96196b.p',c_0_13) ).
cnf(c_44,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0)) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_60,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0)) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_73,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0)) ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_74,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0)) ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_144,negated_conjecture,
( in(sk3_esk6_0,set_intersection2(sk3_esk4_0,sk3_esk5_0))
| ~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0)) ),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_214,negated_conjecture,
~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0)),
inference(backward_subsumption_resolution,[status(thm)],[c_206,c_144]) ).
cnf(c_215,plain,
~ in(X0,set_intersection2(sk3_esk2_0,sk3_esk3_0)),
inference(rewriting,[status(thm)],[c_214]) ).
cnf(c_334,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_226,c_215]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 13:29:02 EDT 2022
% 0.12/0.33 % 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/sandbox/tmp/iprover_proof_f1207c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_96196b.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e2baba | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.53 % --bmc1_dump_file -
% 0.19/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.53 % --bmc1_ucm_extend_mode 1
% 0.19/0.53 % --bmc1_ucm_init_mode 2
% 0.19/0.53 % --bmc1_ucm_cone_mode none
% 0.19/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.53 % --bmc1_ucm_relax_model 4
% 0.19/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.53 % --bmc1_ucm_layered_model none
% 0.19/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.53
% 0.19/0.53 % ------ AIG Options
% 0.19/0.53
% 0.19/0.53 % --aig_mode false
% 0.19/0.53
% 0.19/0.53 % ------ Instantiation Options
% 0.19/0.53
% 0.19/0.53 % --instantiation_flag true
% 0.19/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.53 % --inst_solver_per_active 750
% 0.19/0.53 % --inst_solver_calls_frac 0.5
% 0.19/0.53 % --inst_passive_queue_type priority_queues
% 0.19/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.53 % --inst_passive_queues_freq [25;2]
% 0.19/0.53 % --inst_dismatching true
% 0.19/0.53 % --inst_eager_unprocessed_to_passive true
% 0.19/0.53 % --inst_prop_sim_given true
% 0.19/0.53 % --inst_prop_sim_new false
% 0.19/0.53 % --inst_orphan_elimination true
% 0.19/0.53 % --inst_learning_loop_flag true
% 0.19/0.53 % --inst_learning_start 3000
% 0.19/0.53 % --inst_learning_factor 2
% 0.19/0.53 % --inst_start_prop_sim_after_learn 3
% 0.19/0.53 % --inst_sel_renew solver
% 0.19/0.53 % --inst_lit_activity_flag true
% 0.19/0.53 % --inst_out_proof true
% 0.19/0.53
% 0.19/0.53 % ------ Resolution Options
% 0.19/0.53
% 0.19/0.53 % --resolution_flag true
% 0.19/0.53 % --res_lit_sel kbo_max
% 0.19/0.53 % --res_to_prop_solver none
% 0.19/0.53 % --res_prop_simpl_new false
% 0.19/0.53 % --res_prop_simpl_given false
% 0.19/0.53 % --res_passive_queue_type priority_queues
% 0.19/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.53 % --res_passive_queues_freq [15;5]
% 0.19/0.53 % --res_forward_subs full
% 0.19/0.53 % --res_backward_subs full
% 0.19/0.53 % --res_forward_subs_resolution true
% 0.19/0.53 % --res_backward_subs_resolution true
% 0.19/0.53 % --res_orphan_elimination false
% 0.19/0.53 % --res_time_limit 1000.
% 0.19/0.53 % --res_out_proof true
% 0.19/0.53 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f1207c.s
% 0.19/0.53 % --modulo true
% 0.19/0.53
% 0.19/0.53 % ------ Combination Options
% 0.19/0.53
% 0.19/0.53 % --comb_res_mult 1000
% 0.19/0.53 % --comb_inst_mult 300
% 0.19/0.53 % ------
% 0.19/0.53
% 0.19/0.53 % ------ Parsing...% successful
% 0.19/0.53
% 0.19/0.53 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.53
% 0.19/0.53 % ------ Proving...
% 0.19/0.53 % ------ Problem Properties
% 0.19/0.53
% 0.19/0.53 %
% 0.19/0.53 % EPR false
% 0.19/0.53 % Horn false
% 0.19/0.53 % Has equality true
% 0.19/0.53
% 0.19/0.53 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Compiling...
% 0.19/0.53 Loading plugin: done.
% 0.19/0.53 % % ------ Current options:
% 0.19/0.53
% 0.19/0.53 % ------ Input Options
% 0.19/0.53
% 0.19/0.53 % --out_options all
% 0.19/0.53 % --tptp_safe_out true
% 0.19/0.53 % --problem_path ""
% 0.19/0.53 % --include_path ""
% 0.19/0.53 % --clausifier .//eprover
% 0.19/0.53 % --clausifier_options --tstp-format
% 0.19/0.53 % --stdin false
% 0.19/0.53 % --dbg_backtrace false
% 0.19/0.53 % --dbg_dump_prop_clauses false
% 0.19/0.53 % --dbg_dump_prop_clauses_file -
% 0.19/0.53 % --dbg_out_stat false
% 0.19/0.53
% 0.19/0.53 % ------ General Options
% 0.19/0.53
% 0.19/0.53 % --fof false
% 0.19/0.53 % --time_out_real 150.
% 0.19/0.53 % --time_out_prep_mult 0.2
% 0.19/0.53 % --time_out_virtual -1.
% 0.19/0.53 % --schedule none
% 0.19/0.53 % --ground_splitting input
% 0.19/0.53 % --splitting_nvd 16
% 0.19/0.53 % --non_eq_to_eq false
% 0.19/0.53 % --prep_gs_sim true
% 0.19/0.53 % --prep_unflatten false
% 0.19/0.53 % --prep_res_sim true
% 0.19/0.53 % --prep_upred true
% 0.19/0.53 % --res_sim_input true
% 0.19/0.53 % --clause_weak_htbl true
% 0.19/0.53 % --gc_record_bc_elim false
% 0.19/0.53 % --symbol_type_check false
% 0.19/0.53 % --clausify_out false
% 0.19/0.53 % --large_theory_mode false
% 0.19/0.53 % --prep_sem_filter none
% 0.19/0.53 % --prep_sem_filter_out false
% 0.19/0.53 % --preprocessed_out false
% 0.19/0.53 % --sub_typing false
% 0.19/0.53 % --brand_transform false
% 0.19/0.53 % --pure_diseq_elim true
% 0.19/0.53 % --min_unsat_core false
% 0.19/0.53 % --pred_elim true
% 0.19/0.53 % --add_important_lit false
% 0.19/0.53 % --soft_assumptions false
% 0.19/0.53 % --reset_solvers false
% 0.19/0.53 % --bc_imp_inh []
% 0.19/0.53 % --conj_cone_tolerance 1.5
% 0.19/0.53 % --prolific_symb_bound 500
% 0.19/0.53 % --lt_threshold 2000
% 0.19/0.53
% 0.19/0.53 % ------ SAT Options
% 0.19/0.53
% 0.19/0.53 % --sat_mode false
% 0.19/0.53 % --sat_fm_restart_options ""
% 0.19/0.53 % --sat_gr_def false
% 0.19/0.53 % --sat_epr_types true
% 0.19/0.53 % --sat_non_cyclic_types false
% 0.19/0.53 % --sat_finite_models false
% 0.19/0.53 % --sat_fm_lemmas false
% 0.19/0.53 % --sat_fm_prep false
% 0.19/0.53 % --sat_fm_uc_incr true
% 0.19/0.53 % --sat_out_model small
% 0.19/0.53 % --sat_out_clauses false
% 0.19/0.53
% 0.19/0.53 % ------ QBF Options
% 0.19/0.53
% 0.19/0.53 % --qbf_mode false
% 0.19/0.53 % --qbf_elim_univ true
% 0.19/0.53 % --qbf_sk_in true
% 0.19/0.53 % --qbf_pred_elim true
% 0.19/0.53 % --qbf_split 32
% 0.19/0.53
% 0.19/0.53 % ------ BMC1 Options
% 0.19/0.53
% 0.19/0.53 % --bmc1_incremental false
% 0.19/0.53 % --bmc1_axioms reachable_all
% 0.19/0.53 % --bmc1_min_bound 0
% 0.19/0.53 % --bmc1_max_bound -1
% 0.19/0.53 % --bmc1_max_bound_default -1
% 0.19/0.53 % --bmc1_symbol_reachability true
% 0.19/0.53 % --bmc1_property_lemmas false
% 0.19/0.53 % --bmc1_k_induction false
% 0.19/0.53 % --bmc1_non_equiv_states false
% 0.19/0.53 % --bmc1_deadlock false
% 0.19/0.53 % --bmc1_ucm false
% 0.19/0.53 % --bmc1_add_unsat_core none
% 0.19/0.53 % --bmc1_unsat_core_children false
% 0.19/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.53 % --bmc1_out_stat full
% 0.19/0.53 % --bmc1_ground_init false
% 0.19/0.53 % --bmc1_pre_inst_next_state false
% 0.19/0.53 % --bmc1_pre_inst_state false
% 0.19/0.53 % --bmc1_pre_inst_reach_state false
% 0.19/0.53 % --bmc1_out_unsat_core false
% 0.19/0.53 % --bmc1_aig_witness_out false
% 0.19/0.53 % --bmc1_verbose false
% 0.19/0.53 % --bmc1_dump_clauses_tptp false
% 0.19/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.53 % --bmc1_dump_file -
% 0.19/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.53 % --bmc1_ucm_extend_mode 1
% 0.19/0.53 % --bmc1_ucm_init_mode 2
% 0.19/0.53 % --bmc1_ucm_cone_mode none
% 0.19/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.53 % --bmc1_ucm_relax_model 4
% 0.19/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.53 % --bmc1_ucm_layered_model none
% 0.19/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.53
% 0.19/0.53 % ------ AIG Options
% 0.19/0.53
% 0.19/0.53 % --aig_mode false
% 0.19/0.53
% 0.19/0.53 % ------ Instantiation Options
% 0.19/0.53
% 0.19/0.53 % --instantiation_flag true
% 0.19/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.53 % --inst_solver_per_active 750
% 0.19/0.53 % --inst_solver_calls_frac 0.5
% 0.19/0.53 % --inst_passive_queue_type priority_queues
% 0.19/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.53 % --inst_passive_queues_freq [25;2]
% 0.19/0.53 % --inst_dismatching true
% 0.19/0.53 % --inst_eager_unprocessed_to_passive true
% 0.19/0.53 % --inst_prop_sim_given true
% 0.19/0.53 % --inst_prop_sim_new false
% 0.19/0.53 % --inst_orphan_elimination true
% 0.19/0.53 % --inst_learning_loop_flag true
% 0.19/0.53 % --inst_learning_start 3000
% 0.19/0.53 % --inst_learning_factor 2
% 0.19/0.53 % --inst_start_prop_sim_after_learn 3
% 0.19/0.53 % --inst_sel_renew solver
% 0.19/0.53 % --inst_lit_activity_flag true
% 0.19/0.53 % --inst_out_proof true
% 0.19/0.53
% 0.19/0.53 % ------ Resolution Options
% 0.19/0.53
% 0.19/0.53 % --resolution_flag true
% 0.19/0.53 % --res_lit_sel kbo_max
% 0.19/0.53 % --res_to_prop_solver none
% 0.19/0.53 % --res_prop_simpl_new false
% 0.19/0.53 % --res_prop_simpl_given false
% 0.19/0.53 % --res_passive_queue_type priority_queues
% 0.19/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.53 % --res_passive_queues_freq [15;5]
% 0.19/0.53 % --res_forward_subs full
% 0.19/0.53 % --res_backward_subs full
% 0.19/0.53 % --res_forward_subs_resolution true
% 0.19/0.53 % --res_backward_subs_resolution true
% 0.19/0.53 % --res_orphan_elimination false
% 0.19/0.53 % --res_time_limit 1000.
% 0.19/0.53 % --res_out_proof true
% 0.19/0.53 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f1207c.s
% 0.19/0.53 % --modulo true
% 0.19/0.53
% 0.19/0.53 % ------ Combination Options
% 0.19/0.53
% 0.19/0.53 % --comb_res_mult 1000
% 0.19/0.53 % --comb_inst_mult 300
% 0.19/0.53 % ------
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 % ------ Proving...
% 0.19/0.53 %
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 % Resolution empty clause
% 0.19/0.53
% 0.19/0.53 % ------ Statistics
% 0.19/0.53
% 0.19/0.53 % ------ General
% 0.19/0.53
% 0.19/0.53 % num_of_input_clauses: 26
% 0.19/0.53 % num_of_input_neg_conjectures: 4
% 0.19/0.53 % num_of_splits: 0
% 0.19/0.53 % num_of_split_atoms: 0
% 0.19/0.53 % num_of_sem_filtered_clauses: 0
% 0.19/0.53 % num_of_subtypes: 0
% 0.19/0.53 % monotx_restored_types: 0
% 0.19/0.53 % sat_num_of_epr_types: 0
% 0.19/0.53 % sat_num_of_non_cyclic_types: 0
% 0.19/0.53 % sat_guarded_non_collapsed_types: 0
% 0.19/0.53 % is_epr: 0
% 0.19/0.53 % is_horn: 0
% 0.19/0.53 % has_eq: 1
% 0.19/0.53 % num_pure_diseq_elim: 0
% 0.19/0.53 % simp_replaced_by: 0
% 0.19/0.53 % res_preprocessed: 11
% 0.19/0.53 % prep_upred: 0
% 0.19/0.53 % prep_unflattend: 0
% 0.19/0.53 % pred_elim_cands: 0
% 0.19/0.53 % pred_elim: 0
% 0.19/0.53 % pred_elim_cl: 0
% 0.19/0.53 % pred_elim_cycles: 0
% 0.19/0.53 % forced_gc_time: 0
% 0.19/0.53 % gc_basic_clause_elim: 0
% 0.19/0.53 % parsing_time: 0.001
% 0.19/0.53 % sem_filter_time: 0.
% 0.19/0.53 % pred_elim_time: 0.
% 0.19/0.53 % out_proof_time: 0.002
% 0.19/0.53 % monotx_time: 0.
% 0.19/0.53 % subtype_inf_time: 0.
% 0.19/0.53 % unif_index_cands_time: 0.
% 0.19/0.53 % unif_index_add_time: 0.
% 0.19/0.53 % total_time: 0.13
% 0.19/0.53 % num_of_symbols: 40
% 0.19/0.53 % num_of_terms: 181
% 0.19/0.53
% 0.19/0.53 % ------ Propositional Solver
% 0.19/0.53
% 0.19/0.53 % prop_solver_calls: 1
% 0.19/0.53 % prop_fast_solver_calls: 38
% 0.19/0.53 % prop_num_of_clauses: 37
% 0.19/0.53 % prop_preprocess_simplified: 131
% 0.19/0.53 % prop_fo_subsumed: 0
% 0.19/0.53 % prop_solver_time: 0.
% 0.19/0.53 % prop_fast_solver_time: 0.
% 0.19/0.53 % prop_unsat_core_time: 0.
% 0.19/0.53
% 0.19/0.53 % ------ QBF
% 0.19/0.53
% 0.19/0.53 % qbf_q_res: 0
% 0.19/0.53 % qbf_num_tautologies: 0
% 0.19/0.53 % qbf_prep_cycles: 0
% 0.19/0.53
% 0.19/0.53 % ------ BMC1
% 0.19/0.53
% 0.19/0.53 % bmc1_current_bound: -1
% 0.19/0.53 % bmc1_last_solved_bound: -1
% 0.19/0.53 % bmc1_unsat_core_size: -1
% 0.19/0.53 % bmc1_unsat_core_parents_size: -1
% 0.19/0.53 % bmc1_merge_next_fun: 0
% 0.19/0.53 % bmc1_unsat_core_clauses_time: 0.
% 0.19/0.53
% 0.19/0.53 % ------ Instantiation
% 0.19/0.53
% 0.19/0.53 % inst_num_of_clauses: 25
% 0.19/0.53 % inst_num_in_passive: 0
% 0.19/0.53 % inst_num_in_active: 0
% 0.19/0.53 % inst_num_in_unprocessed: 26
% 0.19/0.54 % inst_num_of_loops: 0
% 0.19/0.54 % inst_num_of_learning_restarts: 0
% 0.19/0.54 % inst_num_moves_active_passive: 0
% 0.19/0.54 % inst_lit_activity: 0
% 0.19/0.54 % inst_lit_activity_moves: 0
% 0.19/0.54 % inst_num_tautologies: 0
% 0.19/0.54 % inst_num_prop_implied: 0
% 0.19/0.54 % inst_num_existing_simplified: 0
% 0.19/0.54 % inst_num_eq_res_simplified: 0
% 0.19/0.54 % inst_num_child_elim: 0
% 0.19/0.54 % inst_num_of_dismatching_blockings: 0
% 0.19/0.54 % inst_num_of_non_proper_insts: 0
% 0.19/0.54 % inst_num_of_duplicates: 0
% 0.19/0.54 % inst_inst_num_from_inst_to_res: 0
% 0.19/0.54 % inst_dismatching_checking_time: 0.
% 0.19/0.54
% 0.19/0.54 % ------ Resolution
% 0.19/0.54
% 0.19/0.54 % res_num_of_clauses: 51
% 0.19/0.54 % res_num_in_passive: 7
% 0.19/0.54 % res_num_in_active: 40
% 0.19/0.54 % res_num_of_loops: 30
% 0.19/0.54 % res_forward_subset_subsumed: 13
% 0.19/0.54 % res_backward_subset_subsumed: 2
% 0.19/0.54 % res_forward_subsumed: 0
% 0.19/0.54 % res_backward_subsumed: 2
% 0.19/0.54 % res_forward_subsumption_resolution: 2
% 0.19/0.54 % res_backward_subsumption_resolution: 2
% 0.19/0.54 % res_clause_to_clause_subsumption: 53
% 0.19/0.54 % res_orphan_elimination: 0
% 0.19/0.54 % res_tautology_del: 0
% 0.19/0.54 % res_num_eq_res_simplified: 0
% 0.19/0.54 % res_num_sel_changes: 0
% 0.19/0.54 % res_moves_from_active_to_pass: 0
% 0.19/0.54
% 0.19/0.54 % Status Unsatisfiable
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------