TSTP Solution File: SYN056+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 07:22:46 EDT 2022
% Result : Theorem 0.23s 0.47s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 12
% Syntax : Number of formulae : 137 ( 9 unt; 0 def)
% Number of atoms : 374 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 438 ( 201 ~; 217 |; 8 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 116 ( 23 sgn 14 !; 4 ?)
% 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
fof(c_0_0,axiom,
! [X1,X2] :
( ( big_p(X1)
& big_q(X2) )
=> ( big_r(X1)
<=> big_s(X2) ) ),
file('<stdin>',pel26_2) ).
fof(c_0_1,axiom,
( ? [X1] : big_p(X1)
<=> ? [X2] : big_q(X2) ),
file('<stdin>',pel26_1) ).
fof(c_0_2,axiom,
! [X1,X2] :
( ( big_p(X1)
& big_q(X2) )
=> ( big_r(X1)
<=> big_s(X2) ) ),
c_0_0 ).
fof(c_0_3,axiom,
( ? [X1] : big_p(X1)
<=> ? [X2] : big_q(X2) ),
c_0_1 ).
fof(c_0_4,plain,
! [X3,X4] :
( ( ~ big_r(X3)
| big_s(X4)
| ~ big_p(X3)
| ~ big_q(X4) )
& ( ~ big_s(X4)
| big_r(X3)
| ~ big_p(X3)
| ~ big_q(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,plain,
! [X3,X5] :
( ( ~ big_p(X3)
| big_q(esk1_0) )
& ( ~ big_q(X5)
| big_p(esk2_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( big_s(X1)
| ~ big_q(X1)
| ~ big_p(X2)
| ~ big_r(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( big_r(X2)
| ~ big_q(X1)
| ~ big_p(X2)
| ~ big_s(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( big_q(esk1_0)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( big_p(esk2_0)
| ~ big_q(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( big_s(X1)
| ~ big_q(X1)
| ~ big_p(X2)
| ~ big_r(X2) ),
c_0_6,
[final] ).
cnf(c_0_11,plain,
( big_r(X2)
| ~ big_q(X1)
| ~ big_p(X2)
| ~ big_s(X1) ),
c_0_7,
[final] ).
cnf(c_0_12,plain,
( big_q(esk1_0)
| ~ big_p(X1) ),
c_0_8,
[final] ).
cnf(c_0_13,plain,
( big_p(esk2_0)
| ~ big_q(X1) ),
c_0_9,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_10_0,axiom,
( big_s(X1)
| ~ big_q(X1)
| ~ big_p(X2)
| ~ big_r(X2) ),
inference(literals_permutation,[status(thm)],[c_0_10]) ).
cnf(c_0_10_1,axiom,
( ~ big_q(X1)
| big_s(X1)
| ~ big_p(X2)
| ~ big_r(X2) ),
inference(literals_permutation,[status(thm)],[c_0_10]) ).
cnf(c_0_10_2,axiom,
( ~ big_p(X2)
| ~ big_q(X1)
| big_s(X1)
| ~ big_r(X2) ),
inference(literals_permutation,[status(thm)],[c_0_10]) ).
cnf(c_0_10_3,axiom,
( ~ big_r(X2)
| ~ big_p(X2)
| ~ big_q(X1)
| big_s(X1) ),
inference(literals_permutation,[status(thm)],[c_0_10]) ).
cnf(c_0_11_0,axiom,
( big_r(X2)
| ~ big_q(X1)
| ~ big_p(X2)
| ~ big_s(X1) ),
inference(literals_permutation,[status(thm)],[c_0_11]) ).
cnf(c_0_11_1,axiom,
( ~ big_q(X1)
| big_r(X2)
| ~ big_p(X2)
| ~ big_s(X1) ),
inference(literals_permutation,[status(thm)],[c_0_11]) ).
cnf(c_0_11_2,axiom,
( ~ big_p(X2)
| ~ big_q(X1)
| big_r(X2)
| ~ big_s(X1) ),
inference(literals_permutation,[status(thm)],[c_0_11]) ).
cnf(c_0_11_3,axiom,
( ~ big_s(X1)
| ~ big_p(X2)
| ~ big_q(X1)
| big_r(X2) ),
inference(literals_permutation,[status(thm)],[c_0_11]) ).
cnf(c_0_12_0,axiom,
( big_q(sk2_esk1_0)
| ~ big_p(X1) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_12_1,axiom,
( ~ big_p(X1)
| big_q(sk2_esk1_0) ),
inference(literals_permutation,[status(thm)],[c_0_12]) ).
cnf(c_0_13_0,axiom,
( big_p(sk2_esk2_0)
| ~ big_q(X1) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
cnf(c_0_13_1,axiom,
( ~ big_q(X1)
| big_p(sk2_esk2_0) ),
inference(literals_permutation,[status(thm)],[c_0_13]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
( ! [X1] :
( big_p(X1)
=> big_r(X1) )
<=> ! [X2] :
( big_q(X2)
=> big_s(X2) ) ),
file('<stdin>',pel26) ).
fof(c_0_1_002,negated_conjecture,
~ ( ! [X1] :
( big_p(X1)
=> big_r(X1) )
<=> ! [X2] :
( big_q(X2)
=> big_s(X2) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
! [X5,X6] :
( ( big_q(esk2_0)
| big_p(esk1_0) )
& ( ~ big_s(esk2_0)
| big_p(esk1_0) )
& ( big_q(esk2_0)
| ~ big_r(esk1_0) )
& ( ~ big_s(esk2_0)
| ~ big_r(esk1_0) )
& ( ~ big_p(X5)
| big_r(X5)
| ~ big_q(X6)
| big_s(X6) ) ),
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,
( big_s(X1)
| big_r(X2)
| ~ big_q(X1)
| ~ big_p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( ~ big_r(esk1_0)
| ~ big_s(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( big_p(esk1_0)
| ~ big_s(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
( big_q(esk2_0)
| ~ big_r(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
( big_p(esk1_0)
| big_q(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
( big_s(X1)
| big_r(X2)
| ~ big_q(X1)
| ~ big_p(X2) ),
c_0_3,
[final] ).
cnf(c_0_9_010,negated_conjecture,
( ~ big_r(esk1_0)
| ~ big_s(esk2_0) ),
c_0_4,
[final] ).
cnf(c_0_10_011,negated_conjecture,
( big_p(esk1_0)
| ~ big_s(esk2_0) ),
c_0_5,
[final] ).
cnf(c_0_11_012,negated_conjecture,
( big_q(esk2_0)
| ~ big_r(esk1_0) ),
c_0_6,
[final] ).
cnf(c_0_12_013,negated_conjecture,
( big_p(esk1_0)
| big_q(esk2_0) ),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_15,negated_conjecture,
( big_q(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_11) ).
cnf(c_40,negated_conjecture,
( big_q(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_60,negated_conjecture,
( big_q(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_69,negated_conjecture,
( big_q(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_109,negated_conjecture,
( big_q(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_162,negated_conjecture,
( big_q(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_109]) ).
cnf(c_4,plain,
( ~ big_s(X0)
| ~ big_p(X1)
| ~ big_q(X0)
| big_r(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_11_0) ).
cnf(c_136,plain,
( ~ big_s(X0)
| ~ big_p(X1)
| ~ big_q(X0)
| big_r(X1) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_137,plain,
( ~ big_s(X0)
| ~ big_q(X0)
| ~ big_p(X1)
| big_r(X1) ),
inference(rewriting,[status(thm)],[c_136]) ).
cnf(c_176,plain,
( ~ big_s(X0)
| big_q(sk3_esk2_0)
| ~ big_q(X0)
| ~ big_p(sk3_esk1_0) ),
inference(resolution,[status(thm)],[c_162,c_137]) ).
cnf(c_177,plain,
( ~ big_s(X0)
| big_q(sk3_esk2_0)
| ~ big_q(X0)
| ~ big_p(sk3_esk1_0) ),
inference(rewriting,[status(thm)],[c_176]) ).
cnf(c_16,negated_conjecture,
( big_q(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_12) ).
cnf(c_42,negated_conjecture,
( big_q(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_61,negated_conjecture,
( big_q(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_68,negated_conjecture,
( big_q(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_104,negated_conjecture,
( big_q(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_152,negated_conjecture,
( big_q(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_224,plain,
( ~ big_s(X0)
| big_q(sk3_esk2_0)
| ~ big_q(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_177,c_152]) ).
cnf(c_225,plain,
( ~ big_s(X0)
| big_q(sk3_esk2_0)
| ~ big_q(X0) ),
inference(rewriting,[status(thm)],[c_224]) ).
cnf(c_8,plain,
( ~ big_p(X0)
| big_q(sk2_esk1_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_12_0) ).
cnf(c_144,plain,
( ~ big_p(X0)
| big_q(sk2_esk1_0) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_145,plain,
( big_q(sk2_esk1_0)
| ~ big_p(X0) ),
inference(rewriting,[status(thm)],[c_144]) ).
cnf(c_229,plain,
( ~ big_s(sk2_esk1_0)
| big_q(sk3_esk2_0)
| ~ big_p(X0) ),
inference(resolution,[status(thm)],[c_225,c_145]) ).
cnf(c_230,plain,
( ~ big_s(sk2_esk1_0)
| big_q(sk3_esk2_0)
| ~ big_p(X0) ),
inference(rewriting,[status(thm)],[c_229]) ).
cnf(c_12,negated_conjecture,
( big_s(X0)
| ~ big_q(X0)
| ~ big_p(X1)
| big_r(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_8) ).
cnf(c_27,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split,sP0_iProver_split])],[c_12]) ).
cnf(c_34,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_64,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_34]) ).
cnf(c_65,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_23,negated_conjecture,
( big_s(X0)
| ~ big_q(X0)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_12]) ).
cnf(c_26,negated_conjecture,
( big_s(X0)
| ~ big_q(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_32,negated_conjecture,
( big_s(X0)
| ~ big_q(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_63,negated_conjecture,
( big_s(X0)
| ~ big_q(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_32]) ).
cnf(c_66,negated_conjecture,
( big_s(X0)
| ~ big_q(X0)
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_72,plain,
( big_s(X0)
| ~ big_q(X0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_65,c_66]) ).
cnf(c_83,plain,
( big_s(X0)
| ~ big_q(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_87,plain,
( big_s(X0)
| ~ big_q(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_83]) ).
cnf(c_106,plain,
( big_s(X0)
| ~ big_q(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_156,plain,
( big_s(X0)
| ~ big_q(X0)
| sP0_iProver_split ),
inference(copy,[status(esa)],[c_106]) ).
cnf(c_200,plain,
( big_s(sk2_esk1_0)
| ~ big_p(X0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_156,c_145]) ).
cnf(c_201,plain,
( big_s(sk2_esk1_0)
| ~ big_p(X0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_200]) ).
cnf(c_255,plain,
( big_s(sk2_esk1_0)
| big_q(sk3_esk2_0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_201,c_152]) ).
cnf(c_256,plain,
( big_s(sk2_esk1_0)
| big_q(sk3_esk2_0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_255]) ).
cnf(c_22,negated_conjecture,
( ~ big_p(X0)
| big_r(X0)
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_12]) ).
cnf(c_25,negated_conjecture,
( ~ big_p(X0)
| big_r(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_30,negated_conjecture,
( ~ big_p(X0)
| big_r(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_62,negated_conjecture,
( ~ big_p(X0)
| big_r(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_67,negated_conjecture,
( ~ big_p(X0)
| big_r(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_105,negated_conjecture,
( ~ big_p(X0)
| big_r(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_154,negated_conjecture,
( ~ big_p(X0)
| big_r(X0)
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_105]) ).
cnf(c_191,plain,
( big_q(sk3_esk2_0)
| ~ big_p(sk3_esk1_0)
| ~ sP0_iProver_split ),
inference(resolution,[status(thm)],[c_154,c_162]) ).
cnf(c_192,plain,
( big_q(sk3_esk2_0)
| ~ big_p(sk3_esk1_0)
| ~ sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_191]) ).
cnf(c_205,plain,
( big_q(sk3_esk2_0)
| ~ sP0_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_192,c_152]) ).
cnf(c_206,plain,
( big_q(sk3_esk2_0)
| ~ sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_205]) ).
cnf(c_261,plain,
( big_s(sk2_esk1_0)
| big_q(sk3_esk2_0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_256,c_206]) ).
cnf(c_262,plain,
( big_s(sk2_esk1_0)
| big_q(sk3_esk2_0) ),
inference(rewriting,[status(thm)],[c_261]) ).
cnf(c_287,plain,
( big_q(sk3_esk2_0)
| ~ big_p(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_230,c_262]) ).
cnf(c_288,plain,
( big_q(sk3_esk2_0)
| ~ big_p(X0) ),
inference(rewriting,[status(thm)],[c_287]) ).
cnf(c_291,negated_conjecture,
big_q(sk3_esk2_0),
inference(backward_subsumption_resolution,[status(thm)],[c_288,c_152]) ).
cnf(c_292,plain,
big_q(sk3_esk2_0),
inference(rewriting,[status(thm)],[c_291]) ).
cnf(c_13,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_9) ).
cnf(c_36,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_58,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_71,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_107,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_158,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| ~ big_r(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_107]) ).
cnf(c_182,plain,
( ~ big_s(sk3_esk2_0)
| ~ big_s(X0)
| ~ big_q(X0)
| ~ big_p(sk3_esk1_0) ),
inference(resolution,[status(thm)],[c_158,c_137]) ).
cnf(c_183,plain,
( ~ big_s(sk3_esk2_0)
| ~ big_s(X0)
| ~ big_q(X0)
| ~ big_p(sk3_esk1_0) ),
inference(rewriting,[status(thm)],[c_182]) ).
cnf(c_14,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_10) ).
cnf(c_38,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_59,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_70,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_108,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_160,negated_conjecture,
( ~ big_s(sk3_esk2_0)
| big_p(sk3_esk1_0) ),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_237,plain,
( ~ big_s(sk3_esk2_0)
| ~ big_s(X0)
| ~ big_q(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_183,c_160]) ).
cnf(c_238,plain,
( ~ big_s(sk3_esk2_0)
| ~ big_s(X0)
| ~ big_q(X0) ),
inference(rewriting,[status(thm)],[c_237]) ).
cnf(c_295,plain,
~ big_s(sk3_esk2_0),
inference(resolution,[status(thm)],[c_292,c_238]) ).
cnf(c_298,plain,
~ big_s(sk3_esk2_0),
inference(rewriting,[status(thm)],[c_295]) ).
cnf(c_296,plain,
( big_s(sk3_esk2_0)
| sP0_iProver_split ),
inference(resolution,[status(thm)],[c_292,c_156]) ).
cnf(c_297,plain,
( big_s(sk3_esk2_0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_296]) ).
cnf(c_307,plain,
sP0_iProver_split,
inference(backward_subsumption_resolution,[status(thm)],[c_298,c_297]) ).
cnf(c_308,plain,
sP0_iProver_split,
inference(rewriting,[status(thm)],[c_307]) ).
cnf(c_313,negated_conjecture,
( ~ big_p(X0)
| big_r(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_308,c_154]) ).
cnf(c_314,plain,
( ~ big_p(X0)
| big_r(X0) ),
inference(rewriting,[status(thm)],[c_313]) ).
cnf(c_0,plain,
( ~ big_r(X0)
| ~ big_p(X0)
| ~ big_q(X1)
| big_s(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_10_0) ).
cnf(c_128,plain,
( ~ big_r(X0)
| ~ big_p(X0)
| ~ big_q(X1)
| big_s(X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_129,plain,
( big_s(X0)
| ~ big_q(X0)
| ~ big_p(X1)
| ~ big_r(X1) ),
inference(rewriting,[status(thm)],[c_128]) ).
cnf(c_319,plain,
( big_s(X0)
| ~ big_q(X0)
| ~ big_p(X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_314,c_129]) ).
cnf(c_320,plain,
( big_s(X0)
| ~ big_q(X0)
| ~ big_p(X1) ),
inference(rewriting,[status(thm)],[c_319]) ).
cnf(c_10,plain,
( ~ big_q(X0)
| big_p(sk2_esk2_0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_3df081.p',c_0_13_0) ).
cnf(c_148,plain,
( ~ big_q(X0)
| big_p(sk2_esk2_0) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_327,plain,
( big_s(X0)
| ~ big_q(X0)
| ~ big_q(X1) ),
inference(resolution,[status(thm)],[c_320,c_148]) ).
cnf(c_328,plain,
( big_s(X0)
| ~ big_q(X0)
| ~ big_q(X1) ),
inference(rewriting,[status(thm)],[c_327]) ).
cnf(c_337,plain,
( big_s(X0)
| ~ big_q(X0) ),
inference(resolution,[status(thm)],[c_328,c_292]) ).
cnf(c_338,plain,
( big_s(X0)
| ~ big_q(X0) ),
inference(rewriting,[status(thm)],[c_337]) ).
cnf(c_345,plain,
big_s(sk3_esk2_0),
inference(resolution,[status(thm)],[c_338,c_292]) ).
cnf(c_346,plain,
big_s(sk3_esk2_0),
inference(rewriting,[status(thm)],[c_345]) ).
cnf(c_348,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_346,c_298]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.14 % Command : iprover_modulo %s %d
% 0.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jul 11 22:02:50 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.23/0.37 % Running in mono-core mode
% 0.23/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.23/0.43 % FOF problem with conjecture
% 0.23/0.43 % 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_b8d35c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_3df081.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_33a3b0 | grep -v "SZS"
% 0.23/0.46
% 0.23/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.23/0.46
% 0.23/0.46 %
% 0.23/0.46 % ------ iProver source info
% 0.23/0.46
% 0.23/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.23/0.46 % git: non_committed_changes: true
% 0.23/0.46 % git: last_make_outside_of_git: true
% 0.23/0.46
% 0.23/0.46 %
% 0.23/0.46 % ------ Input Options
% 0.23/0.46
% 0.23/0.46 % --out_options all
% 0.23/0.46 % --tptp_safe_out true
% 0.23/0.46 % --problem_path ""
% 0.23/0.46 % --include_path ""
% 0.23/0.46 % --clausifier .//eprover
% 0.23/0.46 % --clausifier_options --tstp-format
% 0.23/0.46 % --stdin false
% 0.23/0.46 % --dbg_backtrace false
% 0.23/0.46 % --dbg_dump_prop_clauses false
% 0.23/0.46 % --dbg_dump_prop_clauses_file -
% 0.23/0.46 % --dbg_out_stat false
% 0.23/0.46
% 0.23/0.46 % ------ General Options
% 0.23/0.46
% 0.23/0.46 % --fof false
% 0.23/0.46 % --time_out_real 150.
% 0.23/0.46 % --time_out_prep_mult 0.2
% 0.23/0.46 % --time_out_virtual -1.
% 0.23/0.46 % --schedule none
% 0.23/0.46 % --ground_splitting input
% 0.23/0.46 % --splitting_nvd 16
% 0.23/0.46 % --non_eq_to_eq false
% 0.23/0.46 % --prep_gs_sim true
% 0.23/0.46 % --prep_unflatten false
% 0.23/0.46 % --prep_res_sim true
% 0.23/0.46 % --prep_upred true
% 0.23/0.46 % --res_sim_input true
% 0.23/0.46 % --clause_weak_htbl true
% 0.23/0.46 % --gc_record_bc_elim false
% 0.23/0.46 % --symbol_type_check false
% 0.23/0.46 % --clausify_out false
% 0.23/0.46 % --large_theory_mode false
% 0.23/0.46 % --prep_sem_filter none
% 0.23/0.46 % --prep_sem_filter_out false
% 0.23/0.46 % --preprocessed_out false
% 0.23/0.46 % --sub_typing false
% 0.23/0.46 % --brand_transform false
% 0.23/0.46 % --pure_diseq_elim true
% 0.23/0.46 % --min_unsat_core false
% 0.23/0.46 % --pred_elim true
% 0.23/0.46 % --add_important_lit false
% 0.23/0.46 % --soft_assumptions false
% 0.23/0.46 % --reset_solvers false
% 0.23/0.46 % --bc_imp_inh []
% 0.23/0.46 % --conj_cone_tolerance 1.5
% 0.23/0.46 % --prolific_symb_bound 500
% 0.23/0.46 % --lt_threshold 2000
% 0.23/0.46
% 0.23/0.46 % ------ SAT Options
% 0.23/0.46
% 0.23/0.46 % --sat_mode false
% 0.23/0.46 % --sat_fm_restart_options ""
% 0.23/0.46 % --sat_gr_def false
% 0.23/0.46 % --sat_epr_types true
% 0.23/0.46 % --sat_non_cyclic_types false
% 0.23/0.46 % --sat_finite_models false
% 0.23/0.46 % --sat_fm_lemmas false
% 0.23/0.46 % --sat_fm_prep false
% 0.23/0.46 % --sat_fm_uc_incr true
% 0.23/0.46 % --sat_out_model small
% 0.23/0.46 % --sat_out_clauses false
% 0.23/0.46
% 0.23/0.46 % ------ QBF Options
% 0.23/0.46
% 0.23/0.46 % --qbf_mode false
% 0.23/0.46 % --qbf_elim_univ true
% 0.23/0.46 % --qbf_sk_in true
% 0.23/0.46 % --qbf_pred_elim true
% 0.23/0.46 % --qbf_split 32
% 0.23/0.46
% 0.23/0.46 % ------ BMC1 Options
% 0.23/0.46
% 0.23/0.46 % --bmc1_incremental false
% 0.23/0.46 % --bmc1_axioms reachable_all
% 0.23/0.46 % --bmc1_min_bound 0
% 0.23/0.46 % --bmc1_max_bound -1
% 0.23/0.46 % --bmc1_max_bound_default -1
% 0.23/0.46 % --bmc1_symbol_reachability true
% 0.23/0.46 % --bmc1_property_lemmas false
% 0.23/0.46 % --bmc1_k_induction false
% 0.23/0.46 % --bmc1_non_equiv_states false
% 0.23/0.46 % --bmc1_deadlock false
% 0.23/0.46 % --bmc1_ucm false
% 0.23/0.46 % --bmc1_add_unsat_core none
% 0.23/0.46 % --bmc1_unsat_core_children false
% 0.23/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.23/0.46 % --bmc1_out_stat full
% 0.23/0.46 % --bmc1_ground_init false
% 0.23/0.46 % --bmc1_pre_inst_next_state false
% 0.23/0.46 % --bmc1_pre_inst_state false
% 0.23/0.46 % --bmc1_pre_inst_reach_state false
% 0.23/0.46 % --bmc1_out_unsat_core false
% 0.23/0.46 % --bmc1_aig_witness_out false
% 0.23/0.46 % --bmc1_verbose false
% 0.23/0.46 % --bmc1_dump_clauses_tptp false
% 0.23/0.46 % --bmc1_dump_unsat_core_tptp false
% 0.23/0.46 % --bmc1_dump_file -
% 0.23/0.46 % --bmc1_ucm_expand_uc_limit 128
% 0.23/0.46 % --bmc1_ucm_n_expand_iterations 6
% 0.23/0.46 % --bmc1_ucm_extend_mode 1
% 0.23/0.46 % --bmc1_ucm_init_mode 2
% 0.23/0.46 % --bmc1_ucm_cone_mode none
% 0.23/0.46 % --bmc1_ucm_reduced_relation_type 0
% 0.23/0.46 % --bmc1_ucm_relax_model 4
% 0.23/0.46 % --bmc1_ucm_full_tr_after_sat true
% 0.23/0.46 % --bmc1_ucm_expand_neg_assumptions false
% 0.23/0.46 % --bmc1_ucm_layered_model none
% 0.23/0.46 % --bmc1_ucm_max_lemma_size 10
% 0.23/0.46
% 0.23/0.46 % ------ AIG Options
% 0.23/0.46
% 0.23/0.46 % --aig_mode false
% 0.23/0.46
% 0.23/0.46 % ------ Instantiation Options
% 0.23/0.46
% 0.23/0.46 % --instantiation_flag true
% 0.23/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.23/0.46 % --inst_solver_per_active 750
% 0.23/0.46 % --inst_solver_calls_frac 0.5
% 0.23/0.46 % --inst_passive_queue_type priority_queues
% 0.23/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.23/0.46 % --inst_passive_queues_freq [25;2]
% 0.23/0.46 % --inst_dismatching true
% 0.23/0.46 % --inst_eager_unprocessed_to_passive true
% 0.23/0.46 % --inst_prop_sim_given true
% 0.23/0.46 % --inst_prop_sim_new false
% 0.23/0.46 % --inst_orphan_elimination true
% 0.23/0.46 % --inst_learning_loop_flag true
% 0.23/0.46 % --inst_learning_start 3000
% 0.23/0.46 % --inst_learning_factor 2
% 0.23/0.46 % --inst_start_prop_sim_after_learn 3
% 0.23/0.46 % --inst_sel_renew solver
% 0.23/0.46 % --inst_lit_activity_flag true
% 0.23/0.46 % --inst_out_proof true
% 0.23/0.46
% 0.23/0.46 % ------ Resolution Options
% 0.23/0.46
% 0.23/0.46 % --resolution_flag true
% 0.23/0.46 % --res_lit_sel kbo_max
% 0.23/0.46 % --res_to_prop_solver none
% 0.23/0.46 % --res_prop_simpl_new false
% 0.23/0.46 % --res_prop_simpl_given false
% 0.23/0.46 % --res_passive_queue_type priority_queues
% 0.23/0.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.23/0.46 % --res_passive_queues_freq [15;5]
% 0.23/0.46 % --res_forward_subs full
% 0.23/0.46 % --res_backward_subs full
% 0.23/0.46 % --res_forward_subs_resolution true
% 0.23/0.46 % --res_backward_subs_resolution true
% 0.23/0.46 % --res_orphan_elimination false
% 0.23/0.46 % --res_time_limit 1000.
% 0.23/0.46 % --res_out_proof true
% 0.23/0.46 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b8d35c.s
% 0.23/0.46 % --modulo true
% 0.23/0.46
% 0.23/0.46 % ------ Combination Options
% 0.23/0.46
% 0.23/0.46 % --comb_res_mult 1000
% 0.23/0.46 % --comb_inst_mult 300
% 0.23/0.46 % ------
% 0.23/0.46
% 0.23/0.46 % ------ Parsing...% successful
% 0.23/0.46
% 0.23/0.46 % ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.23/0.46
% 0.23/0.46 % ------ Proving...
% 0.23/0.46 % ------ Problem Properties
% 0.23/0.46
% 0.23/0.46 %
% 0.23/0.46 % EPR true
% 0.23/0.46 % Horn false
% 0.23/0.46 % Has equality false
% 0.23/0.46
% 0.23/0.46 % % ------ Input Options Time Limit: Unbounded
% 0.23/0.46
% 0.23/0.46
% 0.23/0.46 % % ------ Current options:
% 0.23/0.46
% 0.23/0.46 % ------ Input Options
% 0.23/0.46
% 0.23/0.46 % --out_options all
% 0.23/0.46 % --tptp_safe_out true
% 0.23/0.46 % --problem_path ""
% 0.23/0.46 % --include_path ""
% 0.23/0.46 % --clausifier .//eprover
% 0.23/0.46 % --clausifier_options --tstp-format
% 0.23/0.46 % --stdin false
% 0.23/0.46 % --dbg_backtrace false
% 0.23/0.46 % --dbg_dump_prop_clauses false
% 0.23/0.46 % --dbg_dump_prop_clauses_file -
% 0.23/0.46 % --dbg_out_stat false
% 0.23/0.46
% 0.23/0.46 % ------ General Options
% 0.23/0.46
% 0.23/0.46 % --fof false
% 0.23/0.46 % --time_out_real 150.
% 0.23/0.46 % --time_out_prep_mult 0.2
% 0.23/0.46 % --time_out_virtual -1.
% 0.23/0.46 % --schedule none
% 0.23/0.46 % --ground_splitting input
% 0.23/0.46 % --splitting_nvd 16
% 0.23/0.46 % --non_eq_to_eq false
% 0.23/0.46 % --prep_gs_sim true
% 0.23/0.46 % --prep_unflatten false
% 0.23/0.46 % --prep_res_sim true
% 0.23/0.46 % --prep_upred true
% 0.23/0.46 % --res_sim_input true
% 0.23/0.46 % --clause_weak_htbl true
% 0.23/0.46 % --gc_record_bc_elim false
% 0.23/0.46 % --symbol_type_check false
% 0.23/0.46 % --clausify_out false
% 0.23/0.46 % --large_theory_mode false
% 0.23/0.46 % --prep_sem_filter none
% 0.23/0.46 % --prep_sem_filter_out false
% 0.23/0.46 % --preprocessed_out false
% 0.23/0.46 % --sub_typing false
% 0.23/0.46 % --brand_transform false
% 0.23/0.46 % --pure_diseq_elim true
% 0.23/0.46 % --min_unsat_core false
% 0.23/0.46 % --pred_elim true
% 0.23/0.46 % --add_important_lit false
% 0.23/0.46 % --soft_assumptions false
% 0.23/0.46 % --reset_solvers false
% 0.23/0.46 % --bc_imp_inh []
% 0.23/0.46 % --conj_cone_tolerance 1.5
% 0.23/0.46 % --prolific_symb_bound 500
% 0.23/0.46 % --lt_threshold 2000
% 0.23/0.46
% 0.23/0.46 % ------ SAT Options
% 0.23/0.46
% 0.23/0.46 % --sat_mode false
% 0.23/0.46 % --sat_fm_restart_options ""
% 0.23/0.46 % --sat_gr_def false
% 0.23/0.46 % --sat_epr_types true
% 0.23/0.46 % --sat_non_cyclic_types false
% 0.23/0.46 % --sat_finite_models false
% 0.23/0.46 % --sat_fm_lemmas false
% 0.23/0.46 % --sat_fm_prep false
% 0.23/0.46 % --sat_fm_uc_incr true
% 0.23/0.46 % --sat_out_model small
% 0.23/0.46 % --sat_out_clauses false
% 0.23/0.46
% 0.23/0.46 % ------ QBF Options
% 0.23/0.46
% 0.23/0.46 % --qbf_mode false
% 0.23/0.46 % --qbf_elim_univ true
% 0.23/0.46 % --qbf_sk_in true
% 0.23/0.46 % --qbf_pred_elim true
% 0.23/0.46 % --qbf_split 32
% 0.23/0.46
% 0.23/0.46 % ------ BMC1 Options
% 0.23/0.46
% 0.23/0.46 % --bmc1_incremental false
% 0.23/0.46 % --bmc1_axioms reachable_all
% 0.23/0.46 % --bmc1_min_bound 0
% 0.23/0.46 % --bmc1_max_bound -1
% 0.23/0.47 % --bmc1_max_bound_default -1
% 0.23/0.47 % --bmc1_symbol_reachability true
% 0.23/0.47 % --bmc1_property_lemmas false
% 0.23/0.47 % --bmc1_k_induction false
% 0.23/0.47 % --bmc1_non_equiv_states false
% 0.23/0.47 % --bmc1_deadlock false
% 0.23/0.47 % --bmc1_ucm false
% 0.23/0.47 % --bmc1_add_unsat_core none
% 0.23/0.47 % --bmc1_unsat_core_children false
% 0.23/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.23/0.47 % --bmc1_out_stat full
% 0.23/0.47 % --bmc1_ground_init false
% 0.23/0.47 % --bmc1_pre_inst_next_state false
% 0.23/0.47 % --bmc1_pre_inst_state false
% 0.23/0.47 % --bmc1_pre_inst_reach_state false
% 0.23/0.47 % --bmc1_out_unsat_core false
% 0.23/0.47 % --bmc1_aig_witness_out false
% 0.23/0.47 % --bmc1_verbose false
% 0.23/0.47 % --bmc1_dump_clauses_tptp false
% 0.23/0.47 % --bmc1_dump_unsat_core_tptp false
% 0.23/0.47 % --bmc1_dump_file -
% 0.23/0.47 % --bmc1_ucm_expand_uc_limit 128
% 0.23/0.47 % --bmc1_ucm_n_expand_iterations 6
% 0.23/0.47 % --bmc1_ucm_extend_mode 1
% 0.23/0.47 % --bmc1_ucm_init_mode 2
% 0.23/0.47 % --bmc1_ucm_cone_mode none
% 0.23/0.47 % --bmc1_ucm_reduced_relation_type 0
% 0.23/0.47 % --bmc1_ucm_relax_model 4
% 0.23/0.47 % --bmc1_ucm_full_tr_after_sat true
% 0.23/0.47 % --bmc1_ucm_expand_neg_assumptions false
% 0.23/0.47 % --bmc1_ucm_layered_model none
% 0.23/0.47 % --bmc1_ucm_max_lemma_size 10
% 0.23/0.47
% 0.23/0.47 % ------ AIG Options
% 0.23/0.47
% 0.23/0.47 % --aig_mode false
% 0.23/0.47
% 0.23/0.47 % ------ Instantiation Options
% 0.23/0.47
% 0.23/0.47 % --instantiation_flag true
% 0.23/0.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.23/0.47 % --inst_solver_per_active 750
% 0.23/0.47 % --inst_solver_calls_frac 0.5
% 0.23/0.47 % --inst_passive_queue_type priority_queues
% 0.23/0.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.23/0.47 % --inst_passive_queues_freq [25;2]
% 0.23/0.47 % --inst_dismatching true
% 0.23/0.47 % --inst_eager_unprocessed_to_passive true
% 0.23/0.47 % --inst_prop_sim_given true
% 0.23/0.47 % --inst_prop_sim_new false
% 0.23/0.47 % --inst_orphan_elimination true
% 0.23/0.47 % --inst_learning_loop_flag true
% 0.23/0.47 % --inst_learning_start 3000
% 0.23/0.47 % --inst_learning_factor 2
% 0.23/0.47 % --inst_start_prop_sim_after_learn 3
% 0.23/0.47 % --inst_sel_renew solver
% 0.23/0.47 % --inst_lit_activity_flag true
% 0.23/0.47 % --inst_out_proof true
% 0.23/0.47
% 0.23/0.47 % ------ Resolution Options
% 0.23/0.47
% 0.23/0.47 % --resolution_flag true
% 0.23/0.47 % --res_lit_sel kbo_max
% 0.23/0.47 % --res_to_prop_solver none
% 0.23/0.47 % --res_prop_simpl_new false
% 0.23/0.47 % --res_prop_simpl_given false
% 0.23/0.47 % --res_passive_queue_type priority_queues
% 0.23/0.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.23/0.47 % --res_passive_queues_freq [15;5]
% 0.23/0.47 % --res_forward_subs full
% 0.23/0.47 % --res_backward_subs full
% 0.23/0.47 % --res_forward_subs_resolution true
% 0.23/0.47 % --res_backward_subs_resolution true
% 0.23/0.47 % --res_orphan_elimination false
% 0.23/0.47 % --res_time_limit 1000.
% 0.23/0.47 % --res_out_proof true
% 0.23/0.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b8d35c.s
% 0.23/0.47 % --modulo true
% 0.23/0.47
% 0.23/0.47 % ------ Combination Options
% 0.23/0.47
% 0.23/0.47 % --comb_res_mult 1000
% 0.23/0.47 % --comb_inst_mult 300
% 0.23/0.47 % ------
% 0.23/0.47
% 0.23/0.47
% 0.23/0.47
% 0.23/0.47 % ------ Proving...
% 0.23/0.47 %
% 0.23/0.47
% 0.23/0.47
% 0.23/0.47 % Resolution empty clause
% 0.23/0.47
% 0.23/0.47 % ------ Statistics
% 0.23/0.47
% 0.23/0.47 % ------ General
% 0.23/0.47
% 0.23/0.47 % num_of_input_clauses: 17
% 0.23/0.47 % num_of_input_neg_conjectures: 5
% 0.23/0.47 % num_of_splits: 4
% 0.23/0.47 % num_of_split_atoms: 2
% 0.23/0.47 % num_of_sem_filtered_clauses: 0
% 0.23/0.47 % num_of_subtypes: 0
% 0.23/0.47 % monotx_restored_types: 0
% 0.23/0.47 % sat_num_of_epr_types: 0
% 0.23/0.47 % sat_num_of_non_cyclic_types: 0
% 0.23/0.47 % sat_guarded_non_collapsed_types: 0
% 0.23/0.47 % is_epr: 1
% 0.23/0.47 % is_horn: 0
% 0.23/0.47 % has_eq: 0
% 0.23/0.47 % num_pure_diseq_elim: 0
% 0.23/0.47 % simp_replaced_by: 0
% 0.23/0.47 % res_preprocessed: 14
% 0.23/0.47 % prep_upred: 0
% 0.23/0.47 % prep_unflattend: 0
% 0.23/0.47 % pred_elim_cands: 2
% 0.23/0.47 % pred_elim: 1
% 0.23/0.47 % pred_elim_cl: 1
% 0.23/0.47 % pred_elim_cycles: 2
% 0.23/0.47 % forced_gc_time: 0
% 0.23/0.47 % gc_basic_clause_elim: 0
% 0.23/0.47 % parsing_time: 0.
% 0.23/0.47 % sem_filter_time: 0.
% 0.23/0.47 % pred_elim_time: 0.
% 0.23/0.47 % out_proof_time: 0.003
% 0.23/0.47 % monotx_time: 0.
% 0.23/0.47 % subtype_inf_time: 0.
% 0.23/0.47 % unif_index_cands_time: 0.
% 0.23/0.47 % unif_index_add_time: 0.
% 0.23/0.47 % total_time: 0.028
% 0.23/0.47 % num_of_symbols: 35
% 0.23/0.47 % num_of_terms: 55
% 0.23/0.47
% 0.23/0.47 % ------ Propositional Solver
% 0.23/0.47
% 0.23/0.47 % prop_solver_calls: 1
% 0.23/0.47 % prop_fast_solver_calls: 58
% 0.23/0.47 % prop_num_of_clauses: 25
% 0.23/0.47 % prop_preprocess_simplified: 124
% 0.23/0.47 % prop_fo_subsumed: 1
% 0.23/0.47 % prop_solver_time: 0.
% 0.23/0.47 % prop_fast_solver_time: 0.
% 0.23/0.47 % prop_unsat_core_time: 0.
% 0.23/0.47
% 0.23/0.47 % ------ QBF
% 0.23/0.47
% 0.23/0.47 % qbf_q_res: 0
% 0.23/0.47 % qbf_num_tautologies: 0
% 0.23/0.47 % qbf_prep_cycles: 0
% 0.23/0.47
% 0.23/0.47 % ------ BMC1
% 0.23/0.47
% 0.23/0.47 % bmc1_current_bound: -1
% 0.23/0.47 % bmc1_last_solved_bound: -1
% 0.23/0.47 % bmc1_unsat_core_size: -1
% 0.23/0.47 % bmc1_unsat_core_parents_size: -1
% 0.23/0.47 % bmc1_merge_next_fun: 0
% 0.23/0.47 % bmc1_unsat_core_clauses_time: 0.
% 0.23/0.47
% 0.23/0.47 % ------ Instantiation
% 0.23/0.47
% 0.23/0.47 % inst_num_of_clauses: 18
% 0.23/0.47 % inst_num_in_passive: 0
% 0.23/0.47 % inst_num_in_active: 0
% 0.23/0.47 % inst_num_in_unprocessed: 18
% 0.23/0.47 % inst_num_of_loops: 0
% 0.23/0.47 % inst_num_of_learning_restarts: 0
% 0.23/0.47 % inst_num_moves_active_passive: 0
% 0.23/0.47 % inst_lit_activity: 0
% 0.23/0.47 % inst_lit_activity_moves: 0
% 0.23/0.47 % inst_num_tautologies: 0
% 0.23/0.47 % inst_num_prop_implied: 0
% 0.23/0.47 % inst_num_existing_simplified: 0
% 0.23/0.47 % inst_num_eq_res_simplified: 0
% 0.23/0.47 % inst_num_child_elim: 0
% 0.23/0.47 % inst_num_of_dismatching_blockings: 0
% 0.23/0.47 % inst_num_of_non_proper_insts: 0
% 0.23/0.47 % inst_num_of_duplicates: 0
% 0.23/0.47 % inst_inst_num_from_inst_to_res: 0
% 0.23/0.47 % inst_dismatching_checking_time: 0.
% 0.23/0.47
% 0.23/0.47 % ------ Resolution
% 0.23/0.47
% 0.23/0.47 % res_num_of_clauses: 18
% 0.23/0.47 % res_num_in_passive: 1
% 0.23/0.47 % res_num_in_active: 7
% 0.23/0.47 % res_num_of_loops: 28
% 0.23/0.47 % res_forward_subset_subsumed: 12
% 0.23/0.47 % res_backward_subset_subsumed: 11
% 0.23/0.47 % res_forward_subsumed: 4
% 0.23/0.47 % res_backward_subsumed: 7
% 0.23/0.47 % res_forward_subsumption_resolution: 9
% 0.23/0.47 % res_backward_subsumption_resolution: 5
% 0.23/0.47 % res_clause_to_clause_subsumption: 26
% 0.23/0.47 % res_orphan_elimination: 0
% 0.23/0.47 % res_tautology_del: 1
% 0.23/0.47 % res_num_eq_res_simplified: 0
% 0.23/0.47 % res_num_sel_changes: 0
% 0.23/0.47 % res_moves_from_active_to_pass: 0
% 0.23/0.47
% 0.23/0.47 % Status Unsatisfiable
% 0.23/0.47 % SZS status Theorem
% 0.23/0.47 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------