TSTP Solution File: SYN353-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN353-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n005.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:27:01 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 70
% Number of leaves : 28
% Syntax : Number of formulae : 220 ( 17 unt; 0 def)
% Number of atoms : 586 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 631 ( 265 ~; 366 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-3 aty)
% Number of variables : 565 ( 20 sgn 153 !; 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,X3] :
( ~ f(X3,X2,X1)
| ~ f(X2,X1,X3)
| ~ f(X1,X3,X2)
| ~ f(z(X3,X2,X1),z(X3,X2,X1),z(X3,X2,X1)) ),
file('<stdin>',clause17) ).
fof(c_0_1,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| ~ f(a,a,z(X3,X2,X1))
| f(X2,X1,X3)
| f(X1,X3,X2) ),
file('<stdin>',clause1) ).
fof(c_0_2,negated_conjecture,
! [X1,X2,X3] :
( f(X1,X3,X2)
| f(z(X3,X2,X1),z(X3,X2,X1),z(X3,X2,X1)) ),
file('<stdin>',clause16) ).
fof(c_0_3,negated_conjecture,
! [X1,X2,X3] :
( f(X2,X1,X3)
| f(z(X3,X2,X1),z(X3,X2,X1),z(X3,X2,X1)) ),
file('<stdin>',clause15) ).
fof(c_0_4,negated_conjecture,
! [X1,X2,X3] :
( f(X3,X2,X1)
| f(z(X3,X2,X1),z(X3,X2,X1),z(X3,X2,X1)) ),
file('<stdin>',clause14) ).
fof(c_0_5,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X2,X1,X3)
| f(X1,X3,X2)
| ~ f(X3,z(X3,X2,X1),X2) ),
file('<stdin>',clause7) ).
fof(c_0_6,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X2,X1,X3)
| f(X3,X2,X1)
| ~ f(X3,z(X3,X2,X1),X2) ),
file('<stdin>',clause6) ).
fof(c_0_7,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X1,X3,X2)
| f(X2,X1,X3)
| ~ f(X2,X3,z(X3,X2,X1)) ),
file('<stdin>',clause3) ).
fof(c_0_8,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X1,X3,X2)
| f(X3,X2,X1)
| ~ f(X2,X3,z(X3,X2,X1)) ),
file('<stdin>',clause2) ).
fof(c_0_9,negated_conjecture,
! [X1,X2,X3] :
( f(X2,X1,X3)
| f(X3,X2,X1)
| ~ f(z(X3,X2,X1),X2,X3) ),
file('<stdin>',clause11) ).
fof(c_0_10,negated_conjecture,
! [X1,X2,X3] :
( f(X1,X3,X2)
| f(X3,X2,X1)
| ~ f(z(X3,X2,X1),X2,X3) ),
file('<stdin>',clause10) ).
fof(c_0_11,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X1,X3,X2)
| ~ f(X2,X1,X3)
| f(z(X3,X2,X1),X2,X3) ),
file('<stdin>',clause12) ).
fof(c_0_12,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| ~ f(X1,X3,X2)
| f(X3,z(X3,X2,X1),X2) ),
file('<stdin>',clause9) ).
fof(c_0_13,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| ~ f(X2,X1,X3)
| f(X2,X3,z(X3,X2,X1)) ),
file('<stdin>',clause5) ).
fof(c_0_14,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| f(z(X3,X2,X1),X2,X3) ),
file('<stdin>',clause13) ).
fof(c_0_15,negated_conjecture,
! [X1,X2,X3] :
( f(X2,X1,X3)
| f(X3,z(X3,X2,X1),X2) ),
file('<stdin>',clause8) ).
fof(c_0_16,negated_conjecture,
! [X1,X2,X3] :
( f(X1,X3,X2)
| f(X2,X3,z(X3,X2,X1)) ),
file('<stdin>',clause4) ).
fof(c_0_17,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| ~ f(X2,X1,X3)
| ~ f(X1,X3,X2)
| ~ f(z(X3,X2,X1),z(X3,X2,X1),z(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_18,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| ~ f(a,a,z(X3,X2,X1))
| f(X2,X1,X3)
| f(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_19,negated_conjecture,
! [X1,X2,X3] :
( f(X1,X3,X2)
| f(z(X3,X2,X1),z(X3,X2,X1),z(X3,X2,X1)) ),
c_0_2 ).
fof(c_0_20,negated_conjecture,
! [X1,X2,X3] :
( f(X2,X1,X3)
| f(z(X3,X2,X1),z(X3,X2,X1),z(X3,X2,X1)) ),
c_0_3 ).
fof(c_0_21,negated_conjecture,
! [X1,X2,X3] :
( f(X3,X2,X1)
| f(z(X3,X2,X1),z(X3,X2,X1),z(X3,X2,X1)) ),
c_0_4 ).
fof(c_0_22,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X2,X1,X3)
| f(X1,X3,X2)
| ~ f(X3,z(X3,X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_23,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X2,X1,X3)
| f(X3,X2,X1)
| ~ f(X3,z(X3,X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_24,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X1,X3,X2)
| f(X2,X1,X3)
| ~ f(X2,X3,z(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_25,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X1,X3,X2)
| f(X3,X2,X1)
| ~ f(X2,X3,z(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_26,negated_conjecture,
! [X1,X2,X3] :
( f(X2,X1,X3)
| f(X3,X2,X1)
| ~ f(z(X3,X2,X1),X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_27,negated_conjecture,
! [X1,X2,X3] :
( f(X1,X3,X2)
| f(X3,X2,X1)
| ~ f(z(X3,X2,X1),X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_28,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X1,X3,X2)
| ~ f(X2,X1,X3)
| f(z(X3,X2,X1),X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_29,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| ~ f(X1,X3,X2)
| f(X3,z(X3,X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_30,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| ~ f(X2,X1,X3)
| f(X2,X3,z(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_31,negated_conjecture,
! [X1,X2,X3] :
( ~ f(X3,X2,X1)
| f(z(X3,X2,X1),X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_32,negated_conjecture,
! [X1,X2,X3] :
( f(X2,X1,X3)
| f(X3,z(X3,X2,X1),X2) ),
c_0_15 ).
fof(c_0_33,negated_conjecture,
! [X1,X2,X3] :
( f(X1,X3,X2)
| f(X2,X3,z(X3,X2,X1)) ),
c_0_16 ).
fof(c_0_34,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X6,X5,X4)
| ~ f(X5,X4,X6)
| ~ f(X4,X6,X5)
| ~ f(z(X6,X5,X4),z(X6,X5,X4),z(X6,X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_35,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X6,X5,X4)
| ~ f(a,a,z(X6,X5,X4))
| f(X5,X4,X6)
| f(X4,X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_36,negated_conjecture,
! [X4,X5,X6] :
( f(X4,X6,X5)
| f(z(X6,X5,X4),z(X6,X5,X4),z(X6,X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_37,negated_conjecture,
! [X4,X5,X6] :
( f(X5,X4,X6)
| f(z(X6,X5,X4),z(X6,X5,X4),z(X6,X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_38,negated_conjecture,
! [X4,X5,X6] :
( f(X6,X5,X4)
| f(z(X6,X5,X4),z(X6,X5,X4),z(X6,X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_39,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X5,X4,X6)
| f(X4,X6,X5)
| ~ f(X6,z(X6,X5,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_40,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X5,X4,X6)
| f(X6,X5,X4)
| ~ f(X6,z(X6,X5,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
fof(c_0_41,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X4,X6,X5)
| f(X5,X4,X6)
| ~ f(X5,X6,z(X6,X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_42,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X4,X6,X5)
| f(X6,X5,X4)
| ~ f(X5,X6,z(X6,X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_43,negated_conjecture,
! [X4,X5,X6] :
( f(X5,X4,X6)
| f(X6,X5,X4)
| ~ f(z(X6,X5,X4),X5,X6) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
fof(c_0_44,negated_conjecture,
! [X4,X5,X6] :
( f(X4,X6,X5)
| f(X6,X5,X4)
| ~ f(z(X6,X5,X4),X5,X6) ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_45,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X4,X6,X5)
| ~ f(X5,X4,X6)
| f(z(X6,X5,X4),X5,X6) ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
fof(c_0_46,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X6,X5,X4)
| ~ f(X4,X6,X5)
| f(X6,z(X6,X5,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
fof(c_0_47,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X6,X5,X4)
| ~ f(X5,X4,X6)
| f(X5,X6,z(X6,X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_48,negated_conjecture,
! [X4,X5,X6] :
( ~ f(X6,X5,X4)
| f(z(X6,X5,X4),X5,X6) ),
inference(variable_rename,[status(thm)],[c_0_31]) ).
fof(c_0_49,negated_conjecture,
! [X4,X5,X6] :
( f(X5,X4,X6)
| f(X6,z(X6,X5,X4),X5) ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
fof(c_0_50,negated_conjecture,
! [X4,X5,X6] :
( f(X4,X6,X5)
| f(X5,X6,z(X6,X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_33]) ).
cnf(c_0_51,negated_conjecture,
( ~ f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| ~ f(X3,X1,X2)
| ~ f(X2,X3,X1)
| ~ f(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,negated_conjecture,
( f(X1,X2,X3)
| f(X3,X1,X2)
| ~ f(a,a,z(X2,X3,X1))
| ~ f(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,negated_conjecture,
( f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| f(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_54,negated_conjecture,
( f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| f(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_55,negated_conjecture,
( f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| f(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_56,negated_conjecture,
( f(X3,X1,X2)
| ~ f(X1,z(X1,X2,X3),X2)
| ~ f(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_57,negated_conjecture,
( f(X1,X2,X3)
| ~ f(X1,z(X1,X2,X3),X2)
| ~ f(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_58,negated_conjecture,
( f(X1,X3,X2)
| ~ f(X1,X2,z(X2,X1,X3))
| ~ f(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_59,negated_conjecture,
( f(X2,X1,X3)
| ~ f(X1,X2,z(X2,X1,X3))
| ~ f(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_60,negated_conjecture,
( f(X1,X2,X3)
| f(X2,X3,X1)
| ~ f(z(X1,X2,X3),X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_61,negated_conjecture,
( f(X1,X2,X3)
| f(X3,X1,X2)
| ~ f(z(X1,X2,X3),X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_62,negated_conjecture,
( f(z(X1,X2,X3),X2,X1)
| ~ f(X2,X3,X1)
| ~ f(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_63,negated_conjecture,
( f(X1,z(X1,X2,X3),X2)
| ~ f(X3,X1,X2)
| ~ f(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_64,negated_conjecture,
( f(X1,X2,z(X2,X1,X3))
| ~ f(X1,X3,X2)
| ~ f(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_65,negated_conjecture,
( f(z(X1,X2,X3),X2,X1)
| ~ f(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_66,negated_conjecture,
( f(X1,z(X1,X2,X3),X2)
| f(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_67,negated_conjecture,
( f(X1,X2,z(X2,X1,X3))
| f(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_68,negated_conjecture,
( ~ f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| ~ f(X3,X1,X2)
| ~ f(X2,X3,X1)
| ~ f(X1,X2,X3) ),
c_0_51,
[final] ).
cnf(c_0_69,negated_conjecture,
( f(X1,X2,X3)
| f(X3,X1,X2)
| ~ f(a,a,z(X2,X3,X1))
| ~ f(X2,X3,X1) ),
c_0_52,
[final] ).
cnf(c_0_70,negated_conjecture,
( f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| f(X3,X1,X2) ),
c_0_53,
[final] ).
cnf(c_0_71,negated_conjecture,
( f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| f(X2,X3,X1) ),
c_0_54,
[final] ).
cnf(c_0_72,negated_conjecture,
( f(z(X1,X2,X3),z(X1,X2,X3),z(X1,X2,X3))
| f(X1,X2,X3) ),
c_0_55,
[final] ).
cnf(c_0_73,negated_conjecture,
( f(X3,X1,X2)
| ~ f(X1,z(X1,X2,X3),X2)
| ~ f(X2,X3,X1) ),
c_0_56,
[final] ).
cnf(c_0_74,negated_conjecture,
( f(X1,X2,X3)
| ~ f(X1,z(X1,X2,X3),X2)
| ~ f(X2,X3,X1) ),
c_0_57,
[final] ).
cnf(c_0_75,negated_conjecture,
( f(X1,X3,X2)
| ~ f(X1,X2,z(X2,X1,X3))
| ~ f(X3,X2,X1) ),
c_0_58,
[final] ).
cnf(c_0_76,negated_conjecture,
( f(X2,X1,X3)
| ~ f(X1,X2,z(X2,X1,X3))
| ~ f(X3,X2,X1) ),
c_0_59,
[final] ).
cnf(c_0_77,negated_conjecture,
( f(X1,X2,X3)
| f(X2,X3,X1)
| ~ f(z(X1,X2,X3),X2,X1) ),
c_0_60,
[final] ).
cnf(c_0_78,negated_conjecture,
( f(X1,X2,X3)
| f(X3,X1,X2)
| ~ f(z(X1,X2,X3),X2,X1) ),
c_0_61,
[final] ).
cnf(c_0_79,negated_conjecture,
( f(z(X1,X2,X3),X2,X1)
| ~ f(X2,X3,X1)
| ~ f(X3,X1,X2) ),
c_0_62,
[final] ).
cnf(c_0_80,negated_conjecture,
( f(X1,z(X1,X2,X3),X2)
| ~ f(X3,X1,X2)
| ~ f(X1,X2,X3) ),
c_0_63,
[final] ).
cnf(c_0_81,negated_conjecture,
( f(X1,X2,z(X2,X1,X3))
| ~ f(X1,X3,X2)
| ~ f(X2,X1,X3) ),
c_0_64,
[final] ).
cnf(c_0_82,negated_conjecture,
( f(z(X1,X2,X3),X2,X1)
| ~ f(X1,X2,X3) ),
c_0_65,
[final] ).
cnf(c_0_83,negated_conjecture,
( f(X1,z(X1,X2,X3),X2)
| f(X2,X3,X1) ),
c_0_66,
[final] ).
cnf(c_0_84,negated_conjecture,
( f(X1,X2,z(X2,X1,X3))
| f(X3,X2,X1) ),
c_0_67,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_1,negated_conjecture,
( ~ f(a,a,z(X0,X1,X2))
| ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_69) ).
cnf(c_27,negated_conjecture,
( ~ f(a,a,z(X0,X1,X2))
| ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_94,negated_conjecture,
( ~ f(a,a,z(X0,X1,X2))
| ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_125,negated_conjecture,
( ~ f(a,a,z(X0,X1,X2))
| ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_128,negated_conjecture,
( ~ f(a,a,z(X0,X1,X2))
| ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_125]) ).
cnf(c_163,negated_conjecture,
( ~ f(a,a,z(X0,X1,X2))
| ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_128]) ).
cnf(c_16,negated_conjecture,
( f(X0,X1,z(X1,X0,X2))
| f(X2,X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_84) ).
cnf(c_57,negated_conjecture,
( f(X0,X1,z(X1,X0,X2))
| f(X2,X1,X0) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_109,negated_conjecture,
( f(X0,X1,z(X1,X0,X2))
| f(X2,X1,X0) ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_110,negated_conjecture,
( f(X0,X1,z(X1,X0,X2))
| f(X2,X1,X0) ),
inference(copy,[status(esa)],[c_109]) ).
cnf(c_143,negated_conjecture,
( f(X0,X1,z(X1,X0,X2))
| f(X2,X1,X0) ),
inference(copy,[status(esa)],[c_110]) ).
cnf(c_193,plain,
( f(X0,X1,z(X1,X0,X2))
| f(X2,X1,X0) ),
inference(copy,[status(esa)],[c_143]) ).
cnf(c_306,plain,
( ~ f(a,a,X0)
| f(a,X0,a)
| f(X0,a,a) ),
inference(resolution,[status(thm)],[c_163,c_193]) ).
cnf(c_307,plain,
( ~ f(a,a,X0)
| f(a,X0,a)
| f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_306]) ).
cnf(c_330,plain,
( f(z(a,a,X0),a,a)
| f(a,z(a,a,X0),a)
| f(X0,a,a) ),
inference(resolution,[status(thm)],[c_307,c_193]) ).
cnf(c_331,plain,
( f(z(a,a,X0),a,a)
| f(a,z(a,a,X0),a)
| f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_330]) ).
cnf(c_10,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X2,X0,X1)
| f(X0,X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_78) ).
cnf(c_45,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X2,X0,X1)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_103,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X2,X0,X1)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_116,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X2,X0,X1)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_137,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X2,X0,X1)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_116]) ).
cnf(c_181,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X2,X0,X1)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_137]) ).
cnf(c_339,plain,
( f(a,z(a,a,X0),a)
| f(a,a,X0)
| f(X0,a,a) ),
inference(resolution,[status(thm)],[c_331,c_181]) ).
cnf(c_342,plain,
( f(a,z(a,a,X0),a)
| f(a,a,X0)
| f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_339]) ).
cnf(c_5,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X2,X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_73) ).
cnf(c_35,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_98,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_35]) ).
cnf(c_121,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_132,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_121]) ).
cnf(c_171,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_132]) ).
cnf(c_350,plain,
( f(a,a,X0)
| ~ f(a,X0,a)
| f(X0,a,a) ),
inference(resolution,[status(thm)],[c_342,c_171]) ).
cnf(c_351,plain,
( f(a,a,X0)
| ~ f(a,X0,a)
| f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_350]) ).
cnf(c_15,negated_conjecture,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X2,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_83) ).
cnf(c_55,negated_conjecture,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_108,negated_conjecture,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_111,negated_conjecture,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_142,negated_conjecture,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_111]) ).
cnf(c_191,plain,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_142]) ).
cnf(c_360,plain,
( f(z(a,a,X0),a,a)
| f(a,a,z(a,a,X0))
| f(a,X0,a) ),
inference(resolution,[status(thm)],[c_351,c_191]) ).
cnf(c_361,plain,
( f(z(a,a,X0),a,a)
| f(a,a,z(a,a,X0))
| f(a,X0,a) ),
inference(rewriting,[status(thm)],[c_360]) ).
cnf(c_9,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X1,X2,X0)
| f(X0,X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_77) ).
cnf(c_43,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_102,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_117,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_136,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_117]) ).
cnf(c_179,negated_conjecture,
( ~ f(z(X0,X1,X2),X1,X0)
| f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_136]) ).
cnf(c_372,plain,
( f(a,a,z(a,a,X0))
| f(a,a,X0)
| f(a,X0,a) ),
inference(resolution,[status(thm)],[c_361,c_179]) ).
cnf(c_373,plain,
( f(a,a,z(a,a,X0))
| f(a,a,X0)
| f(a,X0,a) ),
inference(rewriting,[status(thm)],[c_372]) ).
cnf(c_7,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X0,X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_75) ).
cnf(c_39,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X0,X2,X1) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_100,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X0,X2,X1) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_119,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X0,X2,X1) ),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_134,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X0,X2,X1) ),
inference(copy,[status(esa)],[c_119]) ).
cnf(c_175,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X0,X2,X1) ),
inference(copy,[status(esa)],[c_134]) ).
cnf(c_384,plain,
( f(a,a,X0)
| f(a,X0,a)
| ~ f(X0,a,a) ),
inference(resolution,[status(thm)],[c_373,c_175]) ).
cnf(c_385,plain,
( f(a,a,X0)
| f(a,X0,a)
| ~ f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_384]) ).
cnf(c_11,negated_conjecture,
( f(z(X0,X1,X2),X1,X0)
| ~ f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_79) ).
cnf(c_47,negated_conjecture,
( f(z(X0,X1,X2),X1,X0)
| ~ f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_104,negated_conjecture,
( f(z(X0,X1,X2),X1,X0)
| ~ f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_115,negated_conjecture,
( f(z(X0,X1,X2),X1,X0)
| ~ f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_138,negated_conjecture,
( f(z(X0,X1,X2),X1,X0)
| ~ f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_115]) ).
cnf(c_183,negated_conjecture,
( f(z(X0,X1,X2),X1,X0)
| ~ f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
inference(copy,[status(esa)],[c_138]) ).
cnf(c_395,plain,
( f(a,z(a,a,X0),a)
| f(a,a,z(a,a,X0))
| ~ f(a,X0,a)
| ~ f(X0,a,a) ),
inference(resolution,[status(thm)],[c_385,c_183]) ).
cnf(c_398,plain,
( f(a,z(a,a,X0),a)
| f(a,a,z(a,a,X0))
| ~ f(a,X0,a)
| ~ f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_395]) ).
cnf(c_407,plain,
( f(a,z(a,a,X0),a)
| f(a,a,z(a,a,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_398,c_193,c_191]) ).
cnf(c_408,plain,
( f(a,z(a,a,X0),a)
| f(a,a,z(a,a,X0)) ),
inference(rewriting,[status(thm)],[c_407]) ).
cnf(c_6,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X0,X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_74) ).
cnf(c_37,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_99,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_120,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_133,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_120]) ).
cnf(c_173,negated_conjecture,
( ~ f(X0,z(X0,X1,X2),X1)
| ~ f(X1,X2,X0)
| f(X0,X1,X2) ),
inference(copy,[status(esa)],[c_133]) ).
cnf(c_411,plain,
( f(a,a,z(a,a,X0))
| f(a,a,X0)
| ~ f(a,X0,a) ),
inference(resolution,[status(thm)],[c_408,c_173]) ).
cnf(c_414,plain,
( f(a,a,z(a,a,X0))
| f(a,a,X0)
| ~ f(a,X0,a) ),
inference(rewriting,[status(thm)],[c_411]) ).
cnf(c_430,plain,
( f(a,a,z(a,a,X0))
| f(a,a,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_414,c_373]) ).
cnf(c_431,plain,
( f(a,a,z(a,a,X0))
| f(a,a,X0) ),
inference(rewriting,[status(thm)],[c_430]) ).
cnf(c_8,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X1,X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_76) ).
cnf(c_41,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X1,X0,X2) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_101,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X1,X0,X2) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_118,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X1,X0,X2) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_135,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X1,X0,X2) ),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_177,negated_conjecture,
( ~ f(X0,X1,z(X1,X0,X2))
| ~ f(X2,X1,X0)
| f(X1,X0,X2) ),
inference(copy,[status(esa)],[c_135]) ).
cnf(c_436,plain,
( f(a,a,X0)
| ~ f(X0,a,a) ),
inference(resolution,[status(thm)],[c_431,c_177]) ).
cnf(c_439,plain,
( f(a,a,X0)
| ~ f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_436]) ).
cnf(c_415,plain,
( f(z(a,a,X0),a,a)
| f(a,a,z(a,a,X0)) ),
inference(resolution,[status(thm)],[c_408,c_351]) ).
cnf(c_416,plain,
( f(z(a,a,X0),a,a)
| f(a,a,z(a,a,X0)) ),
inference(rewriting,[status(thm)],[c_415]) ).
cnf(c_446,plain,
f(a,a,z(a,a,X0)),
inference(backward_subsumption_resolution,[status(thm)],[c_439,c_416]) ).
cnf(c_451,plain,
f(a,a,z(a,a,X0)),
inference(rewriting,[status(thm)],[c_446]) ).
cnf(c_463,plain,
( f(a,X0,a)
| ~ f(X0,a,a) ),
inference(resolution,[status(thm)],[c_451,c_175]) ).
cnf(c_464,plain,
( f(a,X0,a)
| ~ f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_463]) ).
cnf(c_472,plain,
( ~ f(a,a,X0)
| f(a,X0,a) ),
inference(backward_subsumption_resolution,[status(thm)],[c_464,c_307]) ).
cnf(c_473,plain,
( ~ f(a,a,X0)
| f(a,X0,a) ),
inference(rewriting,[status(thm)],[c_472]) ).
cnf(c_486,plain,
f(a,z(a,a,X0),a),
inference(resolution,[status(thm)],[c_473,c_451]) ).
cnf(c_487,plain,
f(a,z(a,a,X0),a),
inference(rewriting,[status(thm)],[c_486]) ).
cnf(c_503,plain,
( ~ f(a,X0,a)
| f(X0,a,a) ),
inference(resolution,[status(thm)],[c_487,c_171]) ).
cnf(c_504,plain,
( ~ f(a,X0,a)
| f(X0,a,a) ),
inference(rewriting,[status(thm)],[c_503]) ).
cnf(c_516,plain,
f(z(a,a,X0),a,a),
inference(resolution,[status(thm)],[c_504,c_487]) ).
cnf(c_517,plain,
f(z(a,a,X0),a,a),
inference(rewriting,[status(thm)],[c_516]) ).
cnf(c_521,plain,
( f(a,a,X0)
| f(a,X0,a) ),
inference(resolution,[status(thm)],[c_517,c_179]) ).
cnf(c_522,plain,
( f(a,a,X0)
| f(a,X0,a) ),
inference(rewriting,[status(thm)],[c_521]) ).
cnf(c_530,plain,
f(a,X0,a),
inference(forward_subsumption_resolution,[status(thm)],[c_522,c_473]) ).
cnf(c_531,plain,
f(a,X0,a),
inference(rewriting,[status(thm)],[c_530]) ).
cnf(c_448,plain,
( f(a,a,X0)
| ~ f(a,X0,a) ),
inference(backward_subsumption_resolution,[status(thm)],[c_439,c_351]) ).
cnf(c_449,plain,
( f(a,a,X0)
| ~ f(a,X0,a) ),
inference(rewriting,[status(thm)],[c_448]) ).
cnf(c_534,plain,
f(a,a,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_531,c_449]) ).
cnf(c_535,plain,
f(a,a,X0),
inference(rewriting,[status(thm)],[c_534]) ).
cnf(c_543,negated_conjecture,
( ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(resolution,[status(thm)],[c_535,c_163]) ).
cnf(c_544,plain,
( ~ f(X0,X1,X2)
| f(X1,X2,X0)
| f(X2,X0,X1) ),
inference(rewriting,[status(thm)],[c_543]) ).
cnf(c_569,plain,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X0,z(X0,X1,X2))
| ~ f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
inference(resolution,[status(thm)],[c_544,c_183]) ).
cnf(c_572,plain,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X0,z(X0,X1,X2))
| ~ f(X2,X0,X1)
| ~ f(X1,X2,X0) ),
inference(rewriting,[status(thm)],[c_569]) ).
cnf(c_591,plain,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X0,z(X0,X1,X2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_572,c_191,c_193]) ).
cnf(c_592,plain,
( f(X0,z(X0,X1,X2),X1)
| f(X1,X0,z(X0,X1,X2)) ),
inference(rewriting,[status(thm)],[c_591]) ).
cnf(c_597,plain,
( f(X0,z(X0,X1,X2),X1)
| ~ f(X2,X0,X1)
| f(X0,X1,X2) ),
inference(resolution,[status(thm)],[c_592,c_177]) ).
cnf(c_600,plain,
( f(X0,z(X0,X1,X2),X1)
| ~ f(X2,X0,X1)
| f(X0,X1,X2) ),
inference(rewriting,[status(thm)],[c_597]) ).
cnf(c_615,plain,
( ~ f(X0,X1,X2)
| ~ f(X2,X0,X1)
| f(X1,X2,X0) ),
inference(resolution,[status(thm)],[c_600,c_173]) ).
cnf(c_618,plain,
( ~ f(X0,X1,X2)
| ~ f(X2,X0,X1)
| f(X1,X2,X0) ),
inference(rewriting,[status(thm)],[c_615]) ).
cnf(c_634,plain,
( ~ f(X0,X1,X2)
| f(X2,X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_618,c_544]) ).
cnf(c_635,plain,
( ~ f(X0,X1,X2)
| f(X2,X0,X1) ),
inference(rewriting,[status(thm)],[c_634]) ).
cnf(c_637,plain,
f(X0,X1,z(X1,X0,X2)),
inference(backward_subsumption_resolution,[status(thm)],[c_635,c_592]) ).
cnf(c_639,plain,
f(X0,X1,z(X1,X0,X2)),
inference(rewriting,[status(thm)],[c_637]) ).
cnf(c_674,plain,
f(z(X0,X1,X2),X1,X0),
inference(resolution,[status(thm)],[c_639,c_635]) ).
cnf(c_675,plain,
f(z(X0,X1,X2),X1,X0),
inference(rewriting,[status(thm)],[c_674]) ).
cnf(c_721,plain,
( f(X0,X1,X2)
| f(X2,X0,X1) ),
inference(resolution,[status(thm)],[c_675,c_179]) ).
cnf(c_722,plain,
( f(X0,X1,X2)
| f(X2,X0,X1) ),
inference(rewriting,[status(thm)],[c_721]) ).
cnf(c_726,plain,
f(X0,X1,X2),
inference(forward_subsumption_resolution,[status(thm)],[c_722,c_635]) ).
cnf(c_727,plain,
f(X0,X1,X2),
inference(rewriting,[status(thm)],[c_726]) ).
cnf(c_0,negated_conjecture,
( ~ f(z(X0,X1,X2),z(X0,X1,X2),z(X0,X1,X2))
| ~ f(X0,X1,X2)
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_114678.p',c_0_68) ).
cnf(c_25,negated_conjecture,
( ~ f(z(X0,X1,X2),z(X0,X1,X2),z(X0,X1,X2))
| ~ f(X0,X1,X2)
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_93,negated_conjecture,
( ~ f(z(X0,X1,X2),z(X0,X1,X2),z(X0,X1,X2))
| ~ f(X0,X1,X2)
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_126,negated_conjecture,
( ~ f(z(X0,X1,X2),z(X0,X1,X2),z(X0,X1,X2))
| ~ f(X0,X1,X2)
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_127,negated_conjecture,
( ~ f(z(X0,X1,X2),z(X0,X1,X2),z(X0,X1,X2))
| ~ f(X0,X1,X2)
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_126]) ).
cnf(c_161,negated_conjecture,
( ~ f(z(X0,X1,X2),z(X0,X1,X2),z(X0,X1,X2))
| ~ f(X0,X1,X2)
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(copy,[status(esa)],[c_127]) ).
cnf(c_729,negated_conjecture,
( ~ f(X0,X1,X2)
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(resolution,[status(thm)],[c_727,c_161]) ).
cnf(c_730,plain,
( ~ f(X0,X1,X2)
| ~ f(X1,X2,X0)
| ~ f(X2,X0,X1) ),
inference(rewriting,[status(thm)],[c_729]) ).
cnf(c_746,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_730,c_727,c_727,c_727]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN353-1 : TPTP v8.1.0. Released v1.2.0.
% 0.04/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 02:13:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.40 % Orientation found
% 0.19/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_abddc6.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_114678.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_e0e27b | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.43 % --bmc1_ucm_extend_mode 1
% 0.19/0.43 % --bmc1_ucm_init_mode 2
% 0.19/0.43 % --bmc1_ucm_cone_mode none
% 0.19/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.43 % --bmc1_ucm_relax_model 4
% 0.19/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.43 % --bmc1_ucm_layered_model none
% 0.19/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.43
% 0.19/0.43 % ------ AIG Options
% 0.19/0.43
% 0.19/0.43 % --aig_mode false
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation Options
% 0.19/0.43
% 0.19/0.43 % --instantiation_flag true
% 0.19/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43 % --inst_solver_per_active 750
% 0.19/0.43 % --inst_solver_calls_frac 0.5
% 0.19/0.43 % --inst_passive_queue_type priority_queues
% 0.19/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 0.19/0.43 % --inst_prop_sim_given true
% 0.19/0.43 % --inst_prop_sim_new false
% 0.19/0.43 % --inst_orphan_elimination true
% 0.19/0.43 % --inst_learning_loop_flag true
% 0.19/0.43 % --inst_learning_start 3000
% 0.19/0.43 % --inst_learning_factor 2
% 0.19/0.43 % --inst_start_prop_sim_after_learn 3
% 0.19/0.43 % --inst_sel_renew solver
% 0.19/0.43 % --inst_lit_activity_flag true
% 0.19/0.43 % --inst_out_proof true
% 0.19/0.43
% 0.19/0.43 % ------ Resolution Options
% 0.19/0.43
% 0.19/0.43 % --resolution_flag true
% 0.19/0.43 % --res_lit_sel kbo_max
% 0.19/0.43 % --res_to_prop_solver none
% 0.19/0.43 % --res_prop_simpl_new false
% 0.19/0.43 % --res_prop_simpl_given false
% 0.19/0.43 % --res_passive_queue_type priority_queues
% 0.19/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.43 % --res_passive_queues_freq [15;5]
% 0.19/0.43 % --res_forward_subs full
% 0.19/0.43 % --res_backward_subs full
% 0.19/0.43 % --res_forward_subs_resolution true
% 0.19/0.43 % --res_backward_subs_resolution true
% 0.19/0.43 % --res_orphan_elimination false
% 0.19/0.43 % --res_time_limit 1000.
% 0.19/0.43 % --res_out_proof true
% 0.19/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_abddc6.s
% 0.19/0.43 % --modulo true
% 0.19/0.43
% 0.19/0.43 % ------ Combination Options
% 0.19/0.43
% 0.19/0.43 % --comb_res_mult 1000
% 0.19/0.43 % --comb_inst_mult 300
% 0.19/0.43 % ------
% 0.19/0.43
% 0.19/0.43 % ------ Parsing...% successful
% 0.19/0.43
% 0.19/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.43
% 0.19/0.43 % ------ Proving...
% 0.19/0.43 % ------ Problem Properties
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % EPR false
% 0.19/0.43 % Horn false
% 0.19/0.43 % Has equality false
% 0.19/0.43
% 0.19/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % % ------ Current options:
% 0.19/0.43
% 0.19/0.43 % ------ Input Options
% 0.19/0.43
% 0.19/0.43 % --out_options all
% 0.19/0.43 % --tptp_safe_out true
% 0.19/0.43 % --problem_path ""
% 0.19/0.43 % --include_path ""
% 0.19/0.43 % --clausifier .//eprover
% 0.19/0.43 % --clausifier_options --tstp-format
% 0.19/0.43 % --stdin false
% 0.19/0.43 % --dbg_backtrace false
% 0.19/0.43 % --dbg_dump_prop_clauses false
% 0.19/0.43 % --dbg_dump_prop_clauses_file -
% 0.19/0.43 % --dbg_out_stat false
% 0.19/0.43
% 0.19/0.43 % ------ General Options
% 0.19/0.43
% 0.19/0.43 % --fof false
% 0.19/0.43 % --time_out_real 150.
% 0.19/0.43 % --time_out_prep_mult 0.2
% 0.19/0.43 % --time_out_virtual -1.
% 0.19/0.43 % --schedule none
% 0.19/0.43 % --ground_splitting input
% 0.19/0.43 % --splitting_nvd 16
% 0.19/0.43 % --non_eq_to_eq false
% 0.19/0.43 % --prep_gs_sim true
% 0.19/0.43 % --prep_unflatten false
% 0.19/0.43 % --prep_res_sim true
% 0.19/0.43 % --prep_upred true
% 0.19/0.43 % --res_sim_input true
% 0.19/0.43 % --clause_weak_htbl true
% 0.19/0.43 % --gc_record_bc_elim false
% 0.19/0.43 % --symbol_type_check false
% 0.19/0.43 % --clausify_out false
% 0.19/0.43 % --large_theory_mode false
% 0.19/0.43 % --prep_sem_filter none
% 0.19/0.43 % --prep_sem_filter_out false
% 0.19/0.43 % --preprocessed_out false
% 0.19/0.43 % --sub_typing false
% 0.19/0.43 % --brand_transform false
% 0.19/0.43 % --pure_diseq_elim true
% 0.19/0.43 % --min_unsat_core false
% 0.19/0.43 % --pred_elim true
% 0.19/0.43 % --add_important_lit false
% 0.19/0.43 % --soft_assumptions false
% 0.19/0.43 % --reset_solvers false
% 0.19/0.43 % --bc_imp_inh []
% 0.19/0.43 % --conj_cone_tolerance 1.5
% 0.19/0.43 % --prolific_symb_bound 500
% 0.19/0.43 % --lt_threshold 2000
% 0.19/0.43
% 0.19/0.43 % ------ SAT Options
% 0.19/0.43
% 0.19/0.43 % --sat_mode false
% 0.19/0.43 % --sat_fm_restart_options ""
% 0.19/0.43 % --sat_gr_def false
% 0.19/0.43 % --sat_epr_types true
% 0.19/0.43 % --sat_non_cyclic_types false
% 0.19/0.43 % --sat_finite_models false
% 0.19/0.43 % --sat_fm_lemmas false
% 0.19/0.43 % --sat_fm_prep false
% 0.19/0.43 % --sat_fm_uc_incr true
% 0.19/0.43 % --sat_out_model small
% 0.19/0.43 % --sat_out_clauses false
% 0.19/0.43
% 0.19/0.43 % ------ QBF Options
% 0.19/0.43
% 0.19/0.43 % --qbf_mode false
% 0.19/0.43 % --qbf_elim_univ true
% 0.19/0.43 % --qbf_sk_in true
% 0.19/0.43 % --qbf_pred_elim true
% 0.19/0.43 % --qbf_split 32
% 0.19/0.43
% 0.19/0.43 % ------ BMC1 Options
% 0.19/0.43
% 0.19/0.43 % --bmc1_incremental false
% 0.19/0.43 % --bmc1_axioms reachable_all
% 0.19/0.43 % --bmc1_min_bound 0
% 0.19/0.43 % --bmc1_max_bound -1
% 0.19/0.43 % --bmc1_max_bound_default -1
% 0.19/0.43 % --bmc1_symbol_reachability true
% 0.19/0.43 % --bmc1_property_lemmas false
% 0.19/0.43 % --bmc1_k_induction false
% 0.19/0.43 % --bmc1_non_equiv_states false
% 0.19/0.43 % --bmc1_deadlock false
% 0.19/0.43 % --bmc1_ucm false
% 0.19/0.43 % --bmc1_add_unsat_core none
% 0.19/0.43 % --bmc1_unsat_core_children false
% 0.19/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.43 % --bmc1_out_stat full
% 0.19/0.43 % --bmc1_ground_init false
% 0.19/0.43 % --bmc1_pre_inst_next_state false
% 0.19/0.43 % --bmc1_pre_inst_state false
% 0.19/0.43 % --bmc1_pre_inst_reach_state false
% 0.19/0.43 % --bmc1_out_unsat_core false
% 0.19/0.43 % --bmc1_aig_witness_out false
% 0.19/0.43 % --bmc1_verbose false
% 0.19/0.43 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.43 % --bmc1_ucm_extend_mode 1
% 0.19/0.43 % --bmc1_ucm_init_mode 2
% 0.19/0.43 % --bmc1_ucm_cone_mode none
% 0.19/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.43 % --bmc1_ucm_relax_model 4
% 0.19/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.43 % --bmc1_ucm_layered_model none
% 0.19/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.43
% 0.19/0.43 % ------ AIG Options
% 0.19/0.43
% 0.19/0.43 % --aig_mode false
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation Options
% 0.19/0.43
% 0.19/0.43 % --instantiation_flag true
% 0.19/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43 % --inst_solver_per_active 750
% 0.19/0.43 % --inst_solver_calls_frac 0.5
% 0.19/0.43 % --inst_passive_queue_type priority_queues
% 0.19/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 0.19/0.43 % --inst_prop_sim_given true
% 0.19/0.45 % --inst_prop_sim_new false
% 0.19/0.45 % --inst_orphan_elimination true
% 0.19/0.45 % --inst_learning_loop_flag true
% 0.19/0.45 % --inst_learning_start 3000
% 0.19/0.45 % --inst_learning_factor 2
% 0.19/0.45 % --inst_start_prop_sim_after_learn 3
% 0.19/0.45 % --inst_sel_renew solver
% 0.19/0.45 % --inst_lit_activity_flag true
% 0.19/0.45 % --inst_out_proof true
% 0.19/0.45
% 0.19/0.45 % ------ Resolution Options
% 0.19/0.45
% 0.19/0.45 % --resolution_flag true
% 0.19/0.45 % --res_lit_sel kbo_max
% 0.19/0.45 % --res_to_prop_solver none
% 0.19/0.45 % --res_prop_simpl_new false
% 0.19/0.45 % --res_prop_simpl_given false
% 0.19/0.45 % --res_passive_queue_type priority_queues
% 0.19/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.45 % --res_passive_queues_freq [15;5]
% 0.19/0.45 % --res_forward_subs full
% 0.19/0.45 % --res_backward_subs full
% 0.19/0.45 % --res_forward_subs_resolution true
% 0.19/0.45 % --res_backward_subs_resolution true
% 0.19/0.45 % --res_orphan_elimination false
% 0.19/0.45 % --res_time_limit 1000.
% 0.19/0.45 % --res_out_proof true
% 0.19/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_abddc6.s
% 0.19/0.45 % --modulo true
% 0.19/0.45
% 0.19/0.45 % ------ Combination Options
% 0.19/0.45
% 0.19/0.45 % --comb_res_mult 1000
% 0.19/0.45 % --comb_inst_mult 300
% 0.19/0.45 % ------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 % ------ Proving...
% 0.19/0.45 %
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 % Resolution empty clause
% 0.19/0.45
% 0.19/0.45 % ------ Statistics
% 0.19/0.45
% 0.19/0.45 % ------ General
% 0.19/0.45
% 0.19/0.45 % num_of_input_clauses: 17
% 0.19/0.45 % num_of_input_neg_conjectures: 17
% 0.19/0.45 % num_of_splits: 0
% 0.19/0.45 % num_of_split_atoms: 0
% 0.19/0.45 % num_of_sem_filtered_clauses: 0
% 0.19/0.45 % num_of_subtypes: 0
% 0.19/0.45 % monotx_restored_types: 0
% 0.19/0.45 % sat_num_of_epr_types: 0
% 0.19/0.45 % sat_num_of_non_cyclic_types: 0
% 0.19/0.45 % sat_guarded_non_collapsed_types: 0
% 0.19/0.45 % is_epr: 0
% 0.19/0.45 % is_horn: 0
% 0.19/0.45 % has_eq: 0
% 0.19/0.45 % num_pure_diseq_elim: 0
% 0.19/0.45 % simp_replaced_by: 0
% 0.19/0.45 % res_preprocessed: 34
% 0.19/0.45 % prep_upred: 0
% 0.19/0.45 % prep_unflattend: 0
% 0.19/0.45 % pred_elim_cands: 0
% 0.19/0.45 % pred_elim: 0
% 0.19/0.45 % pred_elim_cl: 0
% 0.19/0.45 % pred_elim_cycles: 0
% 0.19/0.45 % forced_gc_time: 0
% 0.19/0.45 % gc_basic_clause_elim: 0
% 0.19/0.45 % parsing_time: 0.001
% 0.19/0.45 % sem_filter_time: 0.
% 0.19/0.45 % pred_elim_time: 0.
% 0.19/0.45 % out_proof_time: 0.007
% 0.19/0.45 % monotx_time: 0.
% 0.19/0.45 % subtype_inf_time: 0.
% 0.19/0.45 % unif_index_cands_time: 0.
% 0.19/0.45 % unif_index_add_time: 0.
% 0.19/0.45 % total_time: 0.039
% 0.19/0.45 % num_of_symbols: 28
% 0.19/0.45 % num_of_terms: 66
% 0.19/0.45
% 0.19/0.45 % ------ Propositional Solver
% 0.19/0.45
% 0.19/0.45 % prop_solver_calls: 1
% 0.19/0.45 % prop_fast_solver_calls: 141
% 0.19/0.45 % prop_num_of_clauses: 25
% 0.19/0.45 % prop_preprocess_simplified: 315
% 0.19/0.45 % prop_fo_subsumed: 0
% 0.19/0.45 % prop_solver_time: 0.
% 0.19/0.45 % prop_fast_solver_time: 0.
% 0.19/0.45 % prop_unsat_core_time: 0.
% 0.19/0.45
% 0.19/0.45 % ------ QBF
% 0.19/0.45
% 0.19/0.45 % qbf_q_res: 0
% 0.19/0.45 % qbf_num_tautologies: 0
% 0.19/0.45 % qbf_prep_cycles: 0
% 0.19/0.45
% 0.19/0.45 % ------ BMC1
% 0.19/0.45
% 0.19/0.45 % bmc1_current_bound: -1
% 0.19/0.45 % bmc1_last_solved_bound: -1
% 0.19/0.45 % bmc1_unsat_core_size: -1
% 0.19/0.45 % bmc1_unsat_core_parents_size: -1
% 0.19/0.45 % bmc1_merge_next_fun: 0
% 0.19/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.19/0.45
% 0.19/0.45 % ------ Instantiation
% 0.19/0.45
% 0.19/0.45 % inst_num_of_clauses: 17
% 0.19/0.45 % inst_num_in_passive: 0
% 0.19/0.45 % inst_num_in_active: 0
% 0.19/0.45 % inst_num_in_unprocessed: 17
% 0.19/0.45 % inst_num_of_loops: 0
% 0.19/0.45 % inst_num_of_learning_restarts: 0
% 0.19/0.45 % inst_num_moves_active_passive: 0
% 0.19/0.45 % inst_lit_activity: 0
% 0.19/0.45 % inst_lit_activity_moves: 0
% 0.19/0.45 % inst_num_tautologies: 0
% 0.19/0.45 % inst_num_prop_implied: 0
% 0.19/0.45 % inst_num_existing_simplified: 0
% 0.19/0.45 % inst_num_eq_res_simplified: 0
% 0.19/0.45 % inst_num_child_elim: 0
% 0.19/0.45 % inst_num_of_dismatching_blockings: 0
% 0.19/0.45 % inst_num_of_non_proper_insts: 0
% 0.19/0.45 % inst_num_of_duplicates: 0
% 0.19/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.19/0.45 % inst_dismatching_checking_time: 0.
% 0.19/0.45
% 0.19/0.45 % ------ Resolution
% 0.19/0.45
% 0.19/0.45 % res_num_of_clauses: 14
% 0.19/0.45 % res_num_in_passive: 16
% 0.19/0.45 % res_num_in_active: 10
% 0.19/0.45 % res_num_of_loops: 61
% 0.19/0.45 % res_forward_subset_subsumed: 64
% 0.19/0.45 % res_backward_subset_subsumed: 35
% 0.19/0.45 % res_forward_subsumed: 10
% 0.19/0.45 % res_backward_subsumed: 15
% 0.19/0.45 % res_forward_subsumption_resolution: 12
% 0.19/0.45 % res_backward_subsumption_resolution: 9
% 0.19/0.45 % res_clause_to_clause_subsumption: 331
% 0.19/0.45 % res_orphan_elimination: 0
% 0.19/0.45 % res_tautology_del: 21
% 0.19/0.45 % res_num_eq_res_simplified: 0
% 0.19/0.45 % res_num_sel_changes: 0
% 0.19/0.45 % res_moves_from_active_to_pass: 0
% 0.19/0.45
% 0.19/0.45 % Status Unsatisfiable
% 0.19/0.45 % SZS status Unsatisfiable
% 0.19/0.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------