%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU255+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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:26:32 EDT 2022
% Result : Theorem 1.32s 1.59s
% Output : CNFRefutation 1.32s
% 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(t2_subset,axiom,
! [A,B] :
( element(A,B)
=> ( empty(B)
| in(A,B) ) ),
input ).
fof(t2_subset_0,plain,
! [A,B] :
( ~ element(A,B)
| empty(B)
| in(A,B) ),
inference(orientation,[status(thm)],[t2_subset]) ).
fof(t2_boole,axiom,
! [A] : set_intersection2(A,empty_set) = empty_set,
input ).
fof(t2_boole_0,plain,
! [A] :
( set_intersection2(A,empty_set) = empty_set
| $false ),
inference(orientation,[status(thm)],[t2_boole]) ).
fof(t1_subset,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ),
input ).
fof(t1_subset_0,plain,
! [A,B] :
( ~ in(A,B)
| element(A,B) ),
inference(orientation,[status(thm)],[t1_subset]) ).
fof(t16_wellord1,axiom,
! [A,B,C] :
( relation(C)
=> ( in(A,relation_restriction(C,B))
<=> ( in(A,C)
& in(A,cartesian_product2(B,B)) ) ) ),
input ).
fof(t16_wellord1_0,plain,
! [A,B,C] :
( ~ relation(C)
| ( in(A,relation_restriction(C,B))
<=> ( in(A,C)
& in(A,cartesian_product2(B,B)) ) ) ),
inference(orientation,[status(thm)],[t16_wellord1]) ).
fof(l3_wellord1,axiom,
! [A] :
( relation(A)
=> ( antisymmetric(A)
<=> ! [B,C] :
( ( in(ordered_pair(B,C),A)
& in(ordered_pair(C,B),A) )
=> B = C ) ) ),
input ).
fof(l3_wellord1_0,plain,
! [A] :
( ~ relation(A)
| ( antisymmetric(A)
<=> ! [B,C] :
( ( in(ordered_pair(B,C),A)
& in(ordered_pair(C,B),A) )
=> B = C ) ) ),
inference(orientation,[status(thm)],[l3_wellord1]) ).
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_zfmisc_1,axiom,
! [A,B] : ~ empty(ordered_pair(A,B)),
input ).
fof(fc1_zfmisc_1_0,plain,
! [A,B] :
( ~ empty(ordered_pair(A,B))
| $false ),
inference(orientation,[status(thm)],[fc1_zfmisc_1]) ).
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_m1_subset_1,axiom,
$true,
input ).
fof(dt_m1_subset_1_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_m1_subset_1]) ).
fof(dt_k4_tarski,axiom,
$true,
input ).
fof(dt_k4_tarski_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_k4_tarski]) ).
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_k2_zfmisc_1,axiom,
$true,
input ).
fof(dt_k2_zfmisc_1_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_k2_zfmisc_1]) ).
fof(dt_k2_wellord1,axiom,
! [A,B] :
( relation(A)
=> relation(relation_restriction(A,B)) ),
input ).
fof(dt_k2_wellord1_0,plain,
! [A,B] :
( ~ relation(A)
| relation(relation_restriction(A,B)) ),
inference(orientation,[status(thm)],[dt_k2_wellord1]) ).
fof(dt_k2_tarski,axiom,
$true,
input ).
fof(dt_k2_tarski_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_k2_tarski]) ).
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(dt_k1_tarski,axiom,
$true,
input ).
fof(dt_k1_tarski_0,plain,
( $true
| $false ),
inference(orientation,[status(thm)],[dt_k1_tarski]) ).
fof(d6_wellord1,axiom,
! [A] :
( relation(A)
=> ! [B] : relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B)) ),
input ).
fof(d6_wellord1_0,plain,
! [A] :
( ~ relation(A)
| ! [B] : relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B)) ),
inference(orientation,[status(thm)],[d6_wellord1]) ).
fof(d5_tarski,axiom,
! [A,B] : ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)),
input ).
fof(d5_tarski_0,plain,
! [A,B] :
( ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))
| $false ),
inference(orientation,[status(thm)],[d5_tarski]) ).
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(commutativity_k2_tarski,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
input ).
fof(commutativity_k2_tarski_0,plain,
! [A,B] :
( unordered_pair(A,B) = unordered_pair(B,A)
| $false ),
inference(orientation,[status(thm)],[commutativity_k2_tarski]) ).
fof(cc1_funct_1,axiom,
! [A] :
( empty(A)
=> function(A) ),
input ).
fof(cc1_funct_1_0,plain,
! [A] :
( ~ empty(A)
| function(A) ),
inference(orientation,[status(thm)],[cc1_funct_1]) ).
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,
! [A] :
( lhs_atom2(A)
<=> ~ empty(A) ),
inference(definition,[],[]) ).
fof(to_be_clausified_1,plain,
! [A] :
( lhs_atom2(A)
| function(A) ),
inference(fold_definition,[status(thm)],[cc1_funct_1_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [B,A] :
( lhs_atom3(B,A)
<=> unordered_pair(A,B) = unordered_pair(B,A) ),
inference(definition,[],[]) ).
fof(to_be_clausified_2,plain,
! [A,B] :
( lhs_atom3(B,A)
| $false ),
inference(fold_definition,[status(thm)],[commutativity_k2_tarski_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [B,A] :
( lhs_atom4(B,A)
<=> set_intersection2(A,B) = set_intersection2(B,A) ),
inference(definition,[],[]) ).
fof(to_be_clausified_3,plain,
! [A,B] :
( lhs_atom4(B,A)
| $false ),
inference(fold_definition,[status(thm)],[commutativity_k3_xboole_0_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [B,A] :
( lhs_atom5(B,A)
<=> ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_4,plain,
! [A,B] :
( lhs_atom5(B,A)
| $false ),
inference(fold_definition,[status(thm)],[d5_tarski_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [A] :
( lhs_atom6(A)
<=> ~ relation(A) ),
inference(definition,[],[]) ).
fof(to_be_clausified_5,plain,
! [A] :
( lhs_atom6(A)
| ! [B] : relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B)) ),
inference(fold_definition,[status(thm)],[d6_wellord1_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
( lhs_atom7
<=> $true ),
inference(definition,[],[]) ).
fof(to_be_clausified_6,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[dt_k1_tarski_0,def_lhs_atom7]) ).
fof(to_be_clausified_7,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[dt_k1_xboole_0_0,def_lhs_atom7]) ).
fof(to_be_clausified_8,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[dt_k2_tarski_0,def_lhs_atom7]) ).
fof(to_be_clausified_9,plain,
! [A,B] :
( lhs_atom6(A)
| relation(relation_restriction(A,B)) ),
inference(fold_definition,[status(thm)],[dt_k2_wellord1_0,def_lhs_atom6]) ).
fof(to_be_clausified_10,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[dt_k2_zfmisc_1_0,def_lhs_atom7]) ).
fof(to_be_clausified_11,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[dt_k3_xboole_0_0,def_lhs_atom7]) ).
fof(to_be_clausified_12,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[dt_k4_tarski_0,def_lhs_atom7]) ).
fof(to_be_clausified_13,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[dt_m1_subset_1_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
( lhs_atom8
<=> empty(empty_set) ),
inference(definition,[],[]) ).
fof(to_be_clausified_14,plain,
( lhs_atom8
| $false ),
inference(fold_definition,[status(thm)],[fc1_xboole_0_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [B,A] :
( lhs_atom9(B,A)
<=> ~ empty(ordered_pair(A,B)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_15,plain,
! [A,B] :
( lhs_atom9(B,A)
| $false ),
inference(fold_definition,[status(thm)],[fc1_zfmisc_1_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
! [A] :
( lhs_atom10(A)
<=> set_intersection2(A,A) = A ),
inference(definition,[],[]) ).
fof(to_be_clausified_16,plain,
! [A] :
( lhs_atom10(A)
| $false ),
inference(fold_definition,[status(thm)],[idempotence_k3_xboole_0_0,def_lhs_atom10]) ).
fof(to_be_clausified_17,plain,
! [A] :
( lhs_atom6(A)
| ( antisymmetric(A)
<=> ! [B,C] :
( ( in(ordered_pair(B,C),A)
& in(ordered_pair(C,B),A) )
=> B = C ) ) ),
inference(fold_definition,[status(thm)],[l3_wellord1_0,def_lhs_atom6]) ).
fof(def_lhs_atom11,axiom,
! [C] :
( lhs_atom11(C)
<=> ~ relation(C) ),
inference(definition,[],[]) ).
fof(to_be_clausified_18,plain,
! [A,B,C] :
( lhs_atom11(C)
| ( in(A,relation_restriction(C,B))
<=> ( in(A,C)
& in(A,cartesian_product2(B,B)) ) ) ),
inference(fold_definition,[status(thm)],[t16_wellord1_0,def_lhs_atom11]) ).
fof(to_be_clausified_19,plain,
! [A,B] :
( lhs_atom1(B,A)
| element(A,B) ),
inference(fold_definition,[status(thm)],[t1_subset_0,def_lhs_atom1]) ).
fof(def_lhs_atom12,axiom,
! [A] :
( lhs_atom12(A)
<=> set_intersection2(A,empty_set) = empty_set ),
inference(definition,[],[]) ).
fof(to_be_clausified_20,plain,
! [A] :
( lhs_atom12(A)
| $false ),
inference(fold_definition,[status(thm)],[t2_boole_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
! [B,A] :
( lhs_atom13(B,A)
<=> ~ element(A,B) ),
inference(definition,[],[]) ).
fof(to_be_clausified_21,plain,
! [A,B] :
( lhs_atom13(B,A)
| empty(B)
| in(A,B) ),
inference(fold_definition,[status(thm)],[t2_subset_0,def_lhs_atom13]) ).
fof(to_be_clausified_22,plain,
! [A] :
( lhs_atom2(A)
| A = empty_set ),
inference(fold_definition,[status(thm)],[t6_boole_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2] :
( lhs_atom6(X2)
| ( antisymmetric(X2)
<=> ! [X1,X3] :
( ( in(ordered_pair(X1,X3),X2)
& in(ordered_pair(X3,X1),X2) )
=> X1 = X3 ) ) ),
file('<stdin>',to_be_clausified_17) ).
fof(c_0_1,axiom,
! [X3,X1,X2] :
( lhs_atom11(X3)
| ( in(X2,relation_restriction(X3,X1))
<=> ( in(X2,X3)
& in(X2,cartesian_product2(X1,X1)) ) ) ),
file('<stdin>',to_be_clausified_18) ).
fof(c_0_2,axiom,
! [X2] :
( lhs_atom6(X2)
| ! [X1] : relation_restriction(X2,X1) = set_intersection2(X2,cartesian_product2(X1,X1)) ),
file('<stdin>',to_be_clausified_5) ).
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_atom6(X2)
| relation(relation_restriction(X2,X1)) ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_5,axiom,
! [X1,X2] :
( lhs_atom13(X1,X2)
| empty(X1)
| in(X2,X1) ),
file('<stdin>',to_be_clausified_21) ).
fof(c_0_6,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| element(X2,X1) ),
file('<stdin>',to_be_clausified_19) ).
fof(c_0_7,axiom,
! [X1,X2] :
( lhs_atom9(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_8,axiom,
! [X1,X2] :
( lhs_atom5(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_9,axiom,
! [X1,X2] :
( lhs_atom4(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_10,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_11,axiom,
! [X2] :
( lhs_atom2(X2)
| function(X2) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_12,axiom,
! [X2] :
( lhs_atom2(X2)
| X2 = empty_set ),
file('<stdin>',to_be_clausified_22) ).
fof(c_0_13,axiom,
! [X2] :
( lhs_atom12(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_20) ).
fof(c_0_14,axiom,
! [X2] :
( lhs_atom10(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_16) ).
fof(c_0_15,axiom,
( lhs_atom8
| ~ $true ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_16,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_17,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_18,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_19,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_20,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_21,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_22,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_23,axiom,
! [X2] :
( lhs_atom6(X2)
| ( antisymmetric(X2)
<=> ! [X1,X3] :
( ( in(ordered_pair(X1,X3),X2)
& in(ordered_pair(X3,X1),X2) )
=> X1 = X3 ) ) ),
c_0_0 ).
fof(c_0_24,axiom,
! [X3,X1,X2] :
( lhs_atom11(X3)
| ( in(X2,relation_restriction(X3,X1))
<=> ( in(X2,X3)
& in(X2,cartesian_product2(X1,X1)) ) ) ),
c_0_1 ).
fof(c_0_25,axiom,
! [X2] :
( lhs_atom6(X2)
| ! [X1] : relation_restriction(X2,X1) = set_intersection2(X2,cartesian_product2(X1,X1)) ),
c_0_2 ).
fof(c_0_26,plain,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_27,axiom,
! [X1,X2] :
( lhs_atom6(X2)
| relation(relation_restriction(X2,X1)) ),
c_0_4 ).
fof(c_0_28,axiom,
! [X1,X2] :
( lhs_atom13(X1,X2)
| empty(X1)
| in(X2,X1) ),
c_0_5 ).
fof(c_0_29,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| element(X2,X1) ),
c_0_6 ).
fof(c_0_30,plain,
! [X1,X2] : lhs_atom9(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_31,plain,
! [X1,X2] : lhs_atom5(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_32,plain,
! [X1,X2] : lhs_atom4(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_33,plain,
! [X1,X2] : lhs_atom3(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_34,axiom,
! [X2] :
( lhs_atom2(X2)
| function(X2) ),
c_0_11 ).
fof(c_0_35,axiom,
! [X2] :
( lhs_atom2(X2)
| X2 = empty_set ),
c_0_12 ).
fof(c_0_36,plain,
! [X2] : lhs_atom12(X2),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_37,plain,
! [X2] : lhs_atom10(X2),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_38,plain,
lhs_atom8,
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_39,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_40,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_41,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_42,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_43,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_44,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_21]) ).
fof(c_0_45,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_46,plain,
! [X4,X5,X6] :
( ( ~ antisymmetric(X4)
| ~ in(ordered_pair(X5,X6),X4)
| ~ in(ordered_pair(X6,X5),X4)
| X5 = X6
| lhs_atom6(X4) )
& ( in(ordered_pair(esk1_1(X4),esk2_1(X4)),X4)
| antisymmetric(X4)
| lhs_atom6(X4) )
& ( in(ordered_pair(esk2_1(X4),esk1_1(X4)),X4)
| antisymmetric(X4)
| lhs_atom6(X4) )
& ( esk1_1(X4) != esk2_1(X4)
| antisymmetric(X4)
| lhs_atom6(X4) ) ),
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_23])])])])]) ).
fof(c_0_47,plain,
! [X4,X5,X6,X7,X8] :
( ( in(X6,X4)
| ~ in(X6,relation_restriction(X4,X5))
| lhs_atom11(X4) )
& ( in(X6,cartesian_product2(X5,X5))
| ~ in(X6,relation_restriction(X4,X5))
| lhs_atom11(X4) )
& ( ~ in(X8,X4)
| ~ in(X8,cartesian_product2(X7,X7))
| in(X8,relation_restriction(X4,X7))
| lhs_atom11(X4) ) ),
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_24])])])])]) ).
fof(c_0_48,plain,
! [X3,X4] :
( lhs_atom6(X3)
| relation_restriction(X3,X4) = set_intersection2(X3,cartesian_product2(X4,X4)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_25])]) ).
fof(c_0_49,plain,
! [X3,X4] :
( lhs_atom1(X3,X4)
| ~ in(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_50,plain,
! [X3,X4] :
( lhs_atom6(X4)
| relation(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_51,plain,
! [X3,X4] :
( lhs_atom13(X3,X4)
| empty(X3)
| in(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_52,plain,
! [X3,X4] :
( lhs_atom1(X3,X4)
| element(X4,X3) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_53,plain,
! [X3,X4] : lhs_atom9(X3,X4),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_54,plain,
! [X3,X4] : lhs_atom5(X3,X4),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_55,plain,
! [X3,X4] : lhs_atom4(X3,X4),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_56,plain,
! [X3,X4] : lhs_atom3(X3,X4),
inference(variable_rename,[status(thm)],[c_0_33]) ).
fof(c_0_57,plain,
! [X3] :
( lhs_atom2(X3)
| function(X3) ),
inference(variable_rename,[status(thm)],[c_0_34]) ).
fof(c_0_58,plain,
! [X3] :
( lhs_atom2(X3)
| X3 = empty_set ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
fof(c_0_59,plain,
! [X3] : lhs_atom12(X3),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_60,plain,
! [X3] : lhs_atom10(X3),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_61,plain,
lhs_atom8,
c_0_38 ).
fof(c_0_62,plain,
lhs_atom7,
c_0_39 ).
fof(c_0_63,plain,
lhs_atom7,
c_0_40 ).
fof(c_0_64,plain,
lhs_atom7,
c_0_41 ).
fof(c_0_65,plain,
lhs_atom7,
c_0_42 ).
fof(c_0_66,plain,
lhs_atom7,
c_0_43 ).
fof(c_0_67,plain,
lhs_atom7,
c_0_44 ).
fof(c_0_68,plain,
lhs_atom7,
c_0_45 ).
cnf(c_0_69,plain,
( lhs_atom6(X1)
| X2 = X3
| ~ in(ordered_pair(X3,X2),X1)
| ~ in(ordered_pair(X2,X3),X1)
| ~ antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_70,plain,
( lhs_atom11(X1)
| in(X2,relation_restriction(X1,X3))
| ~ in(X2,cartesian_product2(X3,X3))
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_71,plain,
( lhs_atom11(X1)
| in(X2,cartesian_product2(X3,X3))
| ~ in(X2,relation_restriction(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_72,plain,
( lhs_atom11(X1)
| in(X2,X1)
| ~ in(X2,relation_restriction(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_73,plain,
( lhs_atom6(X1)
| antisymmetric(X1)
| in(ordered_pair(esk1_1(X1),esk2_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_74,plain,
( lhs_atom6(X1)
| antisymmetric(X1)
| in(ordered_pair(esk2_1(X1),esk1_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_75,plain,
( relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2))
| lhs_atom6(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_76,plain,
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_77,plain,
( relation(relation_restriction(X1,X2))
| lhs_atom6(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_78,plain,
( in(X1,X2)
| empty(X2)
| lhs_atom13(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_79,plain,
( element(X1,X2)
| lhs_atom1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_80,plain,
( lhs_atom6(X1)
| antisymmetric(X1)
| esk1_1(X1) != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_81,plain,
lhs_atom9(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_82,plain,
lhs_atom5(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_83,plain,
lhs_atom4(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_84,plain,
lhs_atom3(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_85,plain,
( function(X1)
| lhs_atom2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_86,plain,
( X1 = empty_set
| lhs_atom2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_87,plain,
lhs_atom12(X1),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_88,plain,
lhs_atom10(X1),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_89,plain,
lhs_atom8,
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_90,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_91,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_92,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_93,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_94,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_95,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_96,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_97,plain,
( lhs_atom6(X1)
| X2 = X3
| ~ in(ordered_pair(X3,X2),X1)
| ~ in(ordered_pair(X2,X3),X1)
| ~ antisymmetric(X1) ),
c_0_69,
[final] ).
cnf(c_0_98,plain,
( lhs_atom11(X1)
| in(X2,relation_restriction(X1,X3))
| ~ in(X2,cartesian_product2(X3,X3))
| ~ in(X2,X1) ),
c_0_70,
[final] ).
cnf(c_0_99,plain,
( lhs_atom11(X1)
| in(X2,cartesian_product2(X3,X3))
| ~ in(X2,relation_restriction(X1,X3)) ),
c_0_71,
[final] ).
cnf(c_0_100,plain,
( lhs_atom11(X1)
| in(X2,X1)
| ~ in(X2,relation_restriction(X1,X3)) ),
c_0_72,
[final] ).
cnf(c_0_101,plain,
( lhs_atom6(X1)
| antisymmetric(X1)
| in(ordered_pair(esk1_1(X1),esk2_1(X1)),X1) ),
c_0_73,
[final] ).
cnf(c_0_102,plain,
( lhs_atom6(X1)
| antisymmetric(X1)
| in(ordered_pair(esk2_1(X1),esk1_1(X1)),X1) ),
c_0_74,
[final] ).
cnf(c_0_103,plain,
( set_intersection2(X1,cartesian_product2(X2,X2)) = relation_restriction(X1,X2)
| lhs_atom6(X1) ),
c_0_75,
[final] ).
cnf(c_0_104,plain,
( lhs_atom1(X1,X2)
| ~ in(X1,X2) ),
c_0_76,
[final] ).
cnf(c_0_105,plain,
( relation(relation_restriction(X1,X2))
| lhs_atom6(X1) ),
c_0_77,
[final] ).
cnf(c_0_106,plain,
( in(X1,X2)
| empty(X2)
| lhs_atom13(X2,X1) ),
c_0_78,
[final] ).
cnf(c_0_107,plain,
( element(X1,X2)
| lhs_atom1(X2,X1) ),
c_0_79,
[final] ).
cnf(c_0_108,plain,
( lhs_atom6(X1)
| antisymmetric(X1)
| esk2_1(X1) != esk1_1(X1) ),
c_0_80,
[final] ).
cnf(c_0_109,plain,
lhs_atom9(X1,X2),
c_0_81,
[final] ).
cnf(c_0_110,plain,
lhs_atom5(X1,X2),
c_0_82,
[final] ).
cnf(c_0_111,plain,
lhs_atom4(X1,X2),
c_0_83,
[final] ).
cnf(c_0_112,plain,
lhs_atom3(X1,X2),
c_0_84,
[final] ).
cnf(c_0_113,plain,
( function(X1)
| lhs_atom2(X1) ),
c_0_85,
[final] ).
cnf(c_0_114,plain,
( X1 = empty_set
| lhs_atom2(X1) ),
c_0_86,
[final] ).
cnf(c_0_115,plain,
lhs_atom12(X1),
c_0_87,
[final] ).
cnf(c_0_116,plain,
lhs_atom10(X1),
c_0_88,
[final] ).
cnf(c_0_117,plain,
lhs_atom8,
c_0_89,
[final] ).
cnf(c_0_118,plain,
lhs_atom7,
c_0_90,
[final] ).
cnf(c_0_119,plain,
lhs_atom7,
c_0_91,
[final] ).
cnf(c_0_120,plain,
lhs_atom7,
c_0_92,
[final] ).
cnf(c_0_121,plain,
lhs_atom7,
c_0_93,
[final] ).
cnf(c_0_122,plain,
lhs_atom7,
c_0_94,
[final] ).
cnf(c_0_123,plain,
lhs_atom7,
c_0_95,
[final] ).
cnf(c_0_124,plain,
lhs_atom7,
c_0_96,
[final] ).
% End CNF derivation
cnf(c_0_97_0,axiom,
( ~ relation(X1)
| X2 = X3
| ~ in(ordered_pair(X3,X2),X1)
| ~ in(ordered_pair(X2,X3),X1)
| ~ antisymmetric(X1) ),
inference(unfold_definition,[status(thm)],[c_0_97,def_lhs_atom6]) ).
cnf(c_0_98_0,axiom,
( ~ relation(X1)
| in(X2,relation_restriction(X1,X3))
| ~ in(X2,cartesian_product2(X3,X3))
| ~ in(X2,X1) ),
inference(unfold_definition,[status(thm)],[c_0_98,def_lhs_atom11]) ).
cnf(c_0_99_0,axiom,
( ~ relation(X1)
| in(X2,cartesian_product2(X3,X3))
| ~ in(X2,relation_restriction(X1,X3)) ),
inference(unfold_definition,[status(thm)],[c_0_99,def_lhs_atom11]) ).
cnf(c_0_100_0,axiom,
( ~ relation(X1)
| in(X2,X1)
| ~ in(X2,relation_restriction(X1,X3)) ),
inference(unfold_definition,[status(thm)],[c_0_100,def_lhs_atom11]) ).
cnf(c_0_101_0,axiom,
( ~ relation(X1)
| antisymmetric(X1)
| in(ordered_pair(sk1_esk1_1(X1),sk1_esk2_1(X1)),X1) ),
inference(unfold_definition,[status(thm)],[c_0_101,def_lhs_atom6]) ).
cnf(c_0_102_0,axiom,
( ~ relation(X1)
| antisymmetric(X1)
| in(ordered_pair(sk1_esk2_1(X1),sk1_esk1_1(X1)),X1) ),
inference(unfold_definition,[status(thm)],[c_0_102,def_lhs_atom6]) ).
cnf(c_0_103_0,axiom,
( ~ relation(X1)
| set_intersection2(X1,cartesian_product2(X2,X2)) = relation_restriction(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_103,def_lhs_atom6]) ).
cnf(c_0_104_0,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_104,def_lhs_atom1]) ).
cnf(c_0_105_0,axiom,
( ~ relation(X1)
| relation(relation_restriction(X1,X2)) ),
inference(unfold_definition,[status(thm)],[c_0_105,def_lhs_atom6]) ).
cnf(c_0_106_0,axiom,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(unfold_definition,[status(thm)],[c_0_106,def_lhs_atom13]) ).
cnf(c_0_107_0,axiom,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(unfold_definition,[status(thm)],[c_0_107,def_lhs_atom1]) ).
cnf(c_0_108_0,axiom,
( ~ relation(X1)
| antisymmetric(X1)
| sk1_esk2_1(X1) != sk1_esk1_1(X1) ),
inference(unfold_definition,[status(thm)],[c_0_108,def_lhs_atom6]) ).
cnf(c_0_113_0,axiom,
( ~ empty(X1)
| function(X1) ),
inference(unfold_definition,[status(thm)],[c_0_113,def_lhs_atom2]) ).
cnf(c_0_114_0,axiom,
( ~ empty(X1)
| X1 = empty_set ),
inference(unfold_definition,[status(thm)],[c_0_114,def_lhs_atom2]) ).
cnf(c_0_109_0,axiom,
~ empty(ordered_pair(X2,X1)),
inference(unfold_definition,[status(thm)],[c_0_109,def_lhs_atom9]) ).
cnf(c_0_110_0,axiom,
ordered_pair(X2,X1) = unordered_pair(unordered_pair(X2,X1),singleton(X2)),
inference(unfold_definition,[status(thm)],[c_0_110,def_lhs_atom5]) ).
cnf(c_0_111_0,axiom,
set_intersection2(X2,X1) = set_intersection2(X1,X2),
inference(unfold_definition,[status(thm)],[c_0_111,def_lhs_atom4]) ).
cnf(c_0_112_0,axiom,
unordered_pair(X2,X1) = unordered_pair(X1,X2),
inference(unfold_definition,[status(thm)],[c_0_112,def_lhs_atom3]) ).
cnf(c_0_115_0,axiom,
set_intersection2(X1,empty_set) = empty_set,
inference(unfold_definition,[status(thm)],[c_0_115,def_lhs_atom12]) ).
cnf(c_0_116_0,axiom,
set_intersection2(X1,X1) = X1,
inference(unfold_definition,[status(thm)],[c_0_116,def_lhs_atom10]) ).
cnf(c_0_117_0,axiom,
empty(empty_set),
inference(unfold_definition,[status(thm)],[c_0_117,def_lhs_atom8]) ).
cnf(c_0_118_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_118,def_lhs_atom7]) ).
cnf(c_0_119_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_119,def_lhs_atom7]) ).
cnf(c_0_120_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_120,def_lhs_atom7]) ).
cnf(c_0_121_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_121,def_lhs_atom7]) ).
cnf(c_0_122_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_122,def_lhs_atom7]) ).
cnf(c_0_123_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_123,def_lhs_atom7]) ).
cnf(c_0_124_0,axiom,
$true,
inference(unfold_definition,[status(thm)],[c_0_124,def_lhs_atom7]) ).
% 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] :
( ( relation(X1)
& empty(X1)
& function(X1) )
=> ( relation(X1)
& function(X1)
& one_to_one(X1) ) ),
file('<stdin>',cc2_funct_1) ).
fof(c_0_2_003,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('<stdin>',existence_m1_subset_1) ).
fof(c_0_3_004,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('<stdin>',t8_boole) ).
fof(c_0_4_005,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_5_006,axiom,
? [X1] :
( relation(X1)
& function(X1) ),
file('<stdin>',rc1_funct_1) ).
fof(c_0_6_007,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_7_008,axiom,
? [X1] :
( relation(X1)
& empty(X1)
& function(X1) ),
file('<stdin>',rc2_funct_1) ).
fof(c_0_8_009,axiom,
? [X1] :
( relation(X1)
& function(X1)
& one_to_one(X1) ),
file('<stdin>',rc3_funct_1) ).
fof(c_0_9_010,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
c_0_0 ).
fof(c_0_10_011,axiom,
! [X1] :
( ( relation(X1)
& empty(X1)
& function(X1) )
=> ( relation(X1)
& function(X1)
& one_to_one(X1) ) ),
c_0_1 ).
fof(c_0_11_012,axiom,
! [X1] :
? [X2] : element(X2,X1),
c_0_2 ).
fof(c_0_12_013,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
c_0_3 ).
fof(c_0_13_014,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_14_015,axiom,
? [X1] :
( relation(X1)
& function(X1) ),
c_0_5 ).
fof(c_0_15_016,axiom,
? [X1] : empty(X1),
c_0_6 ).
fof(c_0_16_017,axiom,
? [X1] :
( relation(X1)
& empty(X1)
& function(X1) ),
c_0_7 ).
fof(c_0_17_018,axiom,
? [X1] :
( relation(X1)
& function(X1)
& one_to_one(X1) ),
c_0_8 ).
fof(c_0_18_019,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
fof(c_0_19_020,plain,
! [X2] :
( ( relation(X2)
| ~ relation(X2)
| ~ empty(X2)
| ~ function(X2) )
& ( function(X2)
| ~ relation(X2)
| ~ empty(X2)
| ~ function(X2) )
& ( one_to_one(X2)
| ~ relation(X2)
| ~ empty(X2)
| ~ function(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_20_021,plain,
! [X3] : element(esk6_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
fof(c_0_21_022,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_12])])])]) ).
fof(c_0_22_023,plain,
~ empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
fof(c_0_23_024,plain,
( relation(esk5_0)
& function(esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
fof(c_0_24_025,plain,
empty(esk4_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
fof(c_0_25_026,plain,
( relation(esk3_0)
& empty(esk3_0)
& function(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
fof(c_0_26_027,plain,
( relation(esk1_0)
& function(esk1_0)
& one_to_one(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
cnf(c_0_27_028,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28_029,plain,
( relation(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29_030,plain,
( function(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30_031,plain,
( one_to_one(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31_032,plain,
element(esk6_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32_033,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33_034,plain,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34_035,plain,
relation(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35_036,plain,
function(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36_037,plain,
empty(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37_038,plain,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38_039,plain,
empty(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_39_040,plain,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_40_041,plain,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_41_042,plain,
function(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42_043,plain,
one_to_one(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_43_044,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
c_0_27,
[final] ).
cnf(c_0_44_045,plain,
( relation(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
c_0_28,
[final] ).
cnf(c_0_45_046,plain,
( function(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
c_0_29,
[final] ).
cnf(c_0_46_047,plain,
( one_to_one(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
c_0_30,
[final] ).
cnf(c_0_47_048,plain,
element(esk6_1(X1),X1),
c_0_31,
[final] ).
cnf(c_0_48_049,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
c_0_32,
[final] ).
cnf(c_0_49_050,plain,
~ empty(esk2_0),
c_0_33,
[final] ).
cnf(c_0_50_051,plain,
relation(esk5_0),
c_0_34,
[final] ).
cnf(c_0_51_052,plain,
function(esk5_0),
c_0_35,
[final] ).
cnf(c_0_52_053,plain,
empty(esk4_0),
c_0_36,
[final] ).
cnf(c_0_53_054,plain,
relation(esk3_0),
c_0_37,
[final] ).
cnf(c_0_54_055,plain,
empty(esk3_0),
c_0_38,
[final] ).
cnf(c_0_55_056,plain,
function(esk3_0),
c_0_39,
[final] ).
cnf(c_0_56_057,plain,
relation(esk1_0),
c_0_40,
[final] ).
cnf(c_0_57_058,plain,
function(esk1_0),
c_0_41,
[final] ).
cnf(c_0_58_059,plain,
one_to_one(esk1_0),
c_0_42,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_43_0,axiom,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_1,axiom,
( ~ in(X2,X1)
| ~ empty(X1) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_44_0,axiom,
( relation(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( ~ function(X1)
| relation(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_2,axiom,
( ~ empty(X1)
| ~ function(X1)
| relation(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_3,axiom,
( ~ relation(X1)
| ~ empty(X1)
| ~ function(X1)
| relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( function(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( ~ function(X1)
| function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_2,axiom,
( ~ empty(X1)
| ~ function(X1)
| function(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_3,axiom,
( ~ relation(X1)
| ~ empty(X1)
| ~ function(X1)
| function(X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( one_to_one(X1)
| ~ function(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( ~ function(X1)
| one_to_one(X1)
| ~ empty(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_2,axiom,
( ~ empty(X1)
| ~ function(X1)
| one_to_one(X1)
| ~ relation(X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_3,axiom,
( ~ relation(X1)
| ~ empty(X1)
| ~ function(X1)
| one_to_one(X1) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_48_0,axiom,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ empty(X1)
| X2 = X1
| ~ empty(X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ empty(X2)
| ~ empty(X1)
| X2 = X1 ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
~ empty(sk2_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_47_0,axiom,
element(sk2_esk6_1(X1),X1),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_50_0,axiom,
relation(sk2_esk5_0),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
function(sk2_esk5_0),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_52_0,axiom,
empty(sk2_esk4_0),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
relation(sk2_esk3_0),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
empty(sk2_esk3_0),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_55_0,axiom,
function(sk2_esk3_0),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_56_0,axiom,
relation(sk2_esk1_0),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_57_0,axiom,
function(sk2_esk1_0),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_58_0,axiom,
one_to_one(sk2_esk1_0),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_060,conjecture,
! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
file('<stdin>',t25_wellord1) ).
fof(c_0_1_061,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_062,negated_conjecture,
( relation(esk2_0)
& antisymmetric(esk2_0)
& ~ antisymmetric(relation_restriction(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_063,negated_conjecture,
~ antisymmetric(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_064,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_065,negated_conjecture,
antisymmetric(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_066,negated_conjecture,
~ antisymmetric(relation_restriction(esk2_0,esk1_0)),
c_0_3,
[final] ).
cnf(c_0_7_067,negated_conjecture,
relation(esk2_0),
c_0_4,
[final] ).
cnf(c_0_8_068,negated_conjecture,
antisymmetric(esk2_0),
c_0_5,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_55,plain,
( ~ antisymmetric(X0)
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X1),X0)
| X1 = X2
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_97_0) ).
cnf(c_155,plain,
( ~ antisymmetric(X0)
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X1),X0)
| X1 = X2
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_20091,plain,
( ~ in(ordered_pair(sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),X0)
| ~ in(ordered_pair(sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),X0)
| ~ relation(X0)
| ~ antisymmetric(X0)
| sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)) = sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)) ),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_20268,plain,
( ~ in(ordered_pair(sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),sk3_esk2_0)
| ~ in(ordered_pair(sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),sk3_esk2_0)
| ~ relation(sk3_esk2_0)
| ~ antisymmetric(sk3_esk2_0)
| sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)) = sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)) ),
inference(instantiation,[status(thm)],[c_20091]) ).
cnf(c_52,plain,
( ~ in(X0,relation_restriction(X1,X2))
| in(X0,X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_100_0) ).
cnf(c_152,plain,
( ~ in(X0,relation_restriction(X1,X2))
| in(X0,X1)
| ~ relation(X1) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_19799,plain,
( ~ in(X0,relation_restriction(sk3_esk2_0,X1))
| in(X0,sk3_esk2_0)
| ~ relation(sk3_esk2_0) ),
inference(instantiation,[status(thm)],[c_152]) ).
cnf(c_20107,plain,
( ~ in(ordered_pair(sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),relation_restriction(sk3_esk2_0,sk3_esk1_0))
| in(ordered_pair(sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),sk3_esk2_0)
| ~ relation(sk3_esk2_0) ),
inference(instantiation,[status(thm)],[c_19799]) ).
cnf(c_20099,plain,
( ~ in(ordered_pair(sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),relation_restriction(sk3_esk2_0,sk3_esk1_0))
| in(ordered_pair(sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),sk3_esk2_0)
| ~ relation(sk3_esk2_0) ),
inference(instantiation,[status(thm)],[c_19799]) ).
cnf(c_47,plain,
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_105_0) ).
cnf(c_147,plain,
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_19755,plain,
( relation(relation_restriction(sk3_esk2_0,X0))
| ~ relation(sk3_esk2_0) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_20004,plain,
( relation(relation_restriction(sk3_esk2_0,sk3_esk1_0))
| ~ relation(sk3_esk2_0) ),
inference(instantiation,[status(thm)],[c_19755]) ).
cnf(c_50,plain,
( in(ordered_pair(sk1_esk2_1(X0),sk1_esk1_1(X0)),X0)
| antisymmetric(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_102_0) ).
cnf(c_150,plain,
( in(ordered_pair(sk1_esk2_1(X0),sk1_esk1_1(X0)),X0)
| antisymmetric(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_19811,plain,
( in(ordered_pair(sk1_esk2_1(relation_restriction(sk3_esk2_0,X0)),sk1_esk1_1(relation_restriction(sk3_esk2_0,X0))),relation_restriction(sk3_esk2_0,X0))
| ~ relation(relation_restriction(sk3_esk2_0,X0))
| antisymmetric(relation_restriction(sk3_esk2_0,X0)) ),
inference(instantiation,[status(thm)],[c_150]) ).
cnf(c_19924,plain,
( in(ordered_pair(sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),relation_restriction(sk3_esk2_0,sk3_esk1_0))
| ~ relation(relation_restriction(sk3_esk2_0,sk3_esk1_0))
| antisymmetric(relation_restriction(sk3_esk2_0,sk3_esk1_0)) ),
inference(instantiation,[status(thm)],[c_19811]) ).
cnf(c_51,plain,
( in(ordered_pair(sk1_esk1_1(X0),sk1_esk2_1(X0)),X0)
| antisymmetric(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_101_0) ).
cnf(c_151,plain,
( in(ordered_pair(sk1_esk1_1(X0),sk1_esk2_1(X0)),X0)
| antisymmetric(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_19810,plain,
( in(ordered_pair(sk1_esk1_1(relation_restriction(sk3_esk2_0,X0)),sk1_esk2_1(relation_restriction(sk3_esk2_0,X0))),relation_restriction(sk3_esk2_0,X0))
| ~ relation(relation_restriction(sk3_esk2_0,X0))
| antisymmetric(relation_restriction(sk3_esk2_0,X0)) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_19923,plain,
( in(ordered_pair(sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)),sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0))),relation_restriction(sk3_esk2_0,sk3_esk1_0))
| ~ relation(relation_restriction(sk3_esk2_0,sk3_esk1_0))
| antisymmetric(relation_restriction(sk3_esk2_0,sk3_esk1_0)) ),
inference(instantiation,[status(thm)],[c_19810]) ).
cnf(c_44,plain,
( sk1_esk2_1(X0) != sk1_esk1_1(X0)
| antisymmetric(X0)
| ~ relation(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_108_0) ).
cnf(c_144,plain,
( sk1_esk2_1(X0) != sk1_esk1_1(X0)
| antisymmetric(X0)
| ~ relation(X0) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_19812,plain,
( ~ relation(relation_restriction(sk3_esk2_0,X0))
| antisymmetric(relation_restriction(sk3_esk2_0,X0))
| sk1_esk2_1(relation_restriction(sk3_esk2_0,X0)) != sk1_esk1_1(relation_restriction(sk3_esk2_0,X0)) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_19922,plain,
( ~ relation(relation_restriction(sk3_esk2_0,sk3_esk1_0))
| antisymmetric(relation_restriction(sk3_esk2_0,sk3_esk1_0))
| sk1_esk2_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)) != sk1_esk1_1(relation_restriction(sk3_esk2_0,sk3_esk1_0)) ),
inference(instantiation,[status(thm)],[c_19812]) ).
cnf(c_56,negated_conjecture,
~ antisymmetric(relation_restriction(sk3_esk2_0,sk3_esk1_0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_6) ).
cnf(c_57,negated_conjecture,
relation(sk3_esk2_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_7) ).
cnf(c_58,negated_conjecture,
antisymmetric(sk3_esk2_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p',c_0_8) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_20268,c_20107,c_20099,c_20004,c_19924,c_19923,c_19922,c_56,c_57,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU255+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n027.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 06:12:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.34 % Running in mono-core mode
% 0.18/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.18/0.40 % FOF problem with conjecture
% 0.18/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_b69929.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_cfcce7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_cfabd4 | 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.38/0.63 % --bmc1_dump_unsat_core_tptp false
% 0.38/0.63 % --bmc1_dump_file -
% 0.38/0.63 % --bmc1_ucm_expand_uc_limit 128
% 0.38/0.63 % --bmc1_ucm_n_expand_iterations 6
% 0.38/0.63 % --bmc1_ucm_extend_mode 1
% 0.38/0.63 % --bmc1_ucm_init_mode 2
% 0.38/0.63 % --bmc1_ucm_cone_mode none
% 0.38/0.63 % --bmc1_ucm_reduced_relation_type 0
% 0.38/0.63 % --bmc1_ucm_relax_model 4
% 0.38/0.63 % --bmc1_ucm_full_tr_after_sat true
% 0.38/0.63 % --bmc1_ucm_expand_neg_assumptions false
% 0.38/0.63 % --bmc1_ucm_layered_model none
% 0.38/0.63 % --bmc1_ucm_max_lemma_size 10
% 0.38/0.63
% 0.38/0.63 % ------ AIG Options
% 0.38/0.63
% 0.38/0.63 % --aig_mode false
% 0.38/0.63
% 0.38/0.63 % ------ Instantiation Options
% 0.38/0.63
% 0.38/0.63 % --instantiation_flag true
% 0.38/0.63 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.38/0.63 % --inst_solver_per_active 750
% 0.38/0.63 % --inst_solver_calls_frac 0.5
% 0.38/0.63 % --inst_passive_queue_type priority_queues
% 0.38/0.63 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.38/0.63 % --inst_passive_queues_freq [25;2]
% 0.38/0.63 % --inst_dismatching true
% 0.38/0.63 % --inst_eager_unprocessed_to_passive true
% 0.38/0.63 % --inst_prop_sim_given true
% 0.38/0.63 % --inst_prop_sim_new false
% 0.38/0.63 % --inst_orphan_elimination true
% 0.38/0.63 % --inst_learning_loop_flag true
% 0.38/0.63 % --inst_learning_start 3000
% 0.38/0.63 % --inst_learning_factor 2
% 0.38/0.63 % --inst_start_prop_sim_after_learn 3
% 0.38/0.63 % --inst_sel_renew solver
% 0.38/0.63 % --inst_lit_activity_flag true
% 0.38/0.63 % --inst_out_proof true
% 0.38/0.63
% 0.38/0.63 % ------ Resolution Options
% 0.38/0.63
% 0.38/0.63 % --resolution_flag true
% 0.38/0.63 % --res_lit_sel kbo_max
% 0.38/0.63 % --res_to_prop_solver none
% 0.38/0.63 % --res_prop_simpl_new false
% 0.38/0.63 % --res_prop_simpl_given false
% 0.38/0.63 % --res_passive_queue_type priority_queues
% 0.38/0.63 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.38/0.63 % --res_passive_queues_freq [15;5]
% 0.38/0.63 % --res_forward_subs full
% 0.38/0.63 % --res_backward_subs full
% 0.38/0.63 % --res_forward_subs_resolution true
% 0.38/0.63 % --res_backward_subs_resolution true
% 0.38/0.63 % --res_orphan_elimination false
% 0.38/0.63 % --res_time_limit 1000.
% 0.38/0.63 % --res_out_proof true
% 0.38/0.63 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b69929.s
% 0.38/0.63 % --modulo true
% 0.38/0.63
% 0.38/0.63 % ------ Combination Options
% 0.38/0.63
% 0.38/0.63 % --comb_res_mult 1000
% 0.38/0.63 % --comb_inst_mult 300
% 0.38/0.63 % ------
% 0.38/0.63
% 0.38/0.63 % ------ Parsing...% successful
% 0.38/0.63
% 0.38/0.63 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.38/0.63
% 0.38/0.63 % ------ Proving...
% 0.38/0.63 % ------ Problem Properties
% 0.38/0.63
% 0.38/0.63 %
% 0.38/0.63 % EPR false
% 0.38/0.63 % Horn false
% 0.38/0.63 % Has equality true
% 0.38/0.63
% 0.38/0.63 % % ------ Input Options Time Limit: Unbounded
% 0.38/0.63
% 0.38/0.63
% 0.38/0.63 Compiling...
% 0.38/0.63 Loading plugin: done.
% 0.38/0.63 Compiling...
% 0.38/0.63 Loading plugin: done.
% 0.38/0.63 % % ------ Current options:
% 0.38/0.63
% 0.38/0.63 % ------ Input Options
% 0.38/0.63
% 0.38/0.63 % --out_options all
% 0.38/0.63 % --tptp_safe_out true
% 0.38/0.63 % --problem_path ""
% 0.38/0.63 % --include_path ""
% 0.38/0.63 % --clausifier .//eprover
% 0.38/0.63 % --clausifier_options --tstp-format
% 0.38/0.63 % --stdin false
% 0.38/0.63 % --dbg_backtrace false
% 0.38/0.63 % --dbg_dump_prop_clauses false
% 0.38/0.63 % --dbg_dump_prop_clauses_file -
% 0.38/0.63 % --dbg_out_stat false
% 0.38/0.63
% 0.38/0.63 % ------ General Options
% 0.38/0.63
% 0.38/0.63 % --fof false
% 0.38/0.63 % --time_out_real 150.
% 0.38/0.63 % --time_out_prep_mult 0.2
% 0.38/0.63 % --time_out_virtual -1.
% 0.38/0.63 % --schedule none
% 0.38/0.63 % --ground_splitting input
% 0.38/0.63 % --splitting_nvd 16
% 0.38/0.63 % --non_eq_to_eq false
% 0.38/0.63 % --prep_gs_sim true
% 0.38/0.63 % --prep_unflatten false
% 0.38/0.63 % --prep_res_sim true
% 0.38/0.63 % --prep_upred true
% 0.38/0.63 % --res_sim_input true
% 0.38/0.63 % --clause_weak_htbl true
% 0.38/0.63 % --gc_record_bc_elim false
% 0.38/0.63 % --symbol_type_check false
% 0.38/0.63 % --clausify_out false
% 0.38/0.63 % --large_theory_mode false
% 0.38/0.63 % --prep_sem_filter none
% 0.38/0.63 % --prep_sem_filter_out false
% 0.38/0.63 % --preprocessed_out false
% 0.38/0.63 % --sub_typing false
% 0.38/0.63 % --brand_transform false
% 0.38/0.63 % --pure_diseq_elim true
% 0.38/0.63 % --min_unsat_core false
% 0.38/0.63 % --pred_elim true
% 0.38/0.63 % --add_important_lit false
% 0.38/0.63 % --soft_assumptions false
% 0.38/0.63 % --reset_solvers false
% 0.38/0.63 % --bc_imp_inh []
% 0.38/0.63 % --conj_cone_tolerance 1.5
% 0.38/0.63 % --prolific_symb_bound 500
% 0.38/0.63 % --lt_threshold 2000
% 0.38/0.63
% 0.38/0.63 % ------ SAT Options
% 0.38/0.63
% 0.38/0.63 % --sat_mode false
% 0.38/0.63 % --sat_fm_restart_options ""
% 0.38/0.63 % --sat_gr_def false
% 0.38/0.63 % --sat_epr_types true
% 0.38/0.63 % --sat_non_cyclic_types false
% 0.38/0.63 % --sat_finite_models false
% 0.38/0.63 % --sat_fm_lemmas false
% 0.38/0.63 % --sat_fm_prep false
% 0.38/0.63 % --sat_fm_uc_incr true
% 0.38/0.63 % --sat_out_model small
% 0.38/0.63 % --sat_out_clauses false
% 0.38/0.63
% 0.38/0.63 % ------ QBF Options
% 0.38/0.63
% 0.38/0.63 % --qbf_mode false
% 0.38/0.63 % --qbf_elim_univ true
% 0.38/0.63 % --qbf_sk_in true
% 0.38/0.63 % --qbf_pred_elim true
% 0.38/0.63 % --qbf_split 32
% 0.38/0.63
% 0.38/0.63 % ------ BMC1 Options
% 0.38/0.63
% 0.38/0.63 % --bmc1_incremental false
% 0.38/0.63 % --bmc1_axioms reachable_all
% 0.38/0.63 % --bmc1_min_bound 0
% 0.38/0.63 % --bmc1_max_bound -1
% 0.38/0.63 % --bmc1_max_bound_default -1
% 0.38/0.63 % --bmc1_symbol_reachability true
% 0.38/0.63 % --bmc1_property_lemmas false
% 0.38/0.63 % --bmc1_k_induction false
% 0.38/0.63 % --bmc1_non_equiv_states false
% 0.38/0.63 % --bmc1_deadlock false
% 0.38/0.63 % --bmc1_ucm false
% 0.38/0.63 % --bmc1_add_unsat_core none
% 0.38/0.63 % --bmc1_unsat_core_children false
% 0.38/0.63 % --bmc1_unsat_core_extrapolate_axioms false
% 0.38/0.63 % --bmc1_out_stat full
% 0.38/0.63 % --bmc1_ground_init false
% 0.38/0.63 % --bmc1_pre_inst_next_state false
% 0.38/0.63 % --bmc1_pre_inst_state false
% 0.38/0.63 % --bmc1_pre_inst_reach_state false
% 0.38/0.63 % --bmc1_out_unsat_core false
% 0.38/0.63 % --bmc1_aig_witness_out false
% 0.38/0.63 % --bmc1_verbose false
% 0.38/0.63 % --bmc1_dump_clauses_tptp false
% 0.38/0.63 % --bmc1_dump_unsat_core_tptp false
% 0.38/0.63 % --bmc1_dump_file -
% 0.38/0.63 % --bmc1_ucm_expand_uc_limit 128
% 0.38/0.63 % --bmc1_ucm_n_expand_iterations 6
% 0.38/0.63 % --bmc1_ucm_extend_mode 1
% 0.38/0.63 % --bmc1_ucm_init_mode 2
% 0.38/0.63 % --bmc1_ucm_cone_mode none
% 0.38/0.63 % --bmc1_ucm_reduced_relation_type 0
% 0.38/0.63 % --bmc1_ucm_relax_model 4
% 0.38/0.63 % --bmc1_ucm_full_tr_after_sat true
% 0.38/0.63 % --bmc1_ucm_expand_neg_assumptions false
% 0.38/0.63 % --bmc1_ucm_layered_model none
% 0.38/0.63 % --bmc1_ucm_max_lemma_size 10
% 0.38/0.63
% 0.38/0.63 % ------ AIG Options
% 0.38/0.63
% 0.38/0.63 % --aig_mode false
% 0.38/0.63
% 0.38/0.63 % ------ Instantiation Options
% 0.38/0.63
% 0.38/0.63 % --instantiation_flag true
% 0.38/0.63 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.38/0.63 % --inst_solver_per_active 750
% 0.38/0.63 % --inst_solver_calls_frac 0.5
% 0.38/0.63 % --inst_passive_queue_type priority_queues
% 0.38/0.63 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.38/0.63 % --inst_passive_queues_freq [25;2]
% 0.38/0.63 % --inst_dismatching true
% 1.32/1.58 % --inst_eager_unprocessed_to_passive true
% 1.32/1.58 % --inst_prop_sim_given true
% 1.32/1.58 % --inst_prop_sim_new false
% 1.32/1.58 % --inst_orphan_elimination true
% 1.32/1.58 % --inst_learning_loop_flag true
% 1.32/1.58 % --inst_learning_start 3000
% 1.32/1.58 % --inst_learning_factor 2
% 1.32/1.58 % --inst_start_prop_sim_after_learn 3
% 1.32/1.58 % --inst_sel_renew solver
% 1.32/1.58 % --inst_lit_activity_flag true
% 1.32/1.58 % --inst_out_proof true
% 1.32/1.58
% 1.32/1.58 % ------ Resolution Options
% 1.32/1.58
% 1.32/1.58 % --resolution_flag true
% 1.32/1.58 % --res_lit_sel kbo_max
% 1.32/1.58 % --res_to_prop_solver none
% 1.32/1.58 % --res_prop_simpl_new false
% 1.32/1.58 % --res_prop_simpl_given false
% 1.32/1.58 % --res_passive_queue_type priority_queues
% 1.32/1.58 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.32/1.58 % --res_passive_queues_freq [15;5]
% 1.32/1.58 % --res_forward_subs full
% 1.32/1.58 % --res_backward_subs full
% 1.32/1.59 % --res_forward_subs_resolution true
% 1.32/1.59 % --res_backward_subs_resolution true
% 1.32/1.59 % --res_orphan_elimination false
% 1.32/1.59 % --res_time_limit 1000.
% 1.32/1.59 % --res_out_proof true
% 1.32/1.59 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_b69929.s
% 1.32/1.59 % --modulo true
% 1.32/1.59
% 1.32/1.59 % ------ Combination Options
% 1.32/1.59
% 1.32/1.59 % --comb_res_mult 1000
% 1.32/1.59 % --comb_inst_mult 300
% 1.32/1.59 % ------
% 1.32/1.59
% 1.32/1.59
% 1.32/1.59
% 1.32/1.59 % ------ Proving...
% 1.32/1.59 %
% 1.32/1.59
% 1.32/1.59
% 1.32/1.59 % ------ Statistics
% 1.32/1.59
% 1.32/1.59 % ------ General
% 1.32/1.59
% 1.32/1.59 % num_of_input_clauses: 59
% 1.32/1.59 % num_of_input_neg_conjectures: 3
% 1.32/1.59 % num_of_splits: 0
% 1.32/1.59 % num_of_split_atoms: 0
% 1.32/1.59 % num_of_sem_filtered_clauses: 0
% 1.32/1.59 % num_of_subtypes: 0
% 1.32/1.59 % monotx_restored_types: 0
% 1.32/1.59 % sat_num_of_epr_types: 0
% 1.32/1.59 % sat_num_of_non_cyclic_types: 0
% 1.32/1.59 % sat_guarded_non_collapsed_types: 0
% 1.32/1.59 % is_epr: 0
% 1.32/1.59 % is_horn: 0
% 1.32/1.59 % has_eq: 1
% 1.32/1.59 % num_pure_diseq_elim: 0
% 1.32/1.59 % simp_replaced_by: 0
% 1.32/1.59 % res_preprocessed: 6
% 1.32/1.59 % prep_upred: 0
% 1.32/1.59 % prep_unflattend: 0
% 1.32/1.59 % pred_elim_cands: 0
% 1.32/1.59 % pred_elim: 0
% 1.32/1.59 % pred_elim_cl: 0
% 1.32/1.59 % pred_elim_cycles: 0
% 1.32/1.59 % forced_gc_time: 0
% 1.32/1.59 % gc_basic_clause_elim: 0
% 1.32/1.59 % parsing_time: 0.001
% 1.32/1.59 % sem_filter_time: 0.
% 1.32/1.59 % pred_elim_time: 0.
% 1.32/1.59 % out_proof_time: 0.
% 1.32/1.59 % monotx_time: 0.
% 1.32/1.59 % subtype_inf_time: 0.
% 1.32/1.59 % unif_index_cands_time: 0.002
% 1.32/1.59 % unif_index_add_time: 0.003
% 1.32/1.59 % total_time: 1.183
% 1.32/1.59 % num_of_symbols: 49
% 1.32/1.59 % num_of_terms: 3862
% 1.32/1.59
% 1.32/1.59 % ------ Propositional Solver
% 1.32/1.59
% 1.32/1.59 % prop_solver_calls: 8
% 1.32/1.59 % prop_fast_solver_calls: 9
% 1.32/1.59 % prop_num_of_clauses: 498
% 1.32/1.59 % prop_preprocess_simplified: 694
% 1.32/1.59 % prop_fo_subsumed: 0
% 1.32/1.59 % prop_solver_time: 0.
% 1.32/1.59 % prop_fast_solver_time: 0.
% 1.32/1.59 % prop_unsat_core_time: 0.
% 1.32/1.59
% 1.32/1.59 % ------ QBF
% 1.32/1.59
% 1.32/1.59 % qbf_q_res: 0
% 1.32/1.59 % qbf_num_tautologies: 0
% 1.32/1.59 % qbf_prep_cycles: 0
% 1.32/1.59
% 1.32/1.59 % ------ BMC1
% 1.32/1.59
% 1.32/1.59 % bmc1_current_bound: -1
% 1.32/1.59 % bmc1_last_solved_bound: -1
% 1.32/1.59 % bmc1_unsat_core_size: -1
% 1.32/1.59 % bmc1_unsat_core_parents_size: -1
% 1.32/1.59 % bmc1_merge_next_fun: 0
% 1.32/1.59 % bmc1_unsat_core_clauses_time: 0.
% 1.32/1.59
% 1.32/1.59 % ------ Instantiation
% 1.32/1.59
% 1.32/1.59 % inst_num_of_clauses: 305
% 1.32/1.59 % inst_num_in_passive: 84
% 1.32/1.59 % inst_num_in_active: 204
% 1.32/1.59 % inst_num_in_unprocessed: 7
% 1.32/1.59 % inst_num_of_loops: 222
% 1.32/1.59 % inst_num_of_learning_restarts: 0
% 1.32/1.59 % inst_num_moves_active_passive: 6
% 1.32/1.59 % inst_lit_activity: 135
% 1.32/1.59 % inst_lit_activity_moves: 0
% 1.32/1.59 % inst_num_tautologies: 8
% 1.32/1.59 % inst_num_prop_implied: 0
% 1.32/1.59 % inst_num_existing_simplified: 0
% 1.32/1.59 % inst_num_eq_res_simplified: 0
% 1.32/1.59 % inst_num_child_elim: 0
% 1.32/1.59 % inst_num_of_dismatching_blockings: 10
% 1.32/1.59 % inst_num_of_non_proper_insts: 135
% 1.32/1.59 % inst_num_of_duplicates: 67
% 1.32/1.59 % inst_inst_num_from_inst_to_res: 0
% 1.32/1.59 % inst_dismatching_checking_time: 0.
% 1.32/1.59
% 1.32/1.59 % ------ Resolution
% 1.32/1.59
% 1.32/1.59 % res_num_of_clauses: 2238
% 1.32/1.59 % res_num_in_passive: 1218
% 1.32/1.59 % res_num_in_active: 953
% 1.32/1.59 % res_num_of_loops: 1000
% 1.32/1.59 % res_forward_subset_subsumed: 2234
% 1.32/1.59 % res_backward_subset_subsumed: 0
% 1.32/1.59 % res_forward_subsumed: 32
% 1.32/1.59 % res_backward_subsumed: 0
% 1.32/1.59 % res_forward_subsumption_resolution: 80
% 1.32/1.59 % res_backward_subsumption_resolution: 0
% 1.32/1.59 % res_clause_to_clause_subsumption: 13052
% 1.32/1.59 % res_orphan_elimination: 0
% 1.32/1.59 % res_tautology_del: 228
% 1.32/1.59 % res_num_eq_res_simplified: 0
% 1.32/1.59 % res_num_sel_changes: 0
% 1.32/1.59 % res_moves_from_active_to_pass: 0
% 1.32/1.59
% 1.32/1.59 % Status Unsatisfiable
% 1.32/1.59 % SZS status Theorem
% 1.32/1.59 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------