TSTP Solution File: PUZ047-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ047-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.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 18:13:53 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 24
% Syntax : Number of formulae : 143 ( 37 unt; 0 def)
% Number of atoms : 249 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 237 ( 131 ~; 106 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 175 ( 22 sgn 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% 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,negated_conjecture,
! [X2,X3,X1] :
( p(south,X1,south,X3,take_goat(X2))
| ~ p(north,X1,north,X3,X2) ),
file('<stdin>',thm100_11) ).
fof(c_0_1,negated_conjecture,
! [X2,X3,X1] :
( p(north,X1,north,X3,take_goat(X2))
| ~ p(south,X1,south,X3,X2) ),
file('<stdin>',thm100_10) ).
fof(c_0_2,negated_conjecture,
! [X1] :
( p(south,south,north,south,take_cabbage(X1))
| ~ p(north,south,north,north,X1) ),
file('<stdin>',thm100_15) ).
fof(c_0_3,negated_conjecture,
! [X1] :
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) ),
file('<stdin>',thm100_14) ).
fof(c_0_4,negated_conjecture,
! [X1] :
( p(south,north,south,south,take_cabbage(X1))
| ~ p(north,north,south,north,X1) ),
file('<stdin>',thm100_13) ).
fof(c_0_5,negated_conjecture,
! [X1] :
( p(north,north,south,north,take_cabbage(X1))
| ~ p(south,north,south,south,X1) ),
file('<stdin>',thm100_12) ).
fof(c_0_6,negated_conjecture,
! [X1] :
( p(south,south,north,south,take_wolf(X1))
| ~ p(north,north,north,south,X1) ),
file('<stdin>',thm100_9) ).
fof(c_0_7,negated_conjecture,
! [X1] :
( p(north,north,north,south,take_wolf(X1))
| ~ p(south,south,north,south,X1) ),
file('<stdin>',thm100_8) ).
fof(c_0_8,negated_conjecture,
! [X1] :
( p(south,south,south,north,take_wolf(X1))
| ~ p(north,north,south,north,X1) ),
file('<stdin>',thm100_7) ).
fof(c_0_9,negated_conjecture,
! [X1] :
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1) ),
file('<stdin>',thm100_6) ).
fof(c_0_10,negated_conjecture,
! [X1] :
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1) ),
file('<stdin>',thm100_5) ).
fof(c_0_11,negated_conjecture,
! [X1] :
( p(north,south,north,south,go_alone(X1))
| ~ p(south,south,north,south,X1) ),
file('<stdin>',thm100_4) ).
fof(c_0_12,negated_conjecture,
! [X1] :
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1) ),
file('<stdin>',thm100_3) ).
fof(c_0_13,negated_conjecture,
! [X1] :
( p(north,north,south,north,go_alone(X1))
| ~ p(south,north,south,north,X1) ),
file('<stdin>',thm100_2) ).
fof(c_0_14,negated_conjecture,
! [X1] : ~ p(north,north,north,north,X1),
file('<stdin>',thm100_16) ).
fof(c_0_15,negated_conjecture,
p(south,south,south,south,start),
file('<stdin>',thm100_1) ).
fof(c_0_16,negated_conjecture,
! [X2,X3,X1] :
( p(south,X1,south,X3,take_goat(X2))
| ~ p(north,X1,north,X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_17,negated_conjecture,
! [X2,X3,X1] :
( p(north,X1,north,X3,take_goat(X2))
| ~ p(south,X1,south,X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_18,negated_conjecture,
! [X1] :
( p(south,south,north,south,take_cabbage(X1))
| ~ p(north,south,north,north,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_19,negated_conjecture,
! [X1] :
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_20,negated_conjecture,
! [X1] :
( p(south,north,south,south,take_cabbage(X1))
| ~ p(north,north,south,north,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_21,negated_conjecture,
! [X1] :
( p(north,north,south,north,take_cabbage(X1))
| ~ p(south,north,south,south,X1) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_22,negated_conjecture,
! [X1] :
( p(south,south,north,south,take_wolf(X1))
| ~ p(north,north,north,south,X1) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_23,negated_conjecture,
! [X1] :
( p(north,north,north,south,take_wolf(X1))
| ~ p(south,south,north,south,X1) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_24,negated_conjecture,
! [X1] :
( p(south,south,south,north,take_wolf(X1))
| ~ p(north,north,south,north,X1) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_25,negated_conjecture,
! [X1] :
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_26,negated_conjecture,
! [X1] :
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_27,negated_conjecture,
! [X1] :
( p(north,south,north,south,go_alone(X1))
| ~ p(south,south,north,south,X1) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_28,negated_conjecture,
! [X1] :
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_29,negated_conjecture,
! [X1] :
( p(north,north,south,north,go_alone(X1))
| ~ p(south,north,south,north,X1) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_30,negated_conjecture,
! [X1] : ~ p(north,north,north,north,X1),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_31,negated_conjecture,
p(south,south,south,south,start),
c_0_15 ).
fof(c_0_32,negated_conjecture,
! [X4,X5,X6] :
( p(south,X6,south,X5,take_goat(X4))
| ~ p(north,X6,north,X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_33,negated_conjecture,
! [X4,X5,X6] :
( p(north,X6,north,X5,take_goat(X4))
| ~ p(south,X6,south,X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_34,negated_conjecture,
! [X2] :
( p(south,south,north,south,take_cabbage(X2))
| ~ p(north,south,north,north,X2) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_35,negated_conjecture,
! [X2] :
( p(north,south,north,north,take_cabbage(X2))
| ~ p(south,south,north,south,X2) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_36,negated_conjecture,
! [X2] :
( p(south,north,south,south,take_cabbage(X2))
| ~ p(north,north,south,north,X2) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_37,negated_conjecture,
! [X2] :
( p(north,north,south,north,take_cabbage(X2))
| ~ p(south,north,south,south,X2) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_38,negated_conjecture,
! [X2] :
( p(south,south,north,south,take_wolf(X2))
| ~ p(north,north,north,south,X2) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_39,negated_conjecture,
! [X2] :
( p(north,north,north,south,take_wolf(X2))
| ~ p(south,south,north,south,X2) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_40,negated_conjecture,
! [X2] :
( p(south,south,south,north,take_wolf(X2))
| ~ p(north,north,south,north,X2) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_41,negated_conjecture,
! [X2] :
( p(north,north,south,north,take_wolf(X2))
| ~ p(south,south,south,north,X2) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_42,negated_conjecture,
! [X2] :
( p(south,south,north,south,go_alone(X2))
| ~ p(north,south,north,south,X2) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_43,negated_conjecture,
! [X2] :
( p(north,south,north,south,go_alone(X2))
| ~ p(south,south,north,south,X2) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_44,negated_conjecture,
! [X2] :
( p(south,north,south,north,go_alone(X2))
| ~ p(north,north,south,north,X2) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_45,negated_conjecture,
! [X2] :
( p(north,north,south,north,go_alone(X2))
| ~ p(south,north,south,north,X2) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_46,negated_conjecture,
! [X2] : ~ p(north,north,north,north,X2),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_47,negated_conjecture,
p(south,south,south,south,start),
c_0_31 ).
cnf(c_0_48,negated_conjecture,
( p(south,X1,south,X2,take_goat(X3))
| ~ p(north,X1,north,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_49,negated_conjecture,
( p(north,X1,north,X2,take_goat(X3))
| ~ p(south,X1,south,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_50,negated_conjecture,
( p(south,south,north,south,take_cabbage(X1))
| ~ p(north,south,north,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,negated_conjecture,
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_52,negated_conjecture,
( p(south,north,south,south,take_cabbage(X1))
| ~ p(north,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_53,negated_conjecture,
( p(north,north,south,north,take_cabbage(X1))
| ~ p(south,north,south,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_54,negated_conjecture,
( p(south,south,north,south,take_wolf(X1))
| ~ p(north,north,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_55,negated_conjecture,
( p(north,north,north,south,take_wolf(X1))
| ~ p(south,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_56,negated_conjecture,
( p(south,south,south,north,take_wolf(X1))
| ~ p(north,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_57,negated_conjecture,
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_58,negated_conjecture,
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_59,negated_conjecture,
( p(north,south,north,south,go_alone(X1))
| ~ p(south,south,north,south,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_60,negated_conjecture,
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_61,negated_conjecture,
( p(north,north,south,north,go_alone(X1))
| ~ p(south,north,south,north,X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_62,negated_conjecture,
~ p(north,north,north,north,X1),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_63,negated_conjecture,
p(south,south,south,south,start),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_64,negated_conjecture,
( p(south,X1,south,X2,take_goat(X3))
| ~ p(north,X1,north,X2,X3) ),
c_0_48,
[final] ).
cnf(c_0_65,negated_conjecture,
( p(north,X1,north,X2,take_goat(X3))
| ~ p(south,X1,south,X2,X3) ),
c_0_49,
[final] ).
cnf(c_0_66,negated_conjecture,
( p(south,south,north,south,take_cabbage(X1))
| ~ p(north,south,north,north,X1) ),
c_0_50,
[final] ).
cnf(c_0_67,negated_conjecture,
( p(north,south,north,north,take_cabbage(X1))
| ~ p(south,south,north,south,X1) ),
c_0_51,
[final] ).
cnf(c_0_68,negated_conjecture,
( p(south,north,south,south,take_cabbage(X1))
| ~ p(north,north,south,north,X1) ),
c_0_52,
[final] ).
cnf(c_0_69,negated_conjecture,
( p(north,north,south,north,take_cabbage(X1))
| ~ p(south,north,south,south,X1) ),
c_0_53,
[final] ).
cnf(c_0_70,negated_conjecture,
( p(south,south,north,south,take_wolf(X1))
| ~ p(north,north,north,south,X1) ),
c_0_54,
[final] ).
cnf(c_0_71,negated_conjecture,
( p(north,north,north,south,take_wolf(X1))
| ~ p(south,south,north,south,X1) ),
c_0_55,
[final] ).
cnf(c_0_72,negated_conjecture,
( p(south,south,south,north,take_wolf(X1))
| ~ p(north,north,south,north,X1) ),
c_0_56,
[final] ).
cnf(c_0_73,negated_conjecture,
( p(north,north,south,north,take_wolf(X1))
| ~ p(south,south,south,north,X1) ),
c_0_57,
[final] ).
cnf(c_0_74,negated_conjecture,
( p(south,south,north,south,go_alone(X1))
| ~ p(north,south,north,south,X1) ),
c_0_58,
[final] ).
cnf(c_0_75,negated_conjecture,
( p(north,south,north,south,go_alone(X1))
| ~ p(south,south,north,south,X1) ),
c_0_59,
[final] ).
cnf(c_0_76,negated_conjecture,
( p(south,north,south,north,go_alone(X1))
| ~ p(north,north,south,north,X1) ),
c_0_60,
[final] ).
cnf(c_0_77,negated_conjecture,
( p(north,north,south,north,go_alone(X1))
| ~ p(south,north,south,north,X1) ),
c_0_61,
[final] ).
cnf(c_0_78,negated_conjecture,
~ p(north,north,north,north,X1),
c_0_62,
[final] ).
cnf(c_0_79,negated_conjecture,
p(south,south,south,south,start),
c_0_63,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_12,negated_conjecture,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_440cd2.p',c_0_76) ).
cnf(c_54,negated_conjecture,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_106,negated_conjecture,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_113,negated_conjecture,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_106]) ).
cnf(c_138,negated_conjecture,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_113]) ).
cnf(c_182,negated_conjecture,
( p(south,north,south,north,go_alone(X0))
| ~ p(north,north,south,north,X0) ),
inference(copy,[status(esa)],[c_138]) ).
cnf(c_1,negated_conjecture,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_440cd2.p',c_0_65) ).
cnf(c_32,negated_conjecture,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_95,negated_conjecture,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_124,negated_conjecture,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_127,negated_conjecture,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_124]) ).
cnf(c_160,negated_conjecture,
( ~ p(south,X0,south,X1,X2)
| p(north,X0,north,X1,take_goat(X2)) ),
inference(copy,[status(esa)],[c_127]) ).
cnf(c_14,negated_conjecture,
~ p(north,north,north,north,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_440cd2.p',c_0_78) ).
cnf(c_58,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_108,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_111,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_140,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_111]) ).
cnf(c_186,negated_conjecture,
~ p(north,north,north,north,X0),
inference(copy,[status(esa)],[c_140]) ).
cnf(c_202,plain,
~ p(south,north,south,north,X0),
inference(resolution,[status(thm)],[c_160,c_186]) ).
cnf(c_203,negated_conjecture,
~ p(south,north,south,north,X0),
inference(rewriting,[status(thm)],[c_202]) ).
cnf(c_250,negated_conjecture,
~ p(north,north,south,north,X0),
inference(forward_subsumption_resolution,[status(thm)],[c_182,c_203]) ).
cnf(c_251,negated_conjecture,
~ p(north,north,south,north,X0),
inference(rewriting,[status(thm)],[c_250]) ).
cnf(c_9,negated_conjecture,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_440cd2.p',c_0_73) ).
cnf(c_48,negated_conjecture,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_103,negated_conjecture,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_116,negated_conjecture,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_135,negated_conjecture,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
inference(copy,[status(esa)],[c_116]) ).
cnf(c_176,negated_conjecture,
( ~ p(south,south,south,north,X0)
| p(north,north,south,north,take_wolf(X0)) ),
inference(copy,[status(esa)],[c_135]) ).
cnf(c_254,negated_conjecture,
~ p(south,south,south,north,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_251,c_176]) ).
cnf(c_255,plain,
~ p(south,south,south,north,X0),
inference(rewriting,[status(thm)],[c_254]) ).
cnf(c_0,negated_conjecture,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_440cd2.p',c_0_64) ).
cnf(c_30,negated_conjecture,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_94,negated_conjecture,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_125,negated_conjecture,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_126,negated_conjecture,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_125]) ).
cnf(c_158,negated_conjecture,
( p(south,X0,south,X1,take_goat(X2))
| ~ p(north,X0,north,X1,X2) ),
inference(copy,[status(esa)],[c_126]) ).
cnf(c_259,plain,
~ p(north,south,north,north,X0),
inference(resolution,[status(thm)],[c_255,c_158]) ).
cnf(c_260,negated_conjecture,
~ p(north,south,north,north,X0),
inference(rewriting,[status(thm)],[c_259]) ).
cnf(c_3,negated_conjecture,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_440cd2.p',c_0_67) ).
cnf(c_36,negated_conjecture,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_97,negated_conjecture,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_122,negated_conjecture,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_129,negated_conjecture,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_164,negated_conjecture,
( ~ p(south,south,north,south,X0)
| p(north,south,north,north,take_cabbage(X0)) ),
inference(copy,[status(esa)],[c_129]) ).
cnf(c_267,negated_conjecture,
~ p(south,south,north,south,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_260,c_164]) ).
cnf(c_268,negated_conjecture,
~ p(south,south,north,south,X0),
inference(rewriting,[status(thm)],[c_267]) ).
cnf(c_10,negated_conjecture,
( p(south,south,north,south,go_alone(X0))
| ~ p(north,south,north,south,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_440cd2.p',c_0_74) ).
cnf(c_50,negated_conjecture,
( p(south,south,north,south,go_alone(X0))
| ~ p(north,south,north,south,X0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_104,negated_conjecture,
( p(south,south,north,south,go_alone(X0))
| ~ p(north,south,north,south,X0) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_115,negated_conjecture,
( p(south,south,north,south,go_alone(X0))
| ~ p(north,south,north,south,X0) ),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_136,negated_conjecture,
( p(south,south,north,south,go_alone(X0))
| ~ p(north,south,north,south,X0) ),
inference(copy,[status(esa)],[c_115]) ).
cnf(c_178,negated_conjecture,
( p(south,south,north,south,go_alone(X0))
| ~ p(north,south,north,south,X0) ),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_273,negated_conjecture,
~ p(north,south,north,south,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_268,c_178]) ).
cnf(c_276,plain,
~ p(north,south,north,south,X0),
inference(rewriting,[status(thm)],[c_273]) ).
cnf(c_279,plain,
~ p(south,south,south,south,X0),
inference(resolution,[status(thm)],[c_276,c_160]) ).
cnf(c_280,plain,
~ p(south,south,south,south,X0),
inference(rewriting,[status(thm)],[c_279]) ).
cnf(c_15,negated_conjecture,
p(south,south,south,south,start),
file('/export/starexec/sandbox/tmp/iprover_modulo_440cd2.p',c_0_79) ).
cnf(c_60,negated_conjecture,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_109,negated_conjecture,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_110,negated_conjecture,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_109]) ).
cnf(c_141,negated_conjecture,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_110]) ).
cnf(c_188,negated_conjecture,
p(south,south,south,south,start),
inference(copy,[status(esa)],[c_141]) ).
cnf(c_287,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_280,c_188]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ047-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat May 28 20:41:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f25947.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_440cd2.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_312432 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f25947.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ 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.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn true
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f25947.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 %
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % Resolution empty clause
% 0.20/0.44
% 0.20/0.44 % ------ Statistics
% 0.20/0.44
% 0.20/0.44 % ------ General
% 0.20/0.44
% 0.20/0.44 % num_of_input_clauses: 16
% 0.20/0.44 % num_of_input_neg_conjectures: 16
% 0.20/0.44 % num_of_splits: 0
% 0.20/0.44 % num_of_split_atoms: 0
% 0.20/0.44 % num_of_sem_filtered_clauses: 0
% 0.20/0.44 % num_of_subtypes: 0
% 0.20/0.44 % monotx_restored_types: 0
% 0.20/0.44 % sat_num_of_epr_types: 0
% 0.20/0.44 % sat_num_of_non_cyclic_types: 0
% 0.20/0.44 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 1
% 0.20/0.44 % has_eq: 0
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 32
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 0
% 0.20/0.44 % pred_elim: 0
% 0.20/0.44 % pred_elim_cl: 0
% 0.20/0.44 % pred_elim_cycles: 0
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.
% 0.20/0.44 % out_proof_time: 0.004
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.031
% 0.20/0.44 % num_of_symbols: 33
% 0.20/0.44 % num_of_terms: 108
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 1
% 0.20/0.44 % prop_fast_solver_calls: 90
% 0.20/0.44 % prop_num_of_clauses: 30
% 0.20/0.44 % prop_preprocess_simplified: 280
% 0.20/0.44 % prop_fo_subsumed: 0
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: 16
% 0.20/0.44 % inst_num_in_passive: 0
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 16
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: 13
% 0.20/0.44 % res_num_in_passive: 0
% 0.20/0.44 % res_num_in_active: 12
% 0.20/0.44 % res_num_of_loops: 23
% 0.20/0.44 % res_forward_subset_subsumed: 4
% 0.20/0.44 % res_backward_subset_subsumed: 3
% 0.20/0.44 % res_forward_subsumed: 0
% 0.20/0.44 % res_backward_subsumed: 3
% 0.20/0.44 % res_forward_subsumption_resolution: 1
% 0.20/0.44 % res_backward_subsumption_resolution: 6
% 0.20/0.44 % res_clause_to_clause_subsumption: 70
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 0
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unsatisfiable
% 0.20/0.44 % SZS status Unsatisfiable
% 0.20/0.44 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------