TSTP Solution File: PUZ008-3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.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:40 EDT 2022
% Result : Unsatisfiable 0.44s 0.61s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(great_eq_base,axiom,
greater_or_equal(X,n0),
input ).
fof(great_eq_base_0,plain,
! [X] :
( greater_or_equal(X,n0)
| $false ),
inference(orientation,[status(thm)],[great_eq_base]) ).
cnf(no_missionaries_is_safe,axiom,
safe(n0,X),
input ).
fof(no_missionaries_is_safe_0,plain,
! [X] :
( safe(n0,X)
| $false ),
inference(orientation,[status(thm)],[no_missionaries_is_safe]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> safe(n0,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[no_missionaries_is_safe_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X] :
( lhs_atom2(X)
<=> greater_or_equal(X,n0) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X] :
( lhs_atom2(X)
| $false ),
inference(fold_definition,[status(thm)],[great_eq_base_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom2(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_2,plain,
! [X1] : lhs_atom2(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4,plain,
! [X2] : lhs_atom2(X2),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
lhs_atom2(X1),
c_0_6,
[final] ).
cnf(c_0_9,plain,
lhs_atom1(X1),
c_0_7,
[final] ).
% End CNF derivation
cnf(c_0_8_0,axiom,
greater_or_equal(X1,n0),
inference(unfold_definition,[status(thm)],[c_0_8,def_lhs_atom2]) ).
cnf(c_0_9_0,axiom,
safe(n0,X1),
inference(unfold_definition,[status(thm)],[c_0_9,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(s(s(X2)))),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(X1,s(s(X4)))
| achievable(west(m(X3),c(X2)),boatoneast,east(m(X1),c(s(s(X4))))) ),
file('<stdin>',two_cannibals_west_to_east) ).
fof(c_0_1_002,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(X1),c(s(s(X4)))))
| ~ safe(X3,s(s(X2)))
| ~ safe(X1,X4)
| achievable(west(m(X3),c(s(s(X2)))),boatonwest,east(m(X1),c(X4))) ),
file('<stdin>',two_cannibals_east_to_west) ).
fof(c_0_2_003,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(s(s(X3))),c(X2)),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(s(s(X1)),X4)
| achievable(west(m(X3),c(X2)),boatoneast,east(m(s(s(X1))),c(X4))) ),
file('<stdin>',two_missionaries_west_to_east) ).
fof(c_0_3_004,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(s(s(X1))),c(X4)))
| ~ safe(s(s(X3)),X2)
| ~ safe(X1,X4)
| achievable(west(m(s(s(X3))),c(X2)),boatonwest,east(m(X1),c(X4))) ),
file('<stdin>',two_missionaries_east_to_west) ).
fof(c_0_4_005,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(s(X3)),c(s(X2))),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(s(X1),s(X4))
| achievable(west(m(X3),c(X2)),boatoneast,east(m(s(X1)),c(s(X4)))) ),
file('<stdin>',missionary_and_cannibal_west_to_east) ).
fof(c_0_5_006,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(s(X1)),c(s(X4))))
| ~ safe(s(X3),s(X2))
| ~ safe(X1,X4)
| achievable(west(m(s(X3)),c(s(X2))),boatonwest,east(m(X1),c(X4))) ),
file('<stdin>',missionary_and_cannibal_east_to_west) ).
fof(c_0_6_007,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(s(X2))),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(X1,s(X4))
| achievable(west(m(X3),c(X2)),boatoneast,east(m(X1),c(s(X4)))) ),
file('<stdin>',cannibal_west_to_east) ).
fof(c_0_7_008,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(X1),c(s(X4))))
| ~ safe(X3,s(X2))
| ~ safe(X1,X4)
| achievable(west(m(X3),c(s(X2))),boatonwest,east(m(X1),c(X4))) ),
file('<stdin>',cannibal_east_to_west) ).
fof(c_0_8_009,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(s(X3)),c(X2)),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(s(X1),X4)
| achievable(west(m(X3),c(X2)),boatoneast,east(m(s(X1)),c(X4))) ),
file('<stdin>',missionary_west_to_east) ).
fof(c_0_9_010,axiom,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(s(X1)),c(X4)))
| ~ safe(s(X3),X2)
| ~ safe(X1,X4)
| achievable(west(m(s(X3)),c(X2)),boatonwest,east(m(X1),c(X4))) ),
file('<stdin>',missionary_east_to_west) ).
fof(c_0_10,axiom,
! [X2,X3] :
( greater_or_equal(s(X3),s(X2))
| ~ greater_or_equal(X3,X2) ),
file('<stdin>',great_eq_recursive) ).
fof(c_0_11,axiom,
! [X2,X3] :
( ~ greater_or_equal(X3,X2)
| safe(X3,X2) ),
file('<stdin>',same_or_more_missionaries_is_safe) ).
fof(c_0_12,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(s(s(X2)))),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(X1,s(s(X4)))
| achievable(west(m(X3),c(X2)),boatoneast,east(m(X1),c(s(s(X4))))) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_13,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(X1),c(s(s(X4)))))
| ~ safe(X3,s(s(X2)))
| ~ safe(X1,X4)
| achievable(west(m(X3),c(s(s(X2)))),boatonwest,east(m(X1),c(X4))) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_14,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(s(s(X3))),c(X2)),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(s(s(X1)),X4)
| achievable(west(m(X3),c(X2)),boatoneast,east(m(s(s(X1))),c(X4))) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_15,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(s(s(X1))),c(X4)))
| ~ safe(s(s(X3)),X2)
| ~ safe(X1,X4)
| achievable(west(m(s(s(X3))),c(X2)),boatonwest,east(m(X1),c(X4))) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_16,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(s(X3)),c(s(X2))),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(s(X1),s(X4))
| achievable(west(m(X3),c(X2)),boatoneast,east(m(s(X1)),c(s(X4)))) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_17,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(s(X1)),c(s(X4))))
| ~ safe(s(X3),s(X2))
| ~ safe(X1,X4)
| achievable(west(m(s(X3)),c(s(X2))),boatonwest,east(m(X1),c(X4))) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_18,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(s(X2))),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(X1,s(X4))
| achievable(west(m(X3),c(X2)),boatoneast,east(m(X1),c(s(X4)))) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_19,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(X1),c(s(X4))))
| ~ safe(X3,s(X2))
| ~ safe(X1,X4)
| achievable(west(m(X3),c(s(X2))),boatonwest,east(m(X1),c(X4))) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_20,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(s(X3)),c(X2)),boatonwest,east(m(X1),c(X4)))
| ~ safe(X3,X2)
| ~ safe(s(X1),X4)
| achievable(west(m(X3),c(X2)),boatoneast,east(m(s(X1)),c(X4))) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_21,plain,
! [X1,X2,X3,X4] :
( ~ achievable(west(m(X3),c(X2)),boatoneast,east(m(s(X1)),c(X4)))
| ~ safe(s(X3),X2)
| ~ safe(X1,X4)
| achievable(west(m(s(X3)),c(X2)),boatonwest,east(m(X1),c(X4))) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_22,plain,
! [X2,X3] :
( greater_or_equal(s(X3),s(X2))
| ~ greater_or_equal(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X2,X3] :
( ~ greater_or_equal(X3,X2)
| safe(X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(X7),c(s(s(X6)))),boatonwest,east(m(X5),c(X8)))
| ~ safe(X7,X6)
| ~ safe(X5,s(s(X8)))
| achievable(west(m(X7),c(X6)),boatoneast,east(m(X5),c(s(s(X8))))) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(X7),c(X6)),boatoneast,east(m(X5),c(s(s(X8)))))
| ~ safe(X7,s(s(X6)))
| ~ safe(X5,X8)
| achievable(west(m(X7),c(s(s(X6)))),boatonwest,east(m(X5),c(X8))) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_26,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(s(s(X7))),c(X6)),boatonwest,east(m(X5),c(X8)))
| ~ safe(X7,X6)
| ~ safe(s(s(X5)),X8)
| achievable(west(m(X7),c(X6)),boatoneast,east(m(s(s(X5))),c(X8))) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_27,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(X7),c(X6)),boatoneast,east(m(s(s(X5))),c(X8)))
| ~ safe(s(s(X7)),X6)
| ~ safe(X5,X8)
| achievable(west(m(s(s(X7))),c(X6)),boatonwest,east(m(X5),c(X8))) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_28,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(s(X7)),c(s(X6))),boatonwest,east(m(X5),c(X8)))
| ~ safe(X7,X6)
| ~ safe(s(X5),s(X8))
| achievable(west(m(X7),c(X6)),boatoneast,east(m(s(X5)),c(s(X8)))) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_29,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(X7),c(X6)),boatoneast,east(m(s(X5)),c(s(X8))))
| ~ safe(s(X7),s(X6))
| ~ safe(X5,X8)
| achievable(west(m(s(X7)),c(s(X6))),boatonwest,east(m(X5),c(X8))) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_30,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(X7),c(s(X6))),boatonwest,east(m(X5),c(X8)))
| ~ safe(X7,X6)
| ~ safe(X5,s(X8))
| achievable(west(m(X7),c(X6)),boatoneast,east(m(X5),c(s(X8)))) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_31,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(X7),c(X6)),boatoneast,east(m(X5),c(s(X8))))
| ~ safe(X7,s(X6))
| ~ safe(X5,X8)
| achievable(west(m(X7),c(s(X6))),boatonwest,east(m(X5),c(X8))) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(s(X7)),c(X6)),boatonwest,east(m(X5),c(X8)))
| ~ safe(X7,X6)
| ~ safe(s(X5),X8)
| achievable(west(m(X7),c(X6)),boatoneast,east(m(s(X5)),c(X8))) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_33,plain,
! [X5,X6,X7,X8] :
( ~ achievable(west(m(X7),c(X6)),boatoneast,east(m(s(X5)),c(X8)))
| ~ safe(s(X7),X6)
| ~ safe(X5,X8)
| achievable(west(m(s(X7)),c(X6)),boatonwest,east(m(X5),c(X8))) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_34,plain,
! [X4,X5] :
( greater_or_equal(s(X5),s(X4))
| ~ greater_or_equal(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_35,plain,
! [X4,X5] :
( ~ greater_or_equal(X5,X4)
| safe(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ safe(X3,s(s(X4)))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
( achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(X1,s(s(X2)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ safe(s(s(X3)),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(s(X1)),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(s(X3),s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
( achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(X1),s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X3,s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,plain,
( achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(X1,s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4)))) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ safe(s(X3),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,plain,
( achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(X1),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_46,plain,
( greater_or_equal(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,plain,
( safe(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_48,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ safe(X3,s(s(X4)))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4))) ),
c_0_36,
[final] ).
cnf(c_0_49,plain,
( achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(X1,s(s(X2)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
c_0_37,
[final] ).
cnf(c_0_50,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ safe(s(s(X3)),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4))) ),
c_0_38,
[final] ).
cnf(c_0_51,plain,
( achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(s(X1)),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
c_0_39,
[final] ).
cnf(c_0_52,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(s(X3),s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
c_0_40,
[final] ).
cnf(c_0_53,plain,
( achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(X1),s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
c_0_41,
[final] ).
cnf(c_0_54,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X3,s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
c_0_42,
[final] ).
cnf(c_0_55,plain,
( achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(X1,s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4)))) ),
c_0_43,
[final] ).
cnf(c_0_56,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ safe(s(X3),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
c_0_44,
[final] ).
cnf(c_0_57,plain,
( achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(X1),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4))) ),
c_0_45,
[final] ).
cnf(c_0_58,plain,
( greater_or_equal(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
c_0_46,
[final] ).
cnf(c_0_59,plain,
( safe(X1,X2)
| ~ greater_or_equal(X1,X2) ),
c_0_47,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_48_0,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ safe(X3,s(s(X4)))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ safe(X3,s(s(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ safe(X1,X2)
| ~ safe(X3,s(s(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_3,axiom,
( ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(X3,s(s(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(X1,s(s(X2)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( ~ safe(X3,X4)
| achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,s(s(X2)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_2,axiom,
( ~ safe(X1,s(s(X2)))
| ~ safe(X3,X4)
| achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_3,axiom,
( ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ safe(X1,s(s(X2)))
| ~ safe(X3,X4)
| achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_50_0,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ safe(s(s(X3)),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_1,axiom,
( ~ safe(s(s(X3)),X4)
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_2,axiom,
( ~ safe(X1,X2)
| ~ safe(s(s(X3)),X4)
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_3,axiom,
( ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(s(s(X3)),X4)
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
( achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(s(X1)),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_1,axiom,
( ~ safe(X3,X4)
| achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(s(s(X1)),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_2,axiom,
( ~ safe(s(s(X1)),X2)
| ~ safe(X3,X4)
| achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_3,axiom,
( ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ safe(s(s(X1)),X2)
| ~ safe(X3,X4)
| achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_52_0,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(s(X3),s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( ~ safe(s(X3),s(X4))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_2,axiom,
( ~ safe(X1,X2)
| ~ safe(s(X3),s(X4))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_3,axiom,
( ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(s(X3),s(X4))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(X1),s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( ~ safe(X3,X4)
| achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(s(X1),s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_2,axiom,
( ~ safe(s(X1),s(X2))
| ~ safe(X3,X4)
| achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_3,axiom,
( ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(s(X1),s(X2))
| ~ safe(X3,X4)
| achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X3,s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_1,axiom,
( ~ safe(X3,s(X4))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_2,axiom,
( ~ safe(X1,X2)
| ~ safe(X3,s(X4))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_3,axiom,
( ~ achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(X3,s(X4))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_55_0,axiom,
( achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(X1,s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_1,axiom,
( ~ safe(X3,X4)
| achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_2,axiom,
( ~ safe(X1,s(X2))
| ~ safe(X3,X4)
| achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4)))) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_3,axiom,
( ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X1,s(X2))
| ~ safe(X3,X4)
| achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_56_0,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ safe(s(X3),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_1,axiom,
( ~ safe(s(X3),X4)
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_2,axiom,
( ~ safe(X1,X2)
| ~ safe(s(X3),X4)
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_3,axiom,
( ~ achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(s(X3),X4)
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_57_0,axiom,
( achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X3,X4)
| ~ safe(s(X1),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_1,axiom,
( ~ safe(X3,X4)
| achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(s(X1),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_2,axiom,
( ~ safe(s(X1),X2)
| ~ safe(X3,X4)
| achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_3,axiom,
( ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ safe(s(X1),X2)
| ~ safe(X3,X4)
| achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_58_0,axiom,
( greater_or_equal(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_1,axiom,
( ~ greater_or_equal(X1,X2)
| greater_or_equal(s(X1),s(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_59_0,axiom,
( safe(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_1,axiom,
( ~ greater_or_equal(X1,X2)
| safe(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_011,negated_conjecture,
! [X1] : ~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('<stdin>',prove_can_get_to_east_bank) ).
fof(c_0_1_012,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('<stdin>',start_on_west_bank) ).
fof(c_0_2_013,negated_conjecture,
! [X1] : ~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_014,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
c_0_1 ).
fof(c_0_4_015,negated_conjecture,
! [X2] : ~ achievable(west(m(n0),c(n0)),X2,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5_016,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
c_0_3 ).
cnf(c_0_6_017,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_018,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_019,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
c_0_6,
[final] ).
cnf(c_0_9_020,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_46,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_8) ).
cnf(c_65,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_69,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_72,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_73,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_215,plain,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_0,plain,
( ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(X2,s(s(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3))))) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_48_0) ).
cnf(c_123,plain,
( ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(X2,s(s(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3))))) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_124,plain,
( ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3)))))
| ~ safe(X2,s(s(X3)))
| ~ safe(X0,X1) ),
inference(rewriting,[status(thm)],[c_123]) ).
cnf(c_221,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(n0,n0) ),
inference(resolution,[status(thm)],[c_215,c_124]) ).
cnf(c_222,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(n0,n0) ),
inference(rewriting,[status(thm)],[c_221]) ).
cnf(c_44,plain,
safe(n0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_9_0) ).
cnf(c_211,plain,
safe(n0,X0),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_234,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0)))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_222,c_211]) ).
cnf(c_235,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0)))) ),
inference(rewriting,[status(thm)],[c_234]) ).
cnf(c_28,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3))))
| ~ safe(X0,s(X1))
| ~ safe(X2,X3)
| achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_55_0) ).
cnf(c_179,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3))))
| ~ safe(X0,s(X1))
| ~ safe(X2,X3)
| achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_180,plain,
( achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3))))
| ~ safe(X0,s(X1))
| ~ safe(X2,X3) ),
inference(rewriting,[status(thm)],[c_179]) ).
cnf(c_240,plain,
( ~ achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0))) ),
inference(resolution,[status(thm)],[c_235,c_180]) ).
cnf(c_241,plain,
( ~ achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0))) ),
inference(rewriting,[status(thm)],[c_240]) ).
cnf(c_288,plain,
( ~ achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_241,c_211]) ).
cnf(c_289,plain,
( ~ achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(n0)) ),
inference(rewriting,[status(thm)],[c_288]) ).
cnf(c_293,plain,
( ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(n0)) ),
inference(resolution,[status(thm)],[c_289,c_124]) ).
cnf(c_294,plain,
( ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(n0)) ),
inference(rewriting,[status(thm)],[c_293]) ).
cnf(c_364,plain,
( ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_294,c_211]) ).
cnf(c_365,plain,
( ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0)) ),
inference(rewriting,[status(thm)],[c_364]) ).
cnf(c_372,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0)))) ),
inference(resolution,[status(thm)],[c_365,c_180]) ).
cnf(c_373,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0)))) ),
inference(rewriting,[status(thm)],[c_372]) ).
cnf(c_690,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_373,c_211]) ).
cnf(c_691,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0) ),
inference(rewriting,[status(thm)],[c_690]) ).
cnf(c_8,plain,
( ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(s(s(X2)),X3)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3))) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_50_0) ).
cnf(c_139,plain,
( ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(s(s(X2)),X3)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3))) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_140,plain,
( ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3)))
| ~ safe(s(s(X2)),X3)
| ~ safe(X0,X1) ),
inference(rewriting,[status(thm)],[c_139]) ).
cnf(c_697,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(n0))) ),
inference(resolution,[status(thm)],[c_691,c_140]) ).
cnf(c_698,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(n0))) ),
inference(rewriting,[status(thm)],[c_697]) ).
cnf(c_711,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_698,c_211]) ).
cnf(c_712,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0) ),
inference(rewriting,[status(thm)],[c_711]) ).
cnf(c_20,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(s(X0),s(X1))
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_53_0) ).
cnf(c_163,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(s(X0),s(X1))
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_164,plain,
( achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(s(X0),s(X1))
| ~ safe(X2,X3) ),
inference(rewriting,[status(thm)],[c_163]) ).
cnf(c_722,plain,
( ~ achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(resolution,[status(thm)],[c_712,c_164]) ).
cnf(c_723,plain,
( ~ achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_722]) ).
cnf(c_1280,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(resolution,[status(thm)],[c_723,c_140]) ).
cnf(c_1281,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_1280]) ).
cnf(c_3050,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(s(n0))) ),
inference(resolution,[status(thm)],[c_1281,c_180]) ).
cnf(c_3051,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(s(n0))) ),
inference(rewriting,[status(thm)],[c_3050]) ).
cnf(c_3321,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3051,c_211]) ).
cnf(c_3322,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3321]) ).
cnf(c_3330,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(s(s(n0)))) ),
inference(resolution,[status(thm)],[c_3322,c_124]) ).
cnf(c_3331,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(s(s(n0)))) ),
inference(rewriting,[status(thm)],[c_3330]) ).
cnf(c_3360,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3331,c_211]) ).
cnf(c_3361,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3360]) ).
cnf(c_36,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3)))
| ~ safe(s(X0),X1)
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_57_0) ).
cnf(c_195,plain,
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3)))
| ~ safe(s(X0),X1)
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3))) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_196,plain,
( achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3)))
| ~ safe(s(X0),X1)
| ~ safe(X2,X3) ),
inference(rewriting,[status(thm)],[c_195]) ).
cnf(c_3377,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(n0)) ),
inference(resolution,[status(thm)],[c_3361,c_196]) ).
cnf(c_3378,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ safe(n0,s(n0)) ),
inference(rewriting,[status(thm)],[c_3377]) ).
cnf(c_3408,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3378,c_211]) ).
cnf(c_3409,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3408]) ).
cnf(c_16,plain,
( ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(s(X2),s(X3))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_52_0) ).
cnf(c_155,plain,
( ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(s(X2),s(X3))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_156,plain,
( ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(s(X2),s(X3))
| ~ safe(X0,X1) ),
inference(rewriting,[status(thm)],[c_155]) ).
cnf(c_3417,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0)))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(resolution,[status(thm)],[c_3409,c_156]) ).
cnf(c_3418,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0)))
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3417]) ).
cnf(c_47,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_9) ).
cnf(c_63,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_70,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_71,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_74,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_217,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_3430,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3418,c_217]) ).
cnf(c_3431,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3430]) ).
cnf(c_42,plain,
( ~ greater_or_equal(X0,X1)
| safe(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_59_0) ).
cnf(c_207,plain,
( ~ greater_or_equal(X0,X1)
| safe(X0,X1) ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_208,plain,
( safe(X0,X1)
| ~ greater_or_equal(X0,X1) ),
inference(rewriting,[status(thm)],[c_207]) ).
cnf(c_3438,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(s(n0))),s(s(s(n0)))) ),
inference(resolution,[status(thm)],[c_3431,c_208]) ).
cnf(c_3439,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(s(n0))),s(s(s(n0)))) ),
inference(rewriting,[status(thm)],[c_3438]) ).
cnf(c_40,plain,
( ~ greater_or_equal(X0,X1)
| greater_or_equal(s(X0),s(X1)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_58_0) ).
cnf(c_203,plain,
( ~ greater_or_equal(X0,X1)
| greater_or_equal(s(X0),s(X1)) ),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_204,plain,
( greater_or_equal(s(X0),s(X1))
| ~ greater_or_equal(X0,X1) ),
inference(rewriting,[status(thm)],[c_203]) ).
cnf(c_3480,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(resolution,[status(thm)],[c_3439,c_204]) ).
cnf(c_3481,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(rewriting,[status(thm)],[c_3480]) ).
cnf(c_3646,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3481,c_208]) ).
cnf(c_3647,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(rewriting,[status(thm)],[c_3646]) ).
cnf(c_3653,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(s(n0))),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(resolution,[status(thm)],[c_3647,c_208]) ).
cnf(c_3654,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(s(n0))),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(rewriting,[status(thm)],[c_3653]) ).
cnf(c_3845,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(n0)) ),
inference(resolution,[status(thm)],[c_3654,c_204]) ).
cnf(c_3846,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(n0)) ),
inference(rewriting,[status(thm)],[c_3845]) ).
cnf(c_3863,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(resolution,[status(thm)],[c_3846,c_204]) ).
cnf(c_3864,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(s(n0),s(n0))
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3863]) ).
cnf(c_3911,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3864,c_208]) ).
cnf(c_3912,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3911]) ).
cnf(c_3917,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(s(s(n0))),s(n0))
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(resolution,[status(thm)],[c_3912,c_208]) ).
cnf(c_3918,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(s(s(n0))),s(n0))
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3917]) ).
cnf(c_3945,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(s(n0)),n0)
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(resolution,[status(thm)],[c_3918,c_204]) ).
cnf(c_3946,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(s(n0)),n0)
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3945]) ).
cnf(c_45,plain,
greater_or_equal(X0,n0),
file('/export/starexec/sandbox/tmp/iprover_modulo_50a141.p',c_0_8_0) ).
cnf(c_213,plain,
greater_or_equal(X0,n0),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_3951,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3946,c_213]) ).
cnf(c_3952,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3951]) ).
cnf(c_3956,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(n0),s(n0))
| ~ greater_or_equal(s(n0),n0) ),
inference(resolution,[status(thm)],[c_3952,c_204]) ).
cnf(c_3957,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(n0),s(n0))
| ~ greater_or_equal(s(n0),n0) ),
inference(rewriting,[status(thm)],[c_3956]) ).
cnf(c_3961,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3957,c_213]) ).
cnf(c_3962,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3961]) ).
cnf(c_3965,plain,
( ~ greater_or_equal(s(s(s(n0))),n0)
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(resolution,[status(thm)],[c_3962,c_208]) ).
cnf(c_3966,plain,
( ~ greater_or_equal(s(s(s(n0))),n0)
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(rewriting,[status(thm)],[c_3965]) ).
cnf(c_3969,plain,
~ greater_or_equal(s(n0),s(n0)),
inference(forward_subsumption_resolution,[status(thm)],[c_3966,c_213]) ).
cnf(c_3970,plain,
~ greater_or_equal(s(n0),s(n0)),
inference(rewriting,[status(thm)],[c_3969]) ).
cnf(c_3972,plain,
~ greater_or_equal(n0,n0),
inference(resolution,[status(thm)],[c_3970,c_204]) ).
cnf(c_3973,plain,
~ greater_or_equal(n0,n0),
inference(rewriting,[status(thm)],[c_3972]) ).
cnf(c_3975,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3973,c_213]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n024.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 : Sun May 29 01:08:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % 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_a7da2a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_50a141.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_742139 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --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_a7da2a.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 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ 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.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % ------ Problem Properties
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % EPR false
% 0.20/0.44 % Horn true
% 0.20/0.44 % Has equality false
% 0.20/0.44
% 0.20/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % % ------ Current options:
% 0.20/0.44
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.44/0.61 % --inst_prop_sim_new false
% 0.44/0.61 % --inst_orphan_elimination true
% 0.44/0.61 % --inst_learning_loop_flag true
% 0.44/0.61 % --inst_learning_start 3000
% 0.44/0.61 % --inst_learning_factor 2
% 0.44/0.61 % --inst_start_prop_sim_after_learn 3
% 0.44/0.61 % --inst_sel_renew solver
% 0.44/0.61 % --inst_lit_activity_flag true
% 0.44/0.61 % --inst_out_proof true
% 0.44/0.61
% 0.44/0.61 % ------ Resolution Options
% 0.44/0.61
% 0.44/0.61 % --resolution_flag true
% 0.44/0.61 % --res_lit_sel kbo_max
% 0.44/0.61 % --res_to_prop_solver none
% 0.44/0.61 % --res_prop_simpl_new false
% 0.44/0.61 % --res_prop_simpl_given false
% 0.44/0.61 % --res_passive_queue_type priority_queues
% 0.44/0.61 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.44/0.61 % --res_passive_queues_freq [15;5]
% 0.44/0.61 % --res_forward_subs full
% 0.44/0.61 % --res_backward_subs full
% 0.44/0.61 % --res_forward_subs_resolution true
% 0.44/0.61 % --res_backward_subs_resolution true
% 0.44/0.61 % --res_orphan_elimination false
% 0.44/0.61 % --res_time_limit 1000.
% 0.44/0.61 % --res_out_proof true
% 0.44/0.61 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a7da2a.s
% 0.44/0.61 % --modulo true
% 0.44/0.61
% 0.44/0.61 % ------ Combination Options
% 0.44/0.61
% 0.44/0.61 % --comb_res_mult 1000
% 0.44/0.61 % --comb_inst_mult 300
% 0.44/0.61 % ------
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61 % ------ Proving...
% 0.44/0.61 %
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61 % Resolution empty clause
% 0.44/0.61
% 0.44/0.61 % ------ Statistics
% 0.44/0.61
% 0.44/0.61 % ------ General
% 0.44/0.61
% 0.44/0.61 % num_of_input_clauses: 48
% 0.44/0.61 % num_of_input_neg_conjectures: 1
% 0.44/0.61 % num_of_splits: 0
% 0.44/0.61 % num_of_split_atoms: 0
% 0.44/0.61 % num_of_sem_filtered_clauses: 0
% 0.44/0.61 % num_of_subtypes: 0
% 0.44/0.61 % monotx_restored_types: 0
% 0.44/0.61 % sat_num_of_epr_types: 0
% 0.44/0.61 % sat_num_of_non_cyclic_types: 0
% 0.44/0.61 % sat_guarded_non_collapsed_types: 0
% 0.44/0.61 % is_epr: 0
% 0.44/0.61 % is_horn: 1
% 0.44/0.61 % has_eq: 0
% 0.44/0.61 % num_pure_diseq_elim: 0
% 0.44/0.61 % simp_replaced_by: 0
% 0.44/0.61 % res_preprocessed: 3
% 0.44/0.61 % prep_upred: 0
% 0.44/0.61 % prep_unflattend: 0
% 0.44/0.61 % pred_elim_cands: 0
% 0.44/0.61 % pred_elim: 0
% 0.44/0.61 % pred_elim_cl: 0
% 0.44/0.61 % pred_elim_cycles: 0
% 0.44/0.61 % forced_gc_time: 0
% 0.44/0.61 % gc_basic_clause_elim: 0
% 0.44/0.61 % parsing_time: 0.004
% 0.44/0.61 % sem_filter_time: 0.
% 0.44/0.61 % pred_elim_time: 0.
% 0.44/0.61 % out_proof_time: 0.005
% 0.44/0.61 % monotx_time: 0.
% 0.44/0.61 % subtype_inf_time: 0.
% 0.44/0.61 % unif_index_cands_time: 0.
% 0.44/0.61 % unif_index_add_time: 0.
% 0.44/0.61 % total_time: 0.203
% 0.44/0.61 % num_of_symbols: 36
% 0.44/0.61 % num_of_terms: 315
% 0.44/0.61
% 0.44/0.61 % ------ Propositional Solver
% 0.44/0.61
% 0.44/0.61 % prop_solver_calls: 1
% 0.44/0.61 % prop_fast_solver_calls: 5
% 0.44/0.61 % prop_num_of_clauses: 31
% 0.44/0.61 % prop_preprocess_simplified: 180
% 0.44/0.61 % prop_fo_subsumed: 0
% 0.44/0.61 % prop_solver_time: 0.
% 0.44/0.61 % prop_fast_solver_time: 0.
% 0.44/0.61 % prop_unsat_core_time: 0.
% 0.44/0.61
% 0.44/0.61 % ------ QBF
% 0.44/0.61
% 0.44/0.61 % qbf_q_res: 0
% 0.44/0.61 % qbf_num_tautologies: 0
% 0.44/0.61 % qbf_prep_cycles: 0
% 0.44/0.61
% 0.44/0.61 % ------ BMC1
% 0.44/0.61
% 0.44/0.61 % bmc1_current_bound: -1
% 0.44/0.61 % bmc1_last_solved_bound: -1
% 0.44/0.61 % bmc1_unsat_core_size: -1
% 0.44/0.61 % bmc1_unsat_core_parents_size: -1
% 0.44/0.61 % bmc1_merge_next_fun: 0
% 0.44/0.61 % bmc1_unsat_core_clauses_time: 0.
% 0.44/0.61
% 0.44/0.61 % ------ Instantiation
% 0.44/0.61
% 0.44/0.61 % inst_num_of_clauses: 48
% 0.44/0.61 % inst_num_in_passive: 0
% 0.44/0.61 % inst_num_in_active: 0
% 0.44/0.61 % inst_num_in_unprocessed: 48
% 0.44/0.61 % inst_num_of_loops: 0
% 0.44/0.61 % inst_num_of_learning_restarts: 0
% 0.44/0.61 % inst_num_moves_active_passive: 0
% 0.44/0.61 % inst_lit_activity: 0
% 0.44/0.61 % inst_lit_activity_moves: 0
% 0.44/0.61 % inst_num_tautologies: 0
% 0.44/0.61 % inst_num_prop_implied: 0
% 0.44/0.61 % inst_num_existing_simplified: 0
% 0.44/0.61 % inst_num_eq_res_simplified: 0
% 0.44/0.61 % inst_num_child_elim: 0
% 0.44/0.61 % inst_num_of_dismatching_blockings: 0
% 0.44/0.61 % inst_num_of_non_proper_insts: 0
% 0.44/0.61 % inst_num_of_duplicates: 0
% 0.44/0.61 % inst_inst_num_from_inst_to_res: 0
% 0.44/0.61 % inst_dismatching_checking_time: 0.
% 0.44/0.61
% 0.44/0.61 % ------ Resolution
% 0.44/0.61
% 0.44/0.61 % res_num_of_clauses: 144
% 0.44/0.61 % res_num_in_passive: 0
% 0.44/0.61 % res_num_in_active: 106
% 0.44/0.61 % res_num_of_loops: 348
% 0.44/0.61 % res_forward_subset_subsumed: 184
% 0.44/0.61 % res_backward_subset_subsumed: 21
% 0.44/0.61 % res_forward_subsumed: 165
% 0.44/0.61 % res_backward_subsumed: 90
% 0.44/0.61 % res_forward_subsumption_resolution: 78
% 0.44/0.61 % res_backward_subsumption_resolution: 0
% 0.44/0.61 % res_clause_to_clause_subsumption: 6065
% 0.44/0.61 % res_orphan_elimination: 0
% 0.44/0.61 % res_tautology_del: 0
% 0.44/0.61 % res_num_eq_res_simplified: 0
% 0.44/0.61 % res_num_sel_changes: 0
% 0.44/0.61 % res_moves_from_active_to_pass: 0
% 0.44/0.61
% 0.44/0.61 % Status Unsatisfiable
% 0.44/0.61 % SZS status Unsatisfiable
% 0.44/0.61 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------