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

View Problem - Process Solution

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

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Thu Jul 21 07:22:30 EDT 2022

% Result   : Unsatisfiable 12.12s 12.33s
% Output   : CNFRefutation 12.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   36
% Syntax   : Number of formulae    :  266 (   1 unt;   0 def)
%            Number of atoms       :  756 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  870 ( 380   ~; 490   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :  700 ( 122 sgn 252   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0,negated_conjecture,
    ! [X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ s(X2,f1(X2,X1))
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_1) ).

fof(c_0_1,negated_conjecture,
    ! [X4,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | s(f1(X2,X1),X4)
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_4) ).

fof(c_0_2,negated_conjecture,
    ! [X3,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ s(X2,f1(X2,X1))
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_2) ).

fof(c_0_3,negated_conjecture,
    ! [X3,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ q(X3,X3)
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_7) ).

fof(c_0_4,negated_conjecture,
    ! [X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ s(X2,f1(X2,X1))
      | ~ s(X1,X1) ),
    file('<stdin>',c_3) ).

fof(c_0_5,negated_conjecture,
    ! [X1,X2] :
      ( ~ p(X2,X2)
      | ~ s(X2,f1(X2,X1))
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_10) ).

fof(c_0_6,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | s(f1(X2,X1),X4)
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_5) ).

fof(c_0_7,negated_conjecture,
    ! [X4,X1,X2] :
      ( s(X4,X2)
      | ~ s(X2,f1(X2,X1))
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_19) ).

fof(c_0_8,negated_conjecture,
    ! [X3,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ q(X3,X3)
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_8) ).

fof(c_0_9,negated_conjecture,
    ! [X4,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | s(f1(X2,X1),X4)
      | ~ s(X1,X1) ),
    file('<stdin>',c_6) ).

fof(c_0_10,negated_conjecture,
    ! [X4,X1,X2] :
      ( ~ p(X2,X2)
      | s(f1(X2,X1),X4)
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_13) ).

fof(c_0_11,negated_conjecture,
    ! [X3,X1,X2] :
      ( ~ p(X2,X2)
      | ~ s(X2,f1(X2,X1))
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_11) ).

fof(c_0_12,negated_conjecture,
    ! [X4,X1,X2] :
      ( s(X4,X2)
      | s(f1(X2,X1),X4)
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_22) ).

fof(c_0_13,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | ~ s(X2,f1(X2,X1))
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_20) ).

fof(c_0_14,negated_conjecture,
    ! [X3,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ q(X3,X3)
      | ~ s(X1,X1) ),
    file('<stdin>',c_9) ).

fof(c_0_15,negated_conjecture,
    ! [X3,X1,X2] :
      ( ~ p(X2,X2)
      | ~ q(X3,X3)
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_16) ).

fof(c_0_16,negated_conjecture,
    ! [X1,X2] :
      ( ~ p(X2,X2)
      | ~ s(X2,f1(X2,X1))
      | ~ s(X1,X1) ),
    file('<stdin>',c_12) ).

fof(c_0_17,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( ~ p(X2,X2)
      | s(f1(X2,X1),X4)
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_14) ).

fof(c_0_18,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | ~ q(X3,X3)
      | ~ q(X1,f1(X2,X1)) ),
    file('<stdin>',c_25) ).

fof(c_0_19,negated_conjecture,
    ! [X4,X1,X2] :
      ( s(X4,X2)
      | ~ s(X2,f1(X2,X1))
      | ~ s(X1,X1) ),
    file('<stdin>',c_21) ).

fof(c_0_20,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | s(f1(X2,X1),X4)
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_23) ).

fof(c_0_21,negated_conjecture,
    ! [X3,X1,X2] :
      ( ~ p(X2,X2)
      | ~ q(X3,X3)
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_17) ).

fof(c_0_22,negated_conjecture,
    ! [X4,X1,X2] :
      ( ~ p(X2,X2)
      | s(f1(X2,X1),X4)
      | ~ s(X1,X1) ),
    file('<stdin>',c_15) ).

fof(c_0_23,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | ~ q(X3,X3)
      | q(f1(X2,X1),X3) ),
    file('<stdin>',c_26) ).

fof(c_0_24,negated_conjecture,
    ! [X4,X1,X2] :
      ( s(X4,X2)
      | s(f1(X2,X1),X4)
      | ~ s(X1,X1) ),
    file('<stdin>',c_24) ).

fof(c_0_25,negated_conjecture,
    ! [X3,X1,X2] :
      ( ~ p(X2,X2)
      | ~ q(X3,X3)
      | ~ s(X1,X1) ),
    file('<stdin>',c_18) ).

fof(c_0_26,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | ~ q(X3,X3)
      | ~ s(X1,X1) ),
    file('<stdin>',c_27) ).

fof(c_0_27,negated_conjecture,
    ! [X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ s(X2,f1(X2,X1))
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_28,negated_conjecture,
    ! [X4,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | s(f1(X2,X1),X4)
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_29,negated_conjecture,
    ! [X3,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ s(X2,f1(X2,X1))
      | q(f1(X2,X1),X3) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_30,negated_conjecture,
    ! [X3,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ q(X3,X3)
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_31,negated_conjecture,
    ! [X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ s(X2,f1(X2,X1))
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_32,negated_conjecture,
    ! [X1,X2] :
      ( ~ p(X2,X2)
      | ~ s(X2,f1(X2,X1))
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_33,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | s(f1(X2,X1),X4)
      | q(f1(X2,X1),X3) ),
    c_0_6 ).

fof(c_0_34,negated_conjecture,
    ! [X4,X1,X2] :
      ( s(X4,X2)
      | ~ s(X2,f1(X2,X1))
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_35,negated_conjecture,
    ! [X3,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ q(X3,X3)
      | q(f1(X2,X1),X3) ),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_36,negated_conjecture,
    ! [X4,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | s(f1(X2,X1),X4)
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_37,negated_conjecture,
    ! [X4,X1,X2] :
      ( ~ p(X2,X2)
      | s(f1(X2,X1),X4)
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_10]) ).

fof(c_0_38,negated_conjecture,
    ! [X3,X1,X2] :
      ( ~ p(X2,X2)
      | ~ s(X2,f1(X2,X1))
      | q(f1(X2,X1),X3) ),
    inference(fof_simplification,[status(thm)],[c_0_11]) ).

fof(c_0_39,negated_conjecture,
    ! [X4,X1,X2] :
      ( s(X4,X2)
      | s(f1(X2,X1),X4)
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_12]) ).

fof(c_0_40,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | ~ s(X2,f1(X2,X1))
      | q(f1(X2,X1),X3) ),
    inference(fof_simplification,[status(thm)],[c_0_13]) ).

fof(c_0_41,negated_conjecture,
    ! [X3,X1,X2] :
      ( p(f1(X2,X1),f1(X2,X1))
      | ~ q(X3,X3)
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_14]) ).

fof(c_0_42,negated_conjecture,
    ! [X3,X1,X2] :
      ( ~ p(X2,X2)
      | ~ q(X3,X3)
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

fof(c_0_43,negated_conjecture,
    ! [X1,X2] :
      ( ~ p(X2,X2)
      | ~ s(X2,f1(X2,X1))
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_16]) ).

fof(c_0_44,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( ~ p(X2,X2)
      | s(f1(X2,X1),X4)
      | q(f1(X2,X1),X3) ),
    inference(fof_simplification,[status(thm)],[c_0_17]) ).

fof(c_0_45,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | ~ q(X3,X3)
      | ~ q(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[c_0_18]) ).

fof(c_0_46,negated_conjecture,
    ! [X4,X1,X2] :
      ( s(X4,X2)
      | ~ s(X2,f1(X2,X1))
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_19]) ).

fof(c_0_47,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | s(f1(X2,X1),X4)
      | q(f1(X2,X1),X3) ),
    c_0_20 ).

fof(c_0_48,negated_conjecture,
    ! [X3,X1,X2] :
      ( ~ p(X2,X2)
      | ~ q(X3,X3)
      | q(f1(X2,X1),X3) ),
    inference(fof_simplification,[status(thm)],[c_0_21]) ).

fof(c_0_49,negated_conjecture,
    ! [X4,X1,X2] :
      ( ~ p(X2,X2)
      | s(f1(X2,X1),X4)
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_22]) ).

fof(c_0_50,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | ~ q(X3,X3)
      | q(f1(X2,X1),X3) ),
    inference(fof_simplification,[status(thm)],[c_0_23]) ).

fof(c_0_51,negated_conjecture,
    ! [X4,X1,X2] :
      ( s(X4,X2)
      | s(f1(X2,X1),X4)
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_24]) ).

fof(c_0_52,negated_conjecture,
    ! [X3,X1,X2] :
      ( ~ p(X2,X2)
      | ~ q(X3,X3)
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_25]) ).

fof(c_0_53,negated_conjecture,
    ! [X3,X4,X1,X2] :
      ( s(X4,X2)
      | ~ q(X3,X3)
      | ~ s(X1,X1) ),
    inference(fof_simplification,[status(thm)],[c_0_26]) ).

