TSTP Solution File: PUZ035-7 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ035-7 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n028.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 : Mon Jul 18 18:13:50 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of formulae : 150 ( 9 unt; 0 def)
% Number of atoms : 346 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 381 ( 185 ~; 196 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 218 ( 45 sgn 75 !; 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
fof(c_0_0,axiom,
! [X4,X5] :
( ~ reply(X5,X4,yes)
| ~ reply(X5,X4,no) ),
file('<stdin>',not_yes_and_no) ).
fof(c_0_1,axiom,
! [X4,X5] :
( truth(X4)
| ~ truth(isa(X5,knight))
| ~ reply(X5,X4,yes) ),
file('<stdin>',knights_make_true_statements1) ).
fof(c_0_2,axiom,
! [X4,X5] :
( ~ truth(X4)
| truth(isa(X5,knight))
| ~ reply(X5,X4,yes) ),
file('<stdin>',knights_make_true_statements2) ).
fof(c_0_3,axiom,
! [X4,X5] :
( reply(X5,X4,yes)
| reply(X5,X4,no) ),
file('<stdin>',yes_or_no) ).
fof(c_0_4,axiom,
! [X4,X5] :
( ~ truth(X4)
| ~ truth(isa(X5,knight))
| reply(X5,X4,yes) ),
file('<stdin>',knights_make_true_statements3) ).
fof(c_0_5,axiom,
! [X5] :
( ~ truth(isa(X5,knight))
| ~ truth(isa(X5,knave)) ),
file('<stdin>',not_both_a_knight_and_knave) ).
fof(c_0_6,axiom,
! [X4,X5] :
( truth(X4)
| truth(isa(X5,knight))
| reply(X5,X4,yes) ),
file('<stdin>',knights_make_true_statements4) ).
fof(c_0_7,axiom,
! [X1,X2] :
( truth(X2)
| truth(X1)
| ~ truth(or(X2,X1)) ),
file('<stdin>',or1) ).
fof(c_0_8,axiom,
! [X5] :
( truth(isa(X5,knight))
| truth(isa(X5,knave)) ),
file('<stdin>',everyone_a_knight_or_knave) ).
fof(c_0_9,axiom,
! [X1,X2] :
( truth(or(X2,X1))
| ~ truth(X2) ),
file('<stdin>',or2) ).
fof(c_0_10,axiom,
! [X1,X2] :
( truth(or(X2,X1))
| ~ truth(X1) ),
file('<stdin>',or3) ).
fof(c_0_11,axiom,
! [X3] :
( ~ truth(X3)
| ~ truth(not(X3)) ),
file('<stdin>',true2) ).
fof(c_0_12,axiom,
! [X3] :
( truth(X3)
| truth(not(X3)) ),
file('<stdin>',true1) ).
fof(c_0_13,plain,
! [X4,X5] :
( ~ reply(X5,X4,yes)
| ~ reply(X5,X4,no) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_14,plain,
! [X4,X5] :
( truth(X4)
| ~ truth(isa(X5,knight))
| ~ reply(X5,X4,yes) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_15,plain,
! [X4,X5] :
( ~ truth(X4)
| truth(isa(X5,knight))
| ~ reply(X5,X4,yes) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_16,axiom,
! [X4,X5] :
( reply(X5,X4,yes)
| reply(X5,X4,no) ),
c_0_3 ).
fof(c_0_17,plain,
! [X4,X5] :
( ~ truth(X4)
| ~ truth(isa(X5,knight))
| reply(X5,X4,yes) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_18,plain,
! [X5] :
( ~ truth(isa(X5,knight))
| ~ truth(isa(X5,knave)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_19,axiom,
! [X4,X5] :
( truth(X4)
| truth(isa(X5,knight))
| reply(X5,X4,yes) ),
c_0_6 ).
fof(c_0_20,plain,
! [X1,X2] :
( truth(X2)
| truth(X1)
| ~ truth(or(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_21,axiom,
! [X5] :
( truth(isa(X5,knight))
| truth(isa(X5,knave)) ),
c_0_8 ).
fof(c_0_22,plain,
! [X1,X2] :
( truth(or(X2,X1))
| ~ truth(X2) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_23,plain,
! [X1,X2] :
( truth(or(X2,X1))
| ~ truth(X1) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
! [X3] :
( ~ truth(X3)
| ~ truth(not(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_25,axiom,
! [X3] :
( truth(X3)
| truth(not(X3)) ),
c_0_12 ).
fof(c_0_26,plain,
! [X6,X7] :
( ~ reply(X7,X6,yes)
| ~ reply(X7,X6,no) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_27,plain,
! [X6,X7] :
( truth(X6)
| ~ truth(isa(X7,knight))
| ~ reply(X7,X6,yes) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_14])])]) ).
fof(c_0_28,plain,
! [X6,X7] :
( ~ truth(X6)
| truth(isa(X7,knight))
| ~ reply(X7,X6,yes) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_15])])]) ).
fof(c_0_29,plain,
! [X6,X7] :
( reply(X7,X6,yes)
| reply(X7,X6,no) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_30,plain,
! [X6,X7] :
( ~ truth(X6)
| ~ truth(isa(X7,knight))
| reply(X7,X6,yes) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_17])])]) ).
fof(c_0_31,plain,
! [X6] :
( ~ truth(isa(X6,knight))
| ~ truth(isa(X6,knave)) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_32,plain,
! [X6,X7] :
( truth(X6)
| truth(isa(X7,knight))
| reply(X7,X6,yes) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_19])])]) ).
fof(c_0_33,plain,
! [X3,X4] :
( truth(X4)
| truth(X3)
| ~ truth(or(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_34,plain,
! [X6] :
( truth(isa(X6,knight))
| truth(isa(X6,knave)) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
fof(c_0_35,plain,
! [X3,X4] :
( truth(or(X4,X3))
| ~ truth(X4) ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
fof(c_0_36,plain,
! [X3,X4] :
( truth(or(X4,X3))
| ~ truth(X3) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_23])])]) ).
fof(c_0_37,plain,
! [X4] :
( ~ truth(X4)
| ~ truth(not(X4)) ),
inference(variable_rename,[status(thm)],[c_0_24]) ).
fof(c_0_38,plain,
! [X4] :
( truth(X4)
| truth(not(X4)) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
cnf(c_0_39,plain,
( ~ reply(X1,X2,no)
| ~ reply(X1,X2,yes) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,plain,
( truth(X2)
| ~ reply(X1,X2,yes)
| ~ truth(isa(X1,knight)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_41,plain,
( truth(isa(X1,knight))
| ~ reply(X1,X2,yes)
| ~ truth(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_42,plain,
( reply(X1,X2,no)
| reply(X1,X2,yes) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_43,plain,
( reply(X1,X2,yes)
| ~ truth(isa(X1,knight))
| ~ truth(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_44,plain,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_45,plain,
( reply(X1,X2,yes)
| truth(isa(X1,knight))
| truth(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_46,plain,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_47,plain,
( truth(isa(X1,knave))
| truth(isa(X1,knight)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_48,plain,
( truth(or(X1,X2))
| ~ truth(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_49,plain,
( truth(or(X2,X1))
| ~ truth(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_50,plain,
( ~ truth(not(X1))
| ~ truth(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_51,plain,
( truth(not(X1))
| truth(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_52,plain,
( ~ reply(X1,X2,no)
| ~ reply(X1,X2,yes) ),
c_0_39,
[final] ).
cnf(c_0_53,plain,
( truth(X2)
| ~ reply(X1,X2,yes)
| ~ truth(isa(X1,knight)) ),
c_0_40,
[final] ).
cnf(c_0_54,plain,
( truth(isa(X1,knight))
| ~ reply(X1,X2,yes)
| ~ truth(X2) ),
c_0_41,
[final] ).
cnf(c_0_55,plain,
( reply(X1,X2,no)
| reply(X1,X2,yes) ),
c_0_42,
[final] ).
cnf(c_0_56,plain,
( reply(X1,X2,yes)
| ~ truth(isa(X1,knight))
| ~ truth(X2) ),
c_0_43,
[final] ).
cnf(c_0_57,plain,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
c_0_44,
[final] ).
cnf(c_0_58,plain,
( reply(X1,X2,yes)
| truth(isa(X1,knight))
| truth(X2) ),
c_0_45,
[final] ).
cnf(c_0_59,plain,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
c_0_46,
[final] ).
cnf(c_0_60,plain,
( truth(isa(X1,knave))
| truth(isa(X1,knight)) ),
c_0_47,
[final] ).
cnf(c_0_61,plain,
( truth(or(X1,X2))
| ~ truth(X1) ),
c_0_48,
[final] ).
cnf(c_0_62,plain,
( truth(or(X2,X1))
| ~ truth(X1) ),
c_0_49,
[final] ).
cnf(c_0_63,plain,
( ~ truth(not(X1))
| ~ truth(X1) ),
c_0_50,
[final] ).
cnf(c_0_64,plain,
( truth(not(X1))
| truth(X1) ),
c_0_51,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_52_0,axiom,
( ~ reply(X1,X2,no)
| ~ reply(X1,X2,yes) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( ~ reply(X1,X2,yes)
| ~ reply(X1,X2,no) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( truth(X2)
| ~ reply(X1,X2,yes)
| ~ truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( ~ reply(X1,X2,yes)
| truth(X2)
| ~ truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_2,axiom,
( ~ truth(isa(X1,knight))
| ~ reply(X1,X2,yes)
| truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
( truth(isa(X1,knight))
| ~ reply(X1,X2,yes)
| ~ truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_1,axiom,
( ~ reply(X1,X2,yes)
| truth(isa(X1,knight))
| ~ truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_2,axiom,
( ~ truth(X2)
| ~ reply(X1,X2,yes)
| truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_55_0,axiom,
( reply(X1,X2,no)
| reply(X1,X2,yes) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_55_1,axiom,
( reply(X1,X2,yes)
| reply(X1,X2,no) ),
inference(literals_permutation,[status(thm)],[c_0_55]) ).
cnf(c_0_56_0,axiom,
( reply(X1,X2,yes)
| ~ truth(isa(X1,knight))
| ~ truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_1,axiom,
( ~ truth(isa(X1,knight))
| reply(X1,X2,yes)
| ~ truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_56_2,axiom,
( ~ truth(X2)
| ~ truth(isa(X1,knight))
| reply(X1,X2,yes) ),
inference(literals_permutation,[status(thm)],[c_0_56]) ).
cnf(c_0_57_0,axiom,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_57_1,axiom,
( ~ truth(isa(X1,knight))
| ~ truth(isa(X1,knave)) ),
inference(literals_permutation,[status(thm)],[c_0_57]) ).
cnf(c_0_58_0,axiom,
( reply(X1,X2,yes)
| truth(isa(X1,knight))
| truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_1,axiom,
( truth(isa(X1,knight))
| reply(X1,X2,yes)
| truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_58_2,axiom,
( truth(X2)
| truth(isa(X1,knight))
| reply(X1,X2,yes) ),
inference(literals_permutation,[status(thm)],[c_0_58]) ).
cnf(c_0_59_0,axiom,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_1,axiom,
( truth(X1)
| truth(X2)
| ~ truth(or(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_59_2,axiom,
( ~ truth(or(X1,X2))
| truth(X1)
| truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_59]) ).
cnf(c_0_60_0,axiom,
( truth(isa(X1,knave))
| truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_60_1,axiom,
( truth(isa(X1,knight))
| truth(isa(X1,knave)) ),
inference(literals_permutation,[status(thm)],[c_0_60]) ).
cnf(c_0_61_0,axiom,
( truth(or(X1,X2))
| ~ truth(X1) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_61_1,axiom,
( ~ truth(X1)
| truth(or(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_61]) ).
cnf(c_0_62_0,axiom,
( truth(or(X2,X1))
| ~ truth(X1) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_62_1,axiom,
( ~ truth(X1)
| truth(or(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_62]) ).
cnf(c_0_63_0,axiom,
( ~ truth(not(X1))
| ~ truth(X1) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_63_1,axiom,
( ~ truth(X1)
| ~ truth(not(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_63]) ).
cnf(c_0_64_0,axiom,
( truth(not(X1))
| truth(X1) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
cnf(c_0_64_1,axiom,
( truth(X1)
| truth(not(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_64]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
! [X1,X2,X3] :
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X3)
| ~ truth(isa(asked,X2))
| ~ truth(isa(other,X1)) ),
file('<stdin>',prove_answer) ).
fof(c_0_1_002,negated_conjecture,
! [X1,X2,X3] :
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X3)
| ~ truth(isa(asked,X2))
| ~ truth(isa(other,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
! [X4,X5,X6] :
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X4)
| ~ truth(isa(asked,X5))
| ~ truth(isa(other,X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
( ~ truth(isa(other,X1))
| ~ truth(isa(asked,X2))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( ~ truth(isa(other,X1))
| ~ truth(isa(asked,X2))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X3) ),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_31,negated_conjecture,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| ~ truth(isa(other,X1))
| ~ truth(isa(asked,X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_bb58b7.p',c_0_4) ).
cnf(c_46,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_31]) ).
cnf(c_50,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_58,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_73,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_78,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_128,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_229,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_128]) ).
cnf(c_21,plain,
( truth(isa(X0,knight))
| truth(isa(X0,knave)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_bb58b7.p',c_0_60_0) ).
cnf(c_205,plain,
( truth(isa(X0,knight))
| truth(isa(X0,knave)) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_243,plain,
( truth(isa(asked,knight))
| ~ sP1_iProver_split ),
inference(resolution,[status(thm)],[c_229,c_205]) ).
cnf(c_244,plain,
( truth(isa(asked,knight))
| ~ sP1_iProver_split ),
inference(rewriting,[status(thm)],[c_243]) ).
cnf(c_273,plain,
~ sP1_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_244,c_229]) ).
cnf(c_274,plain,
~ sP1_iProver_split,
inference(rewriting,[status(thm)],[c_273]) ).
cnf(c_52,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split,sP1_iProver_split,sP0_iProver_split])],[c_31]) ).
cnf(c_62,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_75,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_76,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_47,negated_conjecture,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| ~ sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_31]) ).
cnf(c_51,negated_conjecture,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_60,negated_conjecture,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_74,negated_conjecture,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_77,negated_conjecture,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_80,plain,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(resolution,[status(thm)],[c_76,c_77]) ).
cnf(c_91,plain,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_80]) ).
cnf(c_95,plain,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_126,plain,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_225,plain,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_126]) ).
cnf(c_276,plain,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| sP0_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_274,c_225]) ).
cnf(c_277,plain,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0)
| sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_276]) ).
cnf(c_45,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_31]) ).
cnf(c_49,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_56,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_72,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_79,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_127,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_227,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_127]) ).
cnf(c_257,plain,
( truth(isa(other,knight))
| ~ sP0_iProver_split ),
inference(resolution,[status(thm)],[c_227,c_205]) ).
cnf(c_258,plain,
( truth(isa(other,knight))
| ~ sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_257]) ).
cnf(c_280,plain,
~ sP0_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_258,c_227]) ).
cnf(c_281,plain,
~ sP0_iProver_split,
inference(rewriting,[status(thm)],[c_280]) ).
cnf(c_285,plain,
~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0),
inference(forward_subsumption_resolution,[status(thm)],[c_277,c_281]) ).
cnf(c_286,plain,
~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0),
inference(rewriting,[status(thm)],[c_285]) ).
cnf(c_8,plain,
( reply(X0,X1,yes)
| reply(X0,X1,no) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_bb58b7.p',c_0_55_0) ).
cnf(c_179,plain,
( reply(X0,X1,yes)
| reply(X0,X1,no) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_180,plain,
( reply(X0,X1,no)
| reply(X0,X1,yes) ),
inference(rewriting,[status(thm)],[c_179]) ).
cnf(c_288,plain,
reply(asked,or(isa(asked,knight),isa(other,knight)),yes),
inference(resolution,[status(thm)],[c_286,c_180]) ).
cnf(c_289,plain,
reply(asked,or(isa(asked,knight),isa(other,knight)),yes),
inference(rewriting,[status(thm)],[c_288]) ).
cnf(c_295,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_289,c_286]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ035-7 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat May 28 20:29:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.39 % Orientation found
% 0.12/0.39 % 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_fefe21.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_bb58b7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6dd9cf | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fefe21.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42 % ------ Parsing...% successful
% 0.19/0.42
% 0.19/0.42 % ------ Preprocessing... gs_s sp: 6 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.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 % ------ Problem Properties
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % EPR false
% 0.19/0.42 % Horn false
% 0.19/0.42 % Has equality false
% 0.19/0.42
% 0.19/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % % ------ Current options:
% 0.19/0.42
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.42 % --bmc1_dump_file -
% 0.19/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.42 % --bmc1_ucm_extend_mode 1
% 0.19/0.42 % --bmc1_ucm_init_mode 2
% 0.19/0.42 % --bmc1_ucm_cone_mode none
% 0.19/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.42 % --bmc1_ucm_relax_model 4
% 0.19/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.42 % --bmc1_ucm_layered_model none
% 0.19/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.42
% 0.19/0.42 % ------ AIG Options
% 0.19/0.42
% 0.19/0.42 % --aig_mode false
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation Options
% 0.19/0.42
% 0.19/0.42 % --instantiation_flag true
% 0.19/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.42 % --inst_solver_per_active 750
% 0.19/0.42 % --inst_solver_calls_frac 0.5
% 0.19/0.42 % --inst_passive_queue_type priority_queues
% 0.19/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.42 % --inst_passive_queues_freq [25;2]
% 0.19/0.42 % --inst_dismatching true
% 0.19/0.42 % --inst_eager_unprocessed_to_passive true
% 0.19/0.42 % --inst_prop_sim_given true
% 0.19/0.42 % --inst_prop_sim_new false
% 0.19/0.42 % --inst_orphan_elimination true
% 0.19/0.42 % --inst_learning_loop_flag true
% 0.19/0.42 % --inst_learning_start 3000
% 0.19/0.42 % --inst_learning_factor 2
% 0.19/0.42 % --inst_start_prop_sim_after_learn 3
% 0.19/0.42 % --inst_sel_renew solver
% 0.19/0.42 % --inst_lit_activity_flag true
% 0.19/0.42 % --inst_out_proof true
% 0.19/0.42
% 0.19/0.42 % ------ Resolution Options
% 0.19/0.42
% 0.19/0.42 % --resolution_flag true
% 0.19/0.42 % --res_lit_sel kbo_max
% 0.19/0.42 % --res_to_prop_solver none
% 0.19/0.42 % --res_prop_simpl_new false
% 0.19/0.42 % --res_prop_simpl_given false
% 0.19/0.42 % --res_passive_queue_type priority_queues
% 0.19/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.42 % --res_passive_queues_freq [15;5]
% 0.19/0.42 % --res_forward_subs full
% 0.19/0.42 % --res_backward_subs full
% 0.19/0.42 % --res_forward_subs_resolution true
% 0.19/0.42 % --res_backward_subs_resolution true
% 0.19/0.42 % --res_orphan_elimination false
% 0.19/0.42 % --res_time_limit 1000.
% 0.19/0.42 % --res_out_proof true
% 0.19/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fefe21.s
% 0.19/0.42 % --modulo true
% 0.19/0.42
% 0.19/0.42 % ------ Combination Options
% 0.19/0.42
% 0.19/0.42 % --comb_res_mult 1000
% 0.19/0.42 % --comb_inst_mult 300
% 0.19/0.42 % ------
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % ------ Proving...
% 0.19/0.42 %
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 % Resolution empty clause
% 0.19/0.42
% 0.19/0.42 % ------ Statistics
% 0.19/0.42
% 0.19/0.42 % ------ General
% 0.19/0.42
% 0.19/0.42 % num_of_input_clauses: 32
% 0.19/0.42 % num_of_input_neg_conjectures: 1
% 0.19/0.42 % num_of_splits: 6
% 0.19/0.42 % num_of_split_atoms: 3
% 0.19/0.42 % num_of_sem_filtered_clauses: 0
% 0.19/0.42 % num_of_subtypes: 0
% 0.19/0.42 % monotx_restored_types: 0
% 0.19/0.42 % sat_num_of_epr_types: 0
% 0.19/0.42 % sat_num_of_non_cyclic_types: 0
% 0.19/0.42 % sat_guarded_non_collapsed_types: 0
% 0.19/0.42 % is_epr: 0
% 0.19/0.42 % is_horn: 0
% 0.19/0.42 % has_eq: 0
% 0.19/0.42 % num_pure_diseq_elim: 0
% 0.19/0.42 % simp_replaced_by: 0
% 0.19/0.42 % res_preprocessed: 8
% 0.19/0.42 % prep_upred: 0
% 0.19/0.42 % prep_unflattend: 0
% 0.19/0.42 % pred_elim_cands: 3
% 0.19/0.42 % pred_elim: 1
% 0.19/0.42 % pred_elim_cl: 1
% 0.19/0.42 % pred_elim_cycles: 3
% 0.19/0.42 % forced_gc_time: 0
% 0.19/0.42 % gc_basic_clause_elim: 0
% 0.19/0.42 % parsing_time: 0.001
% 0.19/0.42 % sem_filter_time: 0.
% 0.19/0.42 % pred_elim_time: 0.
% 0.19/0.42 % out_proof_time: 0.002
% 0.19/0.42 % monotx_time: 0.
% 0.19/0.42 % subtype_inf_time: 0.
% 0.19/0.42 % unif_index_cands_time: 0.
% 0.19/0.42 % unif_index_add_time: 0.
% 0.19/0.42 % total_time: 0.025
% 0.19/0.42 % num_of_symbols: 39
% 0.19/0.42 % num_of_terms: 128
% 0.19/0.42
% 0.19/0.42 % ------ Propositional Solver
% 0.19/0.42
% 0.19/0.42 % prop_solver_calls: 1
% 0.19/0.42 % prop_fast_solver_calls: 36
% 0.19/0.42 % prop_num_of_clauses: 46
% 0.19/0.42 % prop_preprocess_simplified: 157
% 0.19/0.42 % prop_fo_subsumed: 0
% 0.19/0.42 % prop_solver_time: 0.
% 0.19/0.42 % prop_fast_solver_time: 0.
% 0.19/0.42 % prop_unsat_core_time: 0.
% 0.19/0.42
% 0.19/0.42 % ------ QBF
% 0.19/0.42
% 0.19/0.42 % qbf_q_res: 0
% 0.19/0.42 % qbf_num_tautologies: 0
% 0.19/0.42 % qbf_prep_cycles: 0
% 0.19/0.42
% 0.19/0.42 % ------ BMC1
% 0.19/0.42
% 0.19/0.42 % bmc1_current_bound: -1
% 0.19/0.42 % bmc1_last_solved_bound: -1
% 0.19/0.42 % bmc1_unsat_core_size: -1
% 0.19/0.42 % bmc1_unsat_core_parents_size: -1
% 0.19/0.42 % bmc1_merge_next_fun: 0
% 0.19/0.42 % bmc1_unsat_core_clauses_time: 0.
% 0.19/0.42
% 0.19/0.42 % ------ Instantiation
% 0.19/0.42
% 0.19/0.42 % inst_num_of_clauses: 34
% 0.19/0.42 % inst_num_in_passive: 0
% 0.19/0.42 % inst_num_in_active: 0
% 0.19/0.42 % inst_num_in_unprocessed: 34
% 0.19/0.42 % inst_num_of_loops: 0
% 0.19/0.43 % inst_num_of_learning_restarts: 0
% 0.19/0.43 % inst_num_moves_active_passive: 0
% 0.19/0.43 % inst_lit_activity: 0
% 0.19/0.43 % inst_lit_activity_moves: 0
% 0.19/0.43 % inst_num_tautologies: 0
% 0.19/0.43 % inst_num_prop_implied: 0
% 0.19/0.43 % inst_num_existing_simplified: 0
% 0.19/0.43 % inst_num_eq_res_simplified: 0
% 0.19/0.43 % inst_num_child_elim: 0
% 0.19/0.43 % inst_num_of_dismatching_blockings: 0
% 0.19/0.43 % inst_num_of_non_proper_insts: 0
% 0.19/0.43 % inst_num_of_duplicates: 0
% 0.19/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.19/0.43 % inst_dismatching_checking_time: 0.
% 0.19/0.43
% 0.19/0.43 % ------ Resolution
% 0.19/0.43
% 0.19/0.43 % res_num_of_clauses: 39
% 0.19/0.43 % res_num_in_passive: 5
% 0.19/0.43 % res_num_in_active: 17
% 0.19/0.43 % res_num_of_loops: 15
% 0.19/0.43 % res_forward_subset_subsumed: 17
% 0.19/0.43 % res_backward_subset_subsumed: 3
% 0.19/0.43 % res_forward_subsumed: 8
% 0.19/0.43 % res_backward_subsumed: 2
% 0.19/0.43 % res_forward_subsumption_resolution: 4
% 0.19/0.43 % res_backward_subsumption_resolution: 1
% 0.19/0.43 % res_clause_to_clause_subsumption: 15
% 0.19/0.43 % res_orphan_elimination: 0
% 0.19/0.43 % res_tautology_del: 0
% 0.19/0.43 % res_num_eq_res_simplified: 0
% 0.19/0.43 % res_num_sel_changes: 0
% 0.19/0.43 % res_moves_from_active_to_pass: 0
% 0.19/0.43
% 0.19/0.43 % Status Unsatisfiable
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------