TSTP Solution File: PLA002-1 by iProverMo---2.5-0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProverMo---2.5-0.1
% Problem  : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : iprover_modulo %s %d

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 16:57:50 EDT 2022

% Result   : Unsatisfiable 0.20s 0.44s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   27
% Syntax   : Number of formulae    :  170 (  32 unt;   0 def)
%            Number of atoms       :  346 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  354 ( 178   ~; 176   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :  160 (  38 sgn  51   !;   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,hypothesis,
    ! [X3] :
      ( ~ warm(X3)
      | ~ at(d,X3)
      | at(b,climb(b,X3)) ),
    file('<stdin>',climb_mountain_d_to_b) ).

fof(c_0_1,hypothesis,
    ! [X3] :
      ( ~ warm(X3)
      | ~ at(b,X3)
      | at(d,climb(d,X3)) ),
    file('<stdin>',climb_mountain_b_to_d) ).

fof(c_0_2,hypothesis,
    ! [X3] :
      ( ~ cold(X3)
      | ~ at(c,X3)
      | at(b,skate(b,X3)) ),
    file('<stdin>',cross_river_c_to_b) ).

fof(c_0_3,hypothesis,
    ! [X3] :
      ( ~ cold(X3)
      | ~ at(b,X3)
      | at(c,skate(c,X3)) ),
    file('<stdin>',cross_river_b_to_c) ).

fof(c_0_4,hypothesis,
    ! [X3] :
      ( ~ at(f,X3)
      | at(d,go(d,X3)) ),
    file('<stdin>',go_f_to_d) ).

fof(c_0_5,hypothesis,
    ! [X3] :
      ( ~ at(d,X3)
      | at(f,go(f,X3)) ),
    file('<stdin>',go_d_to_f) ).

fof(c_0_6,hypothesis,
    ! [X3] :
      ( ~ at(e,X3)
      | at(c,go(c,X3)) ),
    file('<stdin>',go_e_to_c) ).

fof(c_0_7,hypothesis,
    ! [X3] :
      ( ~ at(c,X3)
      | at(e,go(e,X3)) ),
    file('<stdin>',go_c_to_e) ).

fof(c_0_8,hypothesis,
    ! [X3] :
      ( ~ at(d,X3)
      | at(c,go(c,X3)) ),
    file('<stdin>',go_d_to_c) ).

fof(c_0_9,hypothesis,
    ! [X3] :
      ( ~ at(c,X3)
      | at(d,go(d,X3)) ),
    file('<stdin>',go_c_to_d) ).

fof(c_0_10,hypothesis,
    ! [X3] :
      ( ~ at(b,X3)
      | at(a,drive(a,X3)) ),
    file('<stdin>',drive_b_to_a) ).

fof(c_0_11,hypothesis,
    ! [X3] :
      ( ~ at(b,X3)
      | at(a,walk(a,X3)) ),
    file('<stdin>',walk_b_to_a) ).

fof(c_0_12,hypothesis,
    ! [X3] :
      ( ~ at(a,X3)
      | at(b,drive(b,X3)) ),
    file('<stdin>',drive_a_to_b) ).

fof(c_0_13,hypothesis,
    ! [X3] :
      ( ~ at(a,X3)
      | at(b,walk(b,X3)) ),
    file('<stdin>',walk_a_to_b) ).

fof(c_0_14,negated_conjecture,
    ! [X4] : ~ at(a,X4),
    file('<stdin>',prove_you_can_get_to_a) ).

fof(c_0_15,hypothesis,
    at(f,s0),
    file('<stdin>',initial) ).

fof(c_0_16,hypothesis,
    ! [X1,X2] :
      ( warm(X2)
      | cold(X1) ),
    file('<stdin>',warm_or_cold) ).

fof(c_0_17,hypothesis,
    ! [X3] :
      ( ~ warm(X3)
      | ~ at(d,X3)
      | at(b,climb(b,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_18,hypothesis,
    ! [X3] :
      ( ~ warm(X3)
      | ~ at(b,X3)
      | at(d,climb(d,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_19,hypothesis,
    ! [X3] :
      ( ~ cold(X3)
      | ~ at(c,X3)
      | at(b,skate(b,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_20,hypothesis,
    ! [X3] :
      ( ~ cold(X3)
      | ~ at(b,X3)
      | at(c,skate(c,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_21,hypothesis,
    ! [X3] :
      ( ~ at(f,X3)
      | at(d,go(d,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_22,hypothesis,
    ! [X3] :
      ( ~ at(d,X3)
      | at(f,go(f,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_23,hypothesis,
    ! [X3] :
      ( ~ at(e,X3)
      | at(c,go(c,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

fof(c_0_24,hypothesis,
    ! [X3] :
      ( ~ at(c,X3)
      | at(e,go(e,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_25,hypothesis,
    ! [X3] :
      ( ~ at(d,X3)
      | at(c,go(c,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_26,hypothesis,
    ! [X3] :
      ( ~ at(c,X3)
      | at(d,go(d,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_27,hypothesis,
    ! [X3] :
      ( ~ at(b,X3)
      | at(a,drive(a,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_10]) ).

fof(c_0_28,hypothesis,
    ! [X3] :
      ( ~ at(b,X3)
      | at(a,walk(a,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_11]) ).

fof(c_0_29,hypothesis,
    ! [X3] :
      ( ~ at(a,X3)
      | at(b,drive(b,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_12]) ).

fof(c_0_30,hypothesis,
    ! [X3] :
      ( ~ at(a,X3)
      | at(b,walk(b,X3)) ),
    inference(fof_simplification,[status(thm)],[c_0_13]) ).

fof(c_0_31,negated_conjecture,
    ! [X4] : ~ at(a,X4),
    inference(fof_simplification,[status(thm)],[c_0_14]) ).

fof(c_0_32,hypothesis,
    at(f,s0),
    c_0_15 ).

fof(c_0_33,hypothesis,
    ! [X1,X2] :
      ( warm(X2)
      | cold(X1) ),
    c_0_16 ).

fof(c_0_34,hypothesis,
    ! [X4] :
      ( ~ warm(X4)
      | ~ at(d,X4)
      | at(b,climb(b,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_17]) ).

fof(c_0_35,hypothesis,
    ! [X4] :
      ( ~ warm(X4)
      | ~ at(b,X4)
      | at(d,climb(d,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_18]) ).

fof(c_0_36,hypothesis,
    ! [X4] :
      ( ~ cold(X4)
      | ~ at(c,X4)
      | at(b,skate(b,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_19]) ).

fof(c_0_37,hypothesis,
    ! [X4] :
      ( ~ cold(X4)
      | ~ at(b,X4)
      | at(c,skate(c,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_20]) ).

fof(c_0_38,hypothesis,
    ! [X4] :
      ( ~ at(f,X4)
      | at(d,go(d,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_21]) ).

fof(c_0_39,hypothesis,
    ! [X4] :
      ( ~ at(d,X4)
      | at(f,go(f,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_22]) ).

fof(c_0_40,hypothesis,
    ! [X4] :
      ( ~ at(e,X4)
      | at(c,go(c,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_23]) ).

fof(c_0_41,hypothesis,
    ! [X4] :
      ( ~ at(c,X4)
      | at(e,go(e,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_24]) ).

fof(c_0_42,hypothesis,
    ! [X4] :
      ( ~ at(d,X4)
      | at(c,go(c,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_25]) ).

fof(c_0_43,hypothesis,
    ! [X4] :
      ( ~ at(c,X4)
      | at(d,go(d,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_26]) ).

fof(c_0_44,hypothesis,
    ! [X4] :
      ( ~ at(b,X4)
      | at(a,drive(a,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_27]) ).

fof(c_0_45,hypothesis,
    ! [X4] :
      ( ~ at(b,X4)
      | at(a,walk(a,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_28]) ).

fof(c_0_46,hypothesis,
    ! [X4] :
      ( ~ at(a,X4)
      | at(b,drive(b,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_29]) ).

fof(c_0_47,hypothesis,
    ! [X4] :
      ( ~ at(a,X4)
      | at(b,walk(b,X4)) ),
    inference(variable_rename,[status(thm)],[c_0_30]) ).

fof(c_0_48,negated_conjecture,
    ! [X5] : ~ at(a,X5),
    inference(variable_rename,[status(thm)],[c_0_31]) ).

fof(c_0_49,hypothesis,
    at(f,s0),
    c_0_32 ).

fof(c_0_50,hypothesis,
    ! [X3,X4] :
      ( warm(X3)
      | cold(X4) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_33])])]) ).

cnf(c_0_51,hypothesis,
    ( at(b,climb(b,X1))
    | ~ at(d,X1)
    | ~ warm(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_52,hypothesis,
    ( at(d,climb(d,X1))
    | ~ at(b,X1)
    | ~ warm(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_53,hypothesis,
    ( at(b,skate(b,X1))
    | ~ at(c,X1)
    | ~ cold(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_54,hypothesis,
    ( at(c,skate(c,X1))
    | ~ at(b,X1)
    | ~ cold(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_55,hypothesis,
    ( at(d,go(d,X1))
    | ~ at(f,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_56,hypothesis,
    ( at(f,go(f,X1))
    | ~ at(d,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_57,hypothesis,
    ( at(c,go(c,X1))
    | ~ at(e,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_58,hypothesis,
    ( at(e,go(e,X1))
    | ~ at(c,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_59,hypothesis,
    ( at(c,go(c,X1))
    | ~ at(d,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

cnf(c_0_60,hypothesis,
    ( at(d,go(d,X1))
    | ~ at(c,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_61,hypothesis,
    ( at(a,drive(a,X1))
    | ~ at(b,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_62,hypothesis,
    ( at(a,walk(a,X1))
    | ~ at(b,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_63,hypothesis,
    ( at(b,drive(b,X1))
    | ~ at(a,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_64,hypothesis,
    ( at(b,walk(b,X1))
    | ~ at(a,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_65,negated_conjecture,
    ~ at(a,X1),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

cnf(c_0_66,hypothesis,
    at(f,s0),
    inference(split_conjunct,[status(thm)],[c_0_49]) ).

cnf(c_0_67,hypothesis,
    ( cold(X1)
    | warm(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

cnf(c_0_68,hypothesis,
    ( at(b,climb(b,X1))
    | ~ at(d,X1)
    | ~ warm(X1) ),
    c_0_51,
    [final] ).

cnf(c_0_69,hypothesis,
    ( at(d,climb(d,X1))
    | ~ at(b,X1)
    | ~ warm(X1) ),
    c_0_52,
    [final] ).

cnf(c_0_70,hypothesis,
    ( at(b,skate(b,X1))
    | ~ at(c,X1)
    | ~ cold(X1) ),
    c_0_53,
    [final] ).

cnf(c_0_71,hypothesis,
    ( at(c,skate(c,X1))
    | ~ at(b,X1)
    | ~ cold(X1) ),
    c_0_54,
    [final] ).

cnf(c_0_72,hypothesis,
    ( at(d,go(d,X1))
    | ~ at(f,X1) ),
    c_0_55,
    [final] ).

cnf(c_0_73,hypothesis,
    ( at(f,go(f,X1))
    | ~ at(d,X1) ),
    c_0_56,
    [final] ).

cnf(c_0_74,hypothesis,
    ( at(c,go(c,X1))
    | ~ at(e,X1) ),
    c_0_57,
    [final] ).

cnf(c_0_75,hypothesis,
    ( at(e,go(e,X1))
    | ~ at(c,X1) ),
    c_0_58,
    [final] ).

cnf(c_0_76,hypothesis,
    ( at(c,go(c,X1))
    | ~ at(d,X1) ),
    c_0_59,
    [final] ).

cnf(c_0_77,hypothesis,
    ( at(d,go(d,X1))
    | ~ at(c,X1) ),
    c_0_60,
    [final] ).

cnf(c_0_78,hypothesis,
    ( at(a,drive(a,X1))
    | ~ at(b,X1) ),
    c_0_61,
    [final] ).

cnf(c_0_79,hypothesis,
    ( at(a,walk(a,X1))
    | ~ at(b,X1) ),
    c_0_62,
    [final] ).

cnf(c_0_80,hypothesis,
    ( at(b,drive(b,X1))
    | ~ at(a,X1) ),
    c_0_63,
    [final] ).

cnf(c_0_81,hypothesis,
    ( at(b,walk(b,X1))
    | ~ at(a,X1) ),
    c_0_64,
    [final] ).

cnf(c_0_82,negated_conjecture,
    ~ at(a,X1),
    c_0_65,
    [final] ).

cnf(c_0_83,hypothesis,
    at(f,s0),
    c_0_66,
    [final] ).

cnf(c_0_84,hypothesis,
    ( cold(X1)
    | warm(X2) ),
    c_0_67,
    [final] ).

% End CNF derivation

%-------------------------------------------------------------
% Proof by iprover

cnf(c_14,plain,
    ( warm(X0)
    | cold(X1) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_84) ).

cnf(c_31,plain,
    ( cold(X0)
    | ~ sP0_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_14]) ).

cnf(c_66,plain,
    ( cold(X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_31]) ).

cnf(c_92,plain,
    ( cold(X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_66]) ).

cnf(c_97,plain,
    ( cold(X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_92]) ).

cnf(c_2,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ cold(X0) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_70) ).

cnf(c_42,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ cold(X0) ),
    inference(copy,[status(esa)],[c_2]) ).

cnf(c_80,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ cold(X0) ),
    inference(copy,[status(esa)],[c_42]) ).

cnf(c_109,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ cold(X0) ),
    inference(copy,[status(esa)],[c_80]) ).

cnf(c_146,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ sP0_iProver_split ),
    inference(resolution,[status(thm)],[c_97,c_109]) ).

cnf(c_157,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_146]) ).

cnf(c_165,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_157]) ).

cnf(c_314,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_165]) ).

cnf(c_352,plain,
    ( at(b,skate(b,X0))
    | ~ at(c,X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_314]) ).

cnf(c_33,plain,
    ( sP0_iProver_split
    | sP1_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split,sP0_iProver_split])],[c_14]) ).

cnf(c_70,plain,
    ( sP0_iProver_split
    | sP1_iProver_split ),
    inference(copy,[status(esa)],[c_33]) ).

cnf(c_94,plain,
    ( sP0_iProver_split
    | sP1_iProver_split ),
    inference(copy,[status(esa)],[c_70]) ).

cnf(c_95,plain,
    ( sP0_iProver_split
    | sP1_iProver_split ),
    inference(copy,[status(esa)],[c_94]) ).

cnf(c_32,plain,
    ( warm(X0)
    | ~ sP1_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_14]) ).

cnf(c_68,plain,
    ( warm(X0)
    | ~ sP1_iProver_split ),
    inference(copy,[status(esa)],[c_32]) ).

cnf(c_93,plain,
    ( warm(X0)
    | ~ sP1_iProver_split ),
    inference(copy,[status(esa)],[c_68]) ).

cnf(c_96,plain,
    ( warm(X0)
    | ~ sP1_iProver_split ),
    inference(copy,[status(esa)],[c_93]) ).

cnf(c_112,plain,
    ( warm(X0)
    | sP0_iProver_split ),
    inference(resolution,[status(thm)],[c_95,c_96]) ).

cnf(c_120,plain,
    ( warm(X0)
    | sP0_iProver_split ),
    inference(copy,[status(esa)],[c_112]) ).

cnf(c_123,plain,
    ( warm(X0)
    | sP0_iProver_split ),
    inference(copy,[status(esa)],[c_120]) ).

cnf(c_0,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | ~ warm(X0) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_68) ).

cnf(c_38,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | ~ warm(X0) ),
    inference(copy,[status(esa)],[c_0]) ).

cnf(c_78,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | ~ warm(X0) ),
    inference(copy,[status(esa)],[c_38]) ).

cnf(c_111,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | ~ warm(X0) ),
    inference(copy,[status(esa)],[c_78]) ).

cnf(c_208,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | sP0_iProver_split ),
    inference(resolution,[status(thm)],[c_123,c_111]) ).

cnf(c_219,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | sP0_iProver_split ),
    inference(copy,[status(esa)],[c_208]) ).

cnf(c_223,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | sP0_iProver_split ),
    inference(copy,[status(esa)],[c_219]) ).

cnf(c_304,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | sP0_iProver_split ),
    inference(copy,[status(esa)],[c_223]) ).

cnf(c_332,plain,
    ( at(b,climb(b,X0))
    | ~ at(d,X0)
    | sP0_iProver_split ),
    inference(copy,[status(esa)],[c_304]) ).

cnf(c_10,plain,
    ( ~ at(b,X0)
    | at(a,drive(a,X0)) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_78) ).

cnf(c_58,plain,
    ( ~ at(b,X0)
    | at(a,drive(a,X0)) ),
    inference(copy,[status(esa)],[c_10]) ).

cnf(c_88,plain,
    ( ~ at(b,X0)
    | at(a,drive(a,X0)) ),
    inference(copy,[status(esa)],[c_58]) ).

cnf(c_101,plain,
    ( ~ at(b,X0)
    | at(a,drive(a,X0)) ),
    inference(copy,[status(esa)],[c_88]) ).

cnf(c_312,plain,
    ( ~ at(b,X0)
    | at(a,drive(a,X0)) ),
    inference(copy,[status(esa)],[c_101]) ).

cnf(c_348,plain,
    ( ~ at(b,X0)
    | at(a,drive(a,X0)) ),
    inference(copy,[status(esa)],[c_312]) ).

cnf(c_12,plain,
    ( at(b,drive(b,X0))
    | ~ at(a,X0) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_80) ).

cnf(c_15,negated_conjecture,
    ~ at(a,X0),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_82) ).

cnf(c_37,plain,
    ~ at(a,X0),
    inference(global_propositional_subsumption,[status(thm)],[c_12,c_15]) ).

cnf(c_62,plain,
    ~ at(a,X0),
    inference(copy,[status(esa)],[c_37]) ).

cnf(c_90,plain,
    ~ at(a,X0),
    inference(copy,[status(esa)],[c_62]) ).

cnf(c_99,plain,
    ~ at(a,X0),
    inference(copy,[status(esa)],[c_90]) ).

cnf(c_315,plain,
    ~ at(a,X0),
    inference(copy,[status(esa)],[c_99]) ).

cnf(c_354,plain,
    ~ at(a,X0),
    inference(copy,[status(esa)],[c_315]) ).

cnf(c_390,plain,
    ~ at(b,X0),
    inference(forward_subsumption_resolution,[status(thm)],[c_348,c_354]) ).

cnf(c_391,plain,
    ~ at(b,X0),
    inference(rewriting,[status(thm)],[c_390]) ).

cnf(c_396,plain,
    ( ~ at(d,X0)
    | sP0_iProver_split ),
    inference(forward_subsumption_resolution,[status(thm)],[c_332,c_391]) ).

cnf(c_397,plain,
    ( ~ at(d,X0)
    | sP0_iProver_split ),
    inference(rewriting,[status(thm)],[c_396]) ).

cnf(c_9,plain,
    ( at(d,go(d,X0))
    | ~ at(c,X0) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_77) ).

cnf(c_56,plain,
    ( at(d,go(d,X0))
    | ~ at(c,X0) ),
    inference(copy,[status(esa)],[c_9]) ).

cnf(c_87,plain,
    ( at(d,go(d,X0))
    | ~ at(c,X0) ),
    inference(copy,[status(esa)],[c_56]) ).

cnf(c_102,plain,
    ( at(d,go(d,X0))
    | ~ at(c,X0) ),
    inference(copy,[status(esa)],[c_87]) ).

cnf(c_310,plain,
    ( at(d,go(d,X0))
    | ~ at(c,X0) ),
    inference(copy,[status(esa)],[c_102]) ).

cnf(c_344,plain,
    ( at(d,go(d,X0))
    | ~ at(c,X0) ),
    inference(copy,[status(esa)],[c_310]) ).

cnf(c_400,plain,
    ( ~ at(c,X0)
    | sP0_iProver_split ),
    inference(resolution,[status(thm)],[c_397,c_344]) ).

cnf(c_403,plain,
    ( ~ at(c,X0)
    | sP0_iProver_split ),
    inference(rewriting,[status(thm)],[c_400]) ).

cnf(c_423,plain,
    ~ at(c,X0),
    inference(forward_subsumption_resolution,[status(thm)],[c_352,c_403,c_391]) ).

cnf(c_424,plain,
    ~ at(c,X0),
    inference(rewriting,[status(thm)],[c_423]) ).

cnf(c_8,plain,
    ( ~ at(d,X0)
    | at(c,go(c,X0)) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_76) ).

cnf(c_54,plain,
    ( ~ at(d,X0)
    | at(c,go(c,X0)) ),
    inference(copy,[status(esa)],[c_8]) ).

cnf(c_86,plain,
    ( ~ at(d,X0)
    | at(c,go(c,X0)) ),
    inference(copy,[status(esa)],[c_54]) ).

cnf(c_103,plain,
    ( ~ at(d,X0)
    | at(c,go(c,X0)) ),
    inference(copy,[status(esa)],[c_86]) ).

cnf(c_309,plain,
    ( ~ at(d,X0)
    | at(c,go(c,X0)) ),
    inference(copy,[status(esa)],[c_103]) ).

cnf(c_342,plain,
    ( ~ at(d,X0)
    | at(c,go(c,X0)) ),
    inference(copy,[status(esa)],[c_309]) ).

cnf(c_426,plain,
    ~ at(d,X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_424,c_342]) ).

cnf(c_429,plain,
    ~ at(d,X0),
    inference(rewriting,[status(thm)],[c_426]) ).

cnf(c_4,plain,
    ( at(d,go(d,X0))
    | ~ at(f,X0) ),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_72) ).

cnf(c_46,plain,
    ( at(d,go(d,X0))
    | ~ at(f,X0) ),
    inference(copy,[status(esa)],[c_4]) ).

cnf(c_82,plain,
    ( at(d,go(d,X0))
    | ~ at(f,X0) ),
    inference(copy,[status(esa)],[c_46]) ).

cnf(c_107,plain,
    ( at(d,go(d,X0))
    | ~ at(f,X0) ),
    inference(copy,[status(esa)],[c_82]) ).

cnf(c_305,plain,
    ( at(d,go(d,X0))
    | ~ at(f,X0) ),
    inference(copy,[status(esa)],[c_107]) ).

cnf(c_334,plain,
    ( at(d,go(d,X0))
    | ~ at(f,X0) ),
    inference(copy,[status(esa)],[c_305]) ).

cnf(c_434,plain,
    ~ at(f,X0),
    inference(backward_subsumption_resolution,[status(thm)],[c_429,c_334]) ).

cnf(c_435,plain,
    ~ at(f,X0),
    inference(rewriting,[status(thm)],[c_434]) ).

cnf(c_16,plain,
    at(f,s0),
    file('/export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p',c_0_83) ).

cnf(c_72,plain,
    at(f,s0),
    inference(copy,[status(esa)],[c_16]) ).

cnf(c_91,plain,
    at(f,s0),
    inference(copy,[status(esa)],[c_72]) ).

cnf(c_98,plain,
    at(f,s0),
    inference(copy,[status(esa)],[c_91]) ).

cnf(c_316,plain,
    at(f,s0),
    inference(copy,[status(esa)],[c_98]) ).

cnf(c_356,plain,
    at(f,s0),
    inference(copy,[status(esa)],[c_316]) ).

cnf(c_438,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_435,c_356]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : iprover_modulo %s %d
% 0.13/0.34  % Computer : n018.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 : Tue May 31 18:38:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Running in mono-core mode
% 0.13/0.40  % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.40  % Orientation found
% 0.13/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/sandbox2/tmp/iprover_proof_a3fa85.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_635a7c.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_44468f | 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.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/sandbox2/tmp/iprover_proof_a3fa85.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: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e  pe_s  pe:1:0s pe:2:0s pe_e  snvd_s sp: 0 0s snvd_e % 
% 0.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                                  false
% 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.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/sandbox2/tmp/iprover_proof_a3fa85.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:                 17
% 0.20/0.44  % num_of_input_neg_conjectures:         1
% 0.20/0.44  % num_of_splits:                        2
% 0.20/0.44  % num_of_split_atoms:                   2
% 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:                              0
% 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:                     20
% 0.20/0.44  % prep_upred:                           0
% 0.20/0.44  % prep_unflattend:                      0
% 0.20/0.44  % pred_elim_cands:                      4
% 0.20/0.44  % pred_elim:                            3
% 0.20/0.44  % pred_elim_cl:                         3
% 0.20/0.44  % pred_elim_cycles:                     6
% 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.004
% 0.20/0.44  % out_proof_time:                       0.002
% 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.03
% 0.20/0.44  % num_of_symbols:                       42
% 0.20/0.44  % num_of_terms:                         130
% 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:               117
% 0.20/0.44  % prop_num_of_clauses:                  56
% 0.20/0.44  % prop_preprocess_simplified:           268
% 0.20/0.44  % prop_fo_subsumed:                     2
% 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:                  14
% 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:              14
% 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:                   8
% 0.20/0.44  % res_num_in_passive:                   1
% 0.20/0.44  % res_num_in_active:                    6
% 0.20/0.44  % res_num_of_loops:                     16
% 0.20/0.44  % res_forward_subset_subsumed:          3
% 0.20/0.44  % res_backward_subset_subsumed:         8
% 0.20/0.44  % res_forward_subsumed:                 0
% 0.20/0.44  % res_backward_subsumed:                1
% 0.20/0.44  % res_forward_subsumption_resolution:   5
% 0.20/0.44  % res_backward_subsumption_resolution:  4
% 0.20/0.44  % res_clause_to_clause_subsumption:     9
% 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
%------------------------------------------------------------------------------