fof(c_0_54,negated_conjecture,
    ! [X3,X4] :
      ( p(f1(X4,X3),f1(X4,X3))
      | ~ s(X4,f1(X4,X3))
      | ~ q(X3,f1(X4,X3)) ),
    inference(variable_rename,[status(thm)],[c_0_27]) ).

fof(c_0_55,negated_conjecture,
    ! [X5,X6,X7] :
      ( p(f1(X7,X6),f1(X7,X6))
      | s(f1(X7,X6),X5)
      | ~ q(X6,f1(X7,X6)) ),
    inference(variable_rename,[status(thm)],[c_0_28]) ).

fof(c_0_56,negated_conjecture,
    ! [X4,X5,X6] :
      ( p(f1(X6,X5),f1(X6,X5))
      | ~ s(X6,f1(X6,X5))
      | q(f1(X6,X5),X4) ),
    inference(variable_rename,[status(thm)],[c_0_29]) ).

fof(c_0_57,negated_conjecture,
    ! [X4,X5,X6] :
      ( p(f1(X6,X5),f1(X6,X5))
      | ~ q(X4,X4)
      | ~ q(X5,f1(X6,X5)) ),
    inference(variable_rename,[status(thm)],[c_0_30]) ).

fof(c_0_58,negated_conjecture,
    ! [X3,X4] :
      ( p(f1(X4,X3),f1(X4,X3))
      | ~ s(X4,f1(X4,X3))
      | ~ s(X3,X3) ),
    inference(variable_rename,[status(thm)],[c_0_31]) ).

fof(c_0_59,negated_conjecture,
    ! [X3,X4] :
      ( ~ p(X4,X4)
      | ~ s(X4,f1(X4,X3))
      | ~ q(X3,f1(X4,X3)) ),
    inference(variable_rename,[status(thm)],[c_0_32]) ).

fof(c_0_60,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( p(f1(X8,X7),f1(X8,X7))
      | s(f1(X8,X7),X6)
      | q(f1(X8,X7),X5) ),
    inference(variable_rename,[status(thm)],[c_0_33]) ).

fof(c_0_61,negated_conjecture,
    ! [X5,X6,X7] :
      ( s(X5,X7)
      | ~ s(X7,f1(X7,X6))
      | ~ q(X6,f1(X7,X6)) ),
    inference(variable_rename,[status(thm)],[c_0_34]) ).

fof(c_0_62,negated_conjecture,
    ! [X4,X5,X6] :
      ( p(f1(X6,X5),f1(X6,X5))
      | ~ q(X4,X4)
      | q(f1(X6,X5),X4) ),
    inference(variable_rename,[status(thm)],[c_0_35]) ).

fof(c_0_63,negated_conjecture,
    ! [X5,X6,X7] :
      ( p(f1(X7,X6),f1(X7,X6))
      | s(f1(X7,X6),X5)
      | ~ s(X6,X6) ),
    inference(variable_rename,[status(thm)],[c_0_36]) ).

fof(c_0_64,negated_conjecture,
    ! [X5,X6,X7] :
      ( ~ p(X7,X7)
      | s(f1(X7,X6),X5)
      | ~ q(X6,f1(X7,X6)) ),
    inference(variable_rename,[status(thm)],[c_0_37]) ).

fof(c_0_65,negated_conjecture,
    ! [X4,X5,X6] :
      ( ~ p(X6,X6)
      | ~ s(X6,f1(X6,X5))
      | q(f1(X6,X5),X4) ),
    inference(variable_rename,[status(thm)],[c_0_38]) ).

fof(c_0_66,negated_conjecture,
    ! [X5,X6,X7] :
      ( s(X5,X7)
      | s(f1(X7,X6),X5)
      | ~ q(X6,f1(X7,X6)) ),
    inference(variable_rename,[status(thm)],[c_0_39]) ).

fof(c_0_67,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( s(X6,X8)
      | ~ s(X8,f1(X8,X7))
      | q(f1(X8,X7),X5) ),
    inference(variable_rename,[status(thm)],[c_0_40]) ).

fof(c_0_68,negated_conjecture,
    ! [X4,X5,X6] :
      ( p(f1(X6,X5),f1(X6,X5))
      | ~ q(X4,X4)
      | ~ s(X5,X5) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_41])])]) ).

fof(c_0_69,negated_conjecture,
    ! [X4,X5,X6] :
      ( ~ p(X6,X6)
      | ~ q(X4,X4)
      | ~ q(X5,f1(X6,X5)) ),
    inference(variable_rename,[status(thm)],[c_0_42]) ).

fof(c_0_70,negated_conjecture,
    ! [X3,X4] :
      ( ~ p(X4,X4)
      | ~ s(X4,f1(X4,X3))
      | ~ s(X3,X3) ),
    inference(variable_rename,[status(thm)],[c_0_43]) ).

fof(c_0_71,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( ~ p(X8,X8)
      | s(f1(X8,X7),X6)
      | q(f1(X8,X7),X5) ),
    inference(variable_rename,[status(thm)],[c_0_44]) ).

fof(c_0_72,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( s(X6,X8)
      | ~ q(X5,X5)
      | ~ q(X7,f1(X8,X7)) ),
    inference(variable_rename,[status(thm)],[c_0_45]) ).

fof(c_0_73,negated_conjecture,
    ! [X5,X6,X7] :
      ( s(X5,X7)
      | ~ s(X7,f1(X7,X6))
      | ~ s(X6,X6) ),
    inference(variable_rename,[status(thm)],[c_0_46]) ).

fof(c_0_74,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( s(X6,X8)
      | s(f1(X8,X7),X6)
      | q(f1(X8,X7),X5) ),
    inference(variable_rename,[status(thm)],[c_0_47]) ).

fof(c_0_75,negated_conjecture,
    ! [X4,X5,X6] :
      ( ~ p(X6,X6)
      | ~ q(X4,X4)
      | q(f1(X6,X5),X4) ),
    inference(variable_rename,[status(thm)],[c_0_48]) ).

fof(c_0_76,negated_conjecture,
    ! [X5,X6,X7] :
      ( ~ p(X7,X7)
      | s(f1(X7,X6),X5)
      | ~ s(X6,X6) ),
    inference(variable_rename,[status(thm)],[c_0_49]) ).

fof(c_0_77,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( s(X6,X8)
      | ~ q(X5,X5)
      | q(f1(X8,X7),X5) ),
    inference(variable_rename,[status(thm)],[c_0_50]) ).

fof(c_0_78,negated_conjecture,
    ! [X5,X6,X7] :
      ( s(X5,X7)
      | s(f1(X7,X6),X5)
      | ~ s(X6,X6) ),
    inference(variable_rename,[status(thm)],[c_0_51]) ).

fof(c_0_79,negated_conjecture,
    ! [X4,X5,X6] :
      ( ~ p(X4,X4)
      | ~ q(X5,X5)
      | ~ s(X6,X6) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_52])])]) ).

fof(c_0_80,negated_conjecture,
    ! [X5,X6,X7,X8] :
      ( s(X5,X6)
      | ~ q(X7,X7)
      | ~ s(X8,X8) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_53])])]) ).

cnf(c_0_81,negated_conjecture,
    ( p(f1(X2,X1),f1(X2,X1))
    | ~ q(X1,f1(X2,X1))
    | ~ s(X2,f1(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_54]) ).

cnf(c_0_82,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | p(f1(X2,X1),f1(X2,X1))
    | ~ q(X1,f1(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_55]) ).

cnf(c_0_83,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | p(f1(X1,X2),f1(X1,X2))
    | ~ s(X1,f1(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_56]) ).

cnf(c_0_84,negated_conjecture,
    ( p(f1(X2,X1),f1(X2,X1))
    | ~ q(X1,f1(X2,X1))
    | ~ q(X3,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_57]) ).

cnf(c_0_85,negated_conjecture,
    ( p(f1(X2,X1),f1(X2,X1))
    | ~ s(X1,X1)
    | ~ s(X2,f1(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_58]) ).

cnf(c_0_86,negated_conjecture,
    ( ~ q(X1,f1(X2,X1))
    | ~ s(X2,f1(X2,X1))
    | ~ p(X2,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_59]) ).

cnf(c_0_87,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(f1(X1,X2),X4)
    | p(f1(X1,X2),f1(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_60]) ).

cnf(c_0_88,negated_conjecture,
    ( s(X3,X2)
    | ~ q(X1,f1(X2,X1))
    | ~ s(X2,f1(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_61]) ).

cnf(c_0_89,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | p(f1(X1,X2),f1(X1,X2))
    | ~ q(X3,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_90,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | p(f1(X2,X1),f1(X2,X1))
    | ~ s(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_63]) ).

cnf(c_0_91,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | ~ q(X1,f1(X2,X1))
    | ~ p(X2,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_64]) ).

cnf(c_0_92,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | ~ s(X1,f1(X1,X2))
    | ~ p(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_65]) ).

cnf(c_0_93,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | s(X3,X2)
    | ~ q(X1,f1(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_66]) ).

cnf(c_0_94,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(X4,X1)
    | ~ s(X1,f1(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_67]) ).

cnf(c_0_95,negated_conjecture,
    ( p(f1(X3,X1),f1(X3,X1))
    | ~ s(X1,X1)
    | ~ q(X2,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_68]) ).

cnf(c_0_96,negated_conjecture,
    ( ~ q(X1,f1(X2,X1))
    | ~ q(X3,X3)
    | ~ p(X2,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_69]) ).

cnf(c_0_97,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ s(X2,f1(X2,X1))
    | ~ p(X2,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_70]) ).

