TSTP Solution File: SYN549+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN549+1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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:51 EDT 2022
% Result : Theorem 1.63s 1.80s
% Output : CNFRefutation 1.63s
% 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)
=> ( ? [X3] :
( reachable(X2,X3)
& ( p(X3)
| ? [X4] :
( reachable(X3,X4)
& q(X4) ) ) )
<=> ( ? [X5] :
( reachable(X2,X5)
& p(X5) )
| ? [X5] :
( reachable(X2,X5)
& q(X5) ) ) ) ) ),
file('<stdin>',prove_this) ).
fof(c_0_1_002,negated_conjecture,
~ ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> ( ? [X3] :
( reachable(X2,X3)
& ( p(X3)
| ? [X4] :
( reachable(X3,X4)
& q(X4) ) ) )
<=> ( ? [X5] :
( reachable(X2,X5)
& p(X5) )
| ? [X5] :
( reachable(X2,X5)
& q(X5) ) ) ) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
! [X6,X8,X9,X10,X11] :
( ( reachable(X6,esk1_1(X6))
| ~ reachable(initial_world,X6) )
& ( ~ reachable(esk1_1(X6),X10)
| ~ p(X10)
| ~ p(X8)
| ~ reachable(esk1_1(X6),X8)
| ~ reachable(initial_world,X6) )
& ( ~ reachable(esk1_1(X6),X11)
| ~ q(X11)
| ~ p(X8)
| ~ reachable(esk1_1(X6),X8)
| ~ reachable(initial_world,X6) )
& ( ~ reachable(esk1_1(X6),X10)
| ~ p(X10)
| ~ reachable(X8,X9)
| ~ q(X9)
| ~ reachable(esk1_1(X6),X8)
| ~ reachable(initial_world,X6) )
& ( ~ reachable(esk1_1(X6),X11)
| ~ q(X11)
| ~ reachable(X8,X9)
| ~ q(X9)
| ~ reachable(esk1_1(X6),X8)
| ~ reachable(initial_world,X6) )
& ( reachable(esk1_1(X6),esk5_1(X6))
| reachable(esk1_1(X6),esk4_1(X6))
| reachable(esk1_1(X6),esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( q(esk5_1(X6))
| reachable(esk1_1(X6),esk4_1(X6))
| reachable(esk1_1(X6),esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( reachable(esk1_1(X6),esk5_1(X6))
| p(esk4_1(X6))
| reachable(esk1_1(X6),esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( q(esk5_1(X6))
| p(esk4_1(X6))
| reachable(esk1_1(X6),esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( reachable(esk1_1(X6),esk5_1(X6))
| reachable(esk1_1(X6),esk4_1(X6))
| reachable(esk2_1(X6),esk3_1(X6))
| p(esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( q(esk5_1(X6))
| reachable(esk1_1(X6),esk4_1(X6))
| reachable(esk2_1(X6),esk3_1(X6))
| p(esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( reachable(esk1_1(X6),esk5_1(X6))
| p(esk4_1(X6))
| reachable(esk2_1(X6),esk3_1(X6))
| p(esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( q(esk5_1(X6))
| p(esk4_1(X6))
| reachable(esk2_1(X6),esk3_1(X6))
| p(esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( reachable(esk1_1(X6),esk5_1(X6))
| reachable(esk1_1(X6),esk4_1(X6))
| q(esk3_1(X6))
| p(esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( q(esk5_1(X6))
| reachable(esk1_1(X6),esk4_1(X6))
| q(esk3_1(X6))
| p(esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( reachable(esk1_1(X6),esk5_1(X6))
| p(esk4_1(X6))
| q(esk3_1(X6))
| p(esk2_1(X6))
| ~ reachable(initial_world,X6) )
& ( q(esk5_1(X6))
| p(esk4_1(X6))
| q(esk3_1(X6))
| p(esk2_1(X6))
| ~ reachable(initial_world,X6) ) ),
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(initial_world,X1)
| ~ reachable(esk1_1(X1),X2)
| ~ q(X3)
| ~ reachable(X2,X3)
| ~ p(X4)
| ~ reachable(esk1_1(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ reachable(esk1_1(X1),X2)
| ~ q(X3)
| ~ reachable(X2,X3)
| ~ q(X4)
| ~ reachable(esk1_1(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( p(esk2_1(X1))
| reachable(esk2_1(X1),esk3_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
( reachable(esk1_1(X1),esk2_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ reachable(esk1_1(X1),X2)
| ~ p(X2)
| ~ p(X3)
| ~ reachable(esk1_1(X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ reachable(esk1_1(X1),X2)
| ~ p(X2)
| ~ q(X3)
| ~ reachable(esk1_1(X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9_010,negated_conjecture,
( p(esk2_1(X1))
| reachable(esk2_1(X1),esk3_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( p(esk2_1(X1))
| reachable(esk2_1(X1),esk3_1(X1))
| p(esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( p(esk2_1(X1))
| q(esk3_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( reachable(esk1_1(X1),esk2_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( reachable(esk1_1(X1),esk2_1(X1))
| p(esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( p(esk2_1(X1))
| reachable(esk2_1(X1),esk3_1(X1))
| p(esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( p(esk2_1(X1))
| q(esk3_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( p(esk2_1(X1))
| q(esk3_1(X1))
| p(esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
( reachable(esk1_1(X1),esk2_1(X1))
| p(esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
( p(esk2_1(X1))
| q(esk3_1(X1))
| p(esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
( reachable(X1,esk1_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_20,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ reachable(esk1_1(X1),X2)
| ~ q(X3)
| ~ reachable(X2,X3)
| ~ p(X4)
| ~ reachable(esk1_1(X1),X4) ),
c_0_3,
[final] ).
cnf(c_0_21,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ reachable(esk1_1(X1),X2)
| ~ q(X3)
| ~ reachable(X2,X3)
| ~ q(X4)
| ~ reachable(esk1_1(X1),X4) ),
c_0_4,
[final] ).
cnf(c_0_22,negated_conjecture,
( p(esk2_1(X1))
| reachable(esk2_1(X1),esk3_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_5,
[final] ).
cnf(c_0_23,negated_conjecture,
( reachable(esk1_1(X1),esk2_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_6,
[final] ).
cnf(c_0_24,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ reachable(esk1_1(X1),X2)
| ~ p(X2)
| ~ p(X3)
| ~ reachable(esk1_1(X1),X3) ),
c_0_7,
[final] ).
cnf(c_0_25,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ reachable(esk1_1(X1),X2)
| ~ p(X2)
| ~ q(X3)
| ~ reachable(esk1_1(X1),X3) ),
c_0_8,
[final] ).
cnf(c_0_26,negated_conjecture,
( p(esk2_1(X1))
| reachable(esk2_1(X1),esk3_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_9,
[final] ).
cnf(c_0_27,negated_conjecture,
( p(esk2_1(X1))
| reachable(esk2_1(X1),esk3_1(X1))
| p(esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_10,
[final] ).
cnf(c_0_28,negated_conjecture,
( p(esk2_1(X1))
| q(esk3_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_11,
[final] ).
cnf(c_0_29,negated_conjecture,
( reachable(esk1_1(X1),esk2_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_12,
[final] ).
cnf(c_0_30,negated_conjecture,
( reachable(esk1_1(X1),esk2_1(X1))
| p(esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_13,
[final] ).
cnf(c_0_31,negated_conjecture,
( p(esk2_1(X1))
| reachable(esk2_1(X1),esk3_1(X1))
| p(esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_14,
[final] ).
cnf(c_0_32,negated_conjecture,
( p(esk2_1(X1))
| q(esk3_1(X1))
| reachable(esk1_1(X1),esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_15,
[final] ).
cnf(c_0_33,negated_conjecture,
( p(esk2_1(X1))
| q(esk3_1(X1))
| p(esk4_1(X1))
| reachable(esk1_1(X1),esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_16,
[final] ).
cnf(c_0_34,negated_conjecture,
( reachable(esk1_1(X1),esk2_1(X1))
| p(esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_17,
[final] ).
cnf(c_0_35,negated_conjecture,
( p(esk2_1(X1))
| q(esk3_1(X1))
| p(esk4_1(X1))
| q(esk5_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_18,
[final] ).
cnf(c_0_36,negated_conjecture,
( reachable(X1,esk1_1(X1))
| ~ reachable(initial_world,X1) ),
c_0_19,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_6,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ p(X1)
| ~ p(X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_24) ).
cnf(c_44,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ p(X1)
| ~ p(X2) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_108,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ p(X1)
| ~ p(X2) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_133,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ p(X1)
| ~ p(X2) ),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_142,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ p(X1)
| ~ p(X2) ),
inference(copy,[status(esa)],[c_133]) ).
cnf(c_161,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ p(X1)
| ~ p(X2) ),
inference(copy,[status(esa)],[c_142]) ).
cnf(c_13836,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk4_1(X1))
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ p(sk3_esk4_1(X1))
| ~ p(X2) ),
inference(instantiation,[status(thm)],[c_161]) ).
cnf(c_14145,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk4_1(X1))
| ~ reachable(sk3_esk1_1(X0),sk3_esk4_1(X2))
| ~ p(sk3_esk4_1(X1))
| ~ p(sk3_esk4_1(X2)) ),
inference(instantiation,[status(thm)],[c_13836]) ).
cnf(c_14146,plain,
( ~ reachable(initial_world,initial_world)
| ~ reachable(sk3_esk1_1(initial_world),sk3_esk4_1(initial_world))
| ~ p(sk3_esk4_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_14145]) ).
cnf(c_3,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,X3)
| ~ q(X1)
| ~ q(X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_21) ).
cnf(c_38,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,X3)
| ~ q(X1)
| ~ q(X3) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_105,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,X3)
| ~ q(X1)
| ~ q(X3) ),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_136,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,X3)
| ~ q(X1)
| ~ q(X3) ),
inference(copy,[status(esa)],[c_105]) ).
cnf(c_139,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,X3)
| ~ q(X1)
| ~ q(X3) ),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_158,negated_conjecture,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,X3)
| ~ q(X1)
| ~ q(X3) ),
inference(copy,[status(esa)],[c_139]) ).
cnf(c_13400,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk3_1(X1))
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,X3)
| ~ q(sk3_esk3_1(X1))
| ~ q(X3) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_13521,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk3_1(X1))
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,sk3_esk3_1(X3))
| ~ q(sk3_esk3_1(X1))
| ~ q(sk3_esk3_1(X3)) ),
inference(instantiation,[status(thm)],[c_13400]) ).
cnf(c_13687,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk2_1(X0))
| ~ reachable(sk3_esk1_1(X0),sk3_esk3_1(X1))
| ~ reachable(sk3_esk2_1(X0),sk3_esk3_1(X2))
| ~ q(sk3_esk3_1(X1))
| ~ q(sk3_esk3_1(X2)) ),
inference(instantiation,[status(thm)],[c_13521]) ).
cnf(c_13688,plain,
( ~ reachable(initial_world,initial_world)
| ~ reachable(sk3_esk1_1(initial_world),sk3_esk2_1(initial_world))
| ~ reachable(sk3_esk1_1(initial_world),sk3_esk3_1(initial_world))
| ~ reachable(sk3_esk2_1(initial_world),sk3_esk3_1(initial_world))
| ~ q(sk3_esk3_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_13687]) ).
cnf(c_1,plain,
( ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| reachable(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_8_0) ).
cnf(c_156,plain,
( ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| reachable(X0,X2) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_13301,plain,
( ~ reachable(sk3_esk1_1(X0),X1)
| reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X1,X2) ),
inference(instantiation,[status(thm)],[c_156]) ).
cnf(c_13380,plain,
( ~ reachable(sk3_esk1_1(X0),sk3_esk2_1(X0))
| reachable(sk3_esk1_1(X0),X1)
| ~ reachable(sk3_esk2_1(X0),X1) ),
inference(instantiation,[status(thm)],[c_13301]) ).
cnf(c_13446,plain,
( ~ reachable(sk3_esk1_1(X0),sk3_esk2_1(X0))
| reachable(sk3_esk1_1(X0),sk3_esk3_1(X0))
| ~ reachable(sk3_esk2_1(X0),sk3_esk3_1(X0)) ),
inference(instantiation,[status(thm)],[c_13380]) ).
cnf(c_13447,plain,
( ~ reachable(sk3_esk1_1(initial_world),sk3_esk2_1(initial_world))
| reachable(sk3_esk1_1(initial_world),sk3_esk3_1(initial_world))
| ~ reachable(sk3_esk2_1(initial_world),sk3_esk3_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_13446]) ).
cnf(c_13286,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk5_1(X1))
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,X3)
| ~ q(sk3_esk5_1(X1))
| ~ q(X3) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_13294,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk5_1(X1))
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ reachable(X2,sk3_esk5_1(X3))
| ~ q(sk3_esk5_1(X1))
| ~ q(sk3_esk5_1(X3)) ),
inference(instantiation,[status(thm)],[c_13286]) ).
cnf(c_13312,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk1_1(X0))
| ~ reachable(sk3_esk1_1(X0),sk3_esk5_1(X1))
| ~ reachable(sk3_esk1_1(X0),sk3_esk5_1(X2))
| ~ q(sk3_esk5_1(X1))
| ~ q(sk3_esk5_1(X2)) ),
inference(instantiation,[status(thm)],[c_13294]) ).
cnf(c_13313,plain,
( ~ reachable(initial_world,initial_world)
| ~ reachable(sk3_esk1_1(initial_world),sk3_esk1_1(initial_world))
| ~ reachable(sk3_esk1_1(initial_world),sk3_esk5_1(initial_world))
| ~ q(sk3_esk5_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_13312]) ).
cnf(c_0,plain,
reachable(X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_9_0) ).
cnf(c_155,plain,
reachable(X0,X0),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_13299,plain,
reachable(sk3_esk1_1(X0),sk3_esk1_1(X0)),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_13300,plain,
reachable(sk3_esk1_1(initial_world),sk3_esk1_1(initial_world)),
inference(instantiation,[status(thm)],[c_13299]) ).
cnf(c_13280,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk2_1(X1))
| ~ reachable(sk3_esk1_1(X0),X2)
| ~ p(sk3_esk2_1(X1))
| ~ p(X2) ),
inference(instantiation,[status(thm)],[c_161]) ).
cnf(c_13282,plain,
( ~ reachable(initial_world,X0)
| ~ reachable(sk3_esk1_1(X0),sk3_esk2_1(X1))
| ~ reachable(sk3_esk1_1(X0),sk3_esk2_1(X2))
| ~ p(sk3_esk2_1(X1))
| ~ p(sk3_esk2_1(X2)) ),
inference(instantiation,[status(thm)],[c_13280]) ).
cnf(c_13283,plain,
( ~ reachable(initial_world,initial_world)
| ~ reachable(sk3_esk1_1(initial_world),sk3_esk2_1(initial_world))
| ~ p(sk3_esk2_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_13282]) ).
cnf(c_35,plain,
reachable(initial_world,initial_world),
inference(instantiation,[status(thm)],[c_0]) ).
cnf(c_4,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk4_1(X0))
| reachable(sk3_esk1_1(X0),sk3_esk5_1(X0))
| reachable(sk3_esk2_1(X0),sk3_esk3_1(X0))
| p(sk3_esk2_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_22) ).
cnf(c_33,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk4_1(initial_world))
| reachable(sk3_esk1_1(initial_world),sk3_esk5_1(initial_world))
| reachable(sk3_esk2_1(initial_world),sk3_esk3_1(initial_world))
| p(sk3_esk2_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_4]) ).
cnf(c_5,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk2_1(X0))
| reachable(sk3_esk1_1(X0),sk3_esk4_1(X0))
| reachable(sk3_esk1_1(X0),sk3_esk5_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_23) ).
cnf(c_32,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk2_1(initial_world))
| reachable(sk3_esk1_1(initial_world),sk3_esk4_1(initial_world))
| reachable(sk3_esk1_1(initial_world),sk3_esk5_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_5]) ).
cnf(c_8,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk4_1(X0))
| reachable(sk3_esk2_1(X0),sk3_esk3_1(X0))
| q(sk3_esk5_1(X0))
| p(sk3_esk2_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_26) ).
cnf(c_29,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk4_1(initial_world))
| reachable(sk3_esk2_1(initial_world),sk3_esk3_1(initial_world))
| q(sk3_esk5_1(initial_world))
| p(sk3_esk2_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_8]) ).
cnf(c_9,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk5_1(X0))
| reachable(sk3_esk2_1(X0),sk3_esk3_1(X0))
| p(sk3_esk2_1(X0))
| p(sk3_esk4_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_27) ).
cnf(c_28,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk5_1(initial_world))
| reachable(sk3_esk2_1(initial_world),sk3_esk3_1(initial_world))
| p(sk3_esk2_1(initial_world))
| p(sk3_esk4_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_9]) ).
cnf(c_10,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk4_1(X0))
| reachable(sk3_esk1_1(X0),sk3_esk5_1(X0))
| q(sk3_esk3_1(X0))
| p(sk3_esk2_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_28) ).
cnf(c_27,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk4_1(initial_world))
| reachable(sk3_esk1_1(initial_world),sk3_esk5_1(initial_world))
| q(sk3_esk3_1(initial_world))
| p(sk3_esk2_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_10]) ).
cnf(c_11,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk2_1(X0))
| reachable(sk3_esk1_1(X0),sk3_esk4_1(X0))
| q(sk3_esk5_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_29) ).
cnf(c_26,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk2_1(initial_world))
| reachable(sk3_esk1_1(initial_world),sk3_esk4_1(initial_world))
| q(sk3_esk5_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_11]) ).
cnf(c_12,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk2_1(X0))
| reachable(sk3_esk1_1(X0),sk3_esk5_1(X0))
| p(sk3_esk4_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_30) ).
cnf(c_25,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk2_1(initial_world))
| reachable(sk3_esk1_1(initial_world),sk3_esk5_1(initial_world))
| p(sk3_esk4_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_12]) ).
cnf(c_13,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk2_1(X0),sk3_esk3_1(X0))
| q(sk3_esk5_1(X0))
| p(sk3_esk2_1(X0))
| p(sk3_esk4_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_31) ).
cnf(c_24,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk2_1(initial_world),sk3_esk3_1(initial_world))
| q(sk3_esk5_1(initial_world))
| p(sk3_esk2_1(initial_world))
| p(sk3_esk4_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_13]) ).
cnf(c_14,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk4_1(X0))
| q(sk3_esk3_1(X0))
| q(sk3_esk5_1(X0))
| p(sk3_esk2_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_32) ).
cnf(c_23,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk4_1(initial_world))
| q(sk3_esk3_1(initial_world))
| q(sk3_esk5_1(initial_world))
| p(sk3_esk2_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_14]) ).
cnf(c_15,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk5_1(X0))
| q(sk3_esk3_1(X0))
| p(sk3_esk2_1(X0))
| p(sk3_esk4_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_33) ).
cnf(c_22,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk5_1(initial_world))
| q(sk3_esk3_1(initial_world))
| p(sk3_esk2_1(initial_world))
| p(sk3_esk4_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_15]) ).
cnf(c_16,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(sk3_esk1_1(X0),sk3_esk2_1(X0))
| q(sk3_esk5_1(X0))
| p(sk3_esk4_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_34) ).
cnf(c_21,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sk3_esk1_1(initial_world),sk3_esk2_1(initial_world))
| q(sk3_esk5_1(initial_world))
| p(sk3_esk4_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_16]) ).
cnf(c_17,negated_conjecture,
( ~ reachable(initial_world,X0)
| q(sk3_esk3_1(X0))
| q(sk3_esk5_1(X0))
| p(sk3_esk2_1(X0))
| p(sk3_esk4_1(X0)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_260148.p',c_0_35) ).
cnf(c_20,plain,
( ~ reachable(initial_world,initial_world)
| q(sk3_esk3_1(initial_world))
| q(sk3_esk5_1(initial_world))
| p(sk3_esk2_1(initial_world))
| p(sk3_esk4_1(initial_world)) ),
inference(instantiation,[status(thm)],[c_17]) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_14146,c_13688,c_13447,c_13313,c_13300,c_13283,c_35,c_33,c_32,c_29,c_28,c_27,c_26,c_25,c_24,c_23,c_22,c_21,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN549+1 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.11 % Command : iprover_modulo %s %d
% 0.10/0.31 % Computer : n020.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Mon Jul 11 19:29:43 EDT 2022
% 0.15/0.31 % CPUTime :
% 0.15/0.32 % Running in mono-core mode
% 0.17/0.37 % Orienting using strategy Equiv(ClausalAll)
% 0.17/0.37 % FOF problem with conjecture
% 0.17/0.37 % 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_ed6335.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_260148.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_d53ca9 | grep -v "SZS"
% 0.17/0.39
% 0.17/0.39 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.17/0.39
% 0.17/0.39 %
% 0.17/0.39 % ------ iProver source info
% 0.17/0.39
% 0.17/0.39 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.17/0.39 % git: non_committed_changes: true
% 0.17/0.39 % git: last_make_outside_of_git: true
% 0.17/0.39
% 0.17/0.39 %
% 0.17/0.39 % ------ Input Options
% 0.17/0.39
% 0.17/0.39 % --out_options all
% 0.17/0.39 % --tptp_safe_out true
% 0.17/0.39 % --problem_path ""
% 0.17/0.39 % --include_path ""
% 0.17/0.39 % --clausifier .//eprover
% 0.17/0.39 % --clausifier_options --tstp-format
% 0.17/0.39 % --stdin false
% 0.17/0.39 % --dbg_backtrace false
% 0.17/0.39 % --dbg_dump_prop_clauses false
% 0.17/0.39 % --dbg_dump_prop_clauses_file -
% 0.17/0.39 % --dbg_out_stat false
% 0.17/0.39
% 0.17/0.39 % ------ General Options
% 0.17/0.39
% 0.17/0.39 % --fof false
% 0.17/0.39 % --time_out_real 150.
% 0.17/0.39 % --time_out_prep_mult 0.2
% 0.17/0.39 % --time_out_virtual -1.
% 0.17/0.39 % --schedule none
% 0.17/0.39 % --ground_splitting input
% 0.17/0.39 % --splitting_nvd 16
% 0.17/0.39 % --non_eq_to_eq false
% 0.17/0.39 % --prep_gs_sim true
% 0.17/0.39 % --prep_unflatten false
% 0.17/0.39 % --prep_res_sim true
% 0.17/0.39 % --prep_upred true
% 0.17/0.39 % --res_sim_input true
% 0.17/0.39 % --clause_weak_htbl true
% 0.17/0.39 % --gc_record_bc_elim false
% 0.17/0.39 % --symbol_type_check false
% 0.17/0.39 % --clausify_out false
% 0.17/0.39 % --large_theory_mode false
% 0.17/0.39 % --prep_sem_filter none
% 0.17/0.39 % --prep_sem_filter_out false
% 0.17/0.39 % --preprocessed_out false
% 0.17/0.39 % --sub_typing false
% 0.17/0.39 % --brand_transform false
% 0.17/0.39 % --pure_diseq_elim true
% 0.17/0.39 % --min_unsat_core false
% 0.17/0.39 % --pred_elim true
% 0.17/0.39 % --add_important_lit false
% 0.17/0.39 % --soft_assumptions false
% 0.17/0.39 % --reset_solvers false
% 0.17/0.39 % --bc_imp_inh []
% 0.17/0.39 % --conj_cone_tolerance 1.5
% 0.17/0.39 % --prolific_symb_bound 500
% 0.17/0.39 % --lt_threshold 2000
% 0.17/0.39
% 0.17/0.39 % ------ SAT Options
% 0.17/0.39
% 0.17/0.39 % --sat_mode false
% 0.17/0.39 % --sat_fm_restart_options ""
% 0.17/0.39 % --sat_gr_def false
% 0.17/0.39 % --sat_epr_types true
% 0.17/0.39 % --sat_non_cyclic_types false
% 0.17/0.39 % --sat_finite_models false
% 0.17/0.39 % --sat_fm_lemmas false
% 0.17/0.39 % --sat_fm_prep false
% 0.17/0.39 % --sat_fm_uc_incr true
% 0.17/0.39 % --sat_out_model small
% 0.17/0.39 % --sat_out_clauses false
% 0.17/0.39
% 0.17/0.39 % ------ QBF Options
% 0.17/0.39
% 0.17/0.39 % --qbf_mode false
% 0.17/0.39 % --qbf_elim_univ true
% 0.17/0.39 % --qbf_sk_in true
% 0.17/0.39 % --qbf_pred_elim true
% 0.17/0.39 % --qbf_split 32
% 0.17/0.39
% 0.17/0.39 % ------ BMC1 Options
% 0.17/0.39
% 0.17/0.39 % --bmc1_incremental false
% 0.17/0.39 % --bmc1_axioms reachable_all
% 0.17/0.39 % --bmc1_min_bound 0
% 0.17/0.39 % --bmc1_max_bound -1
% 0.17/0.39 % --bmc1_max_bound_default -1
% 0.17/0.39 % --bmc1_symbol_reachability true
% 0.17/0.39 % --bmc1_property_lemmas false
% 0.17/0.39 % --bmc1_k_induction false
% 0.17/0.39 % --bmc1_non_equiv_states false
% 0.17/0.39 % --bmc1_deadlock false
% 0.17/0.39 % --bmc1_ucm false
% 0.17/0.39 % --bmc1_add_unsat_core none
% 0.17/0.39 % --bmc1_unsat_core_children false
% 0.17/0.39 % --bmc1_unsat_core_extrapolate_axioms false
% 0.17/0.39 % --bmc1_out_stat full
% 0.17/0.39 % --bmc1_ground_init false
% 0.17/0.39 % --bmc1_pre_inst_next_state false
% 0.17/0.39 % --bmc1_pre_inst_state false
% 0.17/0.39 % --bmc1_pre_inst_reach_state false
% 0.17/0.39 % --bmc1_out_unsat_core false
% 0.17/0.39 % --bmc1_aig_witness_out false
% 0.17/0.39 % --bmc1_verbose false
% 0.17/0.39 % --bmc1_dump_clauses_tptp false
% 0.17/0.40 % --bmc1_dump_unsat_core_tptp false
% 0.17/0.40 % --bmc1_dump_file -
% 0.17/0.40 % --bmc1_ucm_expand_uc_limit 128
% 0.17/0.40 % --bmc1_ucm_n_expand_iterations 6
% 0.17/0.40 % --bmc1_ucm_extend_mode 1
% 0.17/0.40 % --bmc1_ucm_init_mode 2
% 0.17/0.40 % --bmc1_ucm_cone_mode none
% 0.17/0.40 % --bmc1_ucm_reduced_relation_type 0
% 0.17/0.40 % --bmc1_ucm_relax_model 4
% 0.17/0.40 % --bmc1_ucm_full_tr_after_sat true
% 0.17/0.40 % --bmc1_ucm_expand_neg_assumptions false
% 0.17/0.40 % --bmc1_ucm_layered_model none
% 0.17/0.40 % --bmc1_ucm_max_lemma_size 10
% 0.17/0.40
% 0.17/0.40 % ------ AIG Options
% 0.17/0.40
% 0.17/0.40 % --aig_mode false
% 0.17/0.40
% 0.17/0.40 % ------ Instantiation Options
% 0.17/0.40
% 0.17/0.40 % --instantiation_flag true
% 0.17/0.40 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.17/0.40 % --inst_solver_per_active 750
% 0.17/0.40 % --inst_solver_calls_frac 0.5
% 0.17/0.40 % --inst_passive_queue_type priority_queues
% 0.17/0.40 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.17/0.40 % --inst_passive_queues_freq [25;2]
% 0.17/0.40 % --inst_dismatching true
% 0.17/0.40 % --inst_eager_unprocessed_to_passive true
% 0.17/0.40 % --inst_prop_sim_given true
% 0.17/0.40 % --inst_prop_sim_new false
% 0.17/0.40 % --inst_orphan_elimination true
% 0.17/0.40 % --inst_learning_loop_flag true
% 0.17/0.40 % --inst_learning_start 3000
% 0.17/0.40 % --inst_learning_factor 2
% 0.17/0.40 % --inst_start_prop_sim_after_learn 3
% 0.17/0.40 % --inst_sel_renew solver
% 0.17/0.40 % --inst_lit_activity_flag true
% 0.17/0.40 % --inst_out_proof true
% 0.17/0.40
% 0.17/0.40 % ------ Resolution Options
% 0.17/0.40
% 0.17/0.40 % --resolution_flag true
% 0.17/0.40 % --res_lit_sel kbo_max
% 0.17/0.40 % --res_to_prop_solver none
% 0.17/0.40 % --res_prop_simpl_new false
% 0.17/0.40 % --res_prop_simpl_given false
% 0.17/0.40 % --res_passive_queue_type priority_queues
% 0.17/0.40 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.17/0.40 % --res_passive_queues_freq [15;5]
% 0.17/0.40 % --res_forward_subs full
% 0.17/0.40 % --res_backward_subs full
% 0.17/0.40 % --res_forward_subs_resolution true
% 0.17/0.40 % --res_backward_subs_resolution true
% 0.17/0.40 % --res_orphan_elimination false
% 0.17/0.40 % --res_time_limit 1000.
% 0.17/0.40 % --res_out_proof true
% 0.17/0.40 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ed6335.s
% 0.17/0.40 % --modulo true
% 0.17/0.40
% 0.17/0.40 % ------ Combination Options
% 0.17/0.40
% 0.17/0.40 % --comb_res_mult 1000
% 0.17/0.40 % --comb_inst_mult 300
% 0.17/0.40 % ------
% 0.17/0.40
% 0.17/0.40 % ------ Parsing...% successful
% 0.17/0.40
% 0.17/0.40 % ------ 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.17/0.40
% 0.17/0.40 % ------ Proving...
% 0.17/0.40 % ------ Problem Properties
% 0.17/0.40
% 0.17/0.40 %
% 0.17/0.40 % EPR false
% 0.17/0.40 % Horn false
% 0.17/0.40 % Has equality false
% 0.17/0.40
% 0.17/0.40 % % ------ Input Options Time Limit: Unbounded
% 0.17/0.40
% 0.17/0.40
% 0.17/0.40 % % ------ Current options:
% 0.17/0.40
% 0.17/0.40 % ------ Input Options
% 0.17/0.40
% 0.17/0.40 % --out_options all
% 0.17/0.40 % --tptp_safe_out true
% 0.17/0.40 % --problem_path ""
% 0.17/0.40 % --include_path ""
% 0.17/0.40 % --clausifier .//eprover
% 0.17/0.40 % --clausifier_options --tstp-format
% 0.17/0.40 % --stdin false
% 0.17/0.40 % --dbg_backtrace false
% 0.17/0.40 % --dbg_dump_prop_clauses false
% 0.17/0.40 % --dbg_dump_prop_clauses_file -
% 0.17/0.40 % --dbg_out_stat false
% 0.17/0.40
% 0.17/0.40 % ------ General Options
% 0.17/0.40
% 0.17/0.40 % --fof false
% 0.17/0.40 % --time_out_real 150.
% 0.17/0.40 % --time_out_prep_mult 0.2
% 0.17/0.40 % --time_out_virtual -1.
% 0.17/0.40 % --schedule none
% 0.17/0.40 % --ground_splitting input
% 0.17/0.40 % --splitting_nvd 16
% 0.17/0.40 % --non_eq_to_eq false
% 0.17/0.40 % --prep_gs_sim true
% 0.17/0.40 % --prep_unflatten false
% 0.17/0.40 % --prep_res_sim true
% 0.17/0.40 % --prep_upred true
% 0.17/0.40 % --res_sim_input true
% 0.17/0.40 % --clause_weak_htbl true
% 0.17/0.40 % --gc_record_bc_elim false
% 0.17/0.40 % --symbol_type_check false
% 0.17/0.40 % --clausify_out false
% 0.17/0.40 % --large_theory_mode false
% 0.17/0.40 % --prep_sem_filter none
% 0.17/0.40 % --prep_sem_filter_out false
% 0.17/0.40 % --preprocessed_out false
% 0.17/0.40 % --sub_typing false
% 0.17/0.40 % --brand_transform false
% 0.17/0.40 % --pure_diseq_elim true
% 0.17/0.40 % --min_unsat_core false
% 0.17/0.40 % --pred_elim true
% 0.17/0.40 % --add_important_lit false
% 0.17/0.40 % --soft_assumptions false
% 0.17/0.40 % --reset_solvers false
% 0.17/0.40 % --bc_imp_inh []
% 0.17/0.40 % --conj_cone_tolerance 1.5
% 0.17/0.40 % --prolific_symb_bound 500
% 0.17/0.40 % --lt_threshold 2000
% 0.17/0.40
% 0.17/0.40 % ------ SAT Options
% 0.17/0.40
% 0.17/0.40 % --sat_mode false
% 0.17/0.40 % --sat_fm_restart_options ""
% 0.17/0.40 % --sat_gr_def false
% 0.17/0.40 % --sat_epr_types true
% 0.17/0.40 % --sat_non_cyclic_types false
% 0.17/0.40 % --sat_finite_models false
% 0.17/0.40 % --sat_fm_lemmas false
% 0.17/0.40 % --sat_fm_prep false
% 0.17/0.40 % --sat_fm_uc_incr true
% 0.17/0.40 % --sat_out_model small
% 0.17/0.40 % --sat_out_clauses false
% 0.17/0.40
% 0.17/0.40 % ------ QBF Options
% 0.17/0.40
% 0.17/0.40 % --qbf_mode false
% 0.17/0.40 % --qbf_elim_univ true
% 0.17/0.40 % --qbf_sk_in true
% 0.17/0.40 % --qbf_pred_elim true
% 0.17/0.40 % --qbf_split 32
% 0.17/0.40
% 0.17/0.40 % ------ BMC1 Options
% 0.17/0.40
% 0.17/0.40 % --bmc1_incremental false
% 0.17/0.40 % --bmc1_axioms reachable_all
% 0.17/0.40 % --bmc1_min_bound 0
% 0.17/0.40 % --bmc1_max_bound -1
% 0.17/0.40 % --bmc1_max_bound_default -1
% 0.17/0.40 % --bmc1_symbol_reachability true
% 0.17/0.40 % --bmc1_property_lemmas false
% 0.17/0.40 % --bmc1_k_induction false
% 0.17/0.40 % --bmc1_non_equiv_states false
% 0.17/0.40 % --bmc1_deadlock false
% 0.17/0.40 % --bmc1_ucm false
% 0.17/0.40 % --bmc1_add_unsat_core none
% 0.17/0.40 % --bmc1_unsat_core_children false
% 0.17/0.40 % --bmc1_unsat_core_extrapolate_axioms false
% 0.17/0.40 % --bmc1_out_stat full
% 0.17/0.40 % --bmc1_ground_init false
% 0.17/0.40 % --bmc1_pre_inst_next_state false
% 0.17/0.40 % --bmc1_pre_inst_state false
% 0.17/0.40 % --bmc1_pre_inst_reach_state false
% 0.17/0.40 % --bmc1_out_unsat_core false
% 0.17/0.40 % --bmc1_aig_witness_out false
% 0.17/0.40 % --bmc1_verbose false
% 0.17/0.40 % --bmc1_dump_clauses_tptp false
% 0.17/0.40 % --bmc1_dump_unsat_core_tptp false
% 0.17/0.40 % --bmc1_dump_file -
% 0.17/0.40 % --bmc1_ucm_expand_uc_limit 128
% 0.17/0.40 % --bmc1_ucm_n_expand_iterations 6
% 0.17/0.40 % --bmc1_ucm_extend_mode 1
% 0.17/0.40 % --bmc1_ucm_init_mode 2
% 0.17/0.40 % --bmc1_ucm_cone_mode none
% 0.17/0.40 % --bmc1_ucm_reduced_relation_type 0
% 0.17/0.40 % --bmc1_ucm_relax_model 4
% 0.17/0.40 % --bmc1_ucm_full_tr_after_sat true
% 0.17/0.40 % --bmc1_ucm_expand_neg_assumptions false
% 0.17/0.40 % --bmc1_ucm_layered_model none
% 0.17/0.40 % --bmc1_ucm_max_lemma_size 10
% 0.17/0.40
% 0.17/0.40 % ------ AIG Options
% 0.17/0.40
% 0.17/0.40 % --aig_mode false
% 0.17/0.40
% 0.17/0.40 % ------ Instantiation Options
% 0.17/0.40
% 0.17/0.40 % --instantiation_flag true
% 0.17/0.40 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.17/0.40 % --inst_solver_per_active 750
% 0.17/0.40 % --inst_solver_calls_frac 0.5
% 0.17/0.40 % --inst_passive_queue_type priority_queues
% 0.17/0.40 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.17/0.40 % --inst_passive_queues_freq [25;2]
% 0.17/0.40 % --inst_dismatching true
% 0.17/0.40 % --inst_eager_unprocessed_to_passive true
% 0.17/0.40 % --inst_prop_sim_given true
% 1.60/1.80 % --inst_prop_sim_new false
% 1.60/1.80 % --inst_orphan_elimination true
% 1.60/1.80 % --inst_learning_loop_flag true
% 1.60/1.80 % --inst_learning_start 3000
% 1.60/1.80 % --inst_learning_factor 2
% 1.60/1.80 % --inst_start_prop_sim_after_learn 3
% 1.60/1.80 % --inst_sel_renew solver
% 1.60/1.80 % --inst_lit_activity_flag true
% 1.60/1.80 % --inst_out_proof true
% 1.60/1.80
% 1.60/1.80 % ------ Resolution Options
% 1.60/1.80
% 1.60/1.80 % --resolution_flag true
% 1.60/1.80 % --res_lit_sel kbo_max
% 1.60/1.80 % --res_to_prop_solver none
% 1.60/1.80 % --res_prop_simpl_new false
% 1.60/1.80 % --res_prop_simpl_given false
% 1.60/1.80 % --res_passive_queue_type priority_queues
% 1.60/1.80 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.60/1.80 % --res_passive_queues_freq [15;5]
% 1.60/1.80 % --res_forward_subs full
% 1.60/1.80 % --res_backward_subs full
% 1.60/1.80 % --res_forward_subs_resolution true
% 1.60/1.80 % --res_backward_subs_resolution true
% 1.60/1.80 % --res_orphan_elimination false
% 1.60/1.80 % --res_time_limit 1000.
% 1.60/1.80 % --res_out_proof true
% 1.60/1.80 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ed6335.s
% 1.60/1.80 % --modulo true
% 1.60/1.80
% 1.60/1.80 % ------ Combination Options
% 1.60/1.80
% 1.60/1.80 % --comb_res_mult 1000
% 1.60/1.80 % --comb_inst_mult 300
% 1.60/1.80 % ------
% 1.60/1.80
% 1.60/1.80
% 1.60/1.80
% 1.60/1.80 % ------ Proving...
% 1.60/1.80 %
% 1.60/1.80
% 1.60/1.80
% 1.60/1.80 % ------ Statistics
% 1.60/1.80
% 1.60/1.80 % ------ General
% 1.60/1.80
% 1.60/1.80 % num_of_input_clauses: 19
% 1.60/1.80 % num_of_input_neg_conjectures: 17
% 1.60/1.80 % num_of_splits: 0
% 1.60/1.80 % num_of_split_atoms: 0
% 1.60/1.80 % num_of_sem_filtered_clauses: 0
% 1.60/1.80 % num_of_subtypes: 0
% 1.60/1.80 % monotx_restored_types: 0
% 1.60/1.80 % sat_num_of_epr_types: 0
% 1.60/1.80 % sat_num_of_non_cyclic_types: 0
% 1.60/1.80 % sat_guarded_non_collapsed_types: 0
% 1.60/1.80 % is_epr: 0
% 1.60/1.80 % is_horn: 0
% 1.60/1.80 % has_eq: 0
% 1.60/1.80 % num_pure_diseq_elim: 0
% 1.60/1.80 % simp_replaced_by: 0
% 1.60/1.80 % res_preprocessed: 34
% 1.60/1.80 % prep_upred: 0
% 1.60/1.80 % prep_unflattend: 0
% 1.60/1.80 % pred_elim_cands: 0
% 1.60/1.80 % pred_elim: 0
% 1.60/1.80 % pred_elim_cl: 0
% 1.60/1.80 % pred_elim_cycles: 0
% 1.60/1.80 % forced_gc_time: 0
% 1.60/1.80 % gc_basic_clause_elim: 0
% 1.60/1.80 % parsing_time: 0.001
% 1.60/1.80 % sem_filter_time: 0.
% 1.60/1.80 % pred_elim_time: 0.
% 1.60/1.80 % out_proof_time: 0.004
% 1.60/1.80 % monotx_time: 0.
% 1.60/1.80 % subtype_inf_time: 0.
% 1.60/1.80 % unif_index_cands_time: 0.003
% 1.60/1.80 % unif_index_add_time: 0.002
% 1.60/1.80 % total_time: 1.424
% 1.60/1.80 % num_of_symbols: 34
% 1.60/1.80 % num_of_terms: 2210
% 1.60/1.80
% 1.60/1.80 % ------ Propositional Solver
% 1.60/1.80
% 1.60/1.80 % prop_solver_calls: 11
% 1.60/1.80 % prop_fast_solver_calls: 240
% 1.60/1.80 % prop_num_of_clauses: 795
% 1.60/1.80 % prop_preprocess_simplified: 1411
% 1.60/1.80 % prop_fo_subsumed: 0
% 1.60/1.80 % prop_solver_time: 0.
% 1.60/1.80 % prop_fast_solver_time: 0.
% 1.60/1.80 % prop_unsat_core_time: 0.
% 1.60/1.80
% 1.60/1.80 % ------ QBF
% 1.60/1.80
% 1.60/1.80 % qbf_q_res: 0
% 1.60/1.80 % qbf_num_tautologies: 0
% 1.60/1.80 % qbf_prep_cycles: 0
% 1.60/1.80
% 1.60/1.80 % ------ BMC1
% 1.60/1.80
% 1.60/1.80 % bmc1_current_bound: -1
% 1.60/1.80 % bmc1_last_solved_bound: -1
% 1.60/1.80 % bmc1_unsat_core_size: -1
% 1.60/1.80 % bmc1_unsat_core_parents_size: -1
% 1.60/1.80 % bmc1_merge_next_fun: 0
% 1.60/1.80 % bmc1_unsat_core_clauses_time: 0.
% 1.60/1.80
% 1.60/1.80 % ------ Instantiation
% 1.60/1.80
% 1.60/1.80 % inst_num_of_clauses: 474
% 1.60/1.80 % inst_num_in_passive: 29
% 1.60/1.80 % inst_num_in_active: 276
% 1.60/1.80 % inst_num_in_unprocessed: 160
% 1.60/1.80 % inst_num_of_loops: 344
% 1.63/1.80 % inst_num_of_learning_restarts: 0
% 1.63/1.80 % inst_num_moves_active_passive: 51
% 1.63/1.80 % inst_lit_activity: 63
% 1.63/1.80 % inst_lit_activity_moves: 0
% 1.63/1.80 % inst_num_tautologies: 9
% 1.63/1.80 % inst_num_prop_implied: 0
% 1.63/1.80 % inst_num_existing_simplified: 0
% 1.63/1.80 % inst_num_eq_res_simplified: 0
% 1.63/1.80 % inst_num_child_elim: 0
% 1.63/1.80 % inst_num_of_dismatching_blockings: 230
% 1.63/1.80 % inst_num_of_non_proper_insts: 799
% 1.63/1.80 % inst_num_of_duplicates: 228
% 1.63/1.80 % inst_inst_num_from_inst_to_res: 0
% 1.63/1.80 % inst_dismatching_checking_time: 0.001
% 1.63/1.80
% 1.63/1.80 % ------ Resolution
% 1.63/1.80
% 1.63/1.80 % res_num_of_clauses: 3450
% 1.63/1.80 % res_num_in_passive: 3105
% 1.63/1.80 % res_num_in_active: 447
% 1.63/1.80 % res_num_of_loops: 2000
% 1.63/1.80 % res_forward_subset_subsumed: 706
% 1.63/1.80 % res_backward_subset_subsumed: 351
% 1.63/1.80 % res_forward_subsumed: 1206
% 1.63/1.80 % res_backward_subsumed: 215
% 1.63/1.80 % res_forward_subsumption_resolution: 234
% 1.63/1.80 % res_backward_subsumption_resolution: 10
% 1.63/1.80 % res_clause_to_clause_subsumption: 55197
% 1.63/1.80 % res_orphan_elimination: 0
% 1.63/1.80 % res_tautology_del: 440
% 1.63/1.80 % res_num_eq_res_simplified: 0
% 1.63/1.80 % res_num_sel_changes: 0
% 1.63/1.80 % res_moves_from_active_to_pass: 0
% 1.63/1.80
% 1.63/1.80 % Status Unsatisfiable
% 1.63/1.80 % SZS status Theorem
% 1.63/1.80 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------