TSTP Solution File: LCL672+1.001 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LCL672+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n003.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 : Sun Jul 17 11:38:06 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
fof(transitivity,axiom,
! [X,Y,Z] :
( ( r1(X,Y)
& r1(Y,Z) )
=> r1(X,Z) ),
input ).
fof(transitivity_0,plain,
! [X,Y,Z] :
( r1(X,Z)
| ~ ( r1(X,Y)
& r1(Y,Z) ) ),
inference(orientation,[status(thm)],[transitivity]) ).
fof(reflexivity,axiom,
! [X] : r1(X,X),
input ).
fof(reflexivity_0,plain,
! [X] :
( r1(X,X)
| $false ),
inference(orientation,[status(thm)],[reflexivity]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> r1(X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Z,X] :
( lhs_atom2(Z,X)
<=> r1(X,Z) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X,Y,Z] :
( lhs_atom2(Z,X)
| ~ ( r1(X,Y)
& r1(Y,Z) ) ),
inference(fold_definition,[status(thm)],[transitivity_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( r1(X1,X3)
& r1(X3,X2) ) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_2,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( r1(X1,X3)
& r1(X3,X2) ) ),
c_0_0 ).
fof(c_0_3,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( lhs_atom2(X4,X6)
| ~ r1(X6,X5)
| ~ r1(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_5,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( lhs_atom2(X2,X3)
| ~ r1(X1,X2)
| ~ r1(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( lhs_atom2(X2,X3)
| ~ r1(X1,X2)
| ~ r1(X3,X1) ),
c_0_6,
[final] ).
cnf(c_0_9,plain,
lhs_atom1(X1),
c_0_7,
[final] ).
% End CNF derivation
cnf(c_0_8_0,axiom,
( r1(X3,X2)
| ~ r1(X1,X2)
| ~ r1(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_8,def_lhs_atom2]) ).
cnf(c_0_9_0,axiom,
r1(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_9,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
~ ? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ $true ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
file('<stdin>',main) ).
fof(c_0_1_002,negated_conjecture,
~ ~ ? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] : ~ r1(X2,X1) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_0])]) ).
fof(c_0_2_003,negated_conjecture,
! [X4,X5,X6,X8,X9,X10,X11,X12,X14,X15,X16,X17,X18,X20,X21,X23,X24,X25,X27,X31] :
( ( r1(X6,esk2_2(X5,X6))
| ~ r1(X5,X6)
| ~ p1(X5)
| ~ r1(esk1_0,X5)
| ~ r1(esk1_0,X8)
| p1(X8)
| ~ r1(esk1_0,X4)
| p2(X4) )
& ( p1(esk2_2(X5,X6))
| ~ r1(X5,X6)
| ~ p1(X5)
| ~ r1(esk1_0,X5)
| ~ r1(esk1_0,X8)
| p1(X8)
| ~ r1(esk1_0,X4)
| p2(X4) )
& ( r1(X12,esk3_3(X10,X11,X12))
| ~ r1(X11,X12)
| ~ r1(X11,X14)
| p1(X14)
| ~ r1(X10,X11)
| ~ r1(esk1_0,X10)
| ~ r1(esk1_0,X15)
| p1(X15)
| ~ r1(esk1_0,X9)
| p2(X9) )
& ( ~ p1(esk3_3(X10,X11,X12))
| ~ r1(X11,X12)
| ~ r1(X11,X14)
| p1(X14)
| ~ r1(X10,X11)
| ~ r1(esk1_0,X10)
| ~ r1(esk1_0,X15)
| p1(X15)
| ~ r1(esk1_0,X9)
| p2(X9) )
& ( r1(X21,esk5_2(X17,X21))
| ~ r1(X17,X21)
| r1(X18,esk4_2(X17,X18))
| ~ r1(X17,X18)
| ~ r1(esk1_0,X17)
| ~ r1(esk1_0,X23)
| p1(X23)
| ~ r1(esk1_0,X16)
| p2(X16) )
& ( ~ p1(esk5_2(X17,X21))
| ~ r1(X17,X21)
| r1(X18,esk4_2(X17,X18))
| ~ r1(X17,X18)
| ~ r1(esk1_0,X17)
| ~ r1(esk1_0,X23)
| p1(X23)
| ~ r1(esk1_0,X16)
| p2(X16) )
& ( r1(X21,esk5_2(X17,X21))
| ~ r1(X17,X21)
| ~ r1(esk4_2(X17,X18),X20)
| p1(X20)
| ~ r1(X17,X18)
| ~ r1(esk1_0,X17)
| ~ r1(esk1_0,X23)
| p1(X23)
| ~ r1(esk1_0,X16)
| p2(X16) )
& ( ~ p1(esk5_2(X17,X21))
| ~ r1(X17,X21)
| ~ r1(esk4_2(X17,X18),X20)
| p1(X20)
| ~ r1(X17,X18)
| ~ r1(esk1_0,X17)
| ~ r1(esk1_0,X23)
| p1(X23)
| ~ r1(esk1_0,X16)
| p2(X16) )
& ( ~ r1(esk1_0,X24)
| p2(X24)
| ~ r1(esk1_0,X25)
| r1(X25,esk6_1(X25))
| ~ r1(esk1_0,X27)
| p1(X27) )
& r1(esk1_0,esk7_0)
& ~ p2(esk7_0)
& r1(esk1_0,esk8_0)
& r1(esk8_0,esk9_0)
& ( ~ r1(esk9_0,X31)
| p1(X31) )
& r1(esk8_0,esk10_0)
& ~ p1(esk10_0)
& r1(esk1_0,esk11_0)
& ~ p1(esk11_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3_004,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X5)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X5)
| ~ r1(X4,X6)
| ~ p1(esk3_3(X3,X4,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X5)
| r1(X6,esk3_3(X3,X4,X6))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X5)
| ~ r1(X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X5)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(esk4_2(X3,X4),X5)
| ~ r1(X3,X6)
| ~ p1(esk5_2(X3,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X5)
| r1(X6,esk5_2(X3,X6))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(esk4_2(X3,X4),X5)
| ~ r1(X3,X6) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
( p2(X1)
| p1(X2)
| r1(X4,esk4_2(X3,X4))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X3,X5)
| ~ p1(esk5_2(X3,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
( p2(X1)
| p1(X2)
| r1(X4,esk4_2(X3,X4))
| r1(X5,esk5_2(X3,X5))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9_010,negated_conjecture,
( p2(X1)
| p1(X2)
| r1(X4,esk2_2(X3,X4))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ p1(X3)
| ~ r1(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(esk2_2(X3,X4))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ p1(X3)
| ~ r1(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( p1(X1)
| r1(X2,esk6_1(X2))
| p2(X3)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( p1(X1)
| ~ r1(esk9_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
r1(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
r1(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
r1(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
r1(esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
r1(esk1_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
~ p2(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
~ p1(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_20,negated_conjecture,
~ p1(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_21,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X5)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X5)
| ~ r1(X4,X6)
| ~ p1(esk3_3(X3,X4,X6)) ),
c_0_3,
[final] ).
cnf(c_0_22,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X5)
| r1(X6,esk3_3(X3,X4,X6))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X5)
| ~ r1(X4,X6) ),
c_0_4,
[final] ).
cnf(c_0_23,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X5)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(esk4_2(X3,X4),X5)
| ~ r1(X3,X6)
| ~ p1(esk5_2(X3,X6)) ),
c_0_5,
[final] ).
cnf(c_0_24,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X5)
| r1(X6,esk5_2(X3,X6))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(esk4_2(X3,X4),X5)
| ~ r1(X3,X6) ),
c_0_6,
[final] ).
cnf(c_0_25,negated_conjecture,
( p2(X1)
| p1(X2)
| r1(X4,esk4_2(X3,X4))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X3,X5)
| ~ p1(esk5_2(X3,X5)) ),
c_0_7,
[final] ).
cnf(c_0_26,negated_conjecture,
( p2(X1)
| p1(X2)
| r1(X4,esk4_2(X3,X4))
| r1(X5,esk5_2(X3,X5))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X3,X5) ),
c_0_8,
[final] ).
cnf(c_0_27,negated_conjecture,
( p2(X1)
| p1(X2)
| r1(X4,esk2_2(X3,X4))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ p1(X3)
| ~ r1(X3,X4) ),
c_0_9,
[final] ).
cnf(c_0_28,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(esk2_2(X3,X4))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ p1(X3)
| ~ r1(X3,X4) ),
c_0_10,
[final] ).
cnf(c_0_29,negated_conjecture,
( p1(X1)
| r1(X2,esk6_1(X2))
| p2(X3)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3) ),
c_0_11,
[final] ).
cnf(c_0_30,negated_conjecture,
( p1(X1)
| ~ r1(esk9_0,X1) ),
c_0_12,
[final] ).
cnf(c_0_31,negated_conjecture,
r1(esk1_0,esk7_0),
c_0_13,
[final] ).
cnf(c_0_32,negated_conjecture,
r1(esk1_0,esk8_0),
c_0_14,
[final] ).
cnf(c_0_33,negated_conjecture,
r1(esk8_0,esk9_0),
c_0_15,
[final] ).
cnf(c_0_34,negated_conjecture,
r1(esk8_0,esk10_0),
c_0_16,
[final] ).
cnf(c_0_35,negated_conjecture,
r1(esk1_0,esk11_0),
c_0_17,
[final] ).
cnf(c_0_36,negated_conjecture,
~ p2(esk7_0),
c_0_18,
[final] ).
cnf(c_0_37,negated_conjecture,
~ p1(esk10_0),
c_0_19,
[final] ).
cnf(c_0_38,negated_conjecture,
~ p1(esk11_0),
c_0_20,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| ~ r1(sk3_esk1_0,X2)
| r1(X3,sk3_esk3_3(X0,X4,X3))
| ~ r1(X4,X3)
| ~ r1(X4,X5)
| ~ r1(X0,X4)
| p2(X2)
| p1(X5)
| p1(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_22) ).
cnf(c_96,negated_conjecture,
( sP1_iProver_split
| sP2_iProver_split
| sP9_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP9_iProver_split,sP1_iProver_split,sP2_iProver_split])],[c_3]) ).
cnf(c_126,negated_conjecture,
( sP1_iProver_split
| sP2_iProver_split
| sP9_iProver_split ),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_318,negated_conjecture,
( sP1_iProver_split
| sP2_iProver_split
| sP9_iProver_split ),
inference(copy,[status(esa)],[c_126]) ).
cnf(c_323,negated_conjecture,
( sP1_iProver_split
| sP2_iProver_split
| sP9_iProver_split ),
inference(copy,[status(esa)],[c_318]) ).
cnf(c_59,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| ~ sP9_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP9_iProver_split])],[c_3]) ).
cnf(c_95,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| ~ sP9_iProver_split ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_124,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| ~ sP9_iProver_split ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_317,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| ~ sP9_iProver_split ),
inference(copy,[status(esa)],[c_124]) ).
cnf(c_324,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| ~ sP9_iProver_split ),
inference(copy,[status(esa)],[c_317]) ).
cnf(c_526,plain,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| sP1_iProver_split
| sP2_iProver_split ),
inference(resolution,[status(thm)],[c_323,c_324]) ).
cnf(c_552,plain,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_526]) ).
cnf(c_561,plain,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_552]) ).
cnf(c_1257,plain,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_561]) ).
cnf(c_1310,plain,
( ~ r1(sk3_esk1_0,X0)
| r1(X1,sk3_esk3_3(X0,X2,X1))
| ~ r1(X2,X3)
| ~ r1(X2,X1)
| ~ r1(X0,X2)
| p1(X3)
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_1257]) ).
cnf(c_18,negated_conjecture,
r1(sk3_esk8_0,sk3_esk10_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_34) ).
cnf(c_198,negated_conjecture,
r1(sk3_esk8_0,sk3_esk10_0),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_299,negated_conjecture,
r1(sk3_esk8_0,sk3_esk10_0),
inference(copy,[status(esa)],[c_198]) ).
cnf(c_342,negated_conjecture,
r1(sk3_esk8_0,sk3_esk10_0),
inference(copy,[status(esa)],[c_299]) ).
cnf(c_1263,negated_conjecture,
r1(sk3_esk8_0,sk3_esk10_0),
inference(copy,[status(esa)],[c_342]) ).
cnf(c_1322,negated_conjecture,
r1(sk3_esk8_0,sk3_esk10_0),
inference(copy,[status(esa)],[c_1263]) ).
cnf(c_1518,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| r1(X1,sk3_esk3_3(X0,sk3_esk8_0,X1))
| ~ r1(X0,sk3_esk8_0)
| p1(sk3_esk10_0)
| sP1_iProver_split
| sP2_iProver_split ),
inference(resolution,[status(thm)],[c_1310,c_1322]) ).
cnf(c_1519,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| r1(X1,sk3_esk3_3(X0,sk3_esk8_0,X1))
| ~ r1(X0,sk3_esk8_0)
| p1(sk3_esk10_0)
| sP1_iProver_split
| sP2_iProver_split ),
inference(rewriting,[status(thm)],[c_1518]) ).
cnf(c_10,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| ~ r1(sk3_esk1_0,X2)
| r1(X1,sk3_esk6_1(X1))
| p2(X0)
| p1(X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_29) ).
cnf(c_31,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p2(X0)
| ~ sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_10]) ).
cnf(c_97,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p2(X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_31]) ).
cnf(c_112,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p2(X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_97]) ).
cnf(c_303,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p2(X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_112]) ).
cnf(c_338,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p2(X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_303]) ).
cnf(c_1269,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p2(X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_338]) ).
cnf(c_1334,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p2(X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_1269]) ).
cnf(c_15,negated_conjecture,
r1(sk3_esk1_0,sk3_esk7_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_31) ).
cnf(c_192,negated_conjecture,
r1(sk3_esk1_0,sk3_esk7_0),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_296,negated_conjecture,
r1(sk3_esk1_0,sk3_esk7_0),
inference(copy,[status(esa)],[c_192]) ).
cnf(c_345,negated_conjecture,
r1(sk3_esk1_0,sk3_esk7_0),
inference(copy,[status(esa)],[c_296]) ).
cnf(c_1259,negated_conjecture,
r1(sk3_esk1_0,sk3_esk7_0),
inference(copy,[status(esa)],[c_345]) ).
cnf(c_1314,negated_conjecture,
r1(sk3_esk1_0,sk3_esk7_0),
inference(copy,[status(esa)],[c_1259]) ).
cnf(c_1386,plain,
( p2(sk3_esk7_0)
| ~ sP2_iProver_split ),
inference(resolution,[status(thm)],[c_1334,c_1314]) ).
cnf(c_1387,plain,
( p2(sk3_esk7_0)
| ~ sP2_iProver_split ),
inference(rewriting,[status(thm)],[c_1386]) ).
cnf(c_12,negated_conjecture,
~ p2(sk3_esk7_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_36) ).
cnf(c_186,negated_conjecture,
~ p2(sk3_esk7_0),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_293,negated_conjecture,
~ p2(sk3_esk7_0),
inference(copy,[status(esa)],[c_186]) ).
cnf(c_348,negated_conjecture,
~ p2(sk3_esk7_0),
inference(copy,[status(esa)],[c_293]) ).
cnf(c_1255,negated_conjecture,
~ p2(sk3_esk7_0),
inference(copy,[status(esa)],[c_348]) ).
cnf(c_1306,negated_conjecture,
~ p2(sk3_esk7_0),
inference(copy,[status(esa)],[c_1255]) ).
cnf(c_1607,plain,
~ sP2_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_1387,c_1306]) ).
cnf(c_1608,plain,
~ sP2_iProver_split,
inference(rewriting,[status(thm)],[c_1607]) ).
cnf(c_30,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p1(X0)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_10]) ).
cnf(c_98,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p1(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_114,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p1(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_302,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p1(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_114]) ).
cnf(c_339,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p1(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_302]) ).
cnf(c_1268,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p1(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_339]) ).
cnf(c_1332,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| p1(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_1268]) ).
cnf(c_19,negated_conjecture,
r1(sk3_esk1_0,sk3_esk11_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_35) ).
cnf(c_200,negated_conjecture,
r1(sk3_esk1_0,sk3_esk11_0),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_300,negated_conjecture,
r1(sk3_esk1_0,sk3_esk11_0),
inference(copy,[status(esa)],[c_200]) ).
cnf(c_341,negated_conjecture,
r1(sk3_esk1_0,sk3_esk11_0),
inference(copy,[status(esa)],[c_300]) ).
cnf(c_1264,negated_conjecture,
r1(sk3_esk1_0,sk3_esk11_0),
inference(copy,[status(esa)],[c_341]) ).
cnf(c_1324,negated_conjecture,
r1(sk3_esk1_0,sk3_esk11_0),
inference(copy,[status(esa)],[c_1264]) ).
cnf(c_1374,plain,
( p1(sk3_esk11_0)
| ~ sP1_iProver_split ),
inference(resolution,[status(thm)],[c_1332,c_1324]) ).
cnf(c_1375,plain,
( p1(sk3_esk11_0)
| ~ sP1_iProver_split ),
inference(rewriting,[status(thm)],[c_1374]) ).
cnf(c_14,negated_conjecture,
~ p1(sk3_esk11_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_38) ).
cnf(c_190,negated_conjecture,
~ p1(sk3_esk11_0),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_295,negated_conjecture,
~ p1(sk3_esk11_0),
inference(copy,[status(esa)],[c_190]) ).
cnf(c_346,negated_conjecture,
~ p1(sk3_esk11_0),
inference(copy,[status(esa)],[c_295]) ).
cnf(c_1258,negated_conjecture,
~ p1(sk3_esk11_0),
inference(copy,[status(esa)],[c_346]) ).
cnf(c_1312,negated_conjecture,
~ p1(sk3_esk11_0),
inference(copy,[status(esa)],[c_1258]) ).
cnf(c_1590,plain,
~ sP1_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_1375,c_1312]) ).
cnf(c_1591,plain,
~ sP1_iProver_split,
inference(rewriting,[status(thm)],[c_1590]) ).
cnf(c_13,negated_conjecture,
~ p1(sk3_esk10_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_37) ).
cnf(c_188,negated_conjecture,
~ p1(sk3_esk10_0),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_294,negated_conjecture,
~ p1(sk3_esk10_0),
inference(copy,[status(esa)],[c_188]) ).
cnf(c_347,negated_conjecture,
~ p1(sk3_esk10_0),
inference(copy,[status(esa)],[c_294]) ).
cnf(c_1256,negated_conjecture,
~ p1(sk3_esk10_0),
inference(copy,[status(esa)],[c_347]) ).
cnf(c_1308,negated_conjecture,
~ p1(sk3_esk10_0),
inference(copy,[status(esa)],[c_1256]) ).
cnf(c_1788,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| r1(X1,sk3_esk3_3(X0,sk3_esk8_0,X1))
| ~ r1(X0,sk3_esk8_0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1519,c_1608,c_1591,c_1308]) ).
cnf(c_1789,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| r1(X1,sk3_esk3_3(X0,sk3_esk8_0,X1))
| ~ r1(X0,sk3_esk8_0) ),
inference(rewriting,[status(thm)],[c_1788]) ).
cnf(c_11,negated_conjecture,
( ~ r1(sk3_esk9_0,X0)
| p1(X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_30) ).
cnf(c_184,negated_conjecture,
( ~ r1(sk3_esk9_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_292,negated_conjecture,
( ~ r1(sk3_esk9_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_184]) ).
cnf(c_349,negated_conjecture,
( ~ r1(sk3_esk9_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_292]) ).
cnf(c_1254,negated_conjecture,
( ~ r1(sk3_esk9_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_349]) ).
cnf(c_1304,negated_conjecture,
( ~ r1(sk3_esk9_0,X0)
| p1(X0) ),
inference(copy,[status(esa)],[c_1254]) ).
cnf(c_1796,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,sk3_esk9_0)
| ~ r1(X0,sk3_esk8_0)
| p1(sk3_esk3_3(X0,sk3_esk8_0,sk3_esk9_0)) ),
inference(resolution,[status(thm)],[c_1789,c_1304]) ).
cnf(c_1797,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,sk3_esk9_0)
| ~ r1(X0,sk3_esk8_0)
| p1(sk3_esk3_3(X0,sk3_esk8_0,sk3_esk9_0)) ),
inference(rewriting,[status(thm)],[c_1796]) ).
cnf(c_17,negated_conjecture,
r1(sk3_esk8_0,sk3_esk9_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_33) ).
cnf(c_196,negated_conjecture,
r1(sk3_esk8_0,sk3_esk9_0),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_298,negated_conjecture,
r1(sk3_esk8_0,sk3_esk9_0),
inference(copy,[status(esa)],[c_196]) ).
cnf(c_343,negated_conjecture,
r1(sk3_esk8_0,sk3_esk9_0),
inference(copy,[status(esa)],[c_298]) ).
cnf(c_1261,negated_conjecture,
r1(sk3_esk8_0,sk3_esk9_0),
inference(copy,[status(esa)],[c_343]) ).
cnf(c_1318,negated_conjecture,
r1(sk3_esk8_0,sk3_esk9_0),
inference(copy,[status(esa)],[c_1261]) ).
cnf(c_1806,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,sk3_esk8_0)
| p1(sk3_esk3_3(X0,sk3_esk8_0,sk3_esk9_0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1797,c_1318]) ).
cnf(c_1807,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X0,sk3_esk8_0)
| p1(sk3_esk3_3(X0,sk3_esk8_0,sk3_esk9_0)) ),
inference(rewriting,[status(thm)],[c_1806]) ).
cnf(c_2,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk1_0,X1)
| ~ r1(sk3_esk1_0,X2)
| ~ r1(X3,X4)
| ~ r1(X3,X5)
| ~ r1(X0,X3)
| p2(X2)
| ~ p1(sk3_esk3_3(X0,X3,X4))
| p1(X5)
| p1(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_21) ).
cnf(c_100,negated_conjecture,
( sP1_iProver_split
| sP2_iProver_split
| sP10_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP10_iProver_split,sP1_iProver_split,sP2_iProver_split])],[c_2]) ).
cnf(c_118,negated_conjecture,
( sP1_iProver_split
| sP2_iProver_split
| sP10_iProver_split ),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_320,negated_conjecture,
( sP1_iProver_split
| sP2_iProver_split
| sP10_iProver_split ),
inference(copy,[status(esa)],[c_118]) ).
cnf(c_321,negated_conjecture,
( sP1_iProver_split
| sP2_iProver_split
| sP10_iProver_split ),
inference(copy,[status(esa)],[c_320]) ).
cnf(c_63,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| ~ sP10_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP10_iProver_split])],[c_2]) ).
cnf(c_99,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| ~ sP10_iProver_split ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_116,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| ~ sP10_iProver_split ),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_319,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| ~ sP10_iProver_split ),
inference(copy,[status(esa)],[c_116]) ).
cnf(c_322,negated_conjecture,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| ~ sP10_iProver_split ),
inference(copy,[status(esa)],[c_319]) ).
cnf(c_490,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| sP1_iProver_split
| sP2_iProver_split ),
inference(resolution,[status(thm)],[c_321,c_322]) ).
cnf(c_516,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_490]) ).
cnf(c_525,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_516]) ).
cnf(c_1252,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_525]) ).
cnf(c_1300,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(X1,X2)
| ~ r1(X1,X3)
| ~ r1(X0,X1)
| ~ p1(sk3_esk3_3(X0,X1,X3))
| p1(X2)
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_1252]) ).
cnf(c_1811,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,sk3_esk9_0)
| ~ r1(sk3_esk8_0,X1)
| ~ r1(X0,sk3_esk8_0)
| p1(X1)
| sP1_iProver_split
| sP2_iProver_split ),
inference(resolution,[status(thm)],[c_1807,c_1300]) ).
cnf(c_1812,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,sk3_esk9_0)
| ~ r1(sk3_esk8_0,X1)
| ~ r1(X0,sk3_esk8_0)
| p1(X1)
| sP1_iProver_split
| sP2_iProver_split ),
inference(rewriting,[status(thm)],[c_1811]) ).
cnf(c_1922,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| ~ r1(X0,sk3_esk8_0)
| p1(X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1812,c_1608,c_1591,c_1318]) ).
cnf(c_1923,plain,
( ~ r1(sk3_esk1_0,X0)
| ~ r1(sk3_esk8_0,X1)
| ~ r1(X0,sk3_esk8_0)
| p1(X1) ),
inference(rewriting,[status(thm)],[c_1922]) ).
cnf(c_16,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_32) ).
cnf(c_194,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_297,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_194]) ).
cnf(c_344,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_297]) ).
cnf(c_1260,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_344]) ).
cnf(c_1316,negated_conjecture,
r1(sk3_esk1_0,sk3_esk8_0),
inference(copy,[status(esa)],[c_1260]) ).
cnf(c_1932,plain,
( ~ r1(sk3_esk1_0,sk3_esk1_0)
| ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(resolution,[status(thm)],[c_1923,c_1316]) ).
cnf(c_1933,plain,
( ~ r1(sk3_esk1_0,sk3_esk1_0)
| ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(rewriting,[status(thm)],[c_1932]) ).
cnf(c_0,plain,
r1(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_45d92a.p',c_0_9_0) ).
cnf(c_1292,plain,
r1(X0,X0),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_2080,plain,
( ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1933,c_1292]) ).
cnf(c_2081,plain,
( ~ r1(sk3_esk8_0,X0)
| p1(X0) ),
inference(rewriting,[status(thm)],[c_2080]) ).
cnf(c_2090,plain,
p1(sk3_esk10_0),
inference(resolution,[status(thm)],[c_2081,c_1322]) ).
cnf(c_2091,plain,
p1(sk3_esk10_0),
inference(rewriting,[status(thm)],[c_2090]) ).
cnf(c_2113,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2091,c_1308]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL672+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 01:11:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ef8c25.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_45d92a.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_10e401 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 0.20/0.45 % --inst_prop_sim_new false
% 0.20/0.45 % --inst_orphan_elimination true
% 0.20/0.45 % --inst_learning_loop_flag true
% 0.20/0.45 % --inst_learning_start 3000
% 0.20/0.45 % --inst_learning_factor 2
% 0.20/0.45 % --inst_start_prop_sim_after_learn 3
% 0.20/0.45 % --inst_sel_renew solver
% 0.20/0.45 % --inst_lit_activity_flag true
% 0.20/0.45 % --inst_out_proof true
% 0.20/0.45
% 0.20/0.45 % ------ Resolution Options
% 0.20/0.45
% 0.20/0.45 % --resolution_flag true
% 0.20/0.45 % --res_lit_sel kbo_max
% 0.20/0.45 % --res_to_prop_solver none
% 0.20/0.45 % --res_prop_simpl_new false
% 0.20/0.45 % --res_prop_simpl_given false
% 0.20/0.45 % --res_passive_queue_type priority_queues
% 0.20/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.45 % --res_passive_queues_freq [15;5]
% 0.20/0.45 % --res_forward_subs full
% 0.20/0.45 % --res_backward_subs full
% 0.20/0.45 % --res_forward_subs_resolution true
% 0.20/0.45 % --res_backward_subs_resolution true
% 0.20/0.45 % --res_orphan_elimination false
% 0.20/0.45 % --res_time_limit 1000.
% 0.20/0.45 % --res_out_proof true
% 0.20/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ef8c25.s
% 0.20/0.45 % --modulo true
% 0.20/0.45
% 0.20/0.45 % ------ Combination Options
% 0.20/0.45
% 0.20/0.45 % --comb_res_mult 1000
% 0.20/0.45 % --comb_inst_mult 300
% 0.20/0.45 % ------
% 0.20/0.45
% 0.20/0.45 % ------ Parsing...% successful
% 0.20/0.45
% 0.20/0.45 % ------ Preprocessing... gs_s sp: 54 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.45
% 0.20/0.45 % ------ Proving...
% 0.20/0.45 % ------ Problem Properties
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % EPR false
% 0.20/0.45 % Horn false
% 0.20/0.45 % Has equality false
% 0.20/0.45
% 0.20/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % % ------ Current options:
% 0.20/0.45
% 0.20/0.45 % ------ Input Options
% 0.20/0.45
% 0.20/0.45 % --out_options all
% 0.20/0.45 % --tptp_safe_out true
% 0.20/0.45 % --problem_path ""
% 0.20/0.45 % --include_path ""
% 0.20/0.45 % --clausifier .//eprover
% 0.20/0.45 % --clausifier_options --tstp-format
% 0.20/0.45 % --stdin false
% 0.20/0.45 % --dbg_backtrace false
% 0.20/0.45 % --dbg_dump_prop_clauses false
% 0.20/0.45 % --dbg_dump_prop_clauses_file -
% 0.20/0.45 % --dbg_out_stat false
% 0.20/0.45
% 0.20/0.45 % ------ General Options
% 0.20/0.45
% 0.20/0.45 % --fof false
% 0.20/0.45 % --time_out_real 150.
% 0.20/0.45 % --time_out_prep_mult 0.2
% 0.20/0.45 % --time_out_virtual -1.
% 0.20/0.45 % --schedule none
% 0.20/0.45 % --ground_splitting input
% 0.20/0.45 % --splitting_nvd 16
% 0.20/0.45 % --non_eq_to_eq false
% 0.20/0.45 % --prep_gs_sim true
% 0.20/0.45 % --prep_unflatten false
% 0.20/0.45 % --prep_res_sim true
% 0.20/0.45 % --prep_upred true
% 0.20/0.45 % --res_sim_input true
% 0.20/0.45 % --clause_weak_htbl true
% 0.20/0.45 % --gc_record_bc_elim false
% 0.20/0.45 % --symbol_type_check false
% 0.20/0.45 % --clausify_out false
% 0.20/0.45 % --large_theory_mode false
% 0.20/0.45 % --prep_sem_filter none
% 0.20/0.45 % --prep_sem_filter_out false
% 0.20/0.45 % --preprocessed_out false
% 0.20/0.45 % --sub_typing false
% 0.20/0.45 % --brand_transform false
% 0.20/0.45 % --pure_diseq_elim true
% 0.20/0.45 % --min_unsat_core false
% 0.20/0.45 % --pred_elim true
% 0.20/0.45 % --add_important_lit false
% 0.20/0.45 % --soft_assumptions false
% 0.20/0.45 % --reset_solvers false
% 0.20/0.45 % --bc_imp_inh []
% 0.20/0.45 % --conj_cone_tolerance 1.5
% 0.20/0.45 % --prolific_symb_bound 500
% 0.20/0.45 % --lt_threshold 2000
% 0.20/0.45
% 0.20/0.45 % ------ SAT Options
% 0.20/0.45
% 0.20/0.45 % --sat_mode false
% 0.20/0.45 % --sat_fm_restart_options ""
% 0.20/0.45 % --sat_gr_def false
% 0.20/0.45 % --sat_epr_types true
% 0.20/0.45 % --sat_non_cyclic_types false
% 0.20/0.45 % --sat_finite_models false
% 0.20/0.45 % --sat_fm_lemmas false
% 0.20/0.45 % --sat_fm_prep false
% 0.20/0.45 % --sat_fm_uc_incr true
% 0.20/0.45 % --sat_out_model small
% 0.20/0.45 % --sat_out_clauses false
% 0.20/0.45
% 0.20/0.45 % ------ QBF Options
% 0.20/0.45
% 0.20/0.45 % --qbf_mode false
% 0.20/0.45 % --qbf_elim_univ true
% 0.20/0.45 % --qbf_sk_in true
% 0.20/0.45 % --qbf_pred_elim true
% 0.20/0.45 % --qbf_split 32
% 0.20/0.45
% 0.20/0.45 % ------ BMC1 Options
% 0.20/0.45
% 0.20/0.45 % --bmc1_incremental false
% 0.20/0.45 % --bmc1_axioms reachable_all
% 0.20/0.45 % --bmc1_min_bound 0
% 0.20/0.45 % --bmc1_max_bound -1
% 0.20/0.45 % --bmc1_max_bound_default -1
% 0.20/0.45 % --bmc1_symbol_reachability true
% 0.20/0.45 % --bmc1_property_lemmas false
% 0.20/0.45 % --bmc1_k_induction false
% 0.20/0.45 % --bmc1_non_equiv_states false
% 0.20/0.45 % --bmc1_deadlock false
% 0.20/0.45 % --bmc1_ucm false
% 0.20/0.45 % --bmc1_add_unsat_core none
% 0.20/0.45 % --bmc1_unsat_core_children false
% 0.20/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.45 % --bmc1_out_stat full
% 0.20/0.45 % --bmc1_ground_init false
% 0.20/0.45 % --bmc1_pre_inst_next_state false
% 0.20/0.45 % --bmc1_pre_inst_state false
% 0.20/0.45 % --bmc1_pre_inst_reach_state false
% 0.20/0.45 % --bmc1_out_unsat_core false
% 0.20/0.45 % --bmc1_aig_witness_out false
% 0.20/0.45 % --bmc1_verbose false
% 0.20/0.45 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.47 % --inst_prop_sim_given true
% 0.20/0.47 % --inst_prop_sim_new false
% 0.20/0.47 % --inst_orphan_elimination true
% 0.20/0.47 % --inst_learning_loop_flag true
% 0.20/0.47 % --inst_learning_start 3000
% 0.20/0.47 % --inst_learning_factor 2
% 0.20/0.47 % --inst_start_prop_sim_after_learn 3
% 0.20/0.47 % --inst_sel_renew solver
% 0.20/0.47 % --inst_lit_activity_flag true
% 0.20/0.47 % --inst_out_proof true
% 0.20/0.47
% 0.20/0.47 % ------ Resolution Options
% 0.20/0.47
% 0.20/0.47 % --resolution_flag true
% 0.20/0.47 % --res_lit_sel kbo_max
% 0.20/0.47 % --res_to_prop_solver none
% 0.20/0.47 % --res_prop_simpl_new false
% 0.20/0.47 % --res_prop_simpl_given false
% 0.20/0.47 % --res_passive_queue_type priority_queues
% 0.20/0.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.47 % --res_passive_queues_freq [15;5]
% 0.20/0.47 % --res_forward_subs full
% 0.20/0.47 % --res_backward_subs full
% 0.20/0.47 % --res_forward_subs_resolution true
% 0.20/0.47 % --res_backward_subs_resolution true
% 0.20/0.47 % --res_orphan_elimination false
% 0.20/0.47 % --res_time_limit 1000.
% 0.20/0.47 % --res_out_proof true
% 0.20/0.47 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ef8c25.s
% 0.20/0.47 % --modulo true
% 0.20/0.47
% 0.20/0.47 % ------ Combination Options
% 0.20/0.47
% 0.20/0.47 % --comb_res_mult 1000
% 0.20/0.47 % --comb_inst_mult 300
% 0.20/0.47 % ------
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 % ------ Proving...
% 0.20/0.47 %
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 % Resolution empty clause
% 0.20/0.47
% 0.20/0.47 % ------ Statistics
% 0.20/0.47
% 0.20/0.47 % ------ General
% 0.20/0.47
% 0.20/0.47 % num_of_input_clauses: 20
% 0.20/0.47 % num_of_input_neg_conjectures: 18
% 0.20/0.47 % num_of_splits: 54
% 0.20/0.47 % num_of_split_atoms: 11
% 0.20/0.47 % num_of_sem_filtered_clauses: 0
% 0.20/0.47 % num_of_subtypes: 0
% 0.20/0.47 % monotx_restored_types: 0
% 0.20/0.47 % sat_num_of_epr_types: 0
% 0.20/0.47 % sat_num_of_non_cyclic_types: 0
% 0.20/0.47 % sat_guarded_non_collapsed_types: 0
% 0.20/0.47 % is_epr: 0
% 0.20/0.47 % is_horn: 0
% 0.20/0.47 % has_eq: 0
% 0.20/0.47 % num_pure_diseq_elim: 0
% 0.20/0.47 % simp_replaced_by: 0
% 0.20/0.47 % res_preprocessed: 90
% 0.20/0.47 % prep_upred: 0
% 0.20/0.47 % prep_unflattend: 0
% 0.20/0.47 % pred_elim_cands: 11
% 0.20/0.47 % pred_elim: 9
% 0.20/0.47 % pred_elim_cl: 9
% 0.20/0.47 % pred_elim_cycles: 11
% 0.20/0.47 % forced_gc_time: 0
% 0.20/0.47 % gc_basic_clause_elim: 0
% 0.20/0.47 % parsing_time: 0.001
% 0.20/0.47 % sem_filter_time: 0.
% 0.20/0.47 % pred_elim_time: 0.014
% 0.20/0.47 % out_proof_time: 0.004
% 0.20/0.47 % monotx_time: 0.
% 0.20/0.47 % subtype_inf_time: 0.
% 0.20/0.47 % unif_index_cands_time: 0.
% 0.20/0.47 % unif_index_add_time: 0.
% 0.20/0.47 % total_time: 0.056
% 0.20/0.47 % num_of_symbols: 50
% 0.20/0.47 % num_of_terms: 421
% 0.20/0.47
% 0.20/0.47 % ------ Propositional Solver
% 0.20/0.47
% 0.20/0.47 % prop_solver_calls: 1
% 0.20/0.47 % prop_fast_solver_calls: 588
% 0.20/0.47 % prop_num_of_clauses: 108
% 0.20/0.47 % prop_preprocess_simplified: 583
% 0.20/0.47 % prop_fo_subsumed: 0
% 0.20/0.47 % prop_solver_time: 0.
% 0.20/0.47 % prop_fast_solver_time: 0.
% 0.20/0.47 % prop_unsat_core_time: 0.
% 0.20/0.47
% 0.20/0.47 % ------ QBF
% 0.20/0.47
% 0.20/0.47 % qbf_q_res: 0
% 0.20/0.47 % qbf_num_tautologies: 0
% 0.20/0.47 % qbf_prep_cycles: 0
% 0.20/0.47
% 0.20/0.47 % ------ BMC1
% 0.20/0.47
% 0.20/0.47 % bmc1_current_bound: -1
% 0.20/0.47 % bmc1_last_solved_bound: -1
% 0.20/0.47 % bmc1_unsat_core_size: -1
% 0.20/0.47 % bmc1_unsat_core_parents_size: -1
% 0.20/0.47 % bmc1_merge_next_fun: 0
% 0.20/0.47 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.47
% 0.20/0.47 % ------ Instantiation
% 0.20/0.47
% 0.20/0.47 % inst_num_of_clauses: 22
% 0.20/0.47 % inst_num_in_passive: 0
% 0.20/0.47 % inst_num_in_active: 0
% 0.20/0.47 % inst_num_in_unprocessed: 22
% 0.20/0.47 % inst_num_of_loops: 0
% 0.20/0.47 % inst_num_of_learning_restarts: 0
% 0.20/0.47 % inst_num_moves_active_passive: 0
% 0.20/0.47 % inst_lit_activity: 0
% 0.20/0.47 % inst_lit_activity_moves: 0
% 0.20/0.47 % inst_num_tautologies: 0
% 0.20/0.47 % inst_num_prop_implied: 0
% 0.20/0.47 % inst_num_existing_simplified: 0
% 0.20/0.47 % inst_num_eq_res_simplified: 0
% 0.20/0.47 % inst_num_child_elim: 0
% 0.20/0.47 % inst_num_of_dismatching_blockings: 0
% 0.20/0.47 % inst_num_of_non_proper_insts: 0
% 0.20/0.47 % inst_num_of_duplicates: 0
% 0.20/0.47 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.47 % inst_dismatching_checking_time: 0.
% 0.20/0.47
% 0.20/0.47 % ------ Resolution
% 0.20/0.47
% 0.20/0.47 % res_num_of_clauses: 123
% 0.20/0.47 % res_num_in_passive: 88
% 0.20/0.47 % res_num_in_active: 38
% 0.20/0.47 % res_num_of_loops: 62
% 0.20/0.47 % res_forward_subset_subsumed: 9
% 0.20/0.47 % res_backward_subset_subsumed: 10
% 0.20/0.47 % res_forward_subsumed: 6
% 0.20/0.47 % res_backward_subsumed: 8
% 0.20/0.47 % res_forward_subsumption_resolution: 41
% 0.20/0.47 % res_backward_subsumption_resolution: 5
% 0.20/0.47 % res_clause_to_clause_subsumption: 529
% 0.20/0.47 % res_orphan_elimination: 0
% 0.20/0.47 % res_tautology_del: 8
% 0.20/0.47 % res_num_eq_res_simplified: 0
% 0.20/0.47 % res_num_sel_changes: 0
% 0.20/0.47 % res_moves_from_active_to_pass: 0
% 0.20/0.47
% 0.20/0.47 % Status Unsatisfiable
% 0.20/0.47 % SZS status Theorem
% 0.20/0.47 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------