cnf(c_0_98,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(f1(X1,X2),X4)
    | ~ p(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_71]) ).

cnf(c_0_99,negated_conjecture,
    ( s(X4,X2)
    | ~ q(X1,f1(X2,X1))
    | ~ q(X3,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_72]) ).

cnf(c_0_100,negated_conjecture,
    ( s(X3,X2)
    | ~ s(X1,X1)
    | ~ s(X2,f1(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_73]) ).

cnf(c_0_101,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(f1(X1,X2),X4)
    | s(X4,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_74]) ).

cnf(c_0_102,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | ~ q(X3,X3)
    | ~ p(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_75]) ).

cnf(c_0_103,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | ~ s(X1,X1)
    | ~ p(X2,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_76]) ).

cnf(c_0_104,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(X4,X1)
    | ~ q(X3,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_77]) ).

cnf(c_0_105,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | s(X3,X2)
    | ~ s(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_78]) ).

cnf(c_0_106,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ q(X2,X2)
    | ~ p(X3,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_79]) ).

cnf(c_0_107,negated_conjecture,
    ( s(X3,X4)
    | ~ s(X1,X1)
    | ~ q(X2,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_80]) ).

cnf(c_0_108,negated_conjecture,
    ( p(f1(X2,X1),f1(X2,X1))
    | ~ q(X1,f1(X2,X1))
    | ~ s(X2,f1(X2,X1)) ),
    c_0_81,
    [final] ).

cnf(c_0_109,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | p(f1(X2,X1),f1(X2,X1))
    | ~ q(X1,f1(X2,X1)) ),
    c_0_82,
    [final] ).

cnf(c_0_110,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | p(f1(X1,X2),f1(X1,X2))
    | ~ s(X1,f1(X1,X2)) ),
    c_0_83,
    [final] ).

cnf(c_0_111,negated_conjecture,
    ( p(f1(X2,X1),f1(X2,X1))
    | ~ q(X1,f1(X2,X1))
    | ~ q(X3,X3) ),
    c_0_84,
    [final] ).

cnf(c_0_112,negated_conjecture,
    ( p(f1(X2,X1),f1(X2,X1))
    | ~ s(X1,X1)
    | ~ s(X2,f1(X2,X1)) ),
    c_0_85,
    [final] ).

cnf(c_0_113,negated_conjecture,
    ( ~ q(X1,f1(X2,X1))
    | ~ s(X2,f1(X2,X1))
    | ~ p(X2,X2) ),
    c_0_86,
    [final] ).

cnf(c_0_114,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(f1(X1,X2),X4)
    | p(f1(X1,X2),f1(X1,X2)) ),
    c_0_87,
    [final] ).

cnf(c_0_115,negated_conjecture,
    ( s(X3,X2)
    | ~ q(X1,f1(X2,X1))
    | ~ s(X2,f1(X2,X1)) ),
    c_0_88,
    [final] ).

cnf(c_0_116,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | p(f1(X1,X2),f1(X1,X2))
    | ~ q(X3,X3) ),
    c_0_89,
    [final] ).

cnf(c_0_117,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | p(f1(X2,X1),f1(X2,X1))
    | ~ s(X1,X1) ),
    c_0_90,
    [final] ).

cnf(c_0_118,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | ~ q(X1,f1(X2,X1))
    | ~ p(X2,X2) ),
    c_0_91,
    [final] ).

cnf(c_0_119,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | ~ s(X1,f1(X1,X2))
    | ~ p(X1,X1) ),
    c_0_92,
    [final] ).

cnf(c_0_120,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | s(X3,X2)
    | ~ q(X1,f1(X2,X1)) ),
    c_0_93,
    [final] ).

cnf(c_0_121,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(X4,X1)
    | ~ s(X1,f1(X1,X2)) ),
    c_0_94,
    [final] ).

cnf(c_0_122,negated_conjecture,
    ( p(f1(X3,X1),f1(X3,X1))
    | ~ s(X1,X1)
    | ~ q(X2,X2) ),
    c_0_95,
    [final] ).

cnf(c_0_123,negated_conjecture,
    ( ~ q(X1,f1(X2,X1))
    | ~ q(X3,X3)
    | ~ p(X2,X2) ),
    c_0_96,
    [final] ).

cnf(c_0_124,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ s(X2,f1(X2,X1))
    | ~ p(X2,X2) ),
    c_0_97,
    [final] ).

cnf(c_0_125,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(f1(X1,X2),X4)
    | ~ p(X1,X1) ),
    c_0_98,
    [final] ).

cnf(c_0_126,negated_conjecture,
    ( s(X4,X2)
    | ~ q(X1,f1(X2,X1))
    | ~ q(X3,X3) ),
    c_0_99,
    [final] ).

cnf(c_0_127,negated_conjecture,
    ( s(X3,X2)
    | ~ s(X1,X1)
    | ~ s(X2,f1(X2,X1)) ),
    c_0_100,
    [final] ).

cnf(c_0_128,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(f1(X1,X2),X4)
    | s(X4,X1) ),
    c_0_101,
    [final] ).

cnf(c_0_129,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | ~ q(X3,X3)
    | ~ p(X1,X1) ),
    c_0_102,
    [final] ).

cnf(c_0_130,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | ~ s(X1,X1)
    | ~ p(X2,X2) ),
    c_0_103,
    [final] ).

cnf(c_0_131,negated_conjecture,
    ( q(f1(X1,X2),X3)
    | s(X4,X1)
    | ~ q(X3,X3) ),
    c_0_104,
    [final] ).

cnf(c_0_132,negated_conjecture,
    ( s(f1(X2,X1),X3)
    | s(X3,X2)
    | ~ s(X1,X1) ),
    c_0_105,
    [final] ).

cnf(c_0_133,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ q(X2,X2)
    | ~ p(X3,X3) ),
    c_0_106,
    [final] ).

cnf(c_0_134,negated_conjecture,
    ( s(X3,X4)
    | ~ s(X1,X1)
    | ~ q(X2,X2) ),
    c_0_107,
    [final] ).

% End CNF derivation

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

cnf(c_26,negated_conjecture,
    ( ~ q(X0,X0)
    | ~ s(X1,X1)
    | s(X2,X3) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_134) ).

cnf(c_53,negated_conjecture,
    ( ~ q(X0,X0)
    | ~ sP2_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_26]) ).

cnf(c_88,negated_conjecture,
    ( ~ q(X0,X0)
    | ~ sP2_iProver_split ),
    inference(copy,[status(esa)],[c_53]) ).

cnf(c_105,negated_conjecture,
    ( ~ q(X0,X0)
    | ~ sP2_iProver_split ),
    inference(copy,[status(esa)],[c_88]) ).

cnf(c_286,negated_conjecture,
    ( ~ q(X0,X0)
    | ~ sP2_iProver_split ),
    inference(copy,[status(esa)],[c_105]) ).

cnf(c_309,negated_conjecture,
    ( ~ q(X0,X0)
    | ~ sP2_iProver_split ),
    inference(copy,[status(esa)],[c_286]) ).

cnf(c_557,negated_conjecture,
    ( ~ q(X0,X0)
    | ~ sP2_iProver_split ),
    inference(copy,[status(esa)],[c_309]) ).

cnf(c_586,negated_conjecture,
    ( ~ q(X0,X0)
    | ~ sP2_iProver_split ),
    inference(copy,[status(esa)],[c_557]) ).

cnf(c_44927,plain,
    ( ~ q(f1(f1(X0,X1),X2),f1(f1(X0,X1),X2))
    | ~ sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_586]) ).

cnf(c_300582,plain,
    ( ~ q(f1(f1(f1(X0,X1),X2),X3),f1(f1(f1(X0,X1),X2),X3))
    | ~ sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_44927]) ).

cnf(c_300583,plain,
    ( ~ q(f1(f1(f1(iProver_bot,iProver_bot),iProver_bot),iProver_bot),f1(f1(f1(iProver_bot,iProver_bot),iProver_bot),iProver_bot))
    | ~ sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_300582]) ).

cnf(c_13,negated_conjecture,
    ( q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1))
    | s(X3,X0) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_121) ).

cnf(c_129,negated_conjecture,
    ( q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1))
    | s(X3,X0) ),
    inference(copy,[status(esa)],[c_13]) ).

