TSTP Solution File: ITP001+2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : ITP001+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.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 : Sat Jul 16 23:08:44 EDT 2022
% Result : Theorem 0.22s 0.46s
% Output : CNFRefutation 0.22s
% 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(ax_thm_2Ebool_2ET__DEF,axiom,
( $true
<=> i(bool) = i(bool) ),
input ).
fof(ax_thm_2Ebool_2ET__DEF_0,plain,
( $true
| i(bool) != i(bool) ),
inference(orientation,[status(thm)],[ax_thm_2Ebool_2ET__DEF]) ).
fof(ax_thm_2Ebool_2ET__DEF_1,plain,
( ~ $true
| i(bool) = i(bool) ),
inference(orientation,[status(thm)],[ax_thm_2Ebool_2ET__DEF]) ).
fof(ax_eq_p,axiom,
! [A] :
( ne(A)
=> ! [X] :
( mem(X,A)
=> ! [Y] :
( mem(Y,A)
=> ( p(ap(ap(c_2Emin_2E_3D(A),X),Y))
<=> X = Y ) ) ) ),
input ).
fof(ax_eq_p_0,plain,
! [A] :
( ~ ne(A)
| ! [X] :
( mem(X,A)
=> ! [Y] :
( mem(Y,A)
=> ( p(ap(ap(c_2Emin_2E_3D(A),X),Y))
<=> X = Y ) ) ) ),
inference(orientation,[status(thm)],[ax_eq_p]) ).
fof(mem_c_2Emin_2E_3D,axiom,
! [A_27a] :
( ne(A_27a)
=> mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))) ),
input ).
fof(mem_c_2Emin_2E_3D_0,plain,
! [A_27a] :
( ~ ne(A_27a)
| mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))) ),
inference(orientation,[status(thm)],[mem_c_2Emin_2E_3D]) ).
fof(ax_true_p,axiom,
p(c_2Ebool_2ET),
input ).
fof(ax_true_p_0,plain,
( p(c_2Ebool_2ET)
| $false ),
inference(orientation,[status(thm)],[ax_true_p]) ).
fof(mem_c_2Ebool_2ET,axiom,
mem(c_2Ebool_2ET,bool),
input ).
fof(mem_c_2Ebool_2ET_0,plain,
( mem(c_2Ebool_2ET,bool)
| $false ),
inference(orientation,[status(thm)],[mem_c_2Ebool_2ET]) ).
fof(ibeta,axiom,
! [A,X] :
( mem(X,A)
=> ap(i(A),X) = X ),
input ).
fof(ibeta_0,plain,
! [A,X] :
( ~ mem(X,A)
| ap(i(A),X) = X ),
inference(orientation,[status(thm)],[ibeta]) ).
fof(kbeta,axiom,
! [A,Y,X] :
( mem(X,A)
=> ap(k(A,Y),X) = Y ),
input ).
fof(kbeta_0,plain,
! [A,X,Y] :
( ~ mem(X,A)
| ap(k(A,Y),X) = Y ),
inference(orientation,[status(thm)],[kbeta]) ).
fof(funcext,axiom,
! [A,B,F] :
( mem(F,arr(A,B))
=> ! [G] :
( mem(G,arr(A,B))
=> ( ! [X] :
( mem(X,A)
=> ap(F,X) = ap(G,X) )
=> F = G ) ) ),
input ).
fof(funcext_0,plain,
! [A,B,F] :
( ~ mem(F,arr(A,B))
| ! [G] :
( mem(G,arr(A,B))
=> ( ! [X] :
( mem(X,A)
=> ap(F,X) = ap(G,X) )
=> F = G ) ) ),
inference(orientation,[status(thm)],[funcext]) ).
fof(boolext,axiom,
! [Q] :
( mem(Q,bool)
=> ! [R] :
( mem(R,bool)
=> ( ( p(Q)
<=> p(R) )
=> Q = R ) ) ),
input ).
fof(boolext_0,plain,
! [Q] :
( ~ mem(Q,bool)
| ! [R] :
( mem(R,bool)
=> ( ( p(Q)
<=> p(R) )
=> Q = R ) ) ),
inference(orientation,[status(thm)],[boolext]) ).
fof(ap_tp,axiom,
! [A,B,F] :
( mem(F,arr(A,B))
=> ! [X] :
( mem(X,A)
=> mem(ap(F,X),B) ) ),
input ).
fof(ap_tp_0,plain,
! [A,B,F] :
( ~ mem(F,arr(A,B))
| ! [X] :
( mem(X,A)
=> mem(ap(F,X),B) ) ),
inference(orientation,[status(thm)],[ap_tp]) ).
fof(arr_ne,axiom,
! [A] :
( ne(A)
=> ! [B] :
( ne(B)
=> ne(arr(A,B)) ) ),
input ).
fof(arr_ne_0,plain,
! [A] :
( ~ ne(A)
| ! [B] :
( ne(B)
=> ne(arr(A,B)) ) ),
inference(orientation,[status(thm)],[arr_ne]) ).
fof(ind_ne,axiom,
ne(ind),
input ).
fof(ind_ne_0,plain,
( ne(ind)
| $false ),
inference(orientation,[status(thm)],[ind_ne]) ).
fof(bool_ne,axiom,
ne(bool),
input ).
fof(bool_ne_0,plain,
( ne(bool)
| $false ),
inference(orientation,[status(thm)],[bool_ne]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> ne(bool) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[bool_ne_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
( lhs_atom2
<=> ne(ind) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
( lhs_atom2
| $false ),
inference(fold_definition,[status(thm)],[ind_ne_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [A] :
( lhs_atom3(A)
<=> ~ ne(A) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [A] :
( lhs_atom3(A)
| ! [B] :
( ne(B)
=> ne(arr(A,B)) ) ),
inference(fold_definition,[status(thm)],[arr_ne_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [F,B,A] :
( lhs_atom4(F,B,A)
<=> ~ mem(F,arr(A,B)) ),
inference(definition,[],]) ).
fof(to_be_clausified_3,plain,
! [A,B,F] :
( lhs_atom4(F,B,A)
| ! [X] :
( mem(X,A)
=> mem(ap(F,X),B) ) ),
inference(fold_definition,[status(thm)],[ap_tp_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [Q] :
( lhs_atom5(Q)
<=> ~ mem(Q,bool) ),
inference(definition,[],]) ).
fof(to_be_clausified_4,plain,
! [Q] :
( lhs_atom5(Q)
| ! [R] :
( mem(R,bool)
=> ( ( p(Q)
<=> p(R) )
=> Q = R ) ) ),
inference(fold_definition,[status(thm)],[boolext_0,def_lhs_atom5]) ).
fof(to_be_clausified_5,plain,
! [A,B,F] :
( lhs_atom4(F,B,A)
| ! [G] :
( mem(G,arr(A,B))
=> ( ! [X] :
( mem(X,A)
=> ap(F,X) = ap(G,X) )
=> F = G ) ) ),
inference(fold_definition,[status(thm)],[funcext_0,def_lhs_atom4]) ).
fof(def_lhs_atom6,axiom,
! [X,A] :
( lhs_atom6(X,A)
<=> ~ mem(X,A) ),
inference(definition,[],]) ).
fof(to_be_clausified_6,plain,
! [A,X,Y] :
( lhs_atom6(X,A)
| ap(k(A,Y),X) = Y ),
inference(fold_definition,[status(thm)],[kbeta_0,def_lhs_atom6]) ).
fof(to_be_clausified_7,plain,
! [A,X] :
( lhs_atom6(X,A)
| ap(i(A),X) = X ),
inference(fold_definition,[status(thm)],[ibeta_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
( lhs_atom7
<=> mem(c_2Ebool_2ET,bool) ),
inference(definition,[],]) ).
fof(to_be_clausified_8,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[mem_c_2Ebool_2ET_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
( lhs_atom8
<=> p(c_2Ebool_2ET) ),
inference(definition,[],]) ).
fof(to_be_clausified_9,plain,
( lhs_atom8
| $false ),
inference(fold_definition,[status(thm)],[ax_true_p_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [A_27a] :
( lhs_atom9(A_27a)
<=> ~ ne(A_27a) ),
inference(definition,[],]) ).
fof(to_be_clausified_10,plain,
! [A_27a] :
( lhs_atom9(A_27a)
| mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))) ),
inference(fold_definition,[status(thm)],[mem_c_2Emin_2E_3D_0,def_lhs_atom9]) ).
fof(to_be_clausified_11,plain,
! [A] :
( lhs_atom3(A)
| ! [X] :
( mem(X,A)
=> ! [Y] :
( mem(Y,A)
=> ( p(ap(ap(c_2Emin_2E_3D(A),X),Y))
<=> X = Y ) ) ) ),
inference(fold_definition,[status(thm)],[ax_eq_p_0,def_lhs_atom3]) ).
fof(def_lhs_atom10,axiom,
( lhs_atom10
<=> ~ $true ),
inference(definition,[],]) ).
fof(to_be_clausified_12,plain,
( lhs_atom10
| i(bool) = i(bool) ),
inference(fold_definition,[status(thm)],[ax_thm_2Ebool_2ET__DEF_1,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
( lhs_atom11
<=> $true ),
inference(definition,[],]) ).
fof(to_be_clausified_13,plain,
( lhs_atom11
| i(bool) != i(bool) ),
inference(fold_definition,[status(thm)],[ax_thm_2Ebool_2ET__DEF_0,def_lhs_atom11]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X2,X1] :
( lhs_atom4(X3,X2,X1)
| ! [X7] :
( mem(X7,arr(X1,X2))
=> ( ! [X4] :
( mem(X4,X1)
=> ap(X3,X4) = ap(X7,X4) )
=> X3 = X7 ) ) ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom3(X1)
| ! [X4] :
( mem(X4,X1)
=> ! [X8] :
( mem(X8,X1)
=> ( p(ap(ap(c_2Emin_2E_3D(X1),X4),X8))
<=> X4 = X8 ) ) ) ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_2,axiom,
! [X3,X2,X1] :
( lhs_atom4(X3,X2,X1)
| ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_3,axiom,
! [X9] :
( lhs_atom9(X9)
| mem(c_2Emin_2E_3D(X9),arr(X9,arr(X9,bool))) ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_4,axiom,
! [X8,X4,X1] :
( lhs_atom6(X4,X1)
| ap(k(X1,X8),X4) = X8 ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_5,axiom,
! [X1] :
( lhs_atom3(X1)
| ! [X2] :
( ne(X2)
=> ne(arr(X1,X2)) ) ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_6,axiom,
! [X5] :
( lhs_atom5(X5)
| ! [X6] :
( mem(X6,bool)
=> ( ( p(X5)
<=> p(X6) )
=> X5 = X6 ) ) ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_7,axiom,
! [X4,X1] :
( lhs_atom6(X4,X1)
| ap(i(X1),X4) = X4 ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_8,axiom,
( lhs_atom11
| i(bool) != i(bool) ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_9,axiom,
( lhs_atom10
| i(bool) = i(bool) ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_10,axiom,
( lhs_atom8
| ~ $true ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_11,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_12,axiom,
( lhs_atom2
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_13,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_14,axiom,
! [X3,X2,X1] :
( lhs_atom4(X3,X2,X1)
| ! [X7] :
( mem(X7,arr(X1,X2))
=> ( ! [X4] :
( mem(X4,X1)
=> ap(X3,X4) = ap(X7,X4) )
=> X3 = X7 ) ) ),
c_0_0 ).
fof(c_0_15,axiom,
! [X1] :
( lhs_atom3(X1)
| ! [X4] :
( mem(X4,X1)
=> ! [X8] :
( mem(X8,X1)
=> ( p(ap(ap(c_2Emin_2E_3D(X1),X4),X8))
<=> X4 = X8 ) ) ) ),
c_0_1 ).
fof(c_0_16,axiom,
! [X3,X2,X1] :
( lhs_atom4(X3,X2,X1)
| ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
c_0_2 ).
fof(c_0_17,axiom,
! [X9] :
( lhs_atom9(X9)
| mem(c_2Emin_2E_3D(X9),arr(X9,arr(X9,bool))) ),
c_0_3 ).
fof(c_0_18,axiom,
! [X8,X4,X1] :
( lhs_atom6(X4,X1)
| ap(k(X1,X8),X4) = X8 ),
c_0_4 ).
fof(c_0_19,axiom,
! [X1] :
( lhs_atom3(X1)
| ! [X2] :
( ne(X2)
=> ne(arr(X1,X2)) ) ),
c_0_5 ).
fof(c_0_20,axiom,
! [X5] :
( lhs_atom5(X5)
| ! [X6] :
( mem(X6,bool)
=> ( ( p(X5)
<=> p(X6) )
=> X5 = X6 ) ) ),
c_0_6 ).
fof(c_0_21,axiom,
! [X4,X1] :
( lhs_atom6(X4,X1)
| ap(i(X1),X4) = X4 ),
c_0_7 ).
fof(c_0_22,plain,
( lhs_atom11
| i(bool) != i(bool) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_23,axiom,
( lhs_atom10
| i(bool) = i(bool) ),
c_0_9 ).
fof(c_0_24,plain,
lhs_atom8,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_25,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_26,plain,
lhs_atom2,
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_28,plain,
! [X8,X9,X10,X11] :
( ( mem(esk1_4(X8,X9,X10,X11),X10)
| X8 = X11
| ~ mem(X11,arr(X10,X9))
| lhs_atom4(X8,X9,X10) )
& ( ap(X8,esk1_4(X8,X9,X10,X11)) != ap(X11,esk1_4(X8,X9,X10,X11))
| X8 = X11
| ~ mem(X11,arr(X10,X9))
| lhs_atom4(X8,X9,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
fof(c_0_29,plain,
! [X9,X10,X11] :
( ( ~ p(ap(ap(c_2Emin_2E_3D(X9),X10),X11))
| X10 = X11
| ~ mem(X11,X9)
| ~ mem(X10,X9)
| lhs_atom3(X9) )
& ( X10 != X11
| p(ap(ap(c_2Emin_2E_3D(X9),X10),X11))
| ~ mem(X11,X9)
| ~ mem(X10,X9)
| lhs_atom3(X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_30,plain,
! [X5,X6,X7,X8] :
( lhs_atom4(X5,X6,X7)
| ~ mem(X8,X7)
| mem(ap(X5,X8),X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_31,plain,
! [X10] :
( lhs_atom9(X10)
| mem(c_2Emin_2E_3D(X10),arr(X10,arr(X10,bool))) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_32,plain,
! [X9,X10,X11] :
( lhs_atom6(X10,X11)
| ap(k(X11,X9),X10) = X9 ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_33,plain,
! [X3,X4] :
( lhs_atom3(X3)
| ~ ne(X4)
| ne(arr(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_34,plain,
! [X7,X8] :
( ( ~ p(X7)
| ~ p(X8)
| X7 = X8
| ~ mem(X8,bool)
| lhs_atom5(X7) )
& ( p(X7)
| p(X8)
| X7 = X8
| ~ mem(X8,bool)
| lhs_atom5(X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
fof(c_0_35,plain,
! [X5,X6] :
( lhs_atom6(X5,X6)
| ap(i(X6),X5) = X5 ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_36,plain,
( lhs_atom11
| i(bool) != i(bool) ),
c_0_22 ).
fof(c_0_37,axiom,
( lhs_atom10
| i(bool) = i(bool) ),
c_0_23 ).
fof(c_0_38,plain,
lhs_atom8,
c_0_24 ).
fof(c_0_39,plain,
lhs_atom7,
c_0_25 ).
fof(c_0_40,plain,
lhs_atom2,
c_0_26 ).
fof(c_0_41,plain,
lhs_atom1,
c_0_27 ).
cnf(c_0_42,plain,
( lhs_atom4(X1,X2,X3)
| X1 = X4
| ~ mem(X4,arr(X3,X2))
| ap(X1,esk1_4(X1,X2,X3,X4)) != ap(X4,esk1_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_43,plain,
( lhs_atom4(X1,X2,X3)
| X1 = X4
| mem(esk1_4(X1,X2,X3,X4),X3)
| ~ mem(X4,arr(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_44,plain,
( lhs_atom3(X1)
| X2 = X3
| ~ mem(X2,X1)
| ~ mem(X3,X1)
| ~ p(ap(ap(c_2Emin_2E_3D(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_45,plain,
( lhs_atom3(X1)
| p(ap(ap(c_2Emin_2E_3D(X1),X2),X3))
| ~ mem(X2,X1)
| ~ mem(X3,X1)
| X2 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_46,plain,
( mem(ap(X1,X2),X3)
| lhs_atom4(X1,X3,X4)
| ~ mem(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_47,plain,
( mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))
| lhs_atom9(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_48,plain,
( ap(k(X1,X2),X3) = X2
| lhs_atom6(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_49,plain,
( ne(arr(X1,X2))
| lhs_atom3(X1)
| ~ ne(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_50,plain,
( lhs_atom5(X1)
| X1 = X2
| ~ mem(X2,bool)
| ~ p(X2)
| ~ p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,plain,
( lhs_atom5(X1)
| X1 = X2
| p(X2)
| p(X1)
| ~ mem(X2,bool) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,plain,
( ap(i(X1),X2) = X2
| lhs_atom6(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,plain,
( lhs_atom11
| $false ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_54,plain,
( i(bool) = i(bool)
| lhs_atom10 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_55,plain,
lhs_atom8,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_56,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_57,plain,
lhs_atom2,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_58,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_59,plain,
( lhs_atom4(X1,X2,X3)
| X1 = X4
| ~ mem(X4,arr(X3,X2))
| ap(X1,esk1_4(X1,X2,X3,X4)) != ap(X4,esk1_4(X1,X2,X3,X4)) ),
c_0_42,
[final] ).
cnf(c_0_60,plain,
( lhs_atom4(X1,X2,X3)
| X1 = X4
| mem(esk1_4(X1,X2,X3,X4),X3)
| ~ mem(X4,arr(X3,X2)) ),
c_0_43,
[final] ).
cnf(c_0_61,plain,
( lhs_atom3(X1)
| X2 = X3
| ~ mem(X2,X1)
| ~ mem(X3,X1)
| ~ p(ap(ap(c_2Emin_2E_3D(X1),X2),X3)) ),
c_0_44,
[final] ).
cnf(c_0_62,plain,
( lhs_atom3(X1)
| p(ap(ap(c_2Emin_2E_3D(X1),X2),X3))
| ~ mem(X2,X1)
| ~ mem(X3,X1)
| X2 != X3 ),
c_0_45,
[final] ).
cnf(c_0_63,plain,
( mem(ap(X1,X2),X3)
| lhs_atom4(X1,X3,X4)
| ~ mem(X2,X4) ),
c_0_46,
[final] ).
cnf(c_0_64,plain,
( mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool)))
| lhs_atom9(X1) ),
c_0_47,
[final] ).
cnf(c_0_65,plain,
( ap(k(X1,X2),X3) = X2
| lhs_atom6(X3,X1) ),
c_0_48,
[final] ).
cnf(c_0_66,plain,
( ne(arr(X1,X2))
| lhs_atom3(X1)
| ~ ne(X2) ),
c_0_49,
[final] ).
cnf(c_0_67,plain,
( lhs_atom5(X1)
| X1 = X2
| ~ mem(X2,bool)
| ~ p(X2)
| ~ p(X1) ),
c_0_50,
[final] ).
cnf(c_0_68,plain,
( lhs_atom5(X1)
| X1 = X2
| p(X2)
| p(X1)
| ~ mem(X2,bool) ),
c_0_51,
[final] ).
cnf(c_0_69,plain,
( ap(i(X1),X2) = X2
| lhs_atom6(X2,X1) ),
c_0_52,
[final] ).
cnf(c_0_70,plain,
( lhs_atom11
| $false ),
c_0_53,
[final] ).
cnf(c_0_71,plain,
( i(bool) = i(bool)
| lhs_atom10 ),
c_0_54,
[final] ).
cnf(c_0_72,plain,
lhs_atom8,
c_0_55,
[final] ).
cnf(c_0_73,plain,
lhs_atom7,
c_0_56,
[final] ).
cnf(c_0_74,plain,
lhs_atom2,
c_0_57,
[final] ).
cnf(c_0_75,plain,
lhs_atom1,
c_0_58,
[final] ).
% End CNF derivation
cnf(c_0_59_0,axiom,
( ~ mem(X1,arr(X3,X2))
| X1 = X4
| ~ mem(X4,arr(X3,X2))
| ap(X1,sk1_esk1_4(X1,X2,X3,X4)) != ap(X4,sk1_esk1_4(X1,X2,X3,X4)) ),
inference(unfold_definition,[status(thm)],[c_0_59,def_lhs_atom4]) ).
cnf(c_0_60_0,axiom,
( ~ mem(X1,arr(X3,X2))
| X1 = X4
| mem(sk1_esk1_4(X1,X2,X3,X4),X3)
| ~ mem(X4,arr(X3,X2)) ),
inference(unfold_definition,[status(thm)],[c_0_60,def_lhs_atom4]) ).
cnf(c_0_61_0,axiom,
( ~ ne(X1)
| X2 = X3
| ~ mem(X2,X1)
| ~ mem(X3,X1)
| ~ p(ap(ap(c_2Emin_2E_3D(X1),X2),X3)) ),
inference(unfold_definition,[status(thm)],[c_0_61,def_lhs_atom3]) ).
cnf(c_0_62_0,axiom,
( ~ ne(X1)
| p(ap(ap(c_2Emin_2E_3D(X1),X2),X3))
| ~ mem(X2,X1)
| ~ mem(X3,X1)
| X2 != X3 ),
inference(unfold_definition,[status(thm)],[c_0_62,def_lhs_atom3]) ).
cnf(c_0_63_0,axiom,
( ~ mem(X1,arr(X4,X3))
| mem(ap(X1,X2),X3)
| ~ mem(X2,X4) ),
inference(unfold_definition,[status(thm)],[c_0_63,def_lhs_atom4]) ).
cnf(c_0_64_0,axiom,
( ~ ne(X1)
| mem(c_2Emin_2E_3D(X1),arr(X1,arr(X1,bool))) ),
inference(unfold_definition,[status(thm)],[c_0_64,def_lhs_atom9]) ).
cnf(c_0_65_0,axiom,
( ~ mem(X3,X1)
| ap(k(X1,X2),X3) = X2 ),
inference(unfold_definition,[status(thm)],[c_0_65,def_lhs_atom6]) ).
cnf(c_0_66_0,axiom,
( ~ ne(X1)
| ne(arr(X1,X2))
| ~ ne(X2) ),
inference(unfold_definition,[status(thm)],[c_0_66,def_lhs_atom3]) ).
cnf(c_0_67_0,axiom,
( ~ mem(X1,bool)
| X1 = X2
| ~ mem(X2,bool)
| ~ p(X2)
| ~ p(X1) ),
inference(unfold_definition,[status(thm)],[c_0_67,def_lhs_atom5]) ).
cnf(c_0_68_0,axiom,
( ~ mem(X1,bool)
| X1 = X2
| p(X2)
| p(X1)
| ~ mem(X2,bool) ),
inference(unfold_definition,[status(thm)],[c_0_68,def_lhs_atom5]) ).
cnf(c_0_69_0,axiom,
( ~ mem(X2,X1)
| ap(i(X1),X2) = X2 ),
inference(unfold_definition,[status(thm)],[c_0_69,def_lhs_atom6]) ).
cnf(c_0_70_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_70,def_lhs_atom11]) ).
cnf(c_0_71_0,axiom,
( ~ $true
| i(bool) = i(bool) ),
inference(unfold_definition,[status(thm)],[c_0_71,def_lhs_atom10]) ).
cnf(c_0_72_0,axiom,
p(c_2Ebool_2ET),
inference(unfold_definition,[status(thm)],[c_0_72,def_lhs_atom8]) ).
cnf(c_0_73_0,axiom,
mem(c_2Ebool_2ET,bool),
inference(unfold_definition,[status(thm)],[c_0_73,def_lhs_atom7]) ).
cnf(c_0_74_0,axiom,
ne(ind),
inference(unfold_definition,[status(thm)],[c_0_74,def_lhs_atom2]) ).
cnf(c_0_75_0,axiom,
ne(bool),
inference(unfold_definition,[status(thm)],[c_0_75,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
$true,
file('<stdin>',conj_thm_2Ebool_2ETRUTH) ).
fof(c_0_1_002,negated_conjecture,
~ $true,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_0])]) ).
fof(c_0_2_003,negated_conjecture,
~ $true,
c_0_1 ).
cnf(c_0_3_004,negated_conjecture,
$false,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
$false,
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_17,negated_conjecture,
$false,
file('/export/starexec/sandbox2/tmp/iprover_modulo_7af80d.p',c_0_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : ITP001+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.11/0.14 % Command : iprover_modulo %s %d
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 2 22:48:28 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % Running in mono-core mode
% 0.22/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.43 % FOF problem with conjecture
% 0.22/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/sandbox2/tmp/iprover_proof_8dde67.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_7af80d.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_7ffa27 | grep -v "SZS"
% 0.22/0.46
% 0.22/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.46
% 0.22/0.46 %
% 0.22/0.46 % ------ iProver source info
% 0.22/0.46
% 0.22/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.46 % git: non_committed_changes: true
% 0.22/0.46 % git: last_make_outside_of_git: true
% 0.22/0.46
% 0.22/0.46 %
% 0.22/0.46 % ------ Input Options
% 0.22/0.46
% 0.22/0.46 % --out_options all
% 0.22/0.46 % --tptp_safe_out true
% 0.22/0.46 % --problem_path ""
% 0.22/0.46 % --include_path ""
% 0.22/0.46 % --clausifier .//eprover
% 0.22/0.46 % --clausifier_options --tstp-format
% 0.22/0.46 % --stdin false
% 0.22/0.46 % --dbg_backtrace false
% 0.22/0.46 % --dbg_dump_prop_clauses false
% 0.22/0.46 % --dbg_dump_prop_clauses_file -
% 0.22/0.46 % --dbg_out_stat false
% 0.22/0.46
% 0.22/0.46 % ------ General Options
% 0.22/0.46
% 0.22/0.46 % --fof false
% 0.22/0.46 % --time_out_real 150.
% 0.22/0.46 % --time_out_prep_mult 0.2
% 0.22/0.46 % --time_out_virtual -1.
% 0.22/0.46 % --schedule none
% 0.22/0.46 % --ground_splitting input
% 0.22/0.46 % --splitting_nvd 16
% 0.22/0.46 % --non_eq_to_eq false
% 0.22/0.46 % --prep_gs_sim true
% 0.22/0.46 % --prep_unflatten false
% 0.22/0.46 % --prep_res_sim true
% 0.22/0.46 % --prep_upred true
% 0.22/0.46 % --res_sim_input true
% 0.22/0.46 % --clause_weak_htbl true
% 0.22/0.46 % --gc_record_bc_elim false
% 0.22/0.46 % --symbol_type_check false
% 0.22/0.46 % --clausify_out false
% 0.22/0.46 % --large_theory_mode false
% 0.22/0.46 % --prep_sem_filter none
% 0.22/0.46 % --prep_sem_filter_out false
% 0.22/0.46 % --preprocessed_out false
% 0.22/0.46 % --sub_typing false
% 0.22/0.46 % --brand_transform false
% 0.22/0.46 % --pure_diseq_elim true
% 0.22/0.46 % --min_unsat_core false
% 0.22/0.46 % --pred_elim true
% 0.22/0.46 % --add_important_lit false
% 0.22/0.46 % --soft_assumptions false
% 0.22/0.46 % --reset_solvers false
% 0.22/0.46 % --bc_imp_inh []
% 0.22/0.46 % --conj_cone_tolerance 1.5
% 0.22/0.46 % --prolific_symb_bound 500
% 0.22/0.46 % --lt_threshold 2000
% 0.22/0.46
% 0.22/0.46 % ------ SAT Options
% 0.22/0.46
% 0.22/0.46 % --sat_mode false
% 0.22/0.46 % --sat_fm_restart_options ""
% 0.22/0.46 % --sat_gr_def false
% 0.22/0.46 % --sat_epr_types true
% 0.22/0.46 % --sat_non_cyclic_types false
% 0.22/0.46 % --sat_finite_models false
% 0.22/0.46 % --sat_fm_lemmas false
% 0.22/0.46 % --sat_fm_prep false
% 0.22/0.46 % --sat_fm_uc_incr true
% 0.22/0.46 % --sat_out_model small
% 0.22/0.46 % --sat_out_clauses false
% 0.22/0.46
% 0.22/0.46 % ------ QBF Options
% 0.22/0.46
% 0.22/0.46 % --qbf_mode false
% 0.22/0.46 % --qbf_elim_univ true
% 0.22/0.46 % --qbf_sk_in true
% 0.22/0.46 % --qbf_pred_elim true
% 0.22/0.46 % --qbf_split 32
% 0.22/0.46
% 0.22/0.46 % ------ BMC1 Options
% 0.22/0.46
% 0.22/0.46 % --bmc1_incremental false
% 0.22/0.46 % --bmc1_axioms reachable_all
% 0.22/0.46 % --bmc1_min_bound 0
% 0.22/0.46 % --bmc1_max_bound -1
% 0.22/0.46 % --bmc1_max_bound_default -1
% 0.22/0.46 % --bmc1_symbol_reachability true
% 0.22/0.46 % --bmc1_property_lemmas false
% 0.22/0.46 % --bmc1_k_induction false
% 0.22/0.46 % --bmc1_non_equiv_states false
% 0.22/0.46 % --bmc1_deadlock false
% 0.22/0.46 % --bmc1_ucm false
% 0.22/0.46 % --bmc1_add_unsat_core none
% 0.22/0.46 % --bmc1_unsat_core_children false
% 0.22/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.46 % --bmc1_out_stat full
% 0.22/0.46 % --bmc1_ground_init false
% 0.22/0.46 % --bmc1_pre_inst_next_state false
% 0.22/0.46 % --bmc1_pre_inst_state false
% 0.22/0.46 % --bmc1_pre_inst_reach_state false
% 0.22/0.46 % --bmc1_out_unsat_core false
% 0.22/0.46 % --bmc1_aig_witness_out false
% 0.22/0.46 % --bmc1_verbose false
% 0.22/0.46 % --bmc1_dump_clauses_tptp false
% 0.22/0.46 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.46 % --bmc1_dump_file -
% 0.22/0.46 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.46 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.46 % --bmc1_ucm_extend_mode 1
% 0.22/0.46 % --bmc1_ucm_init_mode 2
% 0.22/0.46 % --bmc1_ucm_cone_mode none
% 0.22/0.46 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.46 % --bmc1_ucm_relax_model 4
% 0.22/0.46 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.46 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.46 % --bmc1_ucm_layered_model none
% 0.22/0.46 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.46
% 0.22/0.46 % ------ AIG Options
% 0.22/0.46
% 0.22/0.46 % --aig_mode false
% 0.22/0.46
% 0.22/0.46 % ------ Instantiation Options
% 0.22/0.46
% 0.22/0.46 % --instantiation_flag true
% 0.22/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.46 % --inst_solver_per_active 750
% 0.22/0.46 % --inst_solver_calls_frac 0.5
% 0.22/0.46 % --inst_passive_queue_type priority_queues
% 0.22/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.46 % --inst_passive_queues_freq [25;2]
% 0.22/0.46 % --inst_dismatching true
% 0.22/0.46 % --inst_eager_unprocessed_to_passive true
% 0.22/0.46 % --inst_prop_sim_given true
% 0.22/0.46 % --inst_prop_sim_new false
% 0.22/0.46 % --inst_orphan_elimination true
% 0.22/0.46 % --inst_learning_loop_flag true
% 0.22/0.46 % --inst_learning_start 3000
% 0.22/0.46 % --inst_learning_factor 2
% 0.22/0.46 % --inst_start_prop_sim_after_learn 3
% 0.22/0.46 % --inst_sel_renew solver
% 0.22/0.46 % --inst_lit_activity_flag true
% 0.22/0.46 % --inst_out_proof true
% 0.22/0.46
% 0.22/0.46 % ------ Resolution Options
% 0.22/0.46
% 0.22/0.46 % --resolution_flag true
% 0.22/0.46 % --res_lit_sel kbo_max
% 0.22/0.46 % --res_to_prop_solver none
% 0.22/0.46 % --res_prop_simpl_new false
% 0.22/0.46 % --res_prop_simpl_given false
% 0.22/0.46 % --res_passive_queue_type priority_queues
% 0.22/0.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.46 % --res_passive_queues_freq [15;5]
% 0.22/0.46 % --res_forward_subs full
% 0.22/0.46 % --res_backward_subs full
% 0.22/0.46 % --res_forward_subs_resolution true
% 0.22/0.46 % --res_backward_subs_resolution true
% 0.22/0.46 % --res_orphan_elimination false
% 0.22/0.46 % --res_time_limit 1000.
% 0.22/0.46 % --res_out_proof true
% 0.22/0.46 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_8dde67.s
% 0.22/0.46 % --modulo true
% 0.22/0.46
% 0.22/0.46 % ------ Combination Options
% 0.22/0.46
% 0.22/0.46 % --comb_res_mult 1000
% 0.22/0.46 % --comb_inst_mult 300
% 0.22/0.46 % ------
% 0.22/0.46
% 0.22/0.46 % ------ Parsing...%
% 0.22/0.46
% 0.22/0.46
% 0.22/0.46 % Resolution empty clause
% 0.22/0.46
% 0.22/0.46 % ------ Statistics
% 0.22/0.46
% 0.22/0.46 % ------ General
% 0.22/0.46
% 0.22/0.46 % num_of_input_clauses: 18
% 0.22/0.46 % num_of_input_neg_conjectures: 1
% 0.22/0.46 % num_of_splits: 0
% 0.22/0.46 % num_of_split_atoms: 0
% 0.22/0.46 % num_of_sem_filtered_clauses: 0
% 0.22/0.46 % num_of_subtypes: 0
% 0.22/0.46 % monotx_restored_types: 0
% 0.22/0.46 % sat_num_of_epr_types: 0
% 0.22/0.46 % sat_num_of_non_cyclic_types: 0
% 0.22/0.46 % sat_guarded_non_collapsed_types: 0
% 0.22/0.46 % is_epr: 0
% 0.22/0.46 % is_horn: 0
% 0.22/0.46 % has_eq: 0
% 0.22/0.46 % num_pure_diseq_elim: 0
% 0.22/0.46 % simp_replaced_by: 0
% 0.22/0.46 % res_preprocessed: 0
% 0.22/0.46 % prep_upred: 0
% 0.22/0.46 % prep_unflattend: 0
% 0.22/0.46 % pred_elim_cands: 0
% 0.22/0.46 % pred_elim: 0
% 0.22/0.46 % pred_elim_cl: 0
% 0.22/0.46 % pred_elim_cycles: 0
% 0.22/0.46 % forced_gc_time: 0
% 0.22/0.46 % gc_basic_clause_elim: 0
% 0.22/0.46 % parsing_time: 0.
% 0.22/0.46 % sem_filter_time: 0.
% 0.22/0.46 % pred_elim_time: 0.
% 0.22/0.46 % out_proof_time: 0.
% 0.22/0.46 % monotx_time: 0.
% 0.22/0.46 % subtype_inf_time: 0.
% 0.22/0.46 % unif_index_cands_time: 0.
% 0.22/0.46 % unif_index_add_time: 0.
% 0.22/0.46 % total_time: 0.018
% 0.22/0.46 % num_of_symbols: 37
% 0.22/0.46 % num_of_terms: 127
% 0.22/0.46
% 0.22/0.46 % ------ Propositional Solver
% 0.22/0.46
% 0.22/0.46 % prop_solver_calls: 0
% 0.22/0.46 % prop_fast_solver_calls: 0
% 0.22/0.46 % prop_num_of_clauses: 0
% 0.22/0.46 % prop_preprocess_simplified: 0
% 0.22/0.46 % prop_fo_subsumed: 0
% 0.22/0.46 % prop_solver_time: 0.
% 0.22/0.46 % prop_fast_solver_time: 0.
% 0.22/0.46 % prop_unsat_core_time: 0.
% 0.22/0.46
% 0.22/0.46 % ------ QBF
% 0.22/0.46
% 0.22/0.46 % qbf_q_res: 0
% 0.22/0.46 % qbf_num_tautologies: 0
% 0.22/0.46 % qbf_prep_cycles: 0
% 0.22/0.46
% 0.22/0.46 % ------ BMC1
% 0.22/0.46
% 0.22/0.46 % bmc1_current_bound: -1
% 0.22/0.46 % bmc1_last_solved_bound: -1
% 0.22/0.46 % bmc1_unsat_core_size: -1
% 0.22/0.46 % bmc1_unsat_core_parents_size: -1
% 0.22/0.46 % bmc1_merge_next_fun: 0
% 0.22/0.46 % bmc1_unsat_core_clauses_time: 0.
% 0.22/0.46
% 0.22/0.46 % ------ Instantiation
% 0.22/0.46
% 0.22/0.46 % inst_num_of_clauses: undef
% 0.22/0.46 % inst_num_in_passive: undef
% 0.22/0.46 % inst_num_in_active: 0
% 0.22/0.46 % inst_num_in_unprocessed: 0
% 0.22/0.46 % inst_num_of_loops: 0
% 0.22/0.46 % inst_num_of_learning_restarts: 0
% 0.22/0.46 % inst_num_moves_active_passive: 0
% 0.22/0.46 % inst_lit_activity: 0
% 0.22/0.46 % inst_lit_activity_moves: 0
% 0.22/0.46 % inst_num_tautologies: 0
% 0.22/0.46 % inst_num_prop_implied: 0
% 0.22/0.46 % inst_num_existing_simplified: 0
% 0.22/0.46 % inst_num_eq_res_simplified: 0
% 0.22/0.46 % inst_num_child_elim: 0
% 0.22/0.46 % inst_num_of_dismatching_blockings: 0
% 0.22/0.46 % inst_num_of_non_proper_insts: 0
% 0.22/0.46 % inst_num_of_duplicates: 0
% 0.22/0.46 % inst_inst_num_from_inst_to_res: 0
% 0.22/0.46 % inst_dismatching_checking_time: 0.
% 0.22/0.46
% 0.22/0.46 % ------ Resolution
% 0.22/0.46
% 0.22/0.46 % res_num_of_clauses: undef
% 0.22/0.46 % res_num_in_passive: undef
% 0.22/0.46 % res_num_in_active: 0
% 0.22/0.46 % res_num_of_loops: 0
% 0.22/0.46 % res_forward_subset_subsumed: 0
% 0.22/0.46 % res_backward_subset_subsumed: 0
% 0.22/0.46 % res_forward_subsumed: 0
% 0.22/0.46 % res_backward_subsumed: 0
% 0.22/0.46 % res_forward_subsumption_resolution: 0
% 0.22/0.46 % res_backward_subsumption_resolution: 0
% 0.22/0.46 % res_clause_to_clause_subsumption: 0
% 0.22/0.46 % res_orphan_elimination: 0
% 0.22/0.46 % res_tautology_del: 0
% 0.22/0.46 % res_num_eq_res_simplified: 0
% 0.22/0.46 % res_num_sel_changes: 0
% 0.22/0.46 % res_moves_from_active_to_pass: 0
% 0.22/0.46
% 0.22/0.46 % Status Unsatisfiable
% 0.22/0.46 % SZS status Theorem
% 0.22/0.46 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------