TSTP Solution File: SYN555-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN555-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.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:29:54 EDT 2022
% Result : Unsatisfiable 0.45s 0.63s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 21
% Syntax : Number of formulae : 131 ( 69 unt; 0 def)
% Number of atoms : 273 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 297 ( 155 ~; 142 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 270 ( 0 sgn 84 !; 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,
! [X23,X24,X25] :
( p4(f5(c7,X25,X24),X24)
| ~ p4(f5(c7,X25,X23),X23)
| ~ p4(f5(c7,f6(X25,X23,X24),X23),f5(c7,f6(X25,X23,X24),X24)) ),
file('<stdin>',p4_12) ).
fof(c_0_1,negated_conjecture,
! [X17,X18,X19,X20,X21,X22] :
( p4(f5(X22,X21,X20),f5(X19,X18,X17))
| ~ p3(X21,X18)
| ~ p4(X20,X17)
| ~ p2(X22,X19) ),
file('<stdin>',p4_11) ).
fof(c_0_2,negated_conjecture,
! [X11,X12,X13,X14,X15,X16] :
( p3(f6(X14,X13,X12),f6(X11,X16,X15))
| ~ p4(X12,X15)
| ~ p4(X13,X16)
| ~ p3(X14,X11) ),
file('<stdin>',p3_10) ).
fof(c_0_3,negated_conjecture,
! [X4] : p4(f5(c7,X4,c8),f5(c7,X4,c9)),
file('<stdin>',p4_6) ).
fof(c_0_4,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
file('<stdin>',not_p4_5) ).
fof(c_0_5,negated_conjecture,
p4(f5(c7,c10,c9),c9),
file('<stdin>',p4_4) ).
fof(c_0_6,negated_conjecture,
! [X9,X10,X3] :
( p3(X10,X9)
| ~ p3(X3,X10)
| ~ p3(X3,X9) ),
file('<stdin>',p3_9) ).
fof(c_0_7,negated_conjecture,
! [X7,X8,X2] :
( p4(X8,X7)
| ~ p4(X2,X8)
| ~ p4(X2,X7) ),
file('<stdin>',p4_8) ).
fof(c_0_8,negated_conjecture,
! [X5,X6,X1] :
( p2(X6,X5)
| ~ p2(X1,X6)
| ~ p2(X1,X5) ),
file('<stdin>',p2_7) ).
fof(c_0_9,negated_conjecture,
! [X3] : p3(X3,X3),
file('<stdin>',p3_3) ).
fof(c_0_10,negated_conjecture,
! [X2] : p4(X2,X2),
file('<stdin>',p4_2) ).
fof(c_0_11,negated_conjecture,
! [X1] : p2(X1,X1),
file('<stdin>',p2_1) ).
fof(c_0_12,negated_conjecture,
! [X23,X24,X25] :
( p4(f5(c7,X25,X24),X24)
| ~ p4(f5(c7,X25,X23),X23)
| ~ p4(f5(c7,f6(X25,X23,X24),X23),f5(c7,f6(X25,X23,X24),X24)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_13,negated_conjecture,
! [X17,X18,X19,X20,X21,X22] :
( p4(f5(X22,X21,X20),f5(X19,X18,X17))
| ~ p3(X21,X18)
| ~ p4(X20,X17)
| ~ p2(X22,X19) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_14,negated_conjecture,
! [X11,X12,X13,X14,X15,X16] :
( p3(f6(X14,X13,X12),f6(X11,X16,X15))
| ~ p4(X12,X15)
| ~ p4(X13,X16)
| ~ p3(X14,X11) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_15,negated_conjecture,
! [X4] : p4(f5(c7,X4,c8),f5(c7,X4,c9)),
c_0_3 ).
fof(c_0_16,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_17,negated_conjecture,
p4(f5(c7,c10,c9),c9),
c_0_5 ).
fof(c_0_18,negated_conjecture,
! [X9,X10,X3] :
( p3(X10,X9)
| ~ p3(X3,X10)
| ~ p3(X3,X9) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_19,negated_conjecture,
! [X7,X8,X2] :
( p4(X8,X7)
| ~ p4(X2,X8)
| ~ p4(X2,X7) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_20,negated_conjecture,
! [X5,X6,X1] :
( p2(X6,X5)
| ~ p2(X1,X6)
| ~ p2(X1,X5) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_21,negated_conjecture,
! [X3] : p3(X3,X3),
c_0_9 ).
fof(c_0_22,negated_conjecture,
! [X2] : p4(X2,X2),
c_0_10 ).
fof(c_0_23,negated_conjecture,
! [X1] : p2(X1,X1),
c_0_11 ).
fof(c_0_24,negated_conjecture,
! [X26,X27,X28] :
( p4(f5(c7,X28,X27),X27)
| ~ p4(f5(c7,X28,X26),X26)
| ~ p4(f5(c7,f6(X28,X26,X27),X26),f5(c7,f6(X28,X26,X27),X27)) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_25,negated_conjecture,
! [X23,X24,X25,X26,X27,X28] :
( p4(f5(X28,X27,X26),f5(X25,X24,X23))
| ~ p3(X27,X24)
| ~ p4(X26,X23)
| ~ p2(X28,X25) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_26,negated_conjecture,
! [X17,X18,X19,X20,X21,X22] :
( p3(f6(X20,X19,X18),f6(X17,X22,X21))
| ~ p4(X18,X21)
| ~ p4(X19,X22)
| ~ p3(X20,X17) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_27,negated_conjecture,
! [X5] : p4(f5(c7,X5,c8),f5(c7,X5,c9)),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_28,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
c_0_16 ).
fof(c_0_29,negated_conjecture,
p4(f5(c7,c10,c9),c9),
c_0_17 ).
fof(c_0_30,negated_conjecture,
! [X11,X12,X13] :
( p3(X12,X11)
| ~ p3(X13,X12)
| ~ p3(X13,X11) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_18])])]) ).
fof(c_0_31,negated_conjecture,
! [X9,X10,X11] :
( p4(X10,X9)
| ~ p4(X11,X10)
| ~ p4(X11,X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_19])])]) ).
fof(c_0_32,negated_conjecture,
! [X7,X8,X9] :
( p2(X8,X7)
| ~ p2(X9,X8)
| ~ p2(X9,X7) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_20])])]) ).
fof(c_0_33,negated_conjecture,
! [X4] : p3(X4,X4),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_34,negated_conjecture,
! [X3] : p4(X3,X3),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_35,negated_conjecture,
! [X2] : p2(X2,X2),
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_36,negated_conjecture,
( p4(f5(c7,X1,X3),X3)
| ~ p4(f5(c7,f6(X1,X2,X3),X2),f5(c7,f6(X1,X2,X3),X3))
| ~ p4(f5(c7,X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,negated_conjecture,
( p4(f5(X1,X5,X3),f5(X2,X6,X4))
| ~ p2(X1,X2)
| ~ p4(X3,X4)
| ~ p3(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,negated_conjecture,
( p3(f6(X1,X3,X5),f6(X2,X4,X6))
| ~ p3(X1,X2)
| ~ p4(X3,X4)
| ~ p4(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,negated_conjecture,
p4(f5(c7,X1,c8),f5(c7,X1,c9)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,negated_conjecture,
p4(f5(c7,c10,c9),c9),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,negated_conjecture,
( p4(X3,X2)
| ~ p4(X1,X2)
| ~ p4(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,negated_conjecture,
p3(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_46,negated_conjecture,
p4(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_48,negated_conjecture,
( p4(f5(c7,X1,X3),X3)
| ~ p4(f5(c7,f6(X1,X2,X3),X2),f5(c7,f6(X1,X2,X3),X3))
| ~ p4(f5(c7,X1,X2),X2) ),
c_0_36,
[final] ).
cnf(c_0_49,negated_conjecture,
( p4(f5(X1,X5,X3),f5(X2,X6,X4))
| ~ p2(X1,X2)
| ~ p4(X3,X4)
| ~ p3(X5,X6) ),
c_0_37,
[final] ).
cnf(c_0_50,negated_conjecture,
( p3(f6(X1,X3,X5),f6(X2,X4,X6))
| ~ p3(X1,X2)
| ~ p4(X3,X4)
| ~ p4(X5,X6) ),
c_0_38,
[final] ).
cnf(c_0_51,negated_conjecture,
p4(f5(c7,X1,c8),f5(c7,X1,c9)),
c_0_39,
[final] ).
cnf(c_0_52,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
c_0_40,
[final] ).
cnf(c_0_53,negated_conjecture,
p4(f5(c7,c10,c9),c9),
c_0_41,
[final] ).
cnf(c_0_54,negated_conjecture,
( p3(X3,X2)
| ~ p3(X1,X2)
| ~ p3(X1,X3) ),
c_0_42,
[final] ).
cnf(c_0_55,negated_conjecture,
( p4(X3,X2)
| ~ p4(X1,X2)
| ~ p4(X1,X3) ),
c_0_43,
[final] ).
cnf(c_0_56,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X1,X3) ),
c_0_44,
[final] ).
cnf(c_0_57,negated_conjecture,
p3(X1,X1),
c_0_45,
[final] ).
cnf(c_0_58,negated_conjecture,
p4(X1,X1),
c_0_46,
[final] ).
cnf(c_0_59,negated_conjecture,
p2(X1,X1),
c_0_47,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_4,negated_conjecture,
( ~ p4(X0,X1)
| ~ p4(X0,X2)
| p4(X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_55) ).
cnf(c_26,negated_conjecture,
( ~ p4(X0,X1)
| ~ p4(X0,X2)
| p4(X1,X2) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_70,negated_conjecture,
( ~ p4(X0,X1)
| ~ p4(X0,X2)
| p4(X1,X2) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_85,negated_conjecture,
( ~ p4(X0,X1)
| ~ p4(X0,X2)
| p4(X1,X2) ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_94,negated_conjecture,
( ~ p4(X0,X1)
| ~ p4(X0,X2)
| p4(X1,X2) ),
inference(copy,[status(esa)],[c_85]) ).
cnf(c_122,negated_conjecture,
( ~ p4(X0,X1)
| ~ p4(X0,X2)
| p4(X1,X2) ),
inference(copy,[status(esa)],[c_94]) ).
cnf(c_7,negated_conjecture,
p4(f5(c7,X0,c8),f5(c7,X0,c9)),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_51) ).
cnf(c_32,negated_conjecture,
p4(f5(c7,X0,c8),f5(c7,X0,c9)),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_73,negated_conjecture,
p4(f5(c7,X0,c8),f5(c7,X0,c9)),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_82,negated_conjecture,
p4(f5(c7,X0,c8),f5(c7,X0,c9)),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_97,negated_conjecture,
p4(f5(c7,X0,c8),f5(c7,X0,c9)),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_128,plain,
p4(f5(c7,X0,c8),f5(c7,X0,c9)),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_164,plain,
( ~ p4(f5(c7,X0,c8),X1)
| p4(X1,f5(c7,X0,c9)) ),
inference(resolution,[status(thm)],[c_122,c_128]) ).
cnf(c_165,plain,
( ~ p4(f5(c7,X0,c8),X1)
| p4(X1,f5(c7,X0,c9)) ),
inference(rewriting,[status(thm)],[c_164]) ).
cnf(c_1,negated_conjecture,
( p4(f5(X0,X1,X2),f5(X3,X4,X5))
| ~ p4(X2,X5)
| ~ p2(X0,X3)
| ~ p3(X1,X4) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_49) ).
cnf(c_20,negated_conjecture,
( p4(f5(X0,X1,X2),f5(X3,X4,X5))
| ~ p4(X2,X5)
| ~ p2(X0,X3)
| ~ p3(X1,X4) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_67,negated_conjecture,
( p4(f5(X0,X1,X2),f5(X3,X4,X5))
| ~ p4(X2,X5)
| ~ p2(X0,X3)
| ~ p3(X1,X4) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_88,negated_conjecture,
( p4(f5(X0,X1,X2),f5(X3,X4,X5))
| ~ p4(X2,X5)
| ~ p2(X0,X3)
| ~ p3(X1,X4) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_91,negated_conjecture,
( p4(f5(X0,X1,X2),f5(X3,X4,X5))
| ~ p4(X2,X5)
| ~ p2(X0,X3)
| ~ p3(X1,X4) ),
inference(copy,[status(esa)],[c_88]) ).
cnf(c_116,negated_conjecture,
( p4(f5(X0,X1,X2),f5(X3,X4,X5))
| ~ p4(X2,X5)
| ~ p2(X0,X3)
| ~ p3(X1,X4) ),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_256,plain,
( p4(f5(X0,X1,X2),f5(c7,X3,c9))
| ~ p4(c8,X2)
| ~ p2(c7,X0)
| ~ p3(X3,X1) ),
inference(resolution,[status(thm)],[c_165,c_116]) ).
cnf(c_257,plain,
( p4(f5(X0,X1,X2),f5(c7,X3,c9))
| ~ p4(c8,X2)
| ~ p2(c7,X0)
| ~ p3(X3,X1) ),
inference(rewriting,[status(thm)],[c_256]) ).
cnf(c_10,negated_conjecture,
p4(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_58) ).
cnf(c_38,negated_conjecture,
p4(X0,X0),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_76,negated_conjecture,
p4(X0,X0),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_79,negated_conjecture,
p4(X0,X0),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_100,negated_conjecture,
p4(X0,X0),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_134,plain,
p4(X0,X0),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_168,plain,
( ~ p4(X0,X1)
| p4(X1,X0) ),
inference(resolution,[status(thm)],[c_122,c_134]) ).
cnf(c_169,plain,
( ~ p4(X0,X1)
| p4(X1,X0) ),
inference(rewriting,[status(thm)],[c_168]) ).
cnf(c_485,plain,
( p4(f5(c7,X0,c9),f5(X1,X2,X3))
| ~ p4(c8,X3)
| ~ p2(c7,X1)
| ~ p3(X0,X2) ),
inference(resolution,[status(thm)],[c_257,c_169]) ).
cnf(c_486,plain,
( p4(f5(c7,X0,c9),f5(X1,X2,X3))
| ~ p4(c8,X3)
| ~ p2(c7,X1)
| ~ p3(X0,X2) ),
inference(rewriting,[status(thm)],[c_485]) ).
cnf(c_0,negated_conjecture,
( ~ p4(f5(c7,f6(X0,X1,X2),X1),f5(c7,f6(X0,X1,X2),X2))
| ~ p4(f5(c7,X0,X1),X1)
| p4(f5(c7,X0,X2),X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_48) ).
cnf(c_18,negated_conjecture,
( ~ p4(f5(c7,f6(X0,X1,X2),X1),f5(c7,f6(X0,X1,X2),X2))
| ~ p4(f5(c7,X0,X1),X1)
| p4(f5(c7,X0,X2),X2) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_66,negated_conjecture,
( ~ p4(f5(c7,f6(X0,X1,X2),X1),f5(c7,f6(X0,X1,X2),X2))
| ~ p4(f5(c7,X0,X1),X1)
| p4(f5(c7,X0,X2),X2) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_89,negated_conjecture,
( ~ p4(f5(c7,f6(X0,X1,X2),X1),f5(c7,f6(X0,X1,X2),X2))
| ~ p4(f5(c7,X0,X1),X1)
| p4(f5(c7,X0,X2),X2) ),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_90,negated_conjecture,
( ~ p4(f5(c7,f6(X0,X1,X2),X1),f5(c7,f6(X0,X1,X2),X2))
| ~ p4(f5(c7,X0,X1),X1)
| p4(f5(c7,X0,X2),X2) ),
inference(copy,[status(esa)],[c_89]) ).
cnf(c_114,negated_conjecture,
( ~ p4(f5(c7,f6(X0,X1,X2),X1),f5(c7,f6(X0,X1,X2),X2))
| ~ p4(f5(c7,X0,X1),X1)
| p4(f5(c7,X0,X2),X2) ),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_5146,plain,
( ~ p4(f5(c7,X0,c9),c9)
| p4(f5(c7,X0,X1),X1)
| ~ p4(c8,X1)
| ~ p2(c7,c7)
| ~ p3(f6(X0,c9,X1),f6(X0,c9,X1)) ),
inference(resolution,[status(thm)],[c_486,c_114]) ).
cnf(c_5147,plain,
( ~ p4(f5(c7,X0,c9),c9)
| p4(f5(c7,X0,X1),X1)
| ~ p4(c8,X1)
| ~ p2(c7,c7)
| ~ p3(f6(X0,c9,X1),f6(X0,c9,X1)) ),
inference(rewriting,[status(thm)],[c_5146]) ).
cnf(c_9,negated_conjecture,
p3(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_57) ).
cnf(c_36,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_75,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_80,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_99,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_132,negated_conjecture,
p3(X0,X0),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_11,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_59) ).
cnf(c_40,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_77,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_78,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_101,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_136,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_6073,plain,
( ~ p4(f5(c7,X0,c9),c9)
| p4(f5(c7,X0,X1),X1)
| ~ p4(c8,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5147,c_132,c_136]) ).
cnf(c_6074,plain,
( ~ p4(f5(c7,X0,c9),c9)
| p4(f5(c7,X0,X1),X1)
| ~ p4(c8,X1) ),
inference(rewriting,[status(thm)],[c_6073]) ).
cnf(c_8,negated_conjecture,
p4(f5(c7,c10,c9),c9),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_53) ).
cnf(c_34,negated_conjecture,
p4(f5(c7,c10,c9),c9),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_74,negated_conjecture,
p4(f5(c7,c10,c9),c9),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_81,negated_conjecture,
p4(f5(c7,c10,c9),c9),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_98,negated_conjecture,
p4(f5(c7,c10,c9),c9),
inference(copy,[status(esa)],[c_81]) ).
cnf(c_130,plain,
p4(f5(c7,c10,c9),c9),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_6078,plain,
( p4(f5(c7,c10,X0),X0)
| ~ p4(c8,X0) ),
inference(resolution,[status(thm)],[c_6074,c_130]) ).
cnf(c_6079,plain,
( p4(f5(c7,c10,X0),X0)
| ~ p4(c8,X0) ),
inference(rewriting,[status(thm)],[c_6078]) ).
cnf(c_6,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
file('/export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p',c_0_52) ).
cnf(c_30,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_72,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_83,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_96,negated_conjecture,
~ p4(f5(c7,c10,c8),c8),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_126,plain,
~ p4(f5(c7,c10,c8),c8),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_6220,plain,
~ p4(c8,c8),
inference(resolution,[status(thm)],[c_6079,c_126]) ).
cnf(c_6221,plain,
~ p4(c8,c8),
inference(rewriting,[status(thm)],[c_6220]) ).
cnf(c_7725,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6221,c_134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN555-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 12 08:53:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % Orientation found
% 0.21/0.41 % 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_4dd3a2.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9b7ecc.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_06a6e4 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4dd3a2.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...% successful
% 0.21/0.44
% 0.21/0.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % ------ Problem Properties
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % EPR false
% 0.21/0.44 % Horn true
% 0.21/0.44 % Has equality false
% 0.21/0.44
% 0.21/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % % ------ Current options:
% 0.21/0.44
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.45/0.63 % --inst_prop_sim_new false
% 0.45/0.63 % --inst_orphan_elimination true
% 0.45/0.63 % --inst_learning_loop_flag true
% 0.45/0.63 % --inst_learning_start 3000
% 0.45/0.63 % --inst_learning_factor 2
% 0.45/0.63 % --inst_start_prop_sim_after_learn 3
% 0.45/0.63 % --inst_sel_renew solver
% 0.45/0.63 % --inst_lit_activity_flag true
% 0.45/0.63 % --inst_out_proof true
% 0.45/0.63
% 0.45/0.63 % ------ Resolution Options
% 0.45/0.63
% 0.45/0.63 % --resolution_flag true
% 0.45/0.63 % --res_lit_sel kbo_max
% 0.45/0.63 % --res_to_prop_solver none
% 0.45/0.63 % --res_prop_simpl_new false
% 0.45/0.63 % --res_prop_simpl_given false
% 0.45/0.63 % --res_passive_queue_type priority_queues
% 0.45/0.63 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.45/0.63 % --res_passive_queues_freq [15;5]
% 0.45/0.63 % --res_forward_subs full
% 0.45/0.63 % --res_backward_subs full
% 0.45/0.63 % --res_forward_subs_resolution true
% 0.45/0.63 % --res_backward_subs_resolution true
% 0.45/0.63 % --res_orphan_elimination false
% 0.45/0.63 % --res_time_limit 1000.
% 0.45/0.63 % --res_out_proof true
% 0.45/0.63 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4dd3a2.s
% 0.45/0.63 % --modulo true
% 0.45/0.63
% 0.45/0.63 % ------ Combination Options
% 0.45/0.63
% 0.45/0.63 % --comb_res_mult 1000
% 0.45/0.63 % --comb_inst_mult 300
% 0.45/0.63 % ------
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 % ------ Proving...
% 0.45/0.63 %
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 % Resolution empty clause
% 0.45/0.63
% 0.45/0.63 % ------ Statistics
% 0.45/0.63
% 0.45/0.63 % ------ General
% 0.45/0.63
% 0.45/0.63 % num_of_input_clauses: 12
% 0.45/0.63 % num_of_input_neg_conjectures: 12
% 0.45/0.63 % num_of_splits: 0
% 0.45/0.63 % num_of_split_atoms: 0
% 0.45/0.63 % num_of_sem_filtered_clauses: 0
% 0.45/0.63 % num_of_subtypes: 0
% 0.45/0.63 % monotx_restored_types: 0
% 0.45/0.63 % sat_num_of_epr_types: 0
% 0.45/0.63 % sat_num_of_non_cyclic_types: 0
% 0.45/0.63 % sat_guarded_non_collapsed_types: 0
% 0.45/0.63 % is_epr: 0
% 0.45/0.63 % is_horn: 1
% 0.45/0.63 % has_eq: 0
% 0.45/0.63 % num_pure_diseq_elim: 0
% 0.45/0.63 % simp_replaced_by: 0
% 0.45/0.63 % res_preprocessed: 24
% 0.45/0.63 % prep_upred: 0
% 0.45/0.63 % prep_unflattend: 0
% 0.45/0.63 % pred_elim_cands: 0
% 0.45/0.63 % pred_elim: 0
% 0.45/0.63 % pred_elim_cl: 0
% 0.45/0.63 % pred_elim_cycles: 0
% 0.45/0.63 % forced_gc_time: 0
% 0.45/0.63 % gc_basic_clause_elim: 0
% 0.45/0.63 % parsing_time: 0.
% 0.45/0.63 % sem_filter_time: 0.
% 0.45/0.63 % pred_elim_time: 0.
% 0.45/0.63 % out_proof_time: 0.001
% 0.45/0.63 % monotx_time: 0.
% 0.45/0.63 % subtype_inf_time: 0.
% 0.45/0.63 % unif_index_cands_time: 0.001
% 0.45/0.63 % unif_index_add_time: 0.
% 0.45/0.63 % total_time: 0.207
% 0.45/0.63 % num_of_symbols: 34
% 0.45/0.63 % num_of_terms: 2320
% 0.45/0.63
% 0.45/0.63 % ------ Propositional Solver
% 0.45/0.63
% 0.45/0.63 % prop_solver_calls: 1
% 0.45/0.63 % prop_fast_solver_calls: 78
% 0.45/0.63 % prop_num_of_clauses: 18
% 0.45/0.63 % prop_preprocess_simplified: 202
% 0.45/0.63 % prop_fo_subsumed: 0
% 0.45/0.63 % prop_solver_time: 0.
% 0.45/0.63 % prop_fast_solver_time: 0.
% 0.45/0.63 % prop_unsat_core_time: 0.
% 0.45/0.63
% 0.45/0.63 % ------ QBF
% 0.45/0.63
% 0.45/0.63 % qbf_q_res: 0
% 0.45/0.63 % qbf_num_tautologies: 0
% 0.45/0.63 % qbf_prep_cycles: 0
% 0.45/0.63
% 0.45/0.63 % ------ BMC1
% 0.45/0.63
% 0.45/0.63 % bmc1_current_bound: -1
% 0.45/0.63 % bmc1_last_solved_bound: -1
% 0.45/0.63 % bmc1_unsat_core_size: -1
% 0.45/0.63 % bmc1_unsat_core_parents_size: -1
% 0.45/0.63 % bmc1_merge_next_fun: 0
% 0.45/0.63 % bmc1_unsat_core_clauses_time: 0.
% 0.45/0.63
% 0.45/0.63 % ------ Instantiation
% 0.45/0.63
% 0.45/0.63 % inst_num_of_clauses: 12
% 0.45/0.63 % inst_num_in_passive: 0
% 0.45/0.63 % inst_num_in_active: 0
% 0.45/0.63 % inst_num_in_unprocessed: 12
% 0.45/0.63 % inst_num_of_loops: 0
% 0.45/0.63 % inst_num_of_learning_restarts: 0
% 0.45/0.63 % inst_num_moves_active_passive: 0
% 0.45/0.63 % inst_lit_activity: 0
% 0.45/0.63 % inst_lit_activity_moves: 0
% 0.45/0.63 % inst_num_tautologies: 0
% 0.45/0.63 % inst_num_prop_implied: 0
% 0.45/0.63 % inst_num_existing_simplified: 0
% 0.45/0.63 % inst_num_eq_res_simplified: 0
% 0.45/0.63 % inst_num_child_elim: 0
% 0.45/0.63 % inst_num_of_dismatching_blockings: 0
% 0.45/0.63 % inst_num_of_non_proper_insts: 0
% 0.45/0.63 % inst_num_of_duplicates: 0
% 0.45/0.63 % inst_inst_num_from_inst_to_res: 0
% 0.45/0.63 % inst_dismatching_checking_time: 0.
% 0.45/0.63
% 0.45/0.63 % ------ Resolution
% 0.45/0.63
% 0.45/0.63 % res_num_of_clauses: 2280
% 0.45/0.63 % res_num_in_passive: 2096
% 0.45/0.63 % res_num_in_active: 191
% 0.45/0.63 % res_num_of_loops: 217
% 0.45/0.63 % res_forward_subset_subsumed: 581
% 0.45/0.63 % res_backward_subset_subsumed: 9
% 0.45/0.63 % res_forward_subsumed: 20
% 0.45/0.63 % res_backward_subsumed: 3
% 0.45/0.63 % res_forward_subsumption_resolution: 24
% 0.45/0.63 % res_backward_subsumption_resolution: 0
% 0.45/0.63 % res_clause_to_clause_subsumption: 3886
% 0.45/0.63 % res_orphan_elimination: 0
% 0.45/0.63 % res_tautology_del: 118
% 0.45/0.63 % res_num_eq_res_simplified: 0
% 0.45/0.63 % res_num_sel_changes: 0
% 0.45/0.63 % res_moves_from_active_to_pass: 0
% 0.45/0.63
% 0.45/0.63 % Status Unsatisfiable
% 0.45/0.63 % SZS status Unsatisfiable
% 0.45/0.63 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------