cnf(c_275,negated_conjecture,
    ( q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1))
    | s(X3,X0) ),
    inference(copy,[status(esa)],[c_129]) ).

cnf(c_320,negated_conjecture,
    ( q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1))
    | s(X3,X0) ),
    inference(copy,[status(esa)],[c_275]) ).

cnf(c_542,negated_conjecture,
    ( q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1))
    | s(X3,X0) ),
    inference(copy,[status(esa)],[c_320]) ).

cnf(c_571,negated_conjecture,
    ( q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1))
    | s(X3,X0) ),
    inference(copy,[status(esa)],[c_542]) ).

cnf(c_44790,plain,
    ( q(f1(f1(X0,X1),X2),X3)
    | ~ s(f1(X0,X1),f1(f1(X0,X1),X2))
    | s(X4,f1(X0,X1)) ),
    inference(instantiation,[status(thm)],[c_571]) ).

cnf(c_44926,plain,
    ( q(f1(f1(X0,X1),X2),f1(f1(X0,X1),X2))
    | ~ s(f1(X0,X1),f1(f1(X0,X1),X2))
    | s(X3,f1(X0,X1)) ),
    inference(instantiation,[status(thm)],[c_44790]) ).

cnf(c_45460,plain,
    ( q(f1(f1(f1(X0,X1),X2),X3),f1(f1(f1(X0,X1),X2),X3))
    | ~ s(f1(f1(X0,X1),X2),f1(f1(f1(X0,X1),X2),X3))
    | s(X4,f1(f1(X0,X1),X2)) ),
    inference(instantiation,[status(thm)],[c_44926]) ).

cnf(c_300116,plain,
    ( q(f1(f1(f1(X0,X1),X2),X3),f1(f1(f1(X0,X1),X2),X3))
    | ~ s(f1(f1(X0,X1),X2),f1(f1(f1(X0,X1),X2),X3))
    | s(f1(X0,X1),f1(f1(X0,X1),X2)) ),
    inference(instantiation,[status(thm)],[c_45460]) ).

cnf(c_300117,plain,
    ( q(f1(f1(f1(iProver_bot,iProver_bot),iProver_bot),iProver_bot),f1(f1(f1(iProver_bot,iProver_bot),iProver_bot),iProver_bot))
    | s(f1(iProver_bot,iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot))
    | ~ s(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(f1(f1(iProver_bot,iProver_bot),iProver_bot),iProver_bot)) ),
    inference(instantiation,[status(thm)],[c_300116]) ).

cnf(c_2,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_110) ).

cnf(c_103,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_2]) ).

cnf(c_265,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_103]) ).

cnf(c_330,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_265]) ).

cnf(c_531,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_330]) ).

cnf(c_560,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_531]) ).

cnf(c_46002,plain,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),f1(X0,X1))
    | ~ s(X0,f1(X0,X1)) ),
    inference(instantiation,[status(thm)],[c_560]) ).

cnf(c_46003,plain,
    ( p(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | q(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | ~ s(iProver_bot,f1(iProver_bot,iProver_bot)) ),
    inference(instantiation,[status(thm)],[c_46002]) ).

cnf(c_25,negated_conjecture,
    ( ~ p(X0,X0)
    | ~ q(X1,X1)
    | ~ s(X2,X2) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_133) ).

cnf(c_78,negated_conjecture,
    ( sP0_iProver_split
    | sP2_iProver_split
    | sP3_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP3_iProver_split,sP0_iProver_split,sP2_iProver_split])],[c_25]) ).

cnf(c_171,negated_conjecture,
    ( sP0_iProver_split
    | sP2_iProver_split
    | sP3_iProver_split ),
    inference(copy,[status(esa)],[c_78]) ).

cnf(c_289,negated_conjecture,
    ( sP0_iProver_split
    | sP2_iProver_split
    | sP3_iProver_split ),
    inference(copy,[status(esa)],[c_171]) ).

cnf(c_306,negated_conjecture,
    ( sP0_iProver_split
    | sP2_iProver_split
    | sP3_iProver_split ),
    inference(copy,[status(esa)],[c_289]) ).

cnf(c_57,negated_conjecture,
    ( ~ p(X0,X0)
    | ~ sP3_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP3_iProver_split])],[c_25]) ).

cnf(c_77,negated_conjecture,
    ( ~ p(X0,X0)
    | ~ sP3_iProver_split ),
    inference(copy,[status(esa)],[c_57]) ).

cnf(c_169,negated_conjecture,
    ( ~ p(X0,X0)
    | ~ sP3_iProver_split ),
    inference(copy,[status(esa)],[c_77]) ).

cnf(c_288,negated_conjecture,
    ( ~ p(X0,X0)
    | ~ sP3_iProver_split ),
    inference(copy,[status(esa)],[c_169]) ).

cnf(c_307,negated_conjecture,
    ( ~ p(X0,X0)
    | ~ sP3_iProver_split ),
    inference(copy,[status(esa)],[c_288]) ).

cnf(c_397,plain,
    ( ~ p(X0,X0)
    | sP0_iProver_split
    | sP2_iProver_split ),
    inference(resolution,[status(thm)],[c_306,c_307]) ).

cnf(c_408,plain,
    ( ~ p(X0,X0)
    | sP0_iProver_split
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_397]) ).

cnf(c_412,plain,
    ( ~ p(X0,X0)
    | sP0_iProver_split
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_408]) ).

cnf(c_51,negated_conjecture,
    ( ~ s(X0,X0)
    | ~ sP0_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_26]) ).

cnf(c_76,negated_conjecture,
    ( ~ s(X0,X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_51]) ).

cnf(c_167,negated_conjecture,
    ( ~ s(X0,X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_76]) ).

cnf(c_284,negated_conjecture,
    ( ~ s(X0,X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_167]) ).

cnf(c_311,negated_conjecture,
    ( ~ s(X0,X0)
    | ~ sP0_iProver_split ),
    inference(copy,[status(esa)],[c_284]) ).

cnf(c_440,plain,
    ( ~ p(X0,X0)
    | ~ s(X1,X1)
    | sP2_iProver_split ),
    inference(resolution,[status(thm)],[c_412,c_311]) ).

cnf(c_451,plain,
    ( ~ p(X0,X0)
    | ~ s(X1,X1)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_440]) ).

cnf(c_14,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ q(X2,X2)
    | ~ s(X1,X1) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_122) ).

cnf(c_87,negated_conjecture,
    ( sP2_iProver_split
    | sP6_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP6_iProver_split,sP2_iProver_split])],[c_14]) ).

cnf(c_135,negated_conjecture,
    ( sP2_iProver_split
    | sP6_iProver_split ),
    inference(copy,[status(esa)],[c_87]) ).

cnf(c_295,negated_conjecture,
    ( sP2_iProver_split
    | sP6_iProver_split ),
    inference(copy,[status(esa)],[c_135]) ).

cnf(c_300,negated_conjecture,
    ( sP2_iProver_split
    | sP6_iProver_split ),
    inference(copy,[status(esa)],[c_295]) ).

cnf(c_66,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ s(X1,X1)
    | ~ sP6_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP6_iProver_split])],[c_14]) ).

cnf(c_86,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ s(X1,X1)
    | ~ sP6_iProver_split ),
    inference(copy,[status(esa)],[c_66]) ).

cnf(c_133,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ s(X1,X1)
    | ~ sP6_iProver_split ),
    inference(copy,[status(esa)],[c_86]) ).

cnf(c_294,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ s(X1,X1)
    | ~ sP6_iProver_split ),
    inference(copy,[status(esa)],[c_133]) ).

cnf(c_301,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ s(X1,X1)
    | ~ sP6_iProver_split ),
    inference(copy,[status(esa)],[c_294]) ).

cnf(c_349,plain,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ s(X1,X1)
    | sP2_iProver_split ),
    inference(resolution,[status(thm)],[c_300,c_301]) ).

cnf(c_360,plain,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ s(X1,X1)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_349]) ).

cnf(c_364,plain,
    ( p(f1(X0,X1),f1(X0,X1))
    | ~ s(X1,X1)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_360]) ).

cnf(c_456,plain,
    ( ~ s(X0,X0)
    | sP2_iProver_split ),
    inference(backward_subsumption_resolution,[status(thm)],[c_451,c_364]) ).

cnf(c_458,plain,
    ( ~ s(X0,X0)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_456]) ).

cnf(c_555,plain,
    ( ~ s(X0,X0)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_458]) ).

cnf(c_584,plain,
    ( ~ s(X0,X0)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_555]) ).

cnf(c_45128,plain,
    ( ~ s(f1(X0,X1),f1(X0,X1))
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_584]) ).

cnf(c_45516,plain,
    ( ~ s(f1(f1(X0,X1),X2),f1(f1(X0,X1),X2))
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_45128]) ).

cnf(c_45519,plain,
    ( ~ s(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot))
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_45516]) ).

