%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN550+1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n022.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 : Thu Jul 21 07:29:52 EDT 2022
% Result : Theorem 0.40s 0.60s
% Output : CNFRefutation 0.40s
% 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(transitivity_of_reachable,axiom,
! [X,Y,Z] :
( ( reachable(X,Y)
& reachable(Y,Z) )
=> reachable(X,Z) ),
input ).
fof(transitivity_of_reachable_0,plain,
! [X,Y,Z] :
( reachable(X,Z)
| ~ ( reachable(X,Y)
& reachable(Y,Z) ) ),
inference(orientation,[status(thm)],[transitivity_of_reachable]) ).
fof(reflexivity_of_reachable,axiom,
! [X] : reachable(X,X),
input ).
fof(reflexivity_of_reachable_0,plain,
! [X] :
( reachable(X,X)
| $false ),
inference(orientation,[status(thm)],[reflexivity_of_reachable]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> reachable(X,X) ),
inference(definition,[],[]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_of_reachable_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Z,X] :
( lhs_atom2(Z,X)
<=> reachable(X,Z) ),
inference(definition,[],[]) ).
fof(to_be_clausified_1,plain,
! [X,Y,Z] :
( lhs_atom2(Z,X)
| ~ ( reachable(X,Y)
& reachable(Y,Z) ) ),
inference(fold_definition,[status(thm)],[transitivity_of_reachable_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( reachable(X1,X3)
& reachable(X3,X2) ) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_2,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( reachable(X1,X3)
& reachable(X3,X2) ) ),
c_0_0 ).
fof(c_0_3,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( lhs_atom2(X4,X6)
| ~ reachable(X6,X5)
| ~ reachable(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_5,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( lhs_atom2(X2,X3)
| ~ reachable(X1,X2)
| ~ reachable(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( lhs_atom2(X2,X3)
| ~ reachable(X1,X2)
| ~ reachable(X3,X1) ),
c_0_6,
[final] ).
cnf(c_0_9,plain,
lhs_atom1(X1),
c_0_7,
[final] ).
% End CNF derivation
cnf(c_0_8_0,axiom,
( reachable(X3,X2)
| ~ reachable(X1,X2)
| ~ reachable(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_8,def_lhs_atom2]) ).
cnf(c_0_9_0,axiom,
reachable(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_9,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,
( ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> p(X2) ) )
<=> ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> ? [X3] :
( reachable(X2,X3)
& ! [X4] :
( reachable(X3,X4)
=> p(X4) ) ) ) ) ),
file('<stdin>',prove_this) ).
fof(c_0_1_002,negated_conjecture,
~ ( ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> p(X2) ) )
<=> ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> ? [X3] :
( reachable(X2,X3)
& ! [X4] :
( reachable(X3,X4)
=> p(X4) ) ) ) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
! [X5,X7,X9,X12,X14,X16] :
( ( reachable(X7,esk2_1(X7))
| ~ reachable(initial_world,X7)
| reachable(X5,esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( reachable(X9,esk3_2(X7,X9))
| ~ reachable(esk2_1(X7),X9)
| ~ reachable(initial_world,X7)
| reachable(X5,esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( ~ p(esk3_2(X7,X9))
| ~ reachable(esk2_1(X7),X9)
| ~ reachable(initial_world,X7)
| reachable(X5,esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( reachable(X7,esk2_1(X7))
| ~ reachable(initial_world,X7)
| ~ p(esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( reachable(X9,esk3_2(X7,X9))
| ~ reachable(esk2_1(X7),X9)
| ~ reachable(initial_world,X7)
| ~ p(esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( ~ p(esk3_2(X7,X9))
| ~ reachable(esk2_1(X7),X9)
| ~ reachable(initial_world,X7)
| ~ p(esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( reachable(initial_world,esk5_0)
| reachable(initial_world,esk4_0) )
& ( reachable(X14,esk6_1(X14))
| ~ reachable(esk5_0,X14)
| reachable(initial_world,esk4_0) )
& ( ~ reachable(esk6_1(X14),X16)
| p(X16)
| ~ reachable(esk5_0,X14)
| reachable(initial_world,esk4_0) )
& ( reachable(initial_world,esk5_0)
| ~ reachable(esk4_0,X12)
| p(X12) )
& ( reachable(X14,esk6_1(X14))
| ~ reachable(esk5_0,X14)
| ~ reachable(esk4_0,X12)
| p(X12) )
& ( ~ reachable(esk6_1(X14),X16)
| p(X16)
| ~ reachable(esk5_0,X14)
| ~ reachable(esk4_0,X12)
| p(X12) ) ),
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_1])])])])]) ).
cnf(c_0_3_004,negated_conjecture,
( reachable(X1,esk1_1(X1))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3)
| ~ p(esk3_2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3)
| ~ p(esk3_2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( reachable(X1,esk1_1(X1))
| reachable(X3,esk3_2(X2,X3))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
( reachable(X3,esk3_2(X2,X3))
| ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
( p(X1)
| p(X3)
| ~ reachable(esk4_0,X1)
| ~ reachable(esk5_0,X2)
| ~ reachable(esk6_1(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
( reachable(X1,esk1_1(X1))
| reachable(X2,esk2_1(X2))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9_010,negated_conjecture,
( reachable(X2,esk2_1(X2))
| ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( reachable(initial_world,esk4_0)
| p(X2)
| ~ reachable(esk5_0,X1)
| ~ reachable(esk6_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( p(X1)
| reachable(X2,esk6_1(X2))
| ~ reachable(esk4_0,X1)
| ~ reachable(esk5_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( reachable(initial_world,esk4_0)
| reachable(X1,esk6_1(X1))
| ~ reachable(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( p(X1)
| reachable(initial_world,esk5_0)
| ~ reachable(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( reachable(initial_world,esk4_0)
| reachable(initial_world,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( reachable(X1,esk1_1(X1))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3)
| ~ p(esk3_2(X2,X3)) ),
c_0_3,
[final] ).
cnf(c_0_16,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3)
| ~ p(esk3_2(X2,X3)) ),
c_0_4,
[final] ).
cnf(c_0_17,negated_conjecture,
( reachable(X1,esk1_1(X1))
| reachable(X3,esk3_2(X2,X3))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3) ),
c_0_5,
[final] ).
cnf(c_0_18,negated_conjecture,
( reachable(X3,esk3_2(X2,X3))
| ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3) ),
c_0_6,
[final] ).
cnf(c_0_19,negated_conjecture,
( p(X1)
| p(X3)
| ~ reachable(esk4_0,X1)
| ~ reachable(esk5_0,X2)
| ~ reachable(esk6_1(X2),X3) ),
c_0_7,
[final] ).
cnf(c_0_20,negated_conjecture,
( reachable(X1,esk1_1(X1))
| reachable(X2,esk2_1(X2))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2) ),
c_0_8,
[final] ).
cnf(c_0_21,negated_conjecture,
( reachable(X2,esk2_1(X2))
| ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2) ),
c_0_9,
[final] ).
cnf(c_0_22,negated_conjecture,
( reachable(initial_world,esk4_0)
| p(X2)
| ~ reachable(esk5_0,X1)
| ~ reachable(esk6_1(X1),X2) ),
c_0_10,
[final] ).
cnf(c_0_23,negated_conjecture,
( p(X1)
| reachable(X2,esk6_1(X2))
| ~ reachable(esk4_0,X1)
| ~ reachable(esk5_0,X2) ),
c_0_11,
[final] ).
cnf(c_0_24,negated_conjecture,
( reachable(initial_world,esk4_0)
| reachable(X1,esk6_1(X1))
| ~ reachable(esk5_0,X1) ),
c_0_12,
[final] ).
cnf(c_0_25,negated_conjecture,
( p(X1)
| reachable(initial_world,esk5_0)
| ~ reachable(esk4_0,X1) ),
c_0_13,
[final] ).
cnf(c_0_26,negated_conjecture,
( reachable(initial_world,esk4_0)
| reachable(initial_world,esk5_0) ),
c_0_14,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_12,negated_conjecture,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| p(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_25) ).
cnf(c_134,negated_conjecture,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| p(X0) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_196,negated_conjecture,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| p(X0) ),
inference(copy,[status(esa)],[c_134]) ).
cnf(c_231,negated_conjecture,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| p(X0) ),
inference(copy,[status(esa)],[c_196]) ).
cnf(c_516,negated_conjecture,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| p(X0) ),
inference(copy,[status(esa)],[c_231]) ).
cnf(c_568,negated_conjecture,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| p(X0) ),
inference(copy,[status(esa)],[c_516]) ).
cnf(c_1,plain,
( ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| reachable(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_8_0) ).
cnf(c_546,plain,
( ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| reachable(X0,X2) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_606,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| ~ reachable(X0,X1)
| p(X1) ),
inference(resolution,[status(thm)],[c_568,c_546]) ).
cnf(c_607,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| ~ reachable(X0,X1)
| p(X1) ),
inference(rewriting,[status(thm)],[c_606]) ).
cnf(c_859,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| p(X2) ),
inference(resolution,[status(thm)],[c_607,c_546]) ).
cnf(c_860,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(sk3_esk4_0,X0)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| p(X2) ),
inference(rewriting,[status(thm)],[c_859]) ).
cnf(c_5,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sk3_esk2_1(X0),X2)
| reachable(X2,sk3_esk3_2(X0,X2))
| ~ p(sk3_esk1_1(X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_18) ).
cnf(c_39,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| reachable(X1,sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP6_iProver_split])],[c_5]) ).
cnf(c_66,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| reachable(X1,sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_96,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| reachable(X1,sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_208,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| reachable(X1,sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_219,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| reachable(X1,sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(copy,[status(esa)],[c_208]) ).
cnf(c_508,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| reachable(X1,sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(copy,[status(esa)],[c_219]) ).
cnf(c_552,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| reachable(X1,sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(copy,[status(esa)],[c_508]) ).
cnf(c_1966,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ reachable(sk3_esk4_0,X2)
| ~ reachable(X2,X1)
| p(sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_860,c_552]) ).
cnf(c_1967,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ reachable(sk3_esk4_0,X2)
| ~ reachable(X2,X1)
| p(sk3_esk3_2(X0,X1))
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_1966]) ).
cnf(c_8,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| reachable(X0,sk3_esk2_1(X0))
| ~ p(sk3_esk1_1(X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_21) ).
cnf(c_30,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk2_1(X0))
| ~ sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP3_iProver_split])],[c_8]) ).
cnf(c_57,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk2_1(X0))
| ~ sP3_iProver_split ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_114,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk2_1(X0))
| ~ sP3_iProver_split ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_202,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk2_1(X0))
| ~ sP3_iProver_split ),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_225,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk2_1(X0))
| ~ sP3_iProver_split ),
inference(copy,[status(esa)],[c_202]) ).
cnf(c_522,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk2_1(X0))
| ~ sP3_iProver_split ),
inference(copy,[status(esa)],[c_225]) ).
cnf(c_580,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk2_1(X0))
| ~ sP3_iProver_split ),
inference(copy,[status(esa)],[c_522]) ).
cnf(c_2205,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sk3_esk2_1(X0),sk3_esk2_1(X1))
| ~ reachable(sk3_esk4_0,X1)
| p(sk3_esk3_2(X0,sk3_esk2_1(X1)))
| ~ sP3_iProver_split
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_1967,c_580]) ).
cnf(c_2206,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sk3_esk2_1(X0),sk3_esk2_1(X1))
| ~ reachable(sk3_esk4_0,X1)
| p(sk3_esk3_2(X0,sk3_esk2_1(X1)))
| ~ sP3_iProver_split
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_2205]) ).
cnf(c_3,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sk3_esk2_1(X0),X2)
| ~ p(sk3_esk1_1(X1))
| ~ p(sk3_esk3_2(X0,X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_16) ).
cnf(c_45,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ p(sk3_esk3_2(X0,X1))
| ~ sP7_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP7_iProver_split])],[c_3]) ).
cnf(c_72,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ p(sk3_esk3_2(X0,X1))
| ~ sP7_iProver_split ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_84,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ p(sk3_esk3_2(X0,X1))
| ~ sP7_iProver_split ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_211,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ p(sk3_esk3_2(X0,X1))
| ~ sP7_iProver_split ),
inference(copy,[status(esa)],[c_84]) ).
cnf(c_216,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ p(sk3_esk3_2(X0,X1))
| ~ sP7_iProver_split ),
inference(copy,[status(esa)],[c_211]) ).
cnf(c_511,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ p(sk3_esk3_2(X0,X1))
| ~ sP7_iProver_split ),
inference(copy,[status(esa)],[c_216]) ).
cnf(c_558,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ p(sk3_esk3_2(X0,X1))
| ~ sP7_iProver_split ),
inference(copy,[status(esa)],[c_511]) ).
cnf(c_2524,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sk3_esk2_1(X1),sk3_esk2_1(X0))
| ~ reachable(sk3_esk4_0,X0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_2206,c_558]) ).
cnf(c_2525,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sk3_esk2_1(X1),sk3_esk2_1(X0))
| ~ reachable(sk3_esk4_0,X0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_2524]) ).
cnf(c_0,plain,
reachable(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_9_0) ).
cnf(c_544,plain,
reachable(X0,X0),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_2604,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk4_0,X0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_2525,c_544]) ).
cnf(c_2605,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk4_0,X0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_2604]) ).
cnf(c_3854,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_2605,c_544]) ).
cnf(c_3855,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_3854]) ).
cnf(c_13,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_26) ).
cnf(c_136,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_197,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_230,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_197]) ).
cnf(c_517,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_230]) ).
cnf(c_570,plain,
( reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0) ),
inference(copy,[status(esa)],[c_517]) ).
cnf(c_3873,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_3855,c_570]) ).
cnf(c_3874,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_3873]) ).
cnf(c_6,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| ~ reachable(sk3_esk5_0,X1)
| ~ reachable(sk3_esk6_1(X1),X2)
| p(X2)
| p(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_19) ).
cnf(c_61,negated_conjecture,
( sP1_iProver_split
| sP5_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split,sP5_iProver_split])],[c_6]) ).
cnf(c_110,negated_conjecture,
( sP1_iProver_split
| sP5_iProver_split ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_207,negated_conjecture,
( sP1_iProver_split
| sP5_iProver_split ),
inference(copy,[status(esa)],[c_110]) ).
cnf(c_220,negated_conjecture,
( sP1_iProver_split
| sP5_iProver_split ),
inference(copy,[status(esa)],[c_207]) ).
cnf(c_35,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| ~ sP5_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP5_iProver_split])],[c_6]) ).
cnf(c_59,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| ~ sP5_iProver_split ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_106,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| ~ sP5_iProver_split ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_206,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| ~ sP5_iProver_split ),
inference(copy,[status(esa)],[c_106]) ).
cnf(c_221,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| ~ sP5_iProver_split ),
inference(copy,[status(esa)],[c_206]) ).
cnf(c_250,plain,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| sP1_iProver_split ),
inference(resolution,[status(thm)],[c_220,c_221]) ).
cnf(c_264,plain,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_250]) ).
cnf(c_269,plain,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_264]) ).
cnf(c_519,plain,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_269]) ).
cnf(c_574,plain,
( ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1)
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_519]) ).
cnf(c_7,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| reachable(X1,sk3_esk1_1(X1))
| reachable(X0,sk3_esk2_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_20) ).
cnf(c_32,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0))
| ~ sP4_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP4_iProver_split])],[c_7]) ).
cnf(c_71,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0))
| ~ sP4_iProver_split ),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_82,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0))
| ~ sP4_iProver_split ),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_204,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0))
| ~ sP4_iProver_split ),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_223,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0))
| ~ sP4_iProver_split ),
inference(copy,[status(esa)],[c_204]) ).
cnf(c_506,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0))
| ~ sP4_iProver_split ),
inference(copy,[status(esa)],[c_223]) ).
cnf(c_548,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0))
| ~ sP4_iProver_split ),
inference(copy,[status(esa)],[c_506]) ).
cnf(c_738,plain,
( ~ reachable(initial_world,sk3_esk6_1(X0))
| ~ reachable(sk3_esk5_0,X0)
| p(sk3_esk1_1(sk3_esk6_1(X0)))
| sP1_iProver_split
| ~ sP4_iProver_split ),
inference(resolution,[status(thm)],[c_574,c_548]) ).
cnf(c_739,plain,
( ~ reachable(initial_world,sk3_esk6_1(X0))
| ~ reachable(sk3_esk5_0,X0)
| p(sk3_esk1_1(sk3_esk6_1(X0)))
| sP1_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_738]) ).
cnf(c_29,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0))
| ~ sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_8]) ).
cnf(c_68,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0))
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_88,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0))
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_201,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0))
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_226,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0))
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_201]) ).
cnf(c_521,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0))
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_226]) ).
cnf(c_578,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0))
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_521]) ).
cnf(c_979,plain,
( ~ reachable(initial_world,sk3_esk6_1(X0))
| ~ reachable(sk3_esk5_0,X0)
| sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(resolution,[status(thm)],[c_739,c_578]) ).
cnf(c_980,plain,
( ~ reachable(initial_world,sk3_esk6_1(X0))
| ~ reachable(sk3_esk5_0,X0)
| sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_979]) ).
cnf(c_991,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,X1)
| ~ reachable(X0,sk3_esk6_1(X1))
| sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(resolution,[status(thm)],[c_980,c_546]) ).
cnf(c_992,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,X1)
| ~ reachable(X0,sk3_esk6_1(X1))
| sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_991]) ).
cnf(c_10,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| ~ reachable(sk3_esk5_0,X1)
| reachable(X1,sk3_esk6_1(X1))
| p(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_23) ).
cnf(c_52,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split,sP0_iProver_split])],[c_10]) ).
cnf(c_130,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_200,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_130]) ).
cnf(c_227,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_200]) ).
cnf(c_26,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_10]) ).
cnf(c_50,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_126,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_198,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_126]) ).
cnf(c_229,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_198]) ).
cnf(c_234,plain,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| sP1_iProver_split ),
inference(resolution,[status(thm)],[c_227,c_229]) ).
cnf(c_245,plain,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_234]) ).
cnf(c_249,plain,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_245]) ).
cnf(c_518,plain,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_249]) ).
cnf(c_572,plain,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0))
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_518]) ).
cnf(c_2822,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,X0)
| sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(resolution,[status(thm)],[c_992,c_572]) ).
cnf(c_2825,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,X0)
| sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_2822]) ).
cnf(c_3519,plain,
( ~ reachable(initial_world,sk3_esk5_0)
| sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(resolution,[status(thm)],[c_2825,c_544]) ).
cnf(c_3520,plain,
( ~ reachable(initial_world,sk3_esk5_0)
| sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_3519]) ).
cnf(c_614,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0)
| p(sk3_esk1_1(sk3_esk4_0))
| ~ sP4_iProver_split ),
inference(resolution,[status(thm)],[c_548,c_568]) ).
cnf(c_617,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0)
| p(sk3_esk1_1(sk3_esk4_0))
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_614]) ).
cnf(c_822,plain,
( reachable(initial_world,sk3_esk5_0)
| p(sk3_esk1_1(sk3_esk4_0))
| ~ sP4_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_617,c_570]) ).
cnf(c_823,plain,
( reachable(initial_world,sk3_esk5_0)
| p(sk3_esk1_1(sk3_esk4_0))
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_822]) ).
cnf(c_827,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0)
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(resolution,[status(thm)],[c_823,c_578]) ).
cnf(c_828,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| reachable(initial_world,sk3_esk5_0)
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_827]) ).
cnf(c_833,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_828,c_570]) ).
cnf(c_834,plain,
( reachable(initial_world,sk3_esk5_0)
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_833]) ).
cnf(c_3594,plain,
( sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_3520,c_834]) ).
cnf(c_3595,plain,
( sP1_iProver_split
| ~ sP2_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_3594]) ).
cnf(c_58,negated_conjecture,
( sP3_iProver_split
| sP4_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP3_iProver_split,sP4_iProver_split])],[c_7]) ).
cnf(c_116,negated_conjecture,
( sP3_iProver_split
| sP4_iProver_split ),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_205,negated_conjecture,
( sP3_iProver_split
| sP4_iProver_split ),
inference(copy,[status(esa)],[c_116]) ).
cnf(c_222,negated_conjecture,
( sP3_iProver_split
| sP4_iProver_split ),
inference(copy,[status(esa)],[c_205]) ).
cnf(c_507,negated_conjecture,
( sP3_iProver_split
| sP4_iProver_split ),
inference(copy,[status(esa)],[c_222]) ).
cnf(c_550,negated_conjecture,
( sP3_iProver_split
| sP4_iProver_split ),
inference(copy,[status(esa)],[c_507]) ).
cnf(c_3617,plain,
( sP1_iProver_split
| ~ sP2_iProver_split
| sP3_iProver_split ),
inference(resolution,[status(thm)],[c_3595,c_550]) ).
cnf(c_3618,plain,
( sP1_iProver_split
| ~ sP2_iProver_split
| sP3_iProver_split ),
inference(rewriting,[status(thm)],[c_3617]) ).
cnf(c_55,negated_conjecture,
( sP2_iProver_split
| sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP3_iProver_split,sP2_iProver_split])],[c_8]) ).
cnf(c_122,negated_conjecture,
( sP2_iProver_split
| sP3_iProver_split ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_203,negated_conjecture,
( sP2_iProver_split
| sP3_iProver_split ),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_224,negated_conjecture,
( sP2_iProver_split
| sP3_iProver_split ),
inference(copy,[status(esa)],[c_203]) ).
cnf(c_523,negated_conjecture,
( sP2_iProver_split
| sP3_iProver_split ),
inference(copy,[status(esa)],[c_224]) ).
cnf(c_582,negated_conjecture,
( sP2_iProver_split
| sP3_iProver_split ),
inference(copy,[status(esa)],[c_523]) ).
cnf(c_3639,plain,
( sP1_iProver_split
| sP3_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_3618,c_582]) ).
cnf(c_3640,plain,
( sP1_iProver_split
| sP3_iProver_split ),
inference(rewriting,[status(thm)],[c_3639]) ).
cnf(c_740,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),sk3_esk6_1(X1))
| ~ reachable(sk3_esk5_0,X1)
| p(sk3_esk3_2(X0,sk3_esk6_1(X1)))
| sP1_iProver_split
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_574,c_552]) ).
cnf(c_741,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),sk3_esk6_1(X1))
| ~ reachable(sk3_esk5_0,X1)
| p(sk3_esk3_2(X0,sk3_esk6_1(X1)))
| sP1_iProver_split
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_740]) ).
cnf(c_1157,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),sk3_esk6_1(X1))
| ~ reachable(sk3_esk5_0,X1)
| sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_741,c_558]) ).
cnf(c_1158,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),sk3_esk6_1(X1))
| ~ reachable(sk3_esk5_0,X1)
| sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_1157]) ).
cnf(c_1261,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,sk3_esk2_1(X0))
| sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_1158,c_572]) ).
cnf(c_1264,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,sk3_esk2_1(X0))
| sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_1261]) ).
cnf(c_2538,plain,
( ~ reachable(initial_world,sk3_esk5_0)
| sP1_iProver_split
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_1264,c_580]) ).
cnf(c_2539,plain,
( ~ reachable(initial_world,sk3_esk5_0)
| sP1_iProver_split
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_2538]) ).
cnf(c_3643,plain,
( ~ reachable(initial_world,sk3_esk5_0)
| sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_3640,c_2539]) ).
cnf(c_3658,plain,
( ~ reachable(initial_world,sk3_esk5_0)
| sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_3643]) ).
cnf(c_3899,plain,
( sP1_iProver_split
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_3874,c_3658]) ).
cnf(c_3900,plain,
( sP1_iProver_split
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_3899]) ).
cnf(c_4081,plain,
( sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_3900,c_3640]) ).
cnf(c_4082,plain,
( sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_4081]) ).
cnf(c_27,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_10]) ).
cnf(c_60,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_108,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_199,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_228,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_199]) ).
cnf(c_520,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_228]) ).
cnf(c_576,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_520]) ).
cnf(c_596,plain,
( ~ reachable(sk3_esk4_0,X0)
| ~ reachable(X0,X1)
| p(X1)
| ~ sP1_iProver_split ),
inference(resolution,[status(thm)],[c_576,c_546]) ).
cnf(c_597,plain,
( ~ reachable(sk3_esk4_0,X0)
| ~ reachable(X0,X1)
| p(X1)
| ~ sP1_iProver_split ),
inference(rewriting,[status(thm)],[c_596]) ).
cnf(c_816,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ reachable(sk3_esk4_0,X1)
| p(sk3_esk3_2(X0,X1))
| ~ sP1_iProver_split
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_597,c_552]) ).
cnf(c_817,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ reachable(sk3_esk4_0,X1)
| p(sk3_esk3_2(X0,X1))
| ~ sP1_iProver_split
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_816]) ).
cnf(c_1316,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ reachable(sk3_esk4_0,X1)
| ~ sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_817,c_558]) ).
cnf(c_1317,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ reachable(sk3_esk4_0,X1)
| ~ sP1_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_1316]) ).
cnf(c_4085,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ reachable(sk3_esk4_0,X1)
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_4082,c_1317]) ).
cnf(c_4112,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),X1)
| ~ reachable(sk3_esk4_0,X1)
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_4085]) ).
cnf(c_4168,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk4_0,sk3_esk2_1(X0))
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_4112,c_544]) ).
cnf(c_4169,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk4_0,sk3_esk2_1(X0))
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_4168]) ).
cnf(c_4860,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_4169,c_580]) ).
cnf(c_4861,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_4860]) ).
cnf(c_9,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_22) ).
cnf(c_124,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_194,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1) ),
inference(copy,[status(esa)],[c_124]) ).
cnf(c_233,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1) ),
inference(copy,[status(esa)],[c_194]) ).
cnf(c_513,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1) ),
inference(copy,[status(esa)],[c_233]) ).
cnf(c_562,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| ~ reachable(sk3_esk6_1(X0),X1)
| p(X1) ),
inference(copy,[status(esa)],[c_513]) ).
cnf(c_674,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),sk3_esk6_1(X1))
| ~ reachable(sk3_esk5_0,X1)
| p(sk3_esk3_2(X0,sk3_esk6_1(X1)))
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_552,c_562]) ).
cnf(c_675,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),sk3_esk6_1(X1))
| ~ reachable(sk3_esk5_0,X1)
| p(sk3_esk3_2(X0,sk3_esk6_1(X1)))
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_674]) ).
cnf(c_1171,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),sk3_esk6_1(X1))
| ~ reachable(sk3_esk5_0,X1)
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_675,c_558]) ).
cnf(c_1172,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk2_1(X0),sk3_esk6_1(X1))
| ~ reachable(sk3_esk5_0,X1)
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_1171]) ).
cnf(c_11,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_24) ).
cnf(c_132,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0)) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_195,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0)) ),
inference(copy,[status(esa)],[c_132]) ).
cnf(c_232,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0)) ),
inference(copy,[status(esa)],[c_195]) ).
cnf(c_515,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0)) ),
inference(copy,[status(esa)],[c_232]) ).
cnf(c_566,negated_conjecture,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0)) ),
inference(copy,[status(esa)],[c_515]) ).
cnf(c_1385,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,sk3_esk2_1(X0))
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_1172,c_566]) ).
cnf(c_1386,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,sk3_esk2_1(X0))
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_1385]) ).
cnf(c_1400,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,sk3_esk5_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(resolution,[status(thm)],[c_1386,c_580]) ).
cnf(c_1401,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,sk3_esk5_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_1400]) ).
cnf(c_1407,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_1401,c_570]) ).
cnf(c_1408,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_1407]) ).
cnf(c_4866,plain,
( ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_4861,c_1408]) ).
cnf(c_4867,plain,
( ~ sP3_iProver_split
| ~ sP6_iProver_split
| ~ sP7_iProver_split ),
inference(rewriting,[status(thm)],[c_4866]) ).
cnf(c_2,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sk3_esk2_1(X0),X2)
| reachable(X1,sk3_esk1_1(X1))
| ~ p(sk3_esk3_2(X0,X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_15) ).
cnf(c_73,negated_conjecture,
( sP4_iProver_split
| sP7_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP7_iProver_split,sP4_iProver_split])],[c_2]) ).
cnf(c_86,negated_conjecture,
( sP4_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_213,negated_conjecture,
( sP4_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_86]) ).
cnf(c_214,negated_conjecture,
( sP4_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_213]) ).
cnf(c_514,negated_conjecture,
( sP4_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_214]) ).
cnf(c_564,negated_conjecture,
( sP4_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_514]) ).
cnf(c_4871,plain,
( ~ sP3_iProver_split
| sP4_iProver_split
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_4867,c_564]) ).
cnf(c_4874,plain,
( ~ sP3_iProver_split
| sP4_iProver_split
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_4871]) ).
cnf(c_4,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sk3_esk2_1(X0),X2)
| reachable(X1,sk3_esk1_1(X1))
| reachable(X2,sk3_esk3_2(X0,X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p',c_0_17) ).
cnf(c_67,negated_conjecture,
( sP4_iProver_split
| sP6_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP6_iProver_split,sP4_iProver_split])],[c_4]) ).
cnf(c_98,negated_conjecture,
( sP4_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_210,negated_conjecture,
( sP4_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_217,negated_conjecture,
( sP4_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_210]) ).
cnf(c_510,negated_conjecture,
( sP4_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_217]) ).
cnf(c_556,negated_conjecture,
( sP4_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_510]) ).
cnf(c_4936,plain,
sP4_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_4874,c_556,c_550]) ).
cnf(c_4937,negated_conjecture,
sP4_iProver_split,
inference(rewriting,[status(thm)],[c_4936]) ).
cnf(c_4949,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_4937,c_548]) ).
cnf(c_4950,plain,
( ~ reachable(initial_world,X0)
| reachable(X0,sk3_esk1_1(X0)) ),
inference(rewriting,[status(thm)],[c_4949]) ).
cnf(c_4978,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,sk3_esk6_1(X0))
| ~ reachable(sk3_esk5_0,X0)
| p(sk3_esk1_1(sk3_esk6_1(X0))) ),
inference(resolution,[status(thm)],[c_4950,c_562]) ).
cnf(c_4979,plain,
( reachable(initial_world,sk3_esk4_0)
| ~ reachable(initial_world,sk3_esk6_1(X0))
| ~ reachable(sk3_esk5_0,X0)
| p(sk3_esk1_1(sk3_esk6_1(X0))) ),
inference(rewriting,[status(thm)],[c_4978]) ).
cnf(c_70,negated_conjecture,
( sP2_iProver_split
| sP7_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP7_iProver_split,sP2_iProver_split])],[c_3]) ).
cnf(c_92,negated_conjecture,
( sP2_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_212,negated_conjecture,
( sP2_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_92]) ).
cnf(c_215,negated_conjecture,
( sP2_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_212]) ).
cnf(c_512,negated_conjecture,
( sP2_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_215]) ).
cnf(c_560,negated_conjecture,
( sP2_iProver_split
| sP7_iProver_split ),
inference(copy,[status(esa)],[c_512]) ).
cnf(c_4872,plain,
( sP2_iProver_split
| ~ sP3_iProver_split
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_4867,c_560]) ).
cnf(c_4873,plain,
( sP2_iProver_split
| ~ sP3_iProver_split
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_4872]) ).
cnf(c_64,negated_conjecture,
( sP2_iProver_split
| sP6_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP6_iProver_split,sP2_iProver_split])],[c_5]) ).
cnf(c_104,negated_conjecture,
( sP2_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_209,negated_conjecture,
( sP2_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_218,negated_conjecture,
( sP2_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_209]) ).
cnf(c_509,negated_conjecture,
( sP2_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_218]) ).
cnf(c_554,negated_conjecture,
( sP2_iProver_split
| sP6_iProver_split ),
inference(copy,[status(esa)],[c_509]) ).
cnf(c_4878,plain,
sP2_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_4873,c_554,c_582]) ).
cnf(c_4879,negated_conjecture,
sP2_iProver_split,
inference(rewriting,[status(thm)],[c_4878]) ).
cnf(c_4889,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_4879,c_578]) ).
cnf(c_4896,plain,
( ~ reachable(initial_world,X0)
| ~ p(sk3_esk1_1(X0)) ),
inference(rewriting,[status(thm)],[c_4889]) ).
cnf(c_4115,plain,
( sP1_iProver_split
| sP2_iProver_split
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_4082,c_560]) ).
cnf(c_4116,plain,
( sP1_iProver_split
| sP2_iProver_split
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_4115]) ).
cnf(c_4121,plain,
( sP1_iProver_split
| sP2_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_4116,c_554]) ).
cnf(c_4122,plain,
( sP1_iProver_split
| sP2_iProver_split ),
inference(rewriting,[status(thm)],[c_4121]) ).
cnf(c_4125,plain,
( sP1_iProver_split
| ~ sP4_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_4122,c_3595]) ).
cnf(c_4126,plain,
( sP1_iProver_split
| ~ sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_4125]) ).
cnf(c_4114,plain,
( sP1_iProver_split
| sP4_iProver_split
| ~ sP6_iProver_split ),
inference(resolution,[status(thm)],[c_4082,c_564]) ).
cnf(c_4117,plain,
( sP1_iProver_split
| sP4_iProver_split
| ~ sP6_iProver_split ),
inference(rewriting,[status(thm)],[c_4114]) ).
cnf(c_4130,plain,
( sP1_iProver_split
| sP4_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_4117,c_556]) ).
cnf(c_4131,plain,
( sP1_iProver_split
| sP4_iProver_split ),
inference(rewriting,[status(thm)],[c_4130]) ).
cnf(c_4325,plain,
sP1_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_4126,c_4131]) ).
cnf(c_4326,plain,
sP1_iProver_split,
inference(rewriting,[status(thm)],[c_4325]) ).
cnf(c_4343,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_4326,c_576]) ).
cnf(c_4358,negated_conjecture,
( ~ reachable(sk3_esk4_0,X0)
| p(X0) ),
inference(rewriting,[status(thm)],[c_4343]) ).
cnf(c_4973,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| p(sk3_esk1_1(sk3_esk4_0)) ),
inference(resolution,[status(thm)],[c_4950,c_4358]) ).
cnf(c_4974,plain,
( ~ reachable(initial_world,sk3_esk4_0)
| p(sk3_esk1_1(sk3_esk4_0)) ),
inference(rewriting,[status(thm)],[c_4973]) ).
cnf(c_4991,plain,
~ reachable(initial_world,sk3_esk4_0),
inference(forward_subsumption_resolution,[status(thm)],[c_4974,c_4896]) ).
cnf(c_4992,plain,
~ reachable(initial_world,sk3_esk4_0),
inference(rewriting,[status(thm)],[c_4991]) ).
cnf(c_5091,plain,
( ~ reachable(initial_world,sk3_esk6_1(X0))
| ~ reachable(sk3_esk5_0,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4979,c_4896,c_4992]) ).
cnf(c_5092,plain,
( ~ reachable(initial_world,sk3_esk6_1(X0))
| ~ reachable(sk3_esk5_0,X0) ),
inference(rewriting,[status(thm)],[c_5091]) ).
cnf(c_5095,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,X1)
| ~ reachable(X0,sk3_esk6_1(X1)) ),
inference(resolution,[status(thm)],[c_5092,c_546]) ).
cnf(c_5096,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,X1)
| ~ reachable(X0,sk3_esk6_1(X1)) ),
inference(rewriting,[status(thm)],[c_5095]) ).
cnf(c_4995,negated_conjecture,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_4992,c_566]) ).
cnf(c_5032,plain,
( ~ reachable(sk3_esk5_0,X0)
| reachable(X0,sk3_esk6_1(X0)) ),
inference(rewriting,[status(thm)],[c_4995]) ).
cnf(c_5535,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,X0) ),
inference(resolution,[status(thm)],[c_5096,c_5032]) ).
cnf(c_5536,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk5_0,X0) ),
inference(rewriting,[status(thm)],[c_5535]) ).
cnf(c_5599,plain,
~ reachable(initial_world,sk3_esk5_0),
inference(resolution,[status(thm)],[c_5536,c_544]) ).
cnf(c_5600,plain,
~ reachable(initial_world,sk3_esk5_0),
inference(rewriting,[status(thm)],[c_5599]) ).
cnf(c_4994,plain,
reachable(initial_world,sk3_esk5_0),
inference(backward_subsumption_resolution,[status(thm)],[c_4992,c_570]) ).
cnf(c_5033,plain,
reachable(initial_world,sk3_esk5_0),
inference(rewriting,[status(thm)],[c_4994]) ).
cnf(c_5622,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5600,c_5033]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN550+1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.14 % Command : iprover_modulo %s %d
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jul 12 03:56:10 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Running in mono-core mode
% 0.21/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42 % FOF problem with conjecture
% 0.21/0.42 % 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_2fd5db.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_dd6878.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_368163 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2fd5db.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45 % ------ Parsing...% successful
% 0.21/0.45
% 0.21/0.45 % ------ Preprocessing... gs_s sp: 32 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.45
% 0.21/0.45 % ------ Proving...
% 0.21/0.45 % ------ Problem Properties
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % EPR false
% 0.21/0.45 % Horn false
% 0.21/0.45 % Has equality false
% 0.21/0.45
% 0.21/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % % ------ Current options:
% 0.21/0.45
% 0.21/0.45 % ------ Input Options
% 0.21/0.45
% 0.21/0.45 % --out_options all
% 0.21/0.45 % --tptp_safe_out true
% 0.21/0.45 % --problem_path ""
% 0.21/0.45 % --include_path ""
% 0.21/0.45 % --clausifier .//eprover
% 0.21/0.45 % --clausifier_options --tstp-format
% 0.21/0.45 % --stdin false
% 0.21/0.45 % --dbg_backtrace false
% 0.21/0.45 % --dbg_dump_prop_clauses false
% 0.21/0.45 % --dbg_dump_prop_clauses_file -
% 0.21/0.45 % --dbg_out_stat false
% 0.21/0.45
% 0.21/0.45 % ------ General Options
% 0.21/0.45
% 0.21/0.45 % --fof false
% 0.21/0.45 % --time_out_real 150.
% 0.21/0.45 % --time_out_prep_mult 0.2
% 0.21/0.45 % --time_out_virtual -1.
% 0.21/0.45 % --schedule none
% 0.21/0.45 % --ground_splitting input
% 0.21/0.45 % --splitting_nvd 16
% 0.21/0.45 % --non_eq_to_eq false
% 0.21/0.45 % --prep_gs_sim true
% 0.21/0.45 % --prep_unflatten false
% 0.21/0.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.40/0.59 % --inst_prop_sim_new false
% 0.40/0.59 % --inst_orphan_elimination true
% 0.40/0.59 % --inst_learning_loop_flag true
% 0.40/0.59 % --inst_learning_start 3000
% 0.40/0.59 % --inst_learning_factor 2
% 0.40/0.59 % --inst_start_prop_sim_after_learn 3
% 0.40/0.59 % --inst_sel_renew solver
% 0.40/0.59 % --inst_lit_activity_flag true
% 0.40/0.59 % --inst_out_proof true
% 0.40/0.59
% 0.40/0.59 % ------ Resolution Options
% 0.40/0.59
% 0.40/0.59 % --resolution_flag true
% 0.40/0.59 % --res_lit_sel kbo_max
% 0.40/0.59 % --res_to_prop_solver none
% 0.40/0.59 % --res_prop_simpl_new false
% 0.40/0.59 % --res_prop_simpl_given false
% 0.40/0.59 % --res_passive_queue_type priority_queues
% 0.40/0.59 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.40/0.59 % --res_passive_queues_freq [15;5]
% 0.40/0.59 % --res_forward_subs full
% 0.40/0.59 % --res_backward_subs full
% 0.40/0.59 % --res_forward_subs_resolution true
% 0.40/0.59 % --res_backward_subs_resolution true
% 0.40/0.59 % --res_orphan_elimination false
% 0.40/0.59 % --res_time_limit 1000.
% 0.40/0.59 % --res_out_proof true
% 0.40/0.59 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2fd5db.s
% 0.40/0.59 % --modulo true
% 0.40/0.59
% 0.40/0.59 % ------ Combination Options
% 0.40/0.59
% 0.40/0.59 % --comb_res_mult 1000
% 0.40/0.59 % --comb_inst_mult 300
% 0.40/0.59 % ------
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 % ------ Proving...
% 0.40/0.59 %
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 % Resolution empty clause
% 0.40/0.59
% 0.40/0.59 % ------ Statistics
% 0.40/0.59
% 0.40/0.59 % ------ General
% 0.40/0.59
% 0.40/0.59 % num_of_input_clauses: 14
% 0.40/0.59 % num_of_input_neg_conjectures: 12
% 0.40/0.59 % num_of_splits: 32
% 0.40/0.59 % num_of_split_atoms: 8
% 0.40/0.59 % num_of_sem_filtered_clauses: 0
% 0.40/0.59 % num_of_subtypes: 0
% 0.40/0.59 % monotx_restored_types: 0
% 0.40/0.59 % sat_num_of_epr_types: 0
% 0.40/0.59 % sat_num_of_non_cyclic_types: 0
% 0.40/0.59 % sat_guarded_non_collapsed_types: 0
% 0.40/0.59 % is_epr: 0
% 0.40/0.59 % is_horn: 0
% 0.40/0.59 % has_eq: 0
% 0.40/0.59 % num_pure_diseq_elim: 0
% 0.40/0.59 % simp_replaced_by: 0
% 0.40/0.59 % res_preprocessed: 56
% 0.40/0.59 % prep_upred: 0
% 0.40/0.59 % prep_unflattend: 0
% 0.40/0.59 % pred_elim_cands: 8
% 0.40/0.59 % pred_elim: 2
% 0.40/0.59 % pred_elim_cl: 2
% 0.40/0.59 % pred_elim_cycles: 8
% 0.40/0.59 % forced_gc_time: 0
% 0.40/0.59 % gc_basic_clause_elim: 0
% 0.40/0.59 % parsing_time: 0.
% 0.40/0.59 % sem_filter_time: 0.
% 0.40/0.59 % pred_elim_time: 0.002
% 0.40/0.59 % out_proof_time: 0.005
% 0.40/0.59 % monotx_time: 0.
% 0.40/0.59 % subtype_inf_time: 0.
% 0.40/0.59 % unif_index_cands_time: 0.
% 0.40/0.59 % unif_index_add_time: 0.
% 0.40/0.59 % total_time: 0.17
% 0.40/0.59 % num_of_symbols: 42
% 0.40/0.59 % num_of_terms: 486
% 0.40/0.59
% 0.40/0.59 % ------ Propositional Solver
% 0.40/0.59
% 0.40/0.59 % prop_solver_calls: 1
% 0.40/0.59 % prop_fast_solver_calls: 273
% 0.40/0.59 % prop_num_of_clauses: 78
% 0.40/0.59 % prop_preprocess_simplified: 386
% 0.40/0.59 % prop_fo_subsumed: 0
% 0.40/0.59 % prop_solver_time: 0.
% 0.40/0.59 % prop_fast_solver_time: 0.
% 0.40/0.59 % prop_unsat_core_time: 0.
% 0.40/0.59
% 0.40/0.59 % ------ QBF
% 0.40/0.59
% 0.40/0.59 % qbf_q_res: 0
% 0.40/0.59 % qbf_num_tautologies: 0
% 0.40/0.59 % qbf_prep_cycles: 0
% 0.40/0.59
% 0.40/0.59 % ------ BMC1
% 0.40/0.59
% 0.40/0.59 % bmc1_current_bound: -1
% 0.40/0.59 % bmc1_last_solved_bound: -1
% 0.40/0.59 % bmc1_unsat_core_size: -1
% 0.40/0.59 % bmc1_unsat_core_parents_size: -1
% 0.40/0.59 % bmc1_merge_next_fun: 0
% 0.40/0.59 % bmc1_unsat_core_clauses_time: 0.
% 0.40/0.59
% 0.40/0.59 % ------ Instantiation
% 0.40/0.59
% 0.40/0.59 % inst_num_of_clauses: 20
% 0.40/0.59 % inst_num_in_passive: 0
% 0.40/0.59 % inst_num_in_active: 0
% 0.40/0.59 % inst_num_in_unprocessed: 20
% 0.40/0.59 % inst_num_of_loops: 0
% 0.40/0.60 % inst_num_of_learning_restarts: 0
% 0.40/0.60 % inst_num_moves_active_passive: 0
% 0.40/0.60 % inst_lit_activity: 0
% 0.40/0.60 % inst_lit_activity_moves: 0
% 0.40/0.60 % inst_num_tautologies: 0
% 0.40/0.60 % inst_num_prop_implied: 0
% 0.40/0.60 % inst_num_existing_simplified: 0
% 0.40/0.60 % inst_num_eq_res_simplified: 0
% 0.40/0.60 % inst_num_child_elim: 0
% 0.40/0.60 % inst_num_of_dismatching_blockings: 0
% 0.40/0.60 % inst_num_of_non_proper_insts: 0
% 0.40/0.60 % inst_num_of_duplicates: 0
% 0.40/0.60 % inst_inst_num_from_inst_to_res: 0
% 0.40/0.60 % inst_dismatching_checking_time: 0.
% 0.40/0.60
% 0.40/0.60 % ------ Resolution
% 0.40/0.60
% 0.40/0.60 % res_num_of_clauses: 182
% 0.40/0.60 % res_num_in_passive: 179
% 0.40/0.60 % res_num_in_active: 65
% 0.40/0.60 % res_num_of_loops: 442
% 0.40/0.60 % res_forward_subset_subsumed: 230
% 0.40/0.60 % res_backward_subset_subsumed: 111
% 0.40/0.60 % res_forward_subsumed: 138
% 0.40/0.60 % res_backward_subsumed: 98
% 0.40/0.60 % res_forward_subsumption_resolution: 53
% 0.40/0.60 % res_backward_subsumption_resolution: 119
% 0.40/0.60 % res_clause_to_clause_subsumption: 5997
% 0.40/0.60 % res_orphan_elimination: 0
% 0.40/0.60 % res_tautology_del: 40
% 0.40/0.60 % res_num_eq_res_simplified: 0
% 0.40/0.60 % res_num_sel_changes: 0
% 0.40/0.60 % res_moves_from_active_to_pass: 0
% 0.40/0.60
% 0.40/0.60 % Status Unsatisfiable
% 0.40/0.60 % SZS status Theorem
% 0.40/0.60 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------