%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PLA003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n032.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 : Mon Jul 18 16:57:50 EDT 2022
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 19
% Syntax : Number of formulae : 113 ( 35 unt; 0 def)
% Number of atoms : 191 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 169 ( 91 ~; 78 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 293 ( 54 sgn 93 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X5,X6,X2] :
( can(monkey(X5,X6,the_ladder),ladder(X5,X6),X2)
| ~ can(monkey(X5,X6,nothing),ladder(X5,X6),X2) ),
file('<stdin>',grab_ladder) ).
fof(c_0_1,axiom,
! [X5,X4,X6] :
( can(monkey(X5,X6,the_bananas),X4,bananas(X5,X6))
| ~ can(monkey(X5,X6,nothing),X4,bananas(X5,X6)) ),
file('<stdin>',grab_bananas) ).
fof(c_0_2,axiom,
! [X5,X4,X6] :
( can(monkey(X5,X6,nothing),X4,bananas(X5,floor))
| ~ can(monkey(X5,X6,the_bananas),X4,bananas(X5,X6)) ),
file('<stdin>',drop_bananas) ).
fof(c_0_3,axiom,
! [X5,X6,X2,X7] :
( can(monkey(X5,X6,nothing),ladder(X5,floor),X2)
| ~ can(monkey(X5,X6,the_ladder),ladder(X5,X7),X2) ),
file('<stdin>',drop_ladder) ).
fof(c_0_4,axiom,
! [X3,X1,X4] :
( can(monkey(X3,floor,the_bananas),X4,bananas(X3,floor))
| ~ can(monkey(X1,floor,the_bananas),X4,bananas(X1,floor)) ),
file('<stdin>',go_holding_bananas) ).
fof(c_0_5,axiom,
! [X3,X1,X2] :
( can(monkey(X3,floor,the_ladder),ladder(X3,floor),X2)
| ~ can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2) ),
file('<stdin>',go_holding_ladder) ).
fof(c_0_6,axiom,
! [X1,X2] :
( can(monkey(X1,floor,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2) ),
file('<stdin>',climb_down) ).
fof(c_0_7,axiom,
! [X1,X2] :
( can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,floor,nothing),ladder(X1,floor),X2) ),
file('<stdin>',climb_up) ).
fof(c_0_8,axiom,
! [X3,X1,X4,X2] :
( can(monkey(X3,floor,nothing),X4,X2)
| ~ can(monkey(X1,floor,nothing),X4,X2) ),
file('<stdin>',go_holding_nothing) ).
fof(c_0_9,plain,
! [X5,X6,X2] :
( can(monkey(X5,X6,the_ladder),ladder(X5,X6),X2)
| ~ can(monkey(X5,X6,nothing),ladder(X5,X6),X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_10,plain,
! [X5,X4,X6] :
( can(monkey(X5,X6,the_bananas),X4,bananas(X5,X6))
| ~ can(monkey(X5,X6,nothing),X4,bananas(X5,X6)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_11,plain,
! [X5,X4,X6] :
( can(monkey(X5,X6,nothing),X4,bananas(X5,floor))
| ~ can(monkey(X5,X6,the_bananas),X4,bananas(X5,X6)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_12,plain,
! [X5,X6,X2,X7] :
( can(monkey(X5,X6,nothing),ladder(X5,floor),X2)
| ~ can(monkey(X5,X6,the_ladder),ladder(X5,X7),X2) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_13,plain,
! [X3,X1,X4] :
( can(monkey(X3,floor,the_bananas),X4,bananas(X3,floor))
| ~ can(monkey(X1,floor,the_bananas),X4,bananas(X1,floor)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_14,plain,
! [X3,X1,X2] :
( can(monkey(X3,floor,the_ladder),ladder(X3,floor),X2)
| ~ can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_15,plain,
! [X1,X2] :
( can(monkey(X1,floor,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_16,plain,
! [X1,X2] :
( can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,floor,nothing),ladder(X1,floor),X2) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_17,plain,
! [X3,X1,X4,X2] :
( can(monkey(X3,floor,nothing),X4,X2)
| ~ can(monkey(X1,floor,nothing),X4,X2) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_18,plain,
! [X7,X8,X9] :
( can(monkey(X7,X8,the_ladder),ladder(X7,X8),X9)
| ~ can(monkey(X7,X8,nothing),ladder(X7,X8),X9) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_19,plain,
! [X7,X8,X9] :
( can(monkey(X7,X9,the_bananas),X8,bananas(X7,X9))
| ~ can(monkey(X7,X9,nothing),X8,bananas(X7,X9)) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_20,plain,
! [X7,X8,X9] :
( can(monkey(X7,X9,nothing),X8,bananas(X7,floor))
| ~ can(monkey(X7,X9,the_bananas),X8,bananas(X7,X9)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X8,X9,X10,X11] :
( can(monkey(X8,X9,nothing),ladder(X8,floor),X10)
| ~ can(monkey(X8,X9,the_ladder),ladder(X8,X11),X10) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_12])])]) ).
fof(c_0_22,plain,
! [X5,X6,X7] :
( can(monkey(X5,floor,the_bananas),X7,bananas(X5,floor))
| ~ can(monkey(X6,floor,the_bananas),X7,bananas(X6,floor)) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( can(monkey(X4,floor,the_ladder),ladder(X4,floor),X6)
| ~ can(monkey(X5,floor,the_ladder),ladder(X5,floor),X6) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X3,X4] :
( can(monkey(X3,floor,nothing),ladder(X3,floor),X4)
| ~ can(monkey(X3,ceiling,nothing),ladder(X3,floor),X4) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_25,plain,
! [X3,X4] :
( can(monkey(X3,ceiling,nothing),ladder(X3,floor),X4)
| ~ can(monkey(X3,floor,nothing),ladder(X3,floor),X4) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_26,plain,
! [X5,X6,X7,X8] :
( can(monkey(X5,floor,nothing),X7,X8)
| ~ can(monkey(X6,floor,nothing),X7,X8) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( can(monkey(X1,X2,the_ladder),ladder(X1,X2),X3)
| ~ can(monkey(X1,X2,nothing),ladder(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2))
| ~ can(monkey(X1,X2,nothing),X3,bananas(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( can(monkey(X1,X2,nothing),X3,bananas(X1,floor))
| ~ can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( can(monkey(X1,X2,nothing),ladder(X1,floor),X4)
| ~ can(monkey(X1,X2,the_ladder),ladder(X1,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( can(monkey(X3,floor,the_bananas),X2,bananas(X3,floor))
| ~ can(monkey(X1,floor,the_bananas),X2,bananas(X1,floor)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( can(monkey(X3,floor,the_ladder),ladder(X3,floor),X2)
| ~ can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( can(monkey(X1,floor,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,floor,nothing),ladder(X1,floor),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( can(monkey(X4,floor,nothing),X2,X3)
| ~ can(monkey(X1,floor,nothing),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( can(monkey(X1,X2,the_ladder),ladder(X1,X2),X3)
| ~ can(monkey(X1,X2,nothing),ladder(X1,X2),X3) ),
c_0_27,
[final] ).
cnf(c_0_37,plain,
( can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2))
| ~ can(monkey(X1,X2,nothing),X3,bananas(X1,X2)) ),
c_0_28,
[final] ).
cnf(c_0_38,plain,
( can(monkey(X1,X2,nothing),X3,bananas(X1,floor))
| ~ can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2)) ),
c_0_29,
[final] ).
cnf(c_0_39,plain,
( can(monkey(X1,X2,nothing),ladder(X1,floor),X4)
| ~ can(monkey(X1,X2,the_ladder),ladder(X1,X3),X4) ),
c_0_30,
[final] ).
cnf(c_0_40,plain,
( can(monkey(X3,floor,the_bananas),X2,bananas(X3,floor))
| ~ can(monkey(X1,floor,the_bananas),X2,bananas(X1,floor)) ),
c_0_31,
[final] ).
cnf(c_0_41,plain,
( can(monkey(X3,floor,the_ladder),ladder(X3,floor),X2)
| ~ can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2) ),
c_0_32,
[final] ).
cnf(c_0_42,plain,
( can(monkey(X1,floor,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2) ),
c_0_33,
[final] ).
cnf(c_0_43,plain,
( can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,floor,nothing),ladder(X1,floor),X2) ),
c_0_34,
[final] ).
cnf(c_0_44,plain,
( can(monkey(X4,floor,nothing),X2,X3)
| ~ can(monkey(X1,floor,nothing),X2,X3) ),
c_0_35,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_36_0,axiom,
( can(monkey(X1,X2,the_ladder),ladder(X1,X2),X3)
| ~ can(monkey(X1,X2,nothing),ladder(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_36_1,axiom,
( ~ can(monkey(X1,X2,nothing),ladder(X1,X2),X3)
| can(monkey(X1,X2,the_ladder),ladder(X1,X2),X3) ),
inference(literals_permutation,[status(thm)],[c_0_36]) ).
cnf(c_0_37_0,axiom,
( can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2))
| ~ can(monkey(X1,X2,nothing),X3,bananas(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_37_1,axiom,
( ~ can(monkey(X1,X2,nothing),X3,bananas(X1,X2))
| can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_37]) ).
cnf(c_0_38_0,axiom,
( can(monkey(X1,X2,nothing),X3,bananas(X1,floor))
| ~ can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_38_1,axiom,
( ~ can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2))
| can(monkey(X1,X2,nothing),X3,bananas(X1,floor)) ),
inference(literals_permutation,[status(thm)],[c_0_38]) ).
cnf(c_0_39_0,axiom,
( can(monkey(X1,X2,nothing),ladder(X1,floor),X4)
| ~ can(monkey(X1,X2,the_ladder),ladder(X1,X3),X4) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_39_1,axiom,
( ~ can(monkey(X1,X2,the_ladder),ladder(X1,X3),X4)
| can(monkey(X1,X2,nothing),ladder(X1,floor),X4) ),
inference(literals_permutation,[status(thm)],[c_0_39]) ).
cnf(c_0_40_0,axiom,
( can(monkey(X3,floor,the_bananas),X2,bananas(X3,floor))
| ~ can(monkey(X1,floor,the_bananas),X2,bananas(X1,floor)) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_40_1,axiom,
( ~ can(monkey(X1,floor,the_bananas),X2,bananas(X1,floor))
| can(monkey(X3,floor,the_bananas),X2,bananas(X3,floor)) ),
inference(literals_permutation,[status(thm)],[c_0_40]) ).
cnf(c_0_41_0,axiom,
( can(monkey(X3,floor,the_ladder),ladder(X3,floor),X2)
| ~ can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_41_1,axiom,
( ~ can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2)
| can(monkey(X3,floor,the_ladder),ladder(X3,floor),X2) ),
inference(literals_permutation,[status(thm)],[c_0_41]) ).
cnf(c_0_42_0,axiom,
( can(monkey(X1,floor,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_42_1,axiom,
( ~ can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2)
| can(monkey(X1,floor,nothing),ladder(X1,floor),X2) ),
inference(literals_permutation,[status(thm)],[c_0_42]) ).
cnf(c_0_43_0,axiom,
( can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,floor,nothing),ladder(X1,floor),X2) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_43_1,axiom,
( ~ can(monkey(X1,floor,nothing),ladder(X1,floor),X2)
| can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2) ),
inference(literals_permutation,[status(thm)],[c_0_43]) ).
cnf(c_0_44_0,axiom,
( can(monkey(X4,floor,nothing),X2,X3)
| ~ can(monkey(X1,floor,nothing),X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( ~ can(monkey(X1,floor,nothing),X2,X3)
| can(monkey(X4,floor,nothing),X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
! [X1,X2,X3,X4] : ~ can(monkey(X2,X3,the_bananas),X4,X1),
file('<stdin>',prove_the_monkey_can_get_the_bananas) ).
fof(c_0_1_002,hypothesis,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
file('<stdin>',initial_situation) ).
fof(c_0_2_003,negated_conjecture,
! [X1,X2,X3,X4] : ~ can(monkey(X2,X3,the_bananas),X4,X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_004,hypothesis,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
c_0_1 ).
fof(c_0_4_005,negated_conjecture,
! [X5,X6,X7,X8] : ~ can(monkey(X6,X7,the_bananas),X8,X5),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5_006,hypothesis,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
c_0_3 ).
cnf(c_0_6_007,negated_conjecture,
~ can(monkey(X1,X2,the_bananas),X3,X4),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,hypothesis,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
~ can(monkey(X1,X2,the_bananas),X3,X4),
c_0_6,
[final] ).
cnf(c_0_9_010,hypothesis,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_19,plain,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p',c_0_9) ).
cnf(c_27,plain,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_34,plain,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_35,plain,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_38,plain,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_97,plain,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_0,plain,
( can(monkey(X0,floor,nothing),X1,X2)
| ~ can(monkey(X3,floor,nothing),X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p',c_0_44_1) ).
cnf(c_59,plain,
( can(monkey(X0,floor,nothing),X1,X2)
| ~ can(monkey(X3,floor,nothing),X1,X2) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_113,plain,
can(monkey(X0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[c_97,c_59]) ).
cnf(c_114,plain,
can(monkey(X0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(rewriting,[status(thm)],[c_113]) ).
cnf(c_16,plain,
( can(monkey(X0,X1,the_ladder),ladder(X0,X1),X2)
| ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p',c_0_36_1) ).
cnf(c_91,plain,
( can(monkey(X0,X1,the_ladder),ladder(X0,X1),X2)
| ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_92,plain,
( ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2)
| can(monkey(X0,X1,the_ladder),ladder(X0,X1),X2) ),
inference(rewriting,[status(thm)],[c_91]) ).
cnf(c_121,plain,
can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[c_114,c_92]) ).
cnf(c_122,plain,
can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling)),
inference(rewriting,[status(thm)],[c_121]) ).
cnf(c_6,plain,
( can(monkey(X0,floor,the_ladder),ladder(X0,floor),X1)
| ~ can(monkey(X2,floor,the_ladder),ladder(X2,floor),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p',c_0_41_1) ).
cnf(c_71,plain,
( can(monkey(X0,floor,the_ladder),ladder(X0,floor),X1)
| ~ can(monkey(X2,floor,the_ladder),ladder(X2,floor),X1) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_129,plain,
can(monkey(X0,floor,the_ladder),ladder(X0,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[c_122,c_71]) ).
cnf(c_130,plain,
can(monkey(X0,floor,the_ladder),ladder(X0,floor),bananas(l2,ceiling)),
inference(rewriting,[status(thm)],[c_129]) ).
cnf(c_10,plain,
( can(monkey(X0,X1,nothing),ladder(X0,floor),X2)
| ~ can(monkey(X0,X1,the_ladder),ladder(X0,X3),X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p',c_0_39_1) ).
cnf(c_79,plain,
( can(monkey(X0,X1,nothing),ladder(X0,floor),X2)
| ~ can(monkey(X0,X1,the_ladder),ladder(X0,X3),X2) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_137,plain,
can(monkey(X0,floor,nothing),ladder(X0,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[c_130,c_79]) ).
cnf(c_138,plain,
can(monkey(X0,floor,nothing),ladder(X0,floor),bananas(l2,ceiling)),
inference(rewriting,[status(thm)],[c_137]) ).
cnf(c_2,plain,
( can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1)
| ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p',c_0_43_1) ).
cnf(c_63,plain,
( can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1)
| ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_64,plain,
( ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1)
| can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1) ),
inference(rewriting,[status(thm)],[c_63]) ).
cnf(c_143,plain,
can(monkey(X0,ceiling,nothing),ladder(X0,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[c_138,c_64]) ).
cnf(c_144,plain,
can(monkey(X0,ceiling,nothing),ladder(X0,floor),bananas(l2,ceiling)),
inference(rewriting,[status(thm)],[c_143]) ).
cnf(c_18,negated_conjecture,
~ can(monkey(X0,X1,the_bananas),X2,X3),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p',c_0_8) ).
cnf(c_29,negated_conjecture,
~ can(monkey(X0,X1,the_bananas),X2,X3),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_33,negated_conjecture,
~ can(monkey(X0,X1,the_bananas),X2,X3),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_36,negated_conjecture,
~ can(monkey(X0,X1,the_bananas),X2,X3),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_37,negated_conjecture,
~ can(monkey(X0,X1,the_bananas),X2,X3),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_95,plain,
~ can(monkey(X0,X1,the_bananas),X2,X3),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_14,plain,
( can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1))
| ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p',c_0_37_1) ).
cnf(c_87,plain,
( can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1))
| ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_88,plain,
( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1))
| can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1)) ),
inference(rewriting,[status(thm)],[c_87]) ).
cnf(c_101,plain,
~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)),
inference(backward_subsumption_resolution,[status(thm)],[c_95,c_88]) ).
cnf(c_102,plain,
~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)),
inference(rewriting,[status(thm)],[c_101]) ).
cnf(c_159,plain,
$false,
inference(resolution,[status(thm)],[c_144,c_102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : PLA003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.10 % Command : iprover_modulo %s %d
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Tue May 31 20:49:59 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.29 % Running in mono-core mode
% 0.14/0.34 % Orienting using strategy Equiv(ClausalAll)
% 0.14/0.34 % Orientation found
% 0.14/0.34 % 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_6314a8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_0c82fa | grep -v "SZS"
% 0.14/0.36
% 0.14/0.36 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.14/0.36
% 0.14/0.36 %
% 0.14/0.36 % ------ iProver source info
% 0.14/0.36
% 0.14/0.36 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.14/0.36 % git: non_committed_changes: true
% 0.14/0.36 % git: last_make_outside_of_git: true
% 0.14/0.36
% 0.14/0.36 %
% 0.14/0.36 % ------ Input Options
% 0.14/0.36
% 0.14/0.36 % --out_options all
% 0.14/0.36 % --tptp_safe_out true
% 0.14/0.36 % --problem_path ""
% 0.14/0.36 % --include_path ""
% 0.14/0.36 % --clausifier .//eprover
% 0.14/0.36 % --clausifier_options --tstp-format
% 0.14/0.36 % --stdin false
% 0.14/0.36 % --dbg_backtrace false
% 0.14/0.36 % --dbg_dump_prop_clauses false
% 0.14/0.36 % --dbg_dump_prop_clauses_file -
% 0.14/0.36 % --dbg_out_stat false
% 0.14/0.36
% 0.14/0.36 % ------ General Options
% 0.14/0.36
% 0.14/0.36 % --fof false
% 0.14/0.36 % --time_out_real 150.
% 0.14/0.36 % --time_out_prep_mult 0.2
% 0.14/0.36 % --time_out_virtual -1.
% 0.14/0.36 % --schedule none
% 0.14/0.36 % --ground_splitting input
% 0.14/0.36 % --splitting_nvd 16
% 0.14/0.36 % --non_eq_to_eq false
% 0.14/0.36 % --prep_gs_sim true
% 0.14/0.36 % --prep_unflatten false
% 0.14/0.36 % --prep_res_sim true
% 0.14/0.36 % --prep_upred true
% 0.14/0.36 % --res_sim_input true
% 0.14/0.36 % --clause_weak_htbl true
% 0.14/0.36 % --gc_record_bc_elim false
% 0.14/0.36 % --symbol_type_check false
% 0.14/0.36 % --clausify_out false
% 0.14/0.36 % --large_theory_mode false
% 0.14/0.36 % --prep_sem_filter none
% 0.14/0.36 % --prep_sem_filter_out false
% 0.14/0.36 % --preprocessed_out false
% 0.14/0.36 % --sub_typing false
% 0.14/0.36 % --brand_transform false
% 0.14/0.36 % --pure_diseq_elim true
% 0.14/0.36 % --min_unsat_core false
% 0.14/0.36 % --pred_elim true
% 0.14/0.36 % --add_important_lit false
% 0.14/0.36 % --soft_assumptions false
% 0.14/0.36 % --reset_solvers false
% 0.14/0.36 % --bc_imp_inh []
% 0.14/0.36 % --conj_cone_tolerance 1.5
% 0.14/0.36 % --prolific_symb_bound 500
% 0.14/0.36 % --lt_threshold 2000
% 0.14/0.36
% 0.14/0.36 % ------ SAT Options
% 0.14/0.36
% 0.14/0.36 % --sat_mode false
% 0.14/0.36 % --sat_fm_restart_options ""
% 0.14/0.36 % --sat_gr_def false
% 0.14/0.36 % --sat_epr_types true
% 0.14/0.36 % --sat_non_cyclic_types false
% 0.14/0.36 % --sat_finite_models false
% 0.14/0.36 % --sat_fm_lemmas false
% 0.14/0.36 % --sat_fm_prep false
% 0.14/0.36 % --sat_fm_uc_incr true
% 0.14/0.36 % --sat_out_model small
% 0.14/0.36 % --sat_out_clauses false
% 0.14/0.36
% 0.14/0.36 % ------ QBF Options
% 0.14/0.36
% 0.14/0.36 % --qbf_mode false
% 0.14/0.36 % --qbf_elim_univ true
% 0.14/0.36 % --qbf_sk_in true
% 0.14/0.36 % --qbf_pred_elim true
% 0.14/0.36 % --qbf_split 32
% 0.14/0.36
% 0.14/0.36 % ------ BMC1 Options
% 0.14/0.36
% 0.14/0.36 % --bmc1_incremental false
% 0.14/0.36 % --bmc1_axioms reachable_all
% 0.14/0.36 % --bmc1_min_bound 0
% 0.14/0.36 % --bmc1_max_bound -1
% 0.14/0.36 % --bmc1_max_bound_default -1
% 0.14/0.36 % --bmc1_symbol_reachability true
% 0.14/0.36 % --bmc1_property_lemmas false
% 0.14/0.36 % --bmc1_k_induction false
% 0.14/0.36 % --bmc1_non_equiv_states false
% 0.14/0.36 % --bmc1_deadlock false
% 0.14/0.36 % --bmc1_ucm false
% 0.14/0.36 % --bmc1_add_unsat_core none
% 0.14/0.36 % --bmc1_unsat_core_children false
% 0.14/0.36 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.36 % --bmc1_out_stat full
% 0.14/0.36 % --bmc1_ground_init false
% 0.14/0.36 % --bmc1_pre_inst_next_state false
% 0.14/0.36 % --bmc1_pre_inst_state false
% 0.14/0.36 % --bmc1_pre_inst_reach_state false
% 0.14/0.36 % --bmc1_out_unsat_core false
% 0.14/0.36 % --bmc1_aig_witness_out false
% 0.14/0.36 % --bmc1_verbose false
% 0.14/0.36 % --bmc1_dump_clauses_tptp false
% 0.14/0.36 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.36 % --bmc1_dump_file -
% 0.14/0.36 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.36 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.36 % --bmc1_ucm_extend_mode 1
% 0.14/0.36 % --bmc1_ucm_init_mode 2
% 0.14/0.36 % --bmc1_ucm_cone_mode none
% 0.14/0.36 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.36 % --bmc1_ucm_relax_model 4
% 0.14/0.36 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.36 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.36 % --bmc1_ucm_layered_model none
% 0.14/0.36 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.36
% 0.14/0.36 % ------ AIG Options
% 0.14/0.36
% 0.14/0.36 % --aig_mode false
% 0.14/0.36
% 0.14/0.36 % ------ Instantiation Options
% 0.14/0.36
% 0.14/0.36 % --instantiation_flag true
% 0.14/0.36 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.36 % --inst_solver_per_active 750
% 0.14/0.36 % --inst_solver_calls_frac 0.5
% 0.14/0.36 % --inst_passive_queue_type priority_queues
% 0.14/0.36 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.36 % --inst_passive_queues_freq [25;2]
% 0.14/0.36 % --inst_dismatching true
% 0.14/0.36 % --inst_eager_unprocessed_to_passive true
% 0.14/0.36 % --inst_prop_sim_given true
% 0.14/0.36 % --inst_prop_sim_new false
% 0.14/0.36 % --inst_orphan_elimination true
% 0.14/0.36 % --inst_learning_loop_flag true
% 0.14/0.36 % --inst_learning_start 3000
% 0.14/0.36 % --inst_learning_factor 2
% 0.14/0.36 % --inst_start_prop_sim_after_learn 3
% 0.14/0.36 % --inst_sel_renew solver
% 0.14/0.36 % --inst_lit_activity_flag true
% 0.14/0.36 % --inst_out_proof true
% 0.14/0.36
% 0.14/0.36 % ------ Resolution Options
% 0.14/0.36
% 0.14/0.36 % --resolution_flag true
% 0.14/0.36 % --res_lit_sel kbo_max
% 0.14/0.36 % --res_to_prop_solver none
% 0.14/0.36 % --res_prop_simpl_new false
% 0.14/0.36 % --res_prop_simpl_given false
% 0.14/0.36 % --res_passive_queue_type priority_queues
% 0.14/0.36 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.36 % --res_passive_queues_freq [15;5]
% 0.14/0.36 % --res_forward_subs full
% 0.14/0.36 % --res_backward_subs full
% 0.14/0.36 % --res_forward_subs_resolution true
% 0.14/0.36 % --res_backward_subs_resolution true
% 0.14/0.36 % --res_orphan_elimination false
% 0.14/0.36 % --res_time_limit 1000.
% 0.14/0.36 % --res_out_proof true
% 0.14/0.36 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6314a8.s
% 0.14/0.36 % --modulo true
% 0.14/0.36
% 0.14/0.36 % ------ Combination Options
% 0.14/0.36
% 0.14/0.36 % --comb_res_mult 1000
% 0.14/0.36 % --comb_inst_mult 300
% 0.14/0.36 % ------
% 0.14/0.36
% 0.14/0.36 % ------ Parsing...% successful
% 0.14/0.36
% 0.14/0.36 % ------ 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.14/0.36
% 0.14/0.36 % ------ Proving...
% 0.14/0.36 % ------ Problem Properties
% 0.14/0.36
% 0.14/0.36 %
% 0.14/0.36 % EPR false
% 0.14/0.36 % Horn true
% 0.14/0.36 % Has equality false
% 0.14/0.36
% 0.14/0.36 % % ------ Input Options Time Limit: Unbounded
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % % ------ Current options:
% 0.14/0.36
% 0.14/0.36 % ------ Input Options
% 0.14/0.36
% 0.14/0.36 % --out_options all
% 0.14/0.36 % --tptp_safe_out true
% 0.14/0.36 % --problem_path ""
% 0.14/0.36 % --include_path ""
% 0.14/0.36 % --clausifier .//eprover
% 0.14/0.36 % --clausifier_options --tstp-format
% 0.14/0.36 % --stdin false
% 0.14/0.36 % --dbg_backtrace false
% 0.14/0.36 % --dbg_dump_prop_clauses false
% 0.14/0.36 % --dbg_dump_prop_clauses_file -
% 0.14/0.36 % --dbg_out_stat false
% 0.14/0.36
% 0.14/0.36 % ------ General Options
% 0.14/0.36
% 0.14/0.36 % --fof false
% 0.14/0.36 % --time_out_real 150.
% 0.14/0.36 % --time_out_prep_mult 0.2
% 0.14/0.36 % --time_out_virtual -1.
% 0.14/0.36 % --schedule none
% 0.14/0.36 % --ground_splitting input
% 0.14/0.36 % --splitting_nvd 16
% 0.14/0.36 % --non_eq_to_eq false
% 0.14/0.36 % --prep_gs_sim true
% 0.14/0.36 % --prep_unflatten false
% 0.14/0.36 % --prep_res_sim true
% 0.14/0.36 % --prep_upred true
% 0.14/0.36 % --res_sim_input true
% 0.14/0.36 % --clause_weak_htbl true
% 0.14/0.36 % --gc_record_bc_elim false
% 0.14/0.36 % --symbol_type_check false
% 0.14/0.36 % --clausify_out false
% 0.14/0.36 % --large_theory_mode false
% 0.14/0.36 % --prep_sem_filter none
% 0.14/0.36 % --prep_sem_filter_out false
% 0.14/0.36 % --preprocessed_out false
% 0.14/0.36 % --sub_typing false
% 0.14/0.36 % --brand_transform false
% 0.14/0.36 % --pure_diseq_elim true
% 0.14/0.36 % --min_unsat_core false
% 0.14/0.36 % --pred_elim true
% 0.14/0.36 % --add_important_lit false
% 0.14/0.36 % --soft_assumptions false
% 0.14/0.36 % --reset_solvers false
% 0.14/0.36 % --bc_imp_inh []
% 0.14/0.36 % --conj_cone_tolerance 1.5
% 0.14/0.36 % --prolific_symb_bound 500
% 0.14/0.36 % --lt_threshold 2000
% 0.14/0.36
% 0.14/0.36 % ------ SAT Options
% 0.14/0.36
% 0.14/0.36 % --sat_mode false
% 0.14/0.36 % --sat_fm_restart_options ""
% 0.14/0.36 % --sat_gr_def false
% 0.14/0.36 % --sat_epr_types true
% 0.14/0.36 % --sat_non_cyclic_types false
% 0.14/0.36 % --sat_finite_models false
% 0.14/0.36 % --sat_fm_lemmas false
% 0.14/0.36 % --sat_fm_prep false
% 0.14/0.36 % --sat_fm_uc_incr true
% 0.14/0.36 % --sat_out_model small
% 0.14/0.36 % --sat_out_clauses false
% 0.14/0.36
% 0.14/0.36 % ------ QBF Options
% 0.14/0.36
% 0.14/0.36 % --qbf_mode false
% 0.14/0.36 % --qbf_elim_univ true
% 0.14/0.36 % --qbf_sk_in true
% 0.14/0.36 % --qbf_pred_elim true
% 0.14/0.36 % --qbf_split 32
% 0.14/0.36
% 0.14/0.36 % ------ BMC1 Options
% 0.14/0.36
% 0.14/0.36 % --bmc1_incremental false
% 0.14/0.36 % --bmc1_axioms reachable_all
% 0.14/0.36 % --bmc1_min_bound 0
% 0.14/0.36 % --bmc1_max_bound -1
% 0.14/0.36 % --bmc1_max_bound_default -1
% 0.14/0.36 % --bmc1_symbol_reachability true
% 0.14/0.36 % --bmc1_property_lemmas false
% 0.14/0.36 % --bmc1_k_induction false
% 0.14/0.36 % --bmc1_non_equiv_states false
% 0.14/0.36 % --bmc1_deadlock false
% 0.14/0.36 % --bmc1_ucm false
% 0.14/0.36 % --bmc1_add_unsat_core none
% 0.14/0.36 % --bmc1_unsat_core_children false
% 0.14/0.36 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.36 % --bmc1_out_stat full
% 0.14/0.36 % --bmc1_ground_init false
% 0.14/0.36 % --bmc1_pre_inst_next_state false
% 0.14/0.36 % --bmc1_pre_inst_state false
% 0.14/0.36 % --bmc1_pre_inst_reach_state false
% 0.14/0.36 % --bmc1_out_unsat_core false
% 0.14/0.36 % --bmc1_aig_witness_out false
% 0.14/0.36 % --bmc1_verbose false
% 0.14/0.36 % --bmc1_dump_clauses_tptp false
% 0.14/0.36 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.36 % --bmc1_dump_file -
% 0.14/0.36 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.36 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.36 % --bmc1_ucm_extend_mode 1
% 0.14/0.36 % --bmc1_ucm_init_mode 2
% 0.14/0.36 % --bmc1_ucm_cone_mode none
% 0.14/0.36 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.36 % --bmc1_ucm_relax_model 4
% 0.14/0.36 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.36 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.36 % --bmc1_ucm_layered_model none
% 0.14/0.36 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.36
% 0.14/0.36 % ------ AIG Options
% 0.14/0.36
% 0.14/0.36 % --aig_mode false
% 0.14/0.36
% 0.14/0.36 % ------ Instantiation Options
% 0.14/0.36
% 0.14/0.36 % --instantiation_flag true
% 0.14/0.36 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.36 % --inst_solver_per_active 750
% 0.14/0.36 % --inst_solver_calls_frac 0.5
% 0.14/0.36 % --inst_passive_queue_type priority_queues
% 0.14/0.36 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.36 % --inst_passive_queues_freq [25;2]
% 0.14/0.36 % --inst_dismatching true
% 0.14/0.36 % --inst_eager_unprocessed_to_passive true
% 0.14/0.36 % --inst_prop_sim_given true
% 0.14/0.36 % --inst_prop_sim_new false
% 0.14/0.36 % --inst_orphan_elimination true
% 0.14/0.36 % --inst_learning_loop_flag true
% 0.14/0.36 % --inst_learning_start 3000
% 0.14/0.36 % --inst_learning_factor 2
% 0.14/0.36 % --inst_start_prop_sim_after_learn 3
% 0.14/0.36 % --inst_sel_renew solver
% 0.14/0.36 % --inst_lit_activity_flag true
% 0.14/0.36 % --inst_out_proof true
% 0.14/0.36
% 0.14/0.36 % ------ Resolution Options
% 0.14/0.36
% 0.14/0.36 % --resolution_flag true
% 0.14/0.36 % --res_lit_sel kbo_max
% 0.14/0.36 % --res_to_prop_solver none
% 0.14/0.36 % --res_prop_simpl_new false
% 0.14/0.36 % --res_prop_simpl_given false
% 0.14/0.36 % --res_passive_queue_type priority_queues
% 0.14/0.36 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.36 % --res_passive_queues_freq [15;5]
% 0.14/0.36 % --res_forward_subs full
% 0.14/0.36 % --res_backward_subs full
% 0.14/0.36 % --res_forward_subs_resolution true
% 0.14/0.36 % --res_backward_subs_resolution true
% 0.14/0.36 % --res_orphan_elimination false
% 0.14/0.36 % --res_time_limit 1000.
% 0.14/0.36 % --res_out_proof true
% 0.14/0.36 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6314a8.s
% 0.14/0.36 % --modulo true
% 0.14/0.36
% 0.14/0.36 % ------ Combination Options
% 0.14/0.36
% 0.14/0.36 % --comb_res_mult 1000
% 0.14/0.36 % --comb_inst_mult 300
% 0.14/0.36 % ------
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % ------ Proving...
% 0.14/0.36 % warning: shown sat in sat incomplete mode
% 0.14/0.36 %
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 cnf(c_18,negated_conjecture,
% 0.14/0.36 ( ~ can(monkey(X0,X1,the_bananas),X2,X3) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_8) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_29,negated_conjecture,
% 0.14/0.36 ( ~ can(monkey(X0,X1,the_bananas),X2,X3) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_18]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_33,negated_conjecture,
% 0.14/0.36 ( ~ can(monkey(X0,X1,the_bananas),X2,X3) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_29]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_36,negated_conjecture,
% 0.14/0.36 ( ~ can(monkey(X0,X1,the_bananas),X2,X3) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_33]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_37,negated_conjecture,
% 0.14/0.36 ( ~ can(monkey(X0,X1,the_bananas),X2,X3) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_36]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_95,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,the_bananas),X2,X3) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_37]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_0,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1))
% 0.14/0.36 | can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1)) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_36_0) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_59,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1))
% 0.14/0.36 | can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1)) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_0]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_60,plain,
% 0.14/0.36 ( can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1))
% 0.14/0.36 | ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_59]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_101,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)) ),
% 0.14/0.36 inference(backward_subsumption_resolution,[status(thm)],[c_95,c_60]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_102,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_101]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_8,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1)
% 0.14/0.36 | can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_40_0) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_75,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1)
% 0.14/0.36 | can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_8]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_109,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),ladder(X0,floor),bananas(X0,ceiling)) ),
% 0.14/0.36 inference(resolution,[status(thm)],[c_102,c_75]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_110,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),ladder(X0,floor),bananas(X0,ceiling)) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_109]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_16,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),X1,X2)
% 0.14/0.36 | can(monkey(X3,floor,nothing),X1,X2) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_44_0) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_91,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),X1,X2)
% 0.14/0.36 | can(monkey(X3,floor,nothing),X1,X2) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_16]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_141,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),ladder(X1,floor),bananas(X1,ceiling)) ),
% 0.14/0.36 inference(resolution,[status(thm)],[c_110,c_91]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_142,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),ladder(X1,floor),bananas(X1,ceiling)) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_141]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_19,plain,
% 0.14/0.36 ( can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_9) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_27,plain,
% 0.14/0.36 ( can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_19]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_34,plain,
% 0.14/0.36 ( can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_27]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_35,plain,
% 0.14/0.36 ( can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_34]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_38,plain,
% 0.14/0.36 ( can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_35]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_97,plain,
% 0.14/0.36 ( can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_38]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_17,plain,
% 0.14/0.36 ( can(monkey(X0,floor,nothing),X1,X2)
% 0.14/0.36 | ~ can(monkey(X3,floor,nothing),X1,X2) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_44_1) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_93,plain,
% 0.14/0.36 ( can(monkey(X0,floor,nothing),X1,X2)
% 0.14/0.36 | ~ can(monkey(X3,floor,nothing),X1,X2) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_17]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_123,plain,
% 0.14/0.36 ( can(monkey(X0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
% 0.14/0.36 inference(resolution,[status(thm)],[c_97,c_93]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_124,plain,
% 0.14/0.36 ( can(monkey(X0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_123]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_111,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),X1,bananas(X2,floor)) ),
% 0.14/0.36 inference(resolution,[status(thm)],[c_102,c_91]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_112,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,nothing),X1,bananas(X2,floor)) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_111]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_10,plain,
% 0.14/0.36 ( ~ can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1)
% 0.14/0.36 | can(monkey(X0,floor,nothing),ladder(X0,floor),X1) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_41_0) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_79,plain,
% 0.14/0.36 ( ~ can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1)
% 0.14/0.36 | can(monkey(X0,floor,nothing),ladder(X0,floor),X1) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_10]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_80,plain,
% 0.14/0.36 ( can(monkey(X0,floor,nothing),ladder(X0,floor),X1)
% 0.14/0.36 | ~ can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_79]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_117,plain,
% 0.14/0.36 ( ~ can(monkey(X0,ceiling,nothing),ladder(X0,floor),bananas(X1,floor)) ),
% 0.14/0.36 inference(resolution,[status(thm)],[c_112,c_80]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_118,plain,
% 0.14/0.36 ( ~ can(monkey(X0,ceiling,nothing),ladder(X0,floor),bananas(X1,floor)) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_117]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_13,plain,
% 0.14/0.36 ( can(monkey(X0,floor,the_ladder),ladder(X0,floor),X1)
% 0.14/0.36 | ~ can(monkey(X2,floor,the_ladder),ladder(X2,floor),X1) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_42_1) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_85,plain,
% 0.14/0.36 ( can(monkey(X0,floor,the_ladder),ladder(X0,floor),X1)
% 0.14/0.36 | ~ can(monkey(X2,floor,the_ladder),ladder(X2,floor),X1) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_13]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_12,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,the_ladder),ladder(X0,floor),X1)
% 0.14/0.36 | can(monkey(X2,floor,the_ladder),ladder(X2,floor),X1) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_42_0) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_83,plain,
% 0.14/0.36 ( ~ can(monkey(X0,floor,the_ladder),ladder(X0,floor),X1)
% 0.14/0.36 | can(monkey(X2,floor,the_ladder),ladder(X2,floor),X1) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_12]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_4,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,the_ladder),ladder(X0,X2),X3)
% 0.14/0.36 | can(monkey(X0,X1,nothing),ladder(X0,floor),X3) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_38_0) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_67,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,the_ladder),ladder(X0,X2),X3)
% 0.14/0.36 | can(monkey(X0,X1,nothing),ladder(X0,floor),X3) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_4]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_68,plain,
% 0.14/0.36 ( can(monkey(X0,X1,nothing),ladder(X0,floor),X2)
% 0.14/0.36 | ~ can(monkey(X0,X1,the_ladder),ladder(X0,X3),X2) ),
% 0.14/0.36 inference(rewriting,[status(thm)],[c_67]) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_2,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2)
% 0.14/0.36 | can(monkey(X0,X1,the_ladder),ladder(X0,X1),X2) ),
% 0.14/0.36 file('/export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p', c_0_37_0) ).
% 0.14/0.36
% 0.14/0.36 cnf(c_63,plain,
% 0.14/0.36 ( ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2)
% 0.14/0.36 | can(monkey(X0,X1,the_ladder),ladder(X0,X1),X2) ),
% 0.14/0.36 inference(copy,[status(esa)],[c_2]) ).
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % ------ Statistics
% 0.14/0.36
% 0.14/0.36 % ------ General
% 0.14/0.36
% 0.14/0.36 % num_of_input_clauses: 20
% 0.14/0.36 % num_of_input_neg_conjectures: 1
% 0.14/0.36 % num_of_splits: 0
% 0.14/0.36 % num_of_split_atoms: 0
% 0.14/0.36 % num_of_sem_filtered_clauses: 0
% 0.14/0.36 % num_of_subtypes: 0
% 0.14/0.36 % monotx_restored_types: 0
% 0.14/0.36 % sat_num_of_epr_types: 0
% 0.14/0.36 % sat_num_of_non_cyclic_types: 0
% 0.14/0.36 % sat_guarded_non_collapsed_types: 0
% 0.14/0.36 % is_epr: 0
% 0.14/0.36 % is_horn: 1
% 0.14/0.36 % has_eq: 0
% 0.14/0.36 % num_pure_diseq_elim: 0
% 0.14/0.36 % simp_replaced_by: 0
% 0.14/0.36 % res_preprocessed: 3
% 0.14/0.36 % prep_upred: 0
% 0.14/0.36 % prep_unflattend: 0
% 0.14/0.36 % pred_elim_cands: 0
% 0.14/0.36 % pred_elim: 0
% 0.14/0.36 % pred_elim_cl: 0
% 0.14/0.36 % pred_elim_cycles: 0
% 0.14/0.36 % forced_gc_time: 0
% 0.14/0.36 % gc_basic_clause_elim: 0
% 0.14/0.36 % parsing_time: 0.001
% 0.14/0.36 % sem_filter_time: 0.
% 0.14/0.36 % pred_elim_time: 0.
% 0.14/0.36 % out_proof_time: 0.
% 0.14/0.36 % monotx_time: 0.
% 0.14/0.36 % subtype_inf_time: 0.
% 0.14/0.36 % unif_index_cands_time: 0.
% 0.14/0.36 % unif_index_add_time: 0.
% 0.14/0.36 % total_time: 0.02
% 0.14/0.36 % num_of_symbols: 37
% 0.14/0.36 % num_of_terms: 133
% 0.14/0.36
% 0.14/0.36 % ------ Propositional Solver
% 0.14/0.36
% 0.14/0.36 % prop_solver_calls: 1
% 0.14/0.36 % prop_fast_solver_calls: 5
% 0.14/0.36 % prop_num_of_clauses: 22
% 0.14/0.36 % prop_preprocess_simplified: 77
% 0.14/0.36 % prop_fo_subsumed: 0
% 0.14/0.36 % prop_solver_time: 0.
% 0.14/0.36 % prop_fast_solver_time: 0.
% 0.14/0.36 % prop_unsat_core_time: 0.
% 0.14/0.36
% 0.14/0.36 % ------ QBF
% 0.14/0.36
% 0.14/0.36 % qbf_q_res: 0
% 0.14/0.36 % qbf_num_tautologies: 0
% 0.14/0.36 % qbf_prep_cycles: 0
% 0.14/0.36
% 0.14/0.36 % ------ BMC1
% 0.14/0.36
% 0.14/0.36 % bmc1_current_bound: -1
% 0.14/0.36 % bmc1_last_solved_bound: -1
% 0.14/0.36 % bmc1_unsat_core_size: -1
% 0.14/0.36 % bmc1_unsat_core_parents_size: -1
% 0.14/0.36 % bmc1_merge_next_fun: 0
% 0.14/0.36 % bmc1_unsat_core_clauses_time: 0.
% 0.14/0.36
% 0.14/0.36 % ------ Instantiation
% 0.14/0.36
% 0.14/0.36 % inst_num_of_clauses: 20
% 0.14/0.36 % inst_num_in_passive: 0
% 0.14/0.36 % inst_num_in_active: 0
% 0.14/0.36 % inst_num_in_unprocessed: 20
% 0.14/0.36 % inst_num_of_loops: 0
% 0.14/0.36 % inst_num_of_learning_restarts: 0
% 0.14/0.36 % inst_num_moves_active_passive: 0
% 0.14/0.36 % inst_lit_activity: 0
% 0.14/0.36 % inst_lit_activity_moves: 0
% 0.14/0.36 % inst_num_tautologies: 0
% 0.14/0.36 % inst_num_prop_implied: 0
% 0.14/0.36 % inst_num_existing_simplified: 0
% 0.14/0.36 % inst_num_eq_res_simplified: 0
% 0.14/0.36 % inst_num_child_elim: 0
% 0.14/0.36 % inst_num_of_dismatching_blockings: 0
% 0.14/0.36 % inst_num_of_non_proper_insts: 0
% 0.14/0.36 % inst_num_of_duplicates: 0
% 0.14/0.36 % inst_inst_num_from_inst_to_res: 0
% 0.14/0.36 % inst_dismatching_checking_time: 0.
% 0.14/0.36
% 0.14/0.36 % ------ Resolution
% 0.14/0.36
% 0.14/0.36 % res_num_of_clauses: 20
% 0.14/0.36 % res_num_in_passive: 0
% 0.14/0.36 % res_num_in_active: 14
% 0.14/0.36 % res_num_of_loops: 19
% 0.14/0.36 % res_forward_subset_subsumed: 10
% 0.14/0.36 % res_backward_subset_subsumed: 0
% 0.14/0.36 % res_forward_subsumed: 9
% 0.14/0.37 % res_backward_subsumed: 6
% 0.14/0.37 % res_forward_subsumption_resolution: 0
% 0.14/0.37 % res_backward_subsumption_resolution: 1
% 0.14/0.37 % res_clause_to_clause_subsumption: 42
% 0.14/0.37 % res_orphan_elimination: 0
% 0.14/0.37 % res_tautology_del: 0
% 0.14/0.37 % res_num_eq_res_simplified: 0
% 0.14/0.37 % res_num_sel_changes: 0
% 0.14/0.37 % res_moves_from_active_to_pass: 0
% 0.14/0.37
% 0.14/0.37 % Status Unknown
% 0.14/0.39 % Orienting using strategy ClausalAll
% 0.14/0.39 % Orientation found
% 0.14/0.39 % 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_6314a8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_bf4ec7.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_912cf2 | grep -v "SZS"
% 0.14/0.41
% 0.14/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.14/0.41
% 0.14/0.41 %
% 0.14/0.41 % ------ iProver source info
% 0.14/0.41
% 0.14/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.14/0.41 % git: non_committed_changes: true
% 0.14/0.41 % git: last_make_outside_of_git: true
% 0.14/0.41
% 0.14/0.41 %
% 0.14/0.41 % ------ Input Options
% 0.14/0.41
% 0.14/0.41 % --out_options all
% 0.14/0.41 % --tptp_safe_out true
% 0.14/0.41 % --problem_path ""
% 0.14/0.41 % --include_path ""
% 0.14/0.41 % --clausifier .//eprover
% 0.14/0.41 % --clausifier_options --tstp-format
% 0.14/0.41 % --stdin false
% 0.14/0.41 % --dbg_backtrace false
% 0.14/0.41 % --dbg_dump_prop_clauses false
% 0.14/0.41 % --dbg_dump_prop_clauses_file -
% 0.14/0.41 % --dbg_out_stat false
% 0.14/0.41
% 0.14/0.41 % ------ General Options
% 0.14/0.41
% 0.14/0.41 % --fof false
% 0.14/0.41 % --time_out_real 150.
% 0.14/0.41 % --time_out_prep_mult 0.2
% 0.14/0.41 % --time_out_virtual -1.
% 0.14/0.41 % --schedule none
% 0.14/0.41 % --ground_splitting input
% 0.14/0.41 % --splitting_nvd 16
% 0.14/0.41 % --non_eq_to_eq false
% 0.14/0.41 % --prep_gs_sim true
% 0.14/0.41 % --prep_unflatten false
% 0.14/0.41 % --prep_res_sim true
% 0.14/0.41 % --prep_upred true
% 0.14/0.41 % --res_sim_input true
% 0.14/0.41 % --clause_weak_htbl true
% 0.14/0.41 % --gc_record_bc_elim false
% 0.14/0.41 % --symbol_type_check false
% 0.14/0.41 % --clausify_out false
% 0.14/0.41 % --large_theory_mode false
% 0.14/0.41 % --prep_sem_filter none
% 0.14/0.41 % --prep_sem_filter_out false
% 0.14/0.41 % --preprocessed_out false
% 0.14/0.41 % --sub_typing false
% 0.14/0.41 % --brand_transform false
% 0.14/0.41 % --pure_diseq_elim true
% 0.14/0.41 % --min_unsat_core false
% 0.14/0.41 % --pred_elim true
% 0.14/0.41 % --add_important_lit false
% 0.14/0.41 % --soft_assumptions false
% 0.14/0.41 % --reset_solvers false
% 0.14/0.41 % --bc_imp_inh []
% 0.14/0.41 % --conj_cone_tolerance 1.5
% 0.14/0.41 % --prolific_symb_bound 500
% 0.14/0.41 % --lt_threshold 2000
% 0.14/0.41
% 0.14/0.41 % ------ SAT Options
% 0.14/0.41
% 0.14/0.41 % --sat_mode false
% 0.14/0.41 % --sat_fm_restart_options ""
% 0.14/0.41 % --sat_gr_def false
% 0.14/0.41 % --sat_epr_types true
% 0.14/0.41 % --sat_non_cyclic_types false
% 0.14/0.41 % --sat_finite_models false
% 0.14/0.41 % --sat_fm_lemmas false
% 0.14/0.41 % --sat_fm_prep false
% 0.14/0.41 % --sat_fm_uc_incr true
% 0.14/0.41 % --sat_out_model small
% 0.14/0.41 % --sat_out_clauses false
% 0.14/0.41
% 0.14/0.41 % ------ QBF Options
% 0.14/0.41
% 0.14/0.41 % --qbf_mode false
% 0.14/0.41 % --qbf_elim_univ true
% 0.14/0.41 % --qbf_sk_in true
% 0.14/0.41 % --qbf_pred_elim true
% 0.14/0.41 % --qbf_split 32
% 0.14/0.41
% 0.14/0.41 % ------ BMC1 Options
% 0.14/0.41
% 0.14/0.41 % --bmc1_incremental false
% 0.14/0.41 % --bmc1_axioms reachable_all
% 0.14/0.41 % --bmc1_min_bound 0
% 0.14/0.41 % --bmc1_max_bound -1
% 0.14/0.41 % --bmc1_max_bound_default -1
% 0.14/0.41 % --bmc1_symbol_reachability true
% 0.14/0.41 % --bmc1_property_lemmas false
% 0.14/0.41 % --bmc1_k_induction false
% 0.14/0.41 % --bmc1_non_equiv_states false
% 0.14/0.41 % --bmc1_deadlock false
% 0.14/0.41 % --bmc1_ucm false
% 0.14/0.41 % --bmc1_add_unsat_core none
% 0.14/0.41 % --bmc1_unsat_core_children false
% 0.14/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.41 % --bmc1_out_stat full
% 0.14/0.41 % --bmc1_ground_init false
% 0.14/0.41 % --bmc1_pre_inst_next_state false
% 0.14/0.41 % --bmc1_pre_inst_state false
% 0.14/0.41 % --bmc1_pre_inst_reach_state false
% 0.14/0.41 % --bmc1_out_unsat_core false
% 0.14/0.41 % --bmc1_aig_witness_out false
% 0.14/0.41 % --bmc1_verbose false
% 0.14/0.41 % --bmc1_dump_clauses_tptp false
% 0.14/0.41 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.41 % --bmc1_dump_file -
% 0.14/0.41 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.41 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.41 % --bmc1_ucm_extend_mode 1
% 0.14/0.41 % --bmc1_ucm_init_mode 2
% 0.14/0.41 % --bmc1_ucm_cone_mode none
% 0.14/0.41 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.41 % --bmc1_ucm_relax_model 4
% 0.14/0.41 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.41 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.41 % --bmc1_ucm_layered_model none
% 0.14/0.41 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.41
% 0.14/0.41 % ------ AIG Options
% 0.14/0.41
% 0.14/0.41 % --aig_mode false
% 0.14/0.41
% 0.14/0.41 % ------ Instantiation Options
% 0.14/0.41
% 0.14/0.41 % --instantiation_flag true
% 0.14/0.41 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.41 % --inst_solver_per_active 750
% 0.14/0.41 % --inst_solver_calls_frac 0.5
% 0.14/0.41 % --inst_passive_queue_type priority_queues
% 0.14/0.41 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.41 % --inst_passive_queues_freq [25;2]
% 0.14/0.41 % --inst_dismatching true
% 0.14/0.41 % --inst_eager_unprocessed_to_passive true
% 0.14/0.41 % --inst_prop_sim_given true
% 0.14/0.41 % --inst_prop_sim_new false
% 0.14/0.41 % --inst_orphan_elimination true
% 0.14/0.41 % --inst_learning_loop_flag true
% 0.14/0.41 % --inst_learning_start 3000
% 0.14/0.41 % --inst_learning_factor 2
% 0.14/0.41 % --inst_start_prop_sim_after_learn 3
% 0.14/0.41 % --inst_sel_renew solver
% 0.14/0.41 % --inst_lit_activity_flag true
% 0.14/0.41 % --inst_out_proof true
% 0.14/0.41
% 0.14/0.41 % ------ Resolution Options
% 0.14/0.41
% 0.14/0.41 % --resolution_flag true
% 0.14/0.41 % --res_lit_sel kbo_max
% 0.14/0.41 % --res_to_prop_solver none
% 0.14/0.41 % --res_prop_simpl_new false
% 0.14/0.41 % --res_prop_simpl_given false
% 0.14/0.41 % --res_passive_queue_type priority_queues
% 0.14/0.41 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.41 % --res_passive_queues_freq [15;5]
% 0.14/0.41 % --res_forward_subs full
% 0.14/0.41 % --res_backward_subs full
% 0.14/0.41 % --res_forward_subs_resolution true
% 0.14/0.41 % --res_backward_subs_resolution true
% 0.14/0.41 % --res_orphan_elimination false
% 0.14/0.41 % --res_time_limit 1000.
% 0.14/0.41 % --res_out_proof true
% 0.14/0.41 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6314a8.s
% 0.14/0.41 % --modulo true
% 0.14/0.41
% 0.14/0.41 % ------ Combination Options
% 0.14/0.41
% 0.14/0.41 % --comb_res_mult 1000
% 0.14/0.41 % --comb_inst_mult 300
% 0.14/0.41 % ------
% 0.14/0.41
% 0.14/0.41 % ------ Parsing...% successful
% 0.14/0.41
% 0.14/0.41 % ------ 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.14/0.41
% 0.14/0.41 % ------ Proving...
% 0.14/0.41 % ------ Problem Properties
% 0.14/0.41
% 0.14/0.41 %
% 0.14/0.41 % EPR false
% 0.14/0.41 % Horn true
% 0.14/0.41 % Has equality false
% 0.14/0.41
% 0.14/0.41 % % ------ Input Options Time Limit: Unbounded
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 % % ------ Current options:
% 0.14/0.41
% 0.14/0.41 % ------ Input Options
% 0.14/0.41
% 0.14/0.41 % --out_options all
% 0.14/0.41 % --tptp_safe_out true
% 0.14/0.41 % --problem_path ""
% 0.14/0.41 % --include_path ""
% 0.14/0.41 % --clausifier .//eprover
% 0.14/0.41 % --clausifier_options --tstp-format
% 0.14/0.41 % --stdin false
% 0.14/0.41 % --dbg_backtrace false
% 0.14/0.41 % --dbg_dump_prop_clauses false
% 0.14/0.41 % --dbg_dump_prop_clauses_file -
% 0.14/0.41 % --dbg_out_stat false
% 0.14/0.41
% 0.14/0.41 % ------ General Options
% 0.14/0.41
% 0.14/0.41 % --fof false
% 0.14/0.41 % --time_out_real 150.
% 0.14/0.41 % --time_out_prep_mult 0.2
% 0.14/0.41 % --time_out_virtual -1.
% 0.14/0.41 % --schedule none
% 0.14/0.41 % --ground_splitting input
% 0.14/0.41 % --splitting_nvd 16
% 0.14/0.41 % --non_eq_to_eq false
% 0.14/0.41 % --prep_gs_sim true
% 0.14/0.41 % --prep_unflatten false
% 0.14/0.41 % --prep_res_sim true
% 0.14/0.41 % --prep_upred true
% 0.14/0.41 % --res_sim_input true
% 0.14/0.41 % --clause_weak_htbl true
% 0.14/0.41 % --gc_record_bc_elim false
% 0.14/0.41 % --symbol_type_check false
% 0.14/0.41 % --clausify_out false
% 0.14/0.41 % --large_theory_mode false
% 0.14/0.41 % --prep_sem_filter none
% 0.14/0.41 % --prep_sem_filter_out false
% 0.14/0.41 % --preprocessed_out false
% 0.14/0.41 % --sub_typing false
% 0.14/0.41 % --brand_transform false
% 0.14/0.41 % --pure_diseq_elim true
% 0.14/0.41 % --min_unsat_core false
% 0.14/0.41 % --pred_elim true
% 0.14/0.41 % --add_important_lit false
% 0.14/0.41 % --soft_assumptions false
% 0.14/0.41 % --reset_solvers false
% 0.14/0.41 % --bc_imp_inh []
% 0.14/0.41 % --conj_cone_tolerance 1.5
% 0.14/0.41 % --prolific_symb_bound 500
% 0.14/0.41 % --lt_threshold 2000
% 0.14/0.41
% 0.14/0.41 % ------ SAT Options
% 0.14/0.41
% 0.14/0.41 % --sat_mode false
% 0.14/0.41 % --sat_fm_restart_options ""
% 0.14/0.41 % --sat_gr_def false
% 0.14/0.41 % --sat_epr_types true
% 0.14/0.41 % --sat_non_cyclic_types false
% 0.14/0.41 % --sat_finite_models false
% 0.14/0.41 % --sat_fm_lemmas false
% 0.14/0.41 % --sat_fm_prep false
% 0.14/0.41 % --sat_fm_uc_incr true
% 0.14/0.41 % --sat_out_model small
% 0.14/0.41 % --sat_out_clauses false
% 0.14/0.41
% 0.14/0.41 % ------ QBF Options
% 0.14/0.41
% 0.14/0.41 % --qbf_mode false
% 0.14/0.41 % --qbf_elim_univ true
% 0.14/0.41 % --qbf_sk_in true
% 0.14/0.41 % --qbf_pred_elim true
% 0.14/0.41 % --qbf_split 32
% 0.14/0.41
% 0.14/0.41 % ------ BMC1 Options
% 0.14/0.41
% 0.14/0.41 % --bmc1_incremental false
% 0.14/0.41 % --bmc1_axioms reachable_all
% 0.14/0.41 % --bmc1_min_bound 0
% 0.14/0.41 % --bmc1_max_bound -1
% 0.14/0.41 % --bmc1_max_bound_default -1
% 0.14/0.41 % --bmc1_symbol_reachability true
% 0.14/0.41 % --bmc1_property_lemmas false
% 0.14/0.41 % --bmc1_k_induction false
% 0.14/0.41 % --bmc1_non_equiv_states false
% 0.14/0.41 % --bmc1_deadlock false
% 0.14/0.41 % --bmc1_ucm false
% 0.14/0.41 % --bmc1_add_unsat_core none
% 0.14/0.41 % --bmc1_unsat_core_children false
% 0.14/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.14/0.41 % --bmc1_out_stat full
% 0.14/0.41 % --bmc1_ground_init false
% 0.14/0.41 % --bmc1_pre_inst_next_state false
% 0.14/0.41 % --bmc1_pre_inst_state false
% 0.14/0.41 % --bmc1_pre_inst_reach_state false
% 0.14/0.41 % --bmc1_out_unsat_core false
% 0.14/0.41 % --bmc1_aig_witness_out false
% 0.14/0.41 % --bmc1_verbose false
% 0.14/0.41 % --bmc1_dump_clauses_tptp false
% 0.14/0.41 % --bmc1_dump_unsat_core_tptp false
% 0.14/0.41 % --bmc1_dump_file -
% 0.14/0.41 % --bmc1_ucm_expand_uc_limit 128
% 0.14/0.41 % --bmc1_ucm_n_expand_iterations 6
% 0.14/0.41 % --bmc1_ucm_extend_mode 1
% 0.14/0.41 % --bmc1_ucm_init_mode 2
% 0.14/0.41 % --bmc1_ucm_cone_mode none
% 0.14/0.41 % --bmc1_ucm_reduced_relation_type 0
% 0.14/0.41 % --bmc1_ucm_relax_model 4
% 0.14/0.41 % --bmc1_ucm_full_tr_after_sat true
% 0.14/0.41 % --bmc1_ucm_expand_neg_assumptions false
% 0.14/0.41 % --bmc1_ucm_layered_model none
% 0.14/0.41 % --bmc1_ucm_max_lemma_size 10
% 0.14/0.41
% 0.14/0.41 % ------ AIG Options
% 0.14/0.41
% 0.14/0.41 % --aig_mode false
% 0.14/0.41
% 0.14/0.41 % ------ Instantiation Options
% 0.14/0.41
% 0.14/0.41 % --instantiation_flag true
% 0.14/0.41 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.14/0.41 % --inst_solver_per_active 750
% 0.14/0.41 % --inst_solver_calls_frac 0.5
% 0.14/0.41 % --inst_passive_queue_type priority_queues
% 0.14/0.41 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.14/0.41 % --inst_passive_queues_freq [25;2]
% 0.14/0.41 % --inst_dismatching true
% 0.14/0.41 % --inst_eager_unprocessed_to_passive true
% 0.14/0.41 % --inst_prop_sim_given true
% 0.14/0.41 % --inst_prop_sim_new false
% 0.14/0.41 % --inst_orphan_elimination true
% 0.14/0.41 % --inst_learning_loop_flag true
% 0.14/0.41 % --inst_learning_start 3000
% 0.14/0.41 % --inst_learning_factor 2
% 0.14/0.41 % --inst_start_prop_sim_after_learn 3
% 0.14/0.41 % --inst_sel_renew solver
% 0.14/0.41 % --inst_lit_activity_flag true
% 0.14/0.41 % --inst_out_proof true
% 0.14/0.41
% 0.14/0.41 % ------ Resolution Options
% 0.14/0.41
% 0.14/0.41 % --resolution_flag true
% 0.14/0.41 % --res_lit_sel kbo_max
% 0.14/0.41 % --res_to_prop_solver none
% 0.14/0.41 % --res_prop_simpl_new false
% 0.14/0.41 % --res_prop_simpl_given false
% 0.14/0.41 % --res_passive_queue_type priority_queues
% 0.14/0.41 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.14/0.41 % --res_passive_queues_freq [15;5]
% 0.14/0.41 % --res_forward_subs full
% 0.14/0.41 % --res_backward_subs full
% 0.14/0.41 % --res_forward_subs_resolution true
% 0.14/0.41 % --res_backward_subs_resolution true
% 0.14/0.41 % --res_orphan_elimination false
% 0.14/0.41 % --res_time_limit 1000.
% 0.14/0.41 % --res_out_proof true
% 0.14/0.41 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6314a8.s
% 0.14/0.41 % --modulo true
% 0.14/0.41
% 0.14/0.41 % ------ Combination Options
% 0.14/0.41
% 0.14/0.41 % --comb_res_mult 1000
% 0.14/0.41 % --comb_inst_mult 300
% 0.14/0.41 % ------
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 % ------ Proving...
% 0.14/0.41 %
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 % Resolution empty clause
% 0.14/0.41
% 0.14/0.41 % ------ Statistics
% 0.14/0.41
% 0.14/0.41 % ------ General
% 0.14/0.41
% 0.14/0.41 % num_of_input_clauses: 20
% 0.14/0.41 % num_of_input_neg_conjectures: 1
% 0.14/0.41 % num_of_splits: 0
% 0.14/0.41 % num_of_split_atoms: 0
% 0.14/0.41 % num_of_sem_filtered_clauses: 0
% 0.14/0.41 % num_of_subtypes: 0
% 0.14/0.41 % monotx_restored_types: 0
% 0.14/0.41 % sat_num_of_epr_types: 0
% 0.14/0.41 % sat_num_of_non_cyclic_types: 0
% 0.14/0.41 % sat_guarded_non_collapsed_types: 0
% 0.14/0.41 % is_epr: 0
% 0.14/0.41 % is_horn: 1
% 0.14/0.41 % has_eq: 0
% 0.14/0.41 % num_pure_diseq_elim: 0
% 0.14/0.41 % simp_replaced_by: 0
% 0.14/0.41 % res_preprocessed: 3
% 0.14/0.41 % prep_upred: 0
% 0.14/0.41 % prep_unflattend: 0
% 0.14/0.41 % pred_elim_cands: 0
% 0.14/0.41 % pred_elim: 0
% 0.14/0.41 % pred_elim_cl: 0
% 0.14/0.41 % pred_elim_cycles: 0
% 0.14/0.41 % forced_gc_time: 0
% 0.14/0.41 % gc_basic_clause_elim: 0
% 0.14/0.41 % parsing_time: 0.
% 0.14/0.41 % sem_filter_time: 0.
% 0.14/0.41 % pred_elim_time: 0.
% 0.14/0.41 % out_proof_time: 0.001
% 0.14/0.41 % monotx_time: 0.
% 0.14/0.41 % subtype_inf_time: 0.
% 0.14/0.41 % unif_index_cands_time: 0.
% 0.14/0.41 % unif_index_add_time: 0.
% 0.14/0.41 % total_time: 0.017
% 0.14/0.41 % num_of_symbols: 37
% 0.14/0.41 % num_of_terms: 117
% 0.14/0.41
% 0.14/0.41 % ------ Propositional Solver
% 0.14/0.41
% 0.14/0.41 % prop_solver_calls: 1
% 0.14/0.41 % prop_fast_solver_calls: 5
% 0.14/0.41 % prop_num_of_clauses: 22
% 0.14/0.41 % prop_preprocess_simplified: 77
% 0.14/0.41 % prop_fo_subsumed: 0
% 0.14/0.41 % prop_solver_time: 0.
% 0.14/0.41 % prop_fast_solver_time: 0.
% 0.14/0.41 % prop_unsat_core_time: 0.
% 0.14/0.41
% 0.14/0.41 % ------ QBF
% 0.14/0.41
% 0.14/0.41 % qbf_q_res: 0
% 0.14/0.41 % qbf_num_tautologies: 0
% 0.14/0.41 % qbf_prep_cycles: 0
% 0.14/0.41
% 0.14/0.41 % ------ BMC1
% 0.14/0.41
% 0.14/0.41 % bmc1_current_bound: -1
% 0.14/0.41 % bmc1_last_solved_bound: -1
% 0.14/0.41 % bmc1_unsat_core_size: -1
% 0.14/0.41 % bmc1_unsat_core_parents_size: -1
% 0.14/0.41 % bmc1_merge_next_fun: 0
% 0.14/0.41 % bmc1_unsat_core_clauses_time: 0.
% 0.14/0.41
% 0.14/0.41 % ------ Instantiation
% 0.14/0.41
% 0.14/0.41 % inst_num_of_clauses: 20
% 0.14/0.41 % inst_num_in_passive: 0
% 0.14/0.41 % inst_num_in_active: 0
% 0.14/0.41 % inst_num_in_unprocessed: 20
% 0.14/0.41 % inst_num_of_loops: 0
% 0.14/0.41 % inst_num_of_learning_restarts: 0
% 0.14/0.41 % inst_num_moves_active_passive: 0
% 0.14/0.41 % inst_lit_activity: 0
% 0.14/0.41 % inst_lit_activity_moves: 0
% 0.14/0.41 % inst_num_tautologies: 0
% 0.14/0.41 % inst_num_prop_implied: 0
% 0.14/0.41 % inst_num_existing_simplified: 0
% 0.14/0.41 % inst_num_eq_res_simplified: 0
% 0.14/0.41 % inst_num_child_elim: 0
% 0.14/0.41 % inst_num_of_dismatching_blockings: 0
% 0.14/0.41 % inst_num_of_non_proper_insts: 0
% 0.14/0.41 % inst_num_of_duplicates: 0
% 0.14/0.41 % inst_inst_num_from_inst_to_res: 0
% 0.14/0.41 % inst_dismatching_checking_time: 0.
% 0.14/0.41
% 0.14/0.41 % ------ Resolution
% 0.14/0.41
% 0.14/0.41 % res_num_of_clauses: 21
% 0.14/0.41 % res_num_in_passive: 1
% 0.14/0.41 % res_num_in_active: 13
% 0.14/0.41 % res_num_of_loops: 12
% 0.14/0.41 % res_forward_subset_subsumed: 14
% 0.14/0.41 % res_backward_subset_subsumed: 0
% 0.14/0.41 % res_forward_subsumed: 1
% 0.14/0.41 % res_backward_subsumed: 8
% 0.14/0.41 % res_forward_subsumption_resolution: 0
% 0.14/0.41 % res_backward_subsumption_resolution: 1
% 0.14/0.41 % res_clause_to_clause_subsumption: 23
% 0.14/0.41 % res_orphan_elimination: 0
% 0.14/0.41 % res_tautology_del: 0
% 0.14/0.41 % res_num_eq_res_simplified: 0
% 0.14/0.41 % res_num_sel_changes: 0
% 0.14/0.41 % res_moves_from_active_to_pass: 0
% 0.14/0.41
% 0.14/0.41 % Status Unsatisfiable
% 0.14/0.41 % SZS status Unsatisfiable
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------