cnf(c_18,negated_conjecture,
    ( ~ q(X0,f1(X1,X0))
    | ~ q(X2,X2)
    | s(X3,X1) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_126) ).

cnf(c_81,negated_conjecture,
    ( sP2_iProver_split
    | sP4_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP4_iProver_split,sP2_iProver_split])],[c_18]) ).

cnf(c_151,negated_conjecture,
    ( sP2_iProver_split
    | sP4_iProver_split ),
    inference(copy,[status(esa)],[c_81]) ).

cnf(c_291,negated_conjecture,
    ( sP2_iProver_split
    | sP4_iProver_split ),
    inference(copy,[status(esa)],[c_151]) ).

cnf(c_304,negated_conjecture,
    ( sP2_iProver_split
    | sP4_iProver_split ),
    inference(copy,[status(esa)],[c_291]) ).

cnf(c_60,negated_conjecture,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | ~ sP4_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP4_iProver_split])],[c_18]) ).

cnf(c_80,negated_conjecture,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | ~ sP4_iProver_split ),
    inference(copy,[status(esa)],[c_60]) ).

cnf(c_149,negated_conjecture,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | ~ sP4_iProver_split ),
    inference(copy,[status(esa)],[c_80]) ).

cnf(c_290,negated_conjecture,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | ~ sP4_iProver_split ),
    inference(copy,[status(esa)],[c_149]) ).

cnf(c_305,negated_conjecture,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | ~ sP4_iProver_split ),
    inference(copy,[status(esa)],[c_290]) ).

cnf(c_381,plain,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | sP2_iProver_split ),
    inference(resolution,[status(thm)],[c_304,c_305]) ).

cnf(c_392,plain,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_381]) ).

cnf(c_396,plain,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_392]) ).

cnf(c_551,plain,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_396]) ).

cnf(c_580,plain,
    ( ~ q(X0,f1(X1,X0))
    | s(X2,X1)
    | sP2_iProver_split ),
    inference(copy,[status(esa)],[c_551]) ).

cnf(c_45134,plain,
    ( ~ q(f1(X0,X1),f1(X2,f1(X0,X1)))
    | s(X3,X2)
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_580]) ).

cnf(c_45362,plain,
    ( ~ q(f1(f1(X0,X1),X2),f1(X3,f1(f1(X0,X1),X2)))
    | s(X4,X3)
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_45134]) ).

cnf(c_45363,plain,
    ( ~ q(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(iProver_bot,f1(f1(iProver_bot,iProver_bot),iProver_bot)))
    | s(iProver_bot,iProver_bot)
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_45362]) ).

cnf(c_45135,plain,
    ( ~ q(f1(iProver_bot,iProver_bot),f1(iProver_bot,f1(iProver_bot,iProver_bot)))
    | s(iProver_bot,iProver_bot)
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_45134]) ).

cnf(c_45129,plain,
    ( ~ s(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_45128]) ).

cnf(c_17,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_125) ).

cnf(c_145,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_17]) ).

cnf(c_277,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_145]) ).

cnf(c_318,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_277]) ).

cnf(c_544,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_318]) ).

cnf(c_573,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_544]) ).

cnf(c_44869,plain,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),f1(f1(X0,X1),X3)) ),
    inference(instantiation,[status(thm)],[c_573]) ).

cnf(c_44901,plain,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),f1(X0,X1))
    | s(f1(X0,X1),f1(f1(X0,X1),X2)) ),
    inference(instantiation,[status(thm)],[c_44869]) ).

cnf(c_45084,plain,
    ( ~ p(f1(X0,X1),f1(X0,X1))
    | q(f1(f1(X0,X1),X2),f1(f1(X0,X1),X2))
    | s(f1(f1(X0,X1),X2),f1(f1(f1(X0,X1),X2),X3)) ),
    inference(instantiation,[status(thm)],[c_44901]) ).

cnf(c_45085,plain,
    ( ~ p(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | q(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot))
    | s(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(f1(f1(iProver_bot,iProver_bot),iProver_bot),iProver_bot)) ),
    inference(instantiation,[status(thm)],[c_45084]) ).

cnf(c_45082,plain,
    ( ~ q(f1(X0,X1),f1(X0,X1))
    | ~ sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_586]) ).

cnf(c_45083,plain,
    ( ~ q(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | ~ sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_45082]) ).

cnf(c_11,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_119) ).

cnf(c_125,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_11]) ).

cnf(c_273,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_125]) ).

cnf(c_322,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_273]) ).

cnf(c_540,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_322]) ).

cnf(c_569,negated_conjecture,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | ~ s(X0,f1(X0,X1)) ),
    inference(copy,[status(esa)],[c_540]) ).

cnf(c_44943,plain,
    ( ~ p(f1(X0,X1),f1(X0,X1))
    | q(f1(f1(X0,X1),X2),X3)
    | ~ s(f1(X0,X1),f1(f1(X0,X1),X2)) ),
    inference(instantiation,[status(thm)],[c_569]) ).

cnf(c_45029,plain,
    ( ~ p(f1(X0,X1),f1(X0,X1))
    | q(f1(f1(X0,X1),X2),f1(f1(X0,X1),X2))
    | ~ s(f1(X0,X1),f1(f1(X0,X1),X2)) ),
    inference(instantiation,[status(thm)],[c_44943]) ).

cnf(c_45030,plain,
    ( ~ p(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | q(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot))
    | ~ s(f1(iProver_bot,iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot)) ),
    inference(instantiation,[status(thm)],[c_45029]) ).

cnf(c_44839,plain,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),f1(X0,X1)) ),
    inference(instantiation,[status(thm)],[c_573]) ).

cnf(c_44889,plain,
    ( ~ p(X0,X0)
    | q(f1(X0,X1),f1(X2,f1(X0,X1)))
    | s(f1(X0,X1),f1(X0,X1)) ),
    inference(instantiation,[status(thm)],[c_44839]) ).

cnf(c_44937,plain,
    ( ~ p(f1(X0,X1),f1(X0,X1))
    | q(f1(f1(X0,X1),X2),f1(X3,f1(f1(X0,X1),X2)))
    | s(f1(f1(X0,X1),X2),f1(f1(X0,X1),X2)) ),
    inference(instantiation,[status(thm)],[c_44889]) ).

cnf(c_44956,plain,
    ( ~ p(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | q(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(iProver_bot,f1(f1(iProver_bot,iProver_bot),iProver_bot)))
    | s(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot)) ),
    inference(instantiation,[status(thm)],[c_44937]) ).

cnf(c_6,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    file('/export/starexec/sandbox/tmp/iprover_modulo_9725e0.p',c_0_114) ).

cnf(c_115,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_6]) ).

cnf(c_268,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_115]) ).

cnf(c_327,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_268]) ).

cnf(c_534,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_327]) ).

cnf(c_563,negated_conjecture,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),X2)
    | s(f1(X0,X1),X3) ),
    inference(copy,[status(esa)],[c_534]) ).

cnf(c_44823,plain,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),f1(X2,f1(X0,X1)))
    | s(f1(X0,X1),X3) ),
    inference(instantiation,[status(thm)],[c_563]) ).

cnf(c_44933,plain,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),f1(X2,f1(X0,X1)))
    | s(f1(X0,X1),f1(X0,X1)) ),
    inference(instantiation,[status(thm)],[c_44823]) ).

cnf(c_44934,plain,
    ( p(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | q(f1(iProver_bot,iProver_bot),f1(iProver_bot,f1(iProver_bot,iProver_bot)))
    | s(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot)) ),
    inference(instantiation,[status(thm)],[c_44933]) ).

cnf(c_44929,plain,
    ( ~ q(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot))
    | ~ sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_44927]) ).

cnf(c_44928,plain,
    ( q(f1(f1(iProver_bot,iProver_bot),iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot))
    | s(iProver_bot,f1(iProver_bot,iProver_bot))
    | ~ s(f1(iProver_bot,iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot)) ),
    inference(instantiation,[status(thm)],[c_44926]) ).

cnf(c_44827,plain,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),f1(X0,X1))
    | s(f1(X0,X1),X2) ),
    inference(instantiation,[status(thm)],[c_563]) ).

cnf(c_44906,plain,
    ( p(f1(X0,X1),f1(X0,X1))
    | q(f1(X0,X1),f1(X0,X1))
    | s(f1(X0,X1),f1(f1(X0,X1),X2)) ),
    inference(instantiation,[status(thm)],[c_44827]) ).

cnf(c_44907,plain,
    ( p(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | q(f1(iProver_bot,iProver_bot),f1(iProver_bot,iProver_bot))
    | s(f1(iProver_bot,iProver_bot),f1(f1(iProver_bot,iProver_bot),iProver_bot)) ),
    inference(instantiation,[status(thm)],[c_44906]) ).

cnf(c_457,plain,
    ( ~ s(iProver_bot,iProver_bot)
    | sP2_iProver_split ),
    inference(instantiation,[status(thm)],[c_456]) ).

cnf(contradiction,plain,
    $false,
    inference(minisat,[status(thm)],[c_300583,c_300117,c_46003,c_45519,c_45363,c_45135,c_45129,c_45085,c_45083,c_45030,c_44956,c_44934,c_44929,c_44928,c_44907,c_457]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN039-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.14  % Command  : iprover_modulo %s %d
% 0.13/0.35  % Computer : n012.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 16:25:13 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Running in mono-core mode
% 0.21/0.42  % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42  % Orientation found
% 0.21/0.42  % 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_697bf1.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9725e0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_8cde83 | grep -v "SZS"
% 0.21/0.45  
% 0.21/0.45  %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.45  
% 0.21/0.45  % 
% 0.21/0.45  % ------  iProver source info 
% 0.21/0.45  
% 0.21/0.45  % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.45  % git: non_committed_changes: true
% 0.21/0.45  % git: last_make_outside_of_git: true
% 0.21/0.45  
% 0.21/0.45  % 
% 0.21/0.45  % ------ Input Options
% 0.21/0.45  
% 0.21/0.45  % --out_options                         all
% 0.21/0.45  % --tptp_safe_out                       true
% 0.21/0.45  % --problem_path                        ""
% 0.21/0.45  % --include_path                        ""
% 0.21/0.45  % --clausifier                          .//eprover
% 0.21/0.45  % --clausifier_options                  --tstp-format  
% 0.21/0.45  % --stdin                               false
% 0.21/0.45  % --dbg_backtrace                       false
% 0.21/0.45  % --dbg_dump_prop_clauses               false
% 0.21/0.45  % --dbg_dump_prop_clauses_file          -
% 0.21/0.45  % --dbg_out_stat                        false
% 0.21/0.45  
% 0.21/0.45  % ------ General Options
% 0.21/0.45  
% 0.21/0.45  % --fof                                 false
% 0.21/0.45  % --time_out_real                       150.
% 0.21/0.45  % --time_out_prep_mult                  0.2
% 0.21/0.45  % --time_out_virtual                    -1.
% 0.21/0.45  % --schedule                            none
% 0.21/0.45  % --ground_splitting                    input
% 0.21/0.45  % --splitting_nvd                       16
% 0.21/0.45  % --non_eq_to_eq                        false
% 0.21/0.45  % --prep_gs_sim                         true
% 0.21/0.45  % --prep_unflatten                      false
% 0.21/0.45  % --prep_res_sim                        true
% 0.21/0.45  % --prep_upred                          true
% 0.21/0.45  % --res_sim_input                       true
% 0.21/0.45  % --clause_weak_htbl                    true
% 0.21/0.45  % --gc_record_bc_elim                   false
% 0.21/0.45  % --symbol_type_check                   false
% 0.21/0.45  % --clausify_out                        false
% 0.21/0.45  % --large_theory_mode                   false
% 0.21/0.45  % --prep_sem_filter                     none
% 0.21/0.45  % --prep_sem_filter_out                 false
% 0.21/0.45  % --preprocessed_out                    false
% 0.21/0.45  % --sub_typing                          false
% 0.21/0.45  % --brand_transform                     false
% 0.21/0.45  % --pure_diseq_elim                     true
% 0.21/0.45  % --min_unsat_core                      false
% 0.21/0.45  % --pred_elim                           true
% 0.21/0.45  % --add_important_lit                   false
% 0.21/0.45  % --soft_assumptions                    false
% 0.21/0.45  % --reset_solvers                       false
% 0.21/0.45  % --bc_imp_inh                          []
% 0.21/0.45  % --conj_cone_tolerance                 1.5
% 0.21/0.45  % --prolific_symb_bound                 500
% 0.21/0.45  % --lt_threshold                        2000
% 0.21/0.45  
% 0.21/0.45  % ------ SAT Options
% 0.21/0.45  
% 0.21/0.45  % --sat_mode                            false
% 0.21/0.45  % --sat_fm_restart_options              ""
% 0.21/0.45  % --sat_gr_def                          false
% 0.21/0.45  % --sat_epr_types                       true
% 0.21/0.45  % --sat_non_cyclic_types                false
% 0.21/0.45  % --sat_finite_models                   false
% 0.21/0.45  % --sat_fm_lemmas                       false
% 0.21/0.45  % --sat_fm_prep                         false
% 0.21/0.45  % --sat_fm_uc_incr                      true
% 0.21/0.45  % --sat_out_model                       small
% 0.21/0.45  % --sat_out_clauses                     false
% 0.21/0.45  
% 0.21/0.45  % ------ QBF Options
% 0.21/0.45  
% 0.21/0.45  % --qbf_mode                            false
% 0.21/0.45  % --qbf_elim_univ                       true
% 0.21/0.45  % --qbf_sk_in                           true
% 0.21/0.45  % --qbf_pred_elim                       true
% 0.21/0.45  % --qbf_split                           32
% 0.21/0.45  
% 0.21/0.45  % ------ BMC1 Options
% 0.21/0.45  
% 0.21/0.45  % --bmc1_incremental                    false
% 0.21/0.45  % --bmc1_axioms                         reachable_all
% 0.21/0.45  % --bmc1_min_bound                      0
% 0.21/0.45  % --bmc1_max_bound                      -1
% 0.21/0.45  % --bmc1_max_bound_default              -1
% 0.21/0.45  % --bmc1_symbol_reachability            true
% 0.21/0.45  % --bmc1_property_lemmas                false
% 0.21/0.45  % --bmc1_k_induction                    false
% 0.21/0.45  % --bmc1_non_equiv_states               false
% 0.21/0.45  % --bmc1_deadlock                       false
% 0.21/0.45  % --bmc1_ucm                            false
% 0.21/0.45  % --bmc1_add_unsat_core                 none
% 0.21/0.45  % --bmc1_unsat_core_children            false
% 0.21/0.45  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.21/0.45  % --bmc1_out_stat                       full
% 0.21/0.45  % --bmc1_ground_init                    false
% 0.21/0.45  % --bmc1_pre_inst_next_state            false
% 0.21/0.45  % --bmc1_pre_inst_state                 false
% 0.21/0.45  % --bmc1_pre_inst_reach_state           false
% 0.21/0.45  % --bmc1_out_unsat_core                 false
% 0.21/0.45  % --bmc1_aig_witness_out                false
% 0.21/0.45  % --bmc1_verbose                        false
% 0.21/0.45  % --bmc1_dump_clauses_tptp              false
% 0.21/0.46  % --bmc1_dump_unsat_core_tptp           false
% 0.21/0.46  % --bmc1_dump_file                      -
% 0.21/0.46  % --bmc1_ucm_expand_uc_limit            128
% 0.21/0.46  % --bmc1_ucm_n_expand_iterations        6
% 0.21/0.46  % --bmc1_ucm_extend_mode                1
% 0.21/0.46  % --bmc1_ucm_init_mode                  2
% 0.21/0.46  % --bmc1_ucm_cone_mode                  none
% 0.21/0.46  % --bmc1_ucm_reduced_relation_type      0
% 0.21/0.46  % --bmc1_ucm_relax_model                4
% 0.21/0.46  % --bmc1_ucm_full_tr_after_sat          true
% 0.21/0.46  % --bmc1_ucm_expand_neg_assumptions     false
% 0.21/0.46  % --bmc1_ucm_layered_model              none
% 0.21/0.46  % --bmc1_ucm_max_lemma_size             10
% 0.21/0.46  
% 0.21/0.46  % ------ AIG Options
% 0.21/0.46  
% 0.21/0.46  % --aig_mode                            false
% 0.21/0.46  
% 0.21/0.46  % ------ Instantiation Options
% 0.21/0.46  
% 0.21/0.46  % --instantiation_flag                  true
% 0.21/0.46  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.46  % --inst_solver_per_active              750
% 0.21/0.46  % --inst_solver_calls_frac              0.5
% 0.21/0.46  % --inst_passive_queue_type             priority_queues
% 0.21/0.46  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.46  % --inst_passive_queues_freq            [25;2]
% 0.21/0.46  % --inst_dismatching                    true
% 0.21/0.46  % --inst_eager_unprocessed_to_passive   true
% 0.21/0.46  % --inst_prop_sim_given                 true
% 0.21/0.46  % --inst_prop_sim_new                   false
% 0.21/0.46  % --inst_orphan_elimination             true
% 0.21/0.46  % --inst_learning_loop_flag             true
% 0.21/0.46  % --inst_learning_start                 3000
% 0.21/0.46  % --inst_learning_factor                2
% 0.21/0.46  % --inst_start_prop_sim_after_learn     3
% 0.21/0.46  % --inst_sel_renew                      solver
% 0.21/0.46  % --inst_lit_activity_flag              true
% 0.21/0.46  % --inst_out_proof                      true
% 0.21/0.46  
% 0.21/0.46  % ------ Resolution Options
% 0.21/0.46  
% 0.21/0.46  % --resolution_flag                     true
% 0.21/0.46  % --res_lit_sel                         kbo_max
% 0.21/0.46  % --res_to_prop_solver                  none
% 0.21/0.46  % --res_prop_simpl_new                  false
% 0.21/0.46  % --res_prop_simpl_given                false
% 0.21/0.46  % --res_passive_queue_type              priority_queues
% 0.21/0.46  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.46  % --res_passive_queues_freq             [15;5]
% 0.21/0.46  % --res_forward_subs                    full
% 0.21/0.46  % --res_backward_subs                   full
% 0.21/0.46  % --res_forward_subs_resolution         true
% 0.21/0.46  % --res_backward_subs_resolution        true
% 0.21/0.46  % --res_orphan_elimination              false
% 0.21/0.46  % --res_time_limit                      1000.
% 0.21/0.46  % --res_out_proof                       true
% 0.21/0.46  % --proof_out_file                      /export/starexec/sandbox/tmp/iprover_proof_697bf1.s
% 0.21/0.46  % --modulo                              true
% 0.21/0.46  
% 0.21/0.46  % ------ Combination Options
% 0.21/0.46  
% 0.21/0.46  % --comb_res_mult                       1000
% 0.21/0.46  % --comb_inst_mult                      300
% 0.21/0.46  % ------ 
% 0.21/0.46  
% 0.21/0.46  % ------ Parsing...% successful
% 0.21/0.46  
% 0.21/0.46  % ------ Preprocessing... gs_s  sp: 28 0s  gs_e  snvd_s sp: 0 0s snvd_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  snvd_s sp: 0 0s snvd_e % 
% 0.21/0.46  
% 0.21/0.46  % ------ Proving...
% 0.21/0.46  % ------ Problem Properties 
% 0.21/0.46  
% 0.21/0.46  % 
% 0.21/0.46  % EPR                                   false
% 0.21/0.46  % Horn                                  false
% 0.21/0.46  % Has equality                          false
% 0.21/0.46  
% 0.21/0.46  % % ------ Input Options Time Limit: Unbounded
% 0.21/0.46  
% 0.21/0.46  
% 0.21/0.46  % % ------ Current options:
% 0.21/0.46  
% 0.21/0.46  % ------ Input Options
% 0.21/0.46  
% 0.21/0.46  % --out_options                         all
% 0.21/0.46  % --tptp_safe_out                       true
% 0.21/0.46  % --problem_path                        ""
% 0.21/0.46  % --include_path                        ""
% 0.21/0.46  % --clausifier                          .//eprover
% 0.21/0.46  % --clausifier_options                  --tstp-format  
% 0.21/0.46  % --stdin                               false
% 0.21/0.46  % --dbg_backtrace                       false
% 0.21/0.46  % --dbg_dump_prop_clauses               false
% 0.21/0.46  % --dbg_dump_prop_clauses_file          -
% 0.21/0.46  % --dbg_out_stat                        false
% 0.21/0.46  
% 0.21/0.46  % ------ General Options
% 0.21/0.46  
% 0.21/0.46  % --fof                                 false
% 0.21/0.46  % --time_out_real                       150.
% 0.21/0.46  % --time_out_prep_mult                  0.2
% 0.21/0.46  % --time_out_virtual                    -1.
% 0.21/0.46  % --schedule                            none
% 0.21/0.46  % --ground_splitting                    input
% 0.21/0.46  % --splitting_nvd                       16
% 0.21/0.46  % --non_eq_to_eq                        false
% 0.21/0.46  % --prep_gs_sim                         true
% 0.21/0.46  % --prep_unflatten                      false
% 0.21/0.46  % --prep_res_sim                        true
% 0.21/0.46  % --prep_upred                          true
% 0.21/0.46  % --res_sim_input                       true
% 0.21/0.46  % --clause_weak_htbl                    true
% 0.21/0.46  % --gc_record_bc_elim                   false
% 0.21/0.46  % --symbol_type_check                   false
% 0.21/0.46  % --clausify_out                        false
% 0.21/0.46  % --large_theory_mode                   false
% 0.21/0.46  % --prep_sem_filter                     none
% 0.21/0.46  % --prep_sem_filter_out                 false
% 0.21/0.46  % --preprocessed_out                    false
% 0.21/0.46  % --sub_typing                          false
% 0.21/0.46  % --brand_transform                     false
% 0.21/0.46  % --pure_diseq_elim                     true
% 0.21/0.46  % --min_unsat_core                      false
% 0.21/0.46  % --pred_elim                           true
% 0.21/0.46  % --add_important_lit                   false
% 0.21/0.46  % --soft_assumptions                    false
% 0.21/0.46  % --reset_solvers                       false
% 0.21/0.46  % --bc_imp_inh                          []
% 0.21/0.46  % --conj_cone_tolerance                 1.5
% 0.21/0.46  % --prolific_symb_bound                 500
% 0.21/0.46  % --lt_threshold                        2000
% 0.21/0.46  
% 0.21/0.46  % ------ SAT Options
% 0.21/0.46  
% 0.21/0.46  % --sat_mode                            false
% 0.21/0.46  % --sat_fm_restart_options              ""
% 0.21/0.46  % --sat_gr_def                          false
% 0.21/0.46  % --sat_epr_types                       true
% 0.21/0.46  % --sat_non_cyclic_types                false
% 0.21/0.46  % --sat_finite_models                   false
% 0.21/0.46  % --sat_fm_lemmas                       false
% 0.21/0.46  % --sat_fm_prep                         false
% 0.21/0.46  % --sat_fm_uc_incr                      true
% 0.21/0.46  % --sat_out_model                       small
% 0.21/0.46  % --sat_out_clauses                     false
% 0.21/0.46  
% 0.21/0.46  % ------ QBF Options
% 0.21/0.46  
% 0.21/0.46  % --qbf_mode                            false
% 0.21/0.46  % --qbf_elim_univ                       true
% 0.21/0.46  % --qbf_sk_in                           true
% 0.21/0.46  % --qbf_pred_elim                       true
% 0.21/0.46  % --qbf_split                           32
% 0.21/0.46  
% 0.21/0.46  % ------ BMC1 Options
% 0.21/0.46  
% 0.21/0.46  % --bmc1_incremental                    false
% 0.21/0.46  % --bmc1_axioms                         reachable_all
% 0.21/0.46  % --bmc1_min_bound                      0
% 0.21/0.46  % --bmc1_max_bound                      -1
% 0.21/0.46  % --bmc1_max_bound_default              -1
% 0.21/0.46  % --bmc1_symbol_reachability            true
% 0.21/0.46  % --bmc1_property_lemmas                false
% 0.21/0.46  % --bmc1_k_induction                    false
% 0.21/0.46  % --bmc1_non_equiv_states               false
% 0.21/0.46  % --bmc1_deadlock                       false
% 0.21/0.46  % --bmc1_ucm                            false
% 0.21/0.46  % --bmc1_add_unsat_core                 none
% 0.21/0.46  % --bmc1_unsat_core_children            false
% 0.21/0.46  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.21/0.46  % --bmc1_out_stat                       full
% 0.21/0.46  % --bmc1_ground_init                    false
% 0.21/0.46  % --bmc1_pre_inst_next_state            false
% 0.21/0.46  % --bmc1_pre_inst_state                 false
% 0.21/0.46  % --bmc1_pre_inst_reach_state           false
% 0.21/0.46  % --bmc1_out_unsat_core                 false
% 0.21/0.46  % --bmc1_aig_witness_out                false
% 0.21/0.46  % --bmc1_verbose                        false
% 0.21/0.46  % --bmc1_dump_clauses_tptp              false
% 0.21/0.46  % --bmc1_dump_unsat_core_tptp           false
% 0.21/0.46  % --bmc1_dump_file                      -
% 0.21/0.46  % --bmc1_ucm_expand_uc_limit            128
% 0.21/0.46  % --bmc1_ucm_n_expand_iterations        6
% 0.21/0.46  % --bmc1_ucm_extend_mode                1
% 0.21/0.46  % --bmc1_ucm_init_mode                  2
% 0.21/0.46  % --bmc1_ucm_cone_mode                  none
% 0.21/0.46  % --bmc1_ucm_reduced_relation_type      0
% 0.21/0.46  % --bmc1_ucm_relax_model                4
% 0.21/0.46  % --bmc1_ucm_full_tr_after_sat          true
% 0.21/0.46  % --bmc1_ucm_expand_neg_assumptions     false
% 0.21/0.46  % --bmc1_ucm_layered_model              none
% 0.21/0.46  % --bmc1_ucm_max_lemma_size             10
% 0.21/0.46  
% 0.21/0.46  % ------ AIG Options
% 0.21/0.46  
% 0.21/0.46  % --aig_mode                            false
% 0.21/0.46  
% 0.21/0.46  % ------ Instantiation Options
% 0.21/0.46  
% 0.21/0.46  % --instantiation_flag                  true
% 0.21/0.46  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.46  % --inst_solver_per_active              750
% 0.21/0.46  % --inst_solver_calls_frac              0.5
% 0.21/0.46  % --inst_passive_queue_type             priority_queues
% 0.21/0.46  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.46  % --inst_passive_queues_freq            [25;2]
% 0.21/0.46  % --inst_dismatching                    true
% 0.21/0.46  % --inst_eager_unprocessed_to_passive   true
% 12.12/12.33  % --inst_prop_sim_given                 true
% 12.12/12.33  % --inst_prop_sim_new                   false
% 12.12/12.33  % --inst_orphan_elimination             true
% 12.12/12.33  % --inst_learning_loop_flag             true
% 12.12/12.33  % --inst_learning_start                 3000
% 12.12/12.33  % --inst_learning_factor                2
% 12.12/12.33  % --inst_start_prop_sim_after_learn     3
% 12.12/12.33  % --inst_sel_renew                      solver
% 12.12/12.33  % --inst_lit_activity_flag              true
% 12.12/12.33  % --inst_out_proof                      true
% 12.12/12.33  
% 12.12/12.33  % ------ Resolution Options
% 12.12/12.33  
% 12.12/12.33  % --resolution_flag                     true
% 12.12/12.33  % --res_lit_sel                         kbo_max
% 12.12/12.33  % --res_to_prop_solver                  none
% 12.12/12.33  % --res_prop_simpl_new                  false
% 12.12/12.33  % --res_prop_simpl_given                false
% 12.12/12.33  % --res_passive_queue_type              priority_queues
% 12.12/12.33  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 12.12/12.33  % --res_passive_queues_freq             [15;5]
% 12.12/12.33  % --res_forward_subs                    full
% 12.12/12.33  % --res_backward_subs                   full
% 12.12/12.33  % --res_forward_subs_resolution         true
% 12.12/12.33  % --res_backward_subs_resolution        true
% 12.12/12.33  % --res_orphan_elimination              false
% 12.12/12.33  % --res_time_limit                      1000.
% 12.12/12.33  % --res_out_proof                       true
% 12.12/12.33  % --proof_out_file                      /export/starexec/sandbox/tmp/iprover_proof_697bf1.s
% 12.12/12.33  % --modulo                              true
% 12.12/12.33  
% 12.12/12.33  % ------ Combination Options
% 12.12/12.33  
% 12.12/12.33  % --comb_res_mult                       1000
% 12.12/12.33  % --comb_inst_mult                      300
% 12.12/12.33  % ------ 
% 12.12/12.33  
% 12.12/12.33  
% 12.12/12.33  
% 12.12/12.33  % ------ Proving...
% 12.12/12.33  % 
% 12.12/12.33  
% 12.12/12.33  
% 12.12/12.33  % ------                             Statistics
% 12.12/12.33  
% 12.12/12.33  % ------ General
% 12.12/12.33  
% 12.12/12.33  % num_of_input_clauses:                 27
% 12.12/12.33  % num_of_input_neg_conjectures:         27
% 12.12/12.33  % num_of_splits:                        28
% 12.12/12.33  % num_of_split_atoms:                   8
% 12.12/12.33  % num_of_sem_filtered_clauses:          0
% 12.12/12.33  % num_of_subtypes:                      0
% 12.12/12.33  % monotx_restored_types:                0
% 12.12/12.33  % sat_num_of_epr_types:                 0
% 12.12/12.33  % sat_num_of_non_cyclic_types:          0
% 12.12/12.33  % sat_guarded_non_collapsed_types:      0
% 12.12/12.33  % is_epr:                               0
% 12.12/12.33  % is_horn:                              0
% 12.12/12.33  % has_eq:                               0
% 12.12/12.33  % num_pure_diseq_elim:                  0
% 12.12/12.33  % simp_replaced_by:                     0
% 12.12/12.33  % res_preprocessed:                     82
% 12.12/12.33  % prep_upred:                           0
% 12.12/12.33  % prep_unflattend:                      0
% 12.12/12.33  % pred_elim_cands:                      8
% 12.12/12.33  % pred_elim:                            6
% 12.12/12.33  % pred_elim_cl:                         6
% 12.12/12.33  % pred_elim_cycles:                     8
% 12.12/12.33  % forced_gc_time:                       0
% 12.12/12.33  % gc_basic_clause_elim:                 0
% 12.12/12.33  % parsing_time:                         0.001
% 12.12/12.33  % sem_filter_time:                      0.
% 12.12/12.33  % pred_elim_time:                       0.002
% 12.12/12.33  % out_proof_time:                       0.002
% 12.12/12.33  % monotx_time:                          0.
% 12.12/12.33  % subtype_inf_time:                     0.
% 12.12/12.33  % unif_index_cands_time:                0.016
% 12.12/12.33  % unif_index_add_time:                  0.004
% 12.12/12.33  % total_time:                           11.9
% 12.12/12.33  % num_of_symbols:                       37
% 12.12/12.33  % num_of_terms:                         12499
% 12.12/12.33  
% 12.12/12.33  % ------ Propositional Solver
% 12.12/12.33  
% 12.12/12.33  % prop_solver_calls:                    11
% 12.12/12.33  % prop_fast_solver_calls:               358
% 12.12/12.33  % prop_num_of_clauses:                  1134
% 12.12/12.33  % prop_preprocess_simplified:           1806
% 12.12/12.33  % prop_fo_subsumed:                     1
% 12.12/12.33  % prop_solver_time:                     0.
% 12.12/12.33  % prop_fast_solver_time:                0.
% 12.12/12.33  % prop_unsat_core_time:                 0.
% 12.12/12.33  
% 12.12/12.33  % ------ QBF 
% 12.12/12.33  
% 12.12/12.33  % qbf_q_res:                            0
% 12.12/12.33  % qbf_num_tautologies:                  0
% 12.12/12.33  % qbf_prep_cycles:                      0
% 12.12/12.33  
% 12.12/12.33  % ------ BMC1
% 12.12/12.33  
% 12.12/12.33  % bmc1_current_bound:                   -1
% 12.12/12.33  % bmc1_last_solved_bound:               -1
% 12.12/12.33  % bmc1_unsat_core_size:                 -1
% 12.12/12.33  % bmc1_unsat_core_parents_size:         -1
% 12.12/12.33  % bmc1_merge_next_fun:                  0
% 12.12/12.33  % bmc1_unsat_core_clauses_time:         0.
% 12.12/12.33  
% 12.12/12.33  % ------ Instantiation
% 12.12/12.33  
% 12.12/12.33  % inst_num_of_clauses:                  559
% 12.12/12.33  % inst_num_in_passive:                  61
% 12.12/12.33  % inst_num_in_active:                   304
% 12.12/12.33  % inst_num_in_unprocessed:              189
% 12.12/12.33  % inst_num_of_loops:                    502
% 12.12/12.33  % inst_num_of_learning_restarts:        0
% 12.12/12.33  % inst_num_moves_active_passive:        188
% 12.12/12.33  % inst_lit_activity:                    47
% 12.12/12.33  % inst_lit_activity_moves:              0
% 12.12/12.33  % inst_num_tautologies:                 5
% 12.12/12.33  % inst_num_prop_implied:                0
% 12.12/12.33  % inst_num_existing_simplified:         0
% 12.12/12.33  % inst_num_eq_res_simplified:           0
% 12.12/12.33  % inst_num_child_elim:                  0
% 12.12/12.33  % inst_num_of_dismatching_blockings:    1223
% 12.12/12.33  % inst_num_of_non_proper_insts:         1925
% 12.12/12.33  % inst_num_of_duplicates:               1254
% 12.12/12.33  % inst_inst_num_from_inst_to_res:       0
% 12.12/12.33  % inst_dismatching_checking_time:       0.001
% 12.12/12.33  
% 12.12/12.33  % ------ Resolution
% 12.12/12.33  
% 12.12/12.33  % res_num_of_clauses:                   86570
% 12.12/12.33  % res_num_in_passive:                   87678
% 12.12/12.33  % res_num_in_active:                    540
% 12.12/12.33  % res_num_of_loops:                     2000
% 12.12/12.33  % res_forward_subset_subsumed:          54020
% 12.12/12.33  % res_backward_subset_subsumed:         2221
% 12.12/12.33  % res_forward_subsumed:                 1200
% 12.12/12.33  % res_backward_subsumed:                91
% 12.12/12.33  % res_forward_subsumption_resolution:   81
% 12.12/12.33  % res_backward_subsumption_resolution:  20
% 12.12/12.33  % res_clause_to_clause_subsumption:     33164
% 12.12/12.33  % res_orphan_elimination:               0
% 12.12/12.33  % res_tautology_del:                    224
% 12.12/12.33  % res_num_eq_res_simplified:            0
% 12.12/12.33  % res_num_sel_changes:                  0
% 12.12/12.33  % res_moves_from_active_to_pass:        0
% 12.12/12.33  
% 12.12/12.33  % Status Unsatisfiable
% 12.12/12.33  % SZS status Unsatisfiable
% 12.12/12.33  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------