TSTP Solution File: PUZ035-4 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ035-4 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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:49 EDT 2022
% Result : Unsatisfiable 0.21s 0.43s
% Output : CNFRefutation 0.21s
% 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
cnf(other_person,axiom,
person(other),
input ).
fof(other_person_0,plain,
( person(other)
| $false ),
inference(orientation,[status(thm)],[other_person]) ).
cnf(asked_person,axiom,
person(asked),
input ).
fof(asked_person_0,plain,
( person(asked)
| $false ),
inference(orientation,[status(thm)],[asked_person]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> person(asked) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[asked_person_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
( lhs_atom2
<=> person(other) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
( lhs_atom2
| $false ),
inference(fold_definition,[status(thm)],[other_person_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
( lhs_atom2
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_2,plain,
lhs_atom2,
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4,plain,
lhs_atom2,
c_0_2 ).
fof(c_0_5,plain,
lhs_atom1,
c_0_3 ).
cnf(c_0_6,plain,
lhs_atom2,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
lhs_atom2,
c_0_6,
[final] ).
cnf(c_0_9,plain,
lhs_atom1,
c_0_7,
[final] ).
% End CNF derivation
cnf(c_0_8_0,axiom,
person(other),
inference(unfold_definition,[status(thm)],[c_0_8,def_lhs_atom2]) ).
cnf(c_0_9_0,axiom,
person(asked),
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
fof(c_0_0_001,axiom,
( says(asked,or(isa(asked,knight),isa(other,knight)))
| says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
file('<stdin>',one_is_knight_answer) ).
fof(c_0_1_002,axiom,
! [X3,X2] :
( ~ truth(X3)
| ~ truth(not(or(X3,X2))) ),
file('<stdin>',not1) ).
fof(c_0_2_003,axiom,
! [X1,X2] :
( ~ truth(X1)
| ~ truth(not(or(X2,X1))) ),
file('<stdin>',not2) ).
fof(c_0_3_004,axiom,
! [X6] :
( ~ truth(isa(X6,knight))
| ~ truth(isa(X6,knave)) ),
file('<stdin>',not_both_a_knight_and_knave) ).
fof(c_0_4_005,axiom,
! [X4,X6] :
( truth(X4)
| ~ says(X6,X4)
| ~ truth(isa(X6,knight)) ),
file('<stdin>',knights_make_true_statements1) ).
fof(c_0_5_006,axiom,
! [X6] :
( ~ person(X6)
| truth(isa(X6,knight))
| truth(isa(X6,knave)) ),
file('<stdin>',everyone_a_knight_or_knave) ).
fof(c_0_6_007,axiom,
! [X4,X6] :
( truth(isa(X6,knight))
| ~ says(X6,X4)
| ~ truth(X4) ),
file('<stdin>',knights_make_true_statements2) ).
fof(c_0_7_008,axiom,
! [X1,X3] :
( truth(X3)
| truth(X1)
| ~ truth(or(X3,X1)) ),
file('<stdin>',or_def) ).
fof(c_0_8_009,axiom,
! [X4,X5] :
( truth(X4)
| truth(not(X4))
| ~ says(X5,not(X4)) ),
file('<stdin>',statements_are_true_or_false2) ).
fof(c_0_9_010,axiom,
! [X4,X5] :
( truth(X4)
| truth(not(X4))
| ~ says(X5,X4) ),
file('<stdin>',statements_are_true_or_false) ).
fof(c_0_10,axiom,
! [X4] :
( ~ truth(X4)
| ~ truth(not(X4)) ),
file('<stdin>',statements_are_true_or_false3) ).
fof(c_0_11,axiom,
( says(asked,or(isa(asked,knight),isa(other,knight)))
| says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
c_0_0 ).
fof(c_0_12,plain,
! [X3,X2] :
( ~ truth(X3)
| ~ truth(not(or(X3,X2))) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_13,plain,
! [X1,X2] :
( ~ truth(X1)
| ~ truth(not(or(X2,X1))) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_14,plain,
! [X6] :
( ~ truth(isa(X6,knight))
| ~ truth(isa(X6,knave)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_15,plain,
! [X4,X6] :
( truth(X4)
| ~ says(X6,X4)
| ~ truth(isa(X6,knight)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_16,plain,
! [X6] :
( ~ person(X6)
| truth(isa(X6,knight))
| truth(isa(X6,knave)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_17,plain,
! [X4,X6] :
( truth(isa(X6,knight))
| ~ says(X6,X4)
| ~ truth(X4) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X1,X3] :
( truth(X3)
| truth(X1)
| ~ truth(or(X3,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_19,plain,
! [X4,X5] :
( truth(X4)
| truth(not(X4))
| ~ says(X5,not(X4)) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_20,plain,
! [X4,X5] :
( truth(X4)
| truth(not(X4))
| ~ says(X5,X4) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_21,plain,
! [X4] :
( ~ truth(X4)
| ~ truth(not(X4)) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_22,axiom,
( says(asked,or(isa(asked,knight),isa(other,knight)))
| says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
c_0_11 ).
fof(c_0_23,plain,
! [X4,X5] :
( ~ truth(X4)
| ~ truth(not(or(X4,X5))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_12])])]) ).
fof(c_0_24,plain,
! [X3,X4] :
( ~ truth(X3)
| ~ truth(not(or(X4,X3))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_13])])]) ).
fof(c_0_25,plain,
! [X7] :
( ~ truth(isa(X7,knight))
| ~ truth(isa(X7,knave)) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_26,plain,
! [X7,X8] :
( truth(X7)
| ~ says(X8,X7)
| ~ truth(isa(X8,knight)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_15])])]) ).
fof(c_0_27,plain,
! [X7] :
( ~ person(X7)
| truth(isa(X7,knight))
| truth(isa(X7,knave)) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_28,plain,
! [X7,X8] :
( truth(isa(X8,knight))
| ~ says(X8,X7)
| ~ truth(X7) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_29,plain,
! [X4,X5] :
( truth(X5)
| truth(X4)
| ~ truth(or(X5,X4)) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_30,plain,
! [X6,X7] :
( truth(X6)
| truth(not(X6))
| ~ says(X7,not(X6)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_19])])]) ).
fof(c_0_31,plain,
! [X6,X7] :
( truth(X6)
| truth(not(X6))
| ~ says(X7,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_20])])]) ).
fof(c_0_32,plain,
! [X5] :
( ~ truth(X5)
| ~ truth(not(X5)) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( says(asked,not(or(isa(asked,knight),isa(other,knight))))
| says(asked,or(isa(asked,knight),isa(other,knight))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( ~ truth(not(or(X1,X2)))
| ~ truth(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
( ~ truth(not(or(X1,X2)))
| ~ truth(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
( truth(X2)
| ~ truth(isa(X1,knight))
| ~ says(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( truth(isa(X1,knave))
| truth(isa(X1,knight))
| ~ person(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( truth(isa(X2,knight))
| ~ truth(X1)
| ~ says(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
( truth(not(X2))
| truth(X2)
| ~ says(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
( truth(not(X2))
| truth(X2)
| ~ says(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( ~ truth(not(X1))
| ~ truth(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
( says(asked,not(or(isa(asked,knight),isa(other,knight))))
| says(asked,or(isa(asked,knight),isa(other,knight))) ),
c_0_33,
[final] ).
cnf(c_0_45,plain,
( ~ truth(not(or(X1,X2)))
| ~ truth(X1) ),
c_0_34,
[final] ).
cnf(c_0_46,plain,
( ~ truth(not(or(X1,X2)))
| ~ truth(X2) ),
c_0_35,
[final] ).
cnf(c_0_47,plain,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
c_0_36,
[final] ).
cnf(c_0_48,plain,
( truth(X2)
| ~ truth(isa(X1,knight))
| ~ says(X1,X2) ),
c_0_37,
[final] ).
cnf(c_0_49,plain,
( truth(isa(X1,knave))
| truth(isa(X1,knight))
| ~ person(X1) ),
c_0_38,
[final] ).
cnf(c_0_50,plain,
( truth(isa(X2,knight))
| ~ truth(X1)
| ~ says(X2,X1) ),
c_0_39,
[final] ).
cnf(c_0_51,plain,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
c_0_40,
[final] ).
cnf(c_0_52,plain,
( truth(not(X2))
| truth(X2)
| ~ says(X1,not(X2)) ),
c_0_41,
[final] ).
cnf(c_0_53,plain,
( truth(not(X2))
| truth(X2)
| ~ says(X1,X2) ),
c_0_42,
[final] ).
cnf(c_0_54,plain,
( ~ truth(not(X1))
| ~ truth(X1) ),
c_0_43,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_44_0,axiom,
( says(asked,not(or(isa(asked,knight),isa(other,knight))))
| says(asked,or(isa(asked,knight),isa(other,knight))) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( says(asked,or(isa(asked,knight),isa(other,knight)))
| says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( ~ truth(not(or(X1,X2)))
| ~ truth(X1) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( ~ truth(X1)
| ~ truth(not(or(X1,X2))) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( ~ truth(not(or(X1,X2)))
| ~ truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( ~ truth(X2)
| ~ truth(not(or(X1,X2))) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_47_0,axiom,
( ~ truth(isa(X1,knave))
| ~ truth(isa(X1,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_1,axiom,
( ~ truth(isa(X1,knight))
| ~ truth(isa(X1,knave)) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_48_0,axiom,
( truth(X2)
| ~ truth(isa(X1,knight))
| ~ says(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ truth(isa(X1,knight))
| truth(X2)
| ~ says(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ says(X1,X2)
| ~ truth(isa(X1,knight))
| truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( truth(isa(X1,knave))
| truth(isa(X1,knight))
| ~ person(X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( truth(isa(X1,knight))
| truth(isa(X1,knave))
| ~ person(X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_2,axiom,
( ~ person(X1)
| truth(isa(X1,knight))
| truth(isa(X1,knave)) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_50_0,axiom,
( truth(isa(X2,knight))
| ~ truth(X1)
| ~ says(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_1,axiom,
( ~ truth(X1)
| truth(isa(X2,knight))
| ~ says(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_2,axiom,
( ~ says(X2,X1)
| ~ truth(X1)
| truth(isa(X2,knight)) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
( truth(X2)
| truth(X1)
| ~ truth(or(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_1,axiom,
( truth(X1)
| truth(X2)
| ~ truth(or(X1,X2)) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_2,axiom,
( ~ truth(or(X1,X2))
| truth(X1)
| truth(X2) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_52_0,axiom,
( truth(not(X2))
| truth(X2)
| ~ says(X1,not(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( truth(X2)
| truth(not(X2))
| ~ says(X1,not(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_2,axiom,
( ~ says(X1,not(X2))
| truth(X2)
| truth(not(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( truth(not(X2))
| truth(X2)
| ~ says(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( truth(X2)
| truth(not(X2))
| ~ says(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_2,axiom,
( ~ says(X1,X2)
| truth(X2)
| truth(not(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
( ~ truth(not(X1))
| ~ truth(X1) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_1,axiom,
( ~ truth(X1)
| ~ truth(not(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_011,negated_conjecture,
! [X1,X2,X3] :
( ~ truth(isa(asked,X3))
| ~ truth(isa(other,X2))
| ~ says(asked,X1) ),
file('<stdin>',prove_answer) ).
fof(c_0_1_012,negated_conjecture,
! [X1,X2,X3] :
( ~ truth(isa(asked,X3))
| ~ truth(isa(other,X2))
| ~ says(asked,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_013,negated_conjecture,
! [X4,X5,X6] :
( ~ truth(isa(asked,X4))
| ~ truth(isa(other,X5))
| ~ says(asked,X6) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_014,negated_conjecture,
( ~ says(asked,X1)
| ~ truth(isa(other,X2))
| ~ truth(isa(asked,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_015,negated_conjecture,
( ~ says(asked,X1)
| ~ truth(isa(other,X2))
| ~ truth(isa(asked,X3)) ),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_30,negated_conjecture,
( ~ says(asked,X0)
| ~ truth(isa(asked,X1))
| ~ truth(isa(other,X2)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9e962b.p',c_0_4) ).
cnf(c_42,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_30]) ).
cnf(c_46,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_54,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_69,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_74,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_124,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_222,negated_conjecture,
( ~ truth(isa(other,X0))
| ~ sP1_iProver_split ),
inference(copy,[status(esa)],[c_124]) ).
cnf(c_11,plain,
( ~ person(X0)
| truth(isa(X0,knight))
| truth(isa(X0,knave)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9e962b.p',c_0_49_0) ).
cnf(c_180,plain,
( ~ person(X0)
| truth(isa(X0,knight))
| truth(isa(X0,knave)) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_181,plain,
( truth(isa(X0,knight))
| truth(isa(X0,knave))
| ~ person(X0) ),
inference(rewriting,[status(thm)],[c_180]) ).
cnf(c_248,plain,
( truth(isa(other,knight))
| ~ person(other)
| ~ sP1_iProver_split ),
inference(resolution,[status(thm)],[c_222,c_181]) ).
cnf(c_249,plain,
( truth(isa(other,knight))
| ~ person(other)
| ~ sP1_iProver_split ),
inference(rewriting,[status(thm)],[c_248]) ).
cnf(c_29,plain,
person(other),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9e962b.p',c_0_8_0) ).
cnf(c_216,plain,
person(other),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_277,plain,
~ sP1_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_249,c_216,c_222]) ).
cnf(c_278,plain,
~ sP1_iProver_split,
inference(rewriting,[status(thm)],[c_277]) ).
cnf(c_41,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_30]) ).
cnf(c_45,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_52,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_68,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_75,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_123,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_75]) ).
cnf(c_220,negated_conjecture,
( ~ truth(isa(asked,X0))
| ~ sP0_iProver_split ),
inference(copy,[status(esa)],[c_123]) ).
cnf(c_234,plain,
( truth(isa(asked,knight))
| ~ person(asked)
| ~ sP0_iProver_split ),
inference(resolution,[status(thm)],[c_220,c_181]) ).
cnf(c_235,plain,
( truth(isa(asked,knight))
| ~ person(asked)
| ~ sP0_iProver_split ),
inference(rewriting,[status(thm)],[c_234]) ).
cnf(c_28,plain,
person(asked),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9e962b.p',c_0_9_0) ).
cnf(c_214,plain,
person(asked),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_263,plain,
~ sP0_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_235,c_214,c_220]) ).
cnf(c_264,plain,
~ sP0_iProver_split,
inference(rewriting,[status(thm)],[c_263]) ).
cnf(c_48,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_30]) ).
cnf(c_58,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_71,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_72,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_43,negated_conjecture,
( ~ says(asked,X0)
| ~ sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_30]) ).
cnf(c_47,negated_conjecture,
( ~ says(asked,X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_56,negated_conjecture,
( ~ says(asked,X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_70,negated_conjecture,
( ~ says(asked,X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_73,negated_conjecture,
( ~ says(asked,X0)
| ~ sP2_iProver_split ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_76,plain,
( ~ says(asked,X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(resolution,[status(thm)],[c_72,c_73]) ).
cnf(c_87,plain,
( ~ says(asked,X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_91,plain,
( ~ says(asked,X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_87]) ).
cnf(c_122,plain,
( ~ says(asked,X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_91]) ).
cnf(c_218,plain,
( ~ says(asked,X0)
| sP0_iProver_split
| sP1_iProver_split ),
inference(copy,[status(esa)],[c_122]) ).
cnf(c_266,plain,
( ~ says(asked,X0)
| sP1_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_264,c_218]) ).
cnf(c_267,plain,
( ~ says(asked,X0)
| sP1_iProver_split ),
inference(rewriting,[status(thm)],[c_266]) ).
cnf(c_280,plain,
~ says(asked,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_278,c_267]) ).
cnf(c_281,plain,
~ says(asked,X0),
inference(rewriting,[status(thm)],[c_280]) ).
cnf(c_0,plain,
( says(asked,or(isa(asked,knight),isa(other,knight)))
| says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9e962b.p',c_0_44_0) ).
cnf(c_158,plain,
( says(asked,or(isa(asked,knight),isa(other,knight)))
| says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_284,plain,
says(asked,or(isa(asked,knight),isa(other,knight))),
inference(backward_subsumption_resolution,[status(thm)],[c_281,c_158]) ).
cnf(c_285,plain,
says(asked,or(isa(asked,knight),isa(other,knight))),
inference(rewriting,[status(thm)],[c_284]) ).
cnf(c_287,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_285,c_281]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ035-4 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n027.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 : Sat May 28 23:12:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.40 % Orientation found
% 0.21/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_49d326.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_9e962b.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_762364 | grep -v "SZS"
% 0.21/0.42
% 0.21/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.42
% 0.21/0.42 %
% 0.21/0.42 % ------ iProver source info
% 0.21/0.42
% 0.21/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.42 % git: non_committed_changes: true
% 0.21/0.42 % git: last_make_outside_of_git: true
% 0.21/0.42
% 0.21/0.42 %
% 0.21/0.42 % ------ Input Options
% 0.21/0.42
% 0.21/0.42 % --out_options all
% 0.21/0.42 % --tptp_safe_out true
% 0.21/0.42 % --problem_path ""
% 0.21/0.42 % --include_path ""
% 0.21/0.42 % --clausifier .//eprover
% 0.21/0.42 % --clausifier_options --tstp-format
% 0.21/0.42 % --stdin false
% 0.21/0.42 % --dbg_backtrace false
% 0.21/0.42 % --dbg_dump_prop_clauses false
% 0.21/0.42 % --dbg_dump_prop_clauses_file -
% 0.21/0.42 % --dbg_out_stat false
% 0.21/0.42
% 0.21/0.42 % ------ General Options
% 0.21/0.42
% 0.21/0.42 % --fof false
% 0.21/0.42 % --time_out_real 150.
% 0.21/0.42 % --time_out_prep_mult 0.2
% 0.21/0.42 % --time_out_virtual -1.
% 0.21/0.42 % --schedule none
% 0.21/0.42 % --ground_splitting input
% 0.21/0.42 % --splitting_nvd 16
% 0.21/0.42 % --non_eq_to_eq false
% 0.21/0.42 % --prep_gs_sim true
% 0.21/0.42 % --prep_unflatten false
% 0.21/0.42 % --prep_res_sim true
% 0.21/0.42 % --prep_upred true
% 0.21/0.42 % --res_sim_input true
% 0.21/0.42 % --clause_weak_htbl true
% 0.21/0.42 % --gc_record_bc_elim false
% 0.21/0.42 % --symbol_type_check false
% 0.21/0.42 % --clausify_out false
% 0.21/0.42 % --large_theory_mode false
% 0.21/0.42 % --prep_sem_filter none
% 0.21/0.42 % --prep_sem_filter_out false
% 0.21/0.42 % --preprocessed_out false
% 0.21/0.42 % --sub_typing false
% 0.21/0.42 % --brand_transform false
% 0.21/0.42 % --pure_diseq_elim true
% 0.21/0.42 % --min_unsat_core false
% 0.21/0.42 % --pred_elim true
% 0.21/0.42 % --add_important_lit false
% 0.21/0.42 % --soft_assumptions false
% 0.21/0.42 % --reset_solvers false
% 0.21/0.42 % --bc_imp_inh []
% 0.21/0.42 % --conj_cone_tolerance 1.5
% 0.21/0.42 % --prolific_symb_bound 500
% 0.21/0.42 % --lt_threshold 2000
% 0.21/0.42
% 0.21/0.42 % ------ SAT Options
% 0.21/0.42
% 0.21/0.42 % --sat_mode false
% 0.21/0.42 % --sat_fm_restart_options ""
% 0.21/0.42 % --sat_gr_def false
% 0.21/0.42 % --sat_epr_types true
% 0.21/0.42 % --sat_non_cyclic_types false
% 0.21/0.42 % --sat_finite_models false
% 0.21/0.42 % --sat_fm_lemmas false
% 0.21/0.42 % --sat_fm_prep false
% 0.21/0.42 % --sat_fm_uc_incr true
% 0.21/0.42 % --sat_out_model small
% 0.21/0.42 % --sat_out_clauses false
% 0.21/0.42
% 0.21/0.42 % ------ QBF Options
% 0.21/0.42
% 0.21/0.42 % --qbf_mode false
% 0.21/0.42 % --qbf_elim_univ true
% 0.21/0.42 % --qbf_sk_in true
% 0.21/0.42 % --qbf_pred_elim true
% 0.21/0.42 % --qbf_split 32
% 0.21/0.42
% 0.21/0.42 % ------ BMC1 Options
% 0.21/0.42
% 0.21/0.42 % --bmc1_incremental false
% 0.21/0.42 % --bmc1_axioms reachable_all
% 0.21/0.42 % --bmc1_min_bound 0
% 0.21/0.42 % --bmc1_max_bound -1
% 0.21/0.42 % --bmc1_max_bound_default -1
% 0.21/0.42 % --bmc1_symbol_reachability true
% 0.21/0.42 % --bmc1_property_lemmas false
% 0.21/0.42 % --bmc1_k_induction false
% 0.21/0.42 % --bmc1_non_equiv_states false
% 0.21/0.42 % --bmc1_deadlock false
% 0.21/0.42 % --bmc1_ucm false
% 0.21/0.42 % --bmc1_add_unsat_core none
% 0.21/0.42 % --bmc1_unsat_core_children false
% 0.21/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.42 % --bmc1_out_stat full
% 0.21/0.42 % --bmc1_ground_init false
% 0.21/0.42 % --bmc1_pre_inst_next_state false
% 0.21/0.42 % --bmc1_pre_inst_state false
% 0.21/0.42 % --bmc1_pre_inst_reach_state false
% 0.21/0.42 % --bmc1_out_unsat_core false
% 0.21/0.42 % --bmc1_aig_witness_out false
% 0.21/0.42 % --bmc1_verbose false
% 0.21/0.42 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.43 % --inst_prop_sim_new false
% 0.21/0.43 % --inst_orphan_elimination true
% 0.21/0.43 % --inst_learning_loop_flag true
% 0.21/0.43 % --inst_learning_start 3000
% 0.21/0.43 % --inst_learning_factor 2
% 0.21/0.43 % --inst_start_prop_sim_after_learn 3
% 0.21/0.43 % --inst_sel_renew solver
% 0.21/0.43 % --inst_lit_activity_flag true
% 0.21/0.43 % --inst_out_proof true
% 0.21/0.43
% 0.21/0.43 % ------ Resolution Options
% 0.21/0.43
% 0.21/0.43 % --resolution_flag true
% 0.21/0.43 % --res_lit_sel kbo_max
% 0.21/0.43 % --res_to_prop_solver none
% 0.21/0.43 % --res_prop_simpl_new false
% 0.21/0.43 % --res_prop_simpl_given false
% 0.21/0.43 % --res_passive_queue_type priority_queues
% 0.21/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.43 % --res_passive_queues_freq [15;5]
% 0.21/0.43 % --res_forward_subs full
% 0.21/0.43 % --res_backward_subs full
% 0.21/0.43 % --res_forward_subs_resolution true
% 0.21/0.43 % --res_backward_subs_resolution true
% 0.21/0.43 % --res_orphan_elimination false
% 0.21/0.43 % --res_time_limit 1000.
% 0.21/0.43 % --res_out_proof true
% 0.21/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_49d326.s
% 0.21/0.43 % --modulo true
% 0.21/0.43
% 0.21/0.43 % ------ Combination Options
% 0.21/0.43
% 0.21/0.43 % --comb_res_mult 1000
% 0.21/0.43 % --comb_inst_mult 300
% 0.21/0.43 % ------
% 0.21/0.43
% 0.21/0.43 % ------ Parsing...% successful
% 0.21/0.43
% 0.21/0.43 % ------ 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.21/0.43
% 0.21/0.43 % ------ Proving...
% 0.21/0.43 % ------ Problem Properties
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % EPR false
% 0.21/0.43 % Horn false
% 0.21/0.43 % Has equality false
% 0.21/0.43
% 0.21/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 % % ------ Current options:
% 0.21/0.43
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.43 % --bmc1_dump_file -
% 0.21/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.43 % --bmc1_ucm_extend_mode 1
% 0.21/0.43 % --bmc1_ucm_init_mode 2
% 0.21/0.43 % --bmc1_ucm_cone_mode none
% 0.21/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.43 % --bmc1_ucm_relax_model 4
% 0.21/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.43 % --bmc1_ucm_layered_model none
% 0.21/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.43
% 0.21/0.43 % ------ AIG Options
% 0.21/0.43
% 0.21/0.43 % --aig_mode false
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation Options
% 0.21/0.43
% 0.21/0.43 % --instantiation_flag true
% 0.21/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.43 % --inst_solver_per_active 750
% 0.21/0.43 % --inst_solver_calls_frac 0.5
% 0.21/0.43 % --inst_passive_queue_type priority_queues
% 0.21/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.43 % --inst_passive_queues_freq [25;2]
% 0.21/0.43 % --inst_dismatching true
% 0.21/0.43 % --inst_eager_unprocessed_to_passive true
% 0.21/0.43 % --inst_prop_sim_given true
% 0.21/0.43 % --inst_prop_sim_new false
% 0.21/0.43 % --inst_orphan_elimination true
% 0.21/0.43 % --inst_learning_loop_flag true
% 0.21/0.43 % --inst_learning_start 3000
% 0.21/0.43 % --inst_learning_factor 2
% 0.21/0.43 % --inst_start_prop_sim_after_learn 3
% 0.21/0.43 % --inst_sel_renew solver
% 0.21/0.43 % --inst_lit_activity_flag true
% 0.21/0.43 % --inst_out_proof true
% 0.21/0.43
% 0.21/0.43 % ------ Resolution Options
% 0.21/0.43
% 0.21/0.43 % --resolution_flag true
% 0.21/0.43 % --res_lit_sel kbo_max
% 0.21/0.43 % --res_to_prop_solver none
% 0.21/0.43 % --res_prop_simpl_new false
% 0.21/0.43 % --res_prop_simpl_given false
% 0.21/0.43 % --res_passive_queue_type priority_queues
% 0.21/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.43 % --res_passive_queues_freq [15;5]
% 0.21/0.43 % --res_forward_subs full
% 0.21/0.43 % --res_backward_subs full
% 0.21/0.43 % --res_forward_subs_resolution true
% 0.21/0.43 % --res_backward_subs_resolution true
% 0.21/0.43 % --res_orphan_elimination false
% 0.21/0.43 % --res_time_limit 1000.
% 0.21/0.43 % --res_out_proof true
% 0.21/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_49d326.s
% 0.21/0.43 % --modulo true
% 0.21/0.43
% 0.21/0.43 % ------ Combination Options
% 0.21/0.43
% 0.21/0.43 % --comb_res_mult 1000
% 0.21/0.43 % --comb_inst_mult 300
% 0.21/0.43 % ------
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 % ------ Proving...
% 0.21/0.43 %
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 % Resolution empty clause
% 0.21/0.43
% 0.21/0.43 % ------ Statistics
% 0.21/0.43
% 0.21/0.43 % ------ General
% 0.21/0.43
% 0.21/0.43 % num_of_input_clauses: 31
% 0.21/0.43 % num_of_input_neg_conjectures: 1
% 0.21/0.43 % num_of_splits: 6
% 0.21/0.43 % num_of_split_atoms: 3
% 0.21/0.43 % num_of_sem_filtered_clauses: 0
% 0.21/0.43 % num_of_subtypes: 0
% 0.21/0.43 % monotx_restored_types: 0
% 0.21/0.43 % sat_num_of_epr_types: 0
% 0.21/0.43 % sat_num_of_non_cyclic_types: 0
% 0.21/0.43 % sat_guarded_non_collapsed_types: 0
% 0.21/0.43 % is_epr: 0
% 0.21/0.43 % is_horn: 0
% 0.21/0.43 % has_eq: 0
% 0.21/0.43 % num_pure_diseq_elim: 0
% 0.21/0.43 % simp_replaced_by: 0
% 0.21/0.43 % res_preprocessed: 8
% 0.21/0.43 % prep_upred: 0
% 0.21/0.43 % prep_unflattend: 0
% 0.21/0.43 % pred_elim_cands: 3
% 0.21/0.43 % pred_elim: 1
% 0.21/0.43 % pred_elim_cl: 1
% 0.21/0.43 % pred_elim_cycles: 3
% 0.21/0.43 % forced_gc_time: 0
% 0.21/0.43 % gc_basic_clause_elim: 0
% 0.21/0.43 % parsing_time: 0.001
% 0.21/0.43 % sem_filter_time: 0.
% 0.21/0.43 % pred_elim_time: 0.
% 0.21/0.43 % out_proof_time: 0.001
% 0.21/0.43 % monotx_time: 0.
% 0.21/0.43 % subtype_inf_time: 0.
% 0.21/0.43 % unif_index_cands_time: 0.
% 0.21/0.43 % unif_index_add_time: 0.
% 0.21/0.43 % total_time: 0.026
% 0.21/0.43 % num_of_symbols: 38
% 0.21/0.43 % num_of_terms: 140
% 0.21/0.43
% 0.21/0.43 % ------ Propositional Solver
% 0.21/0.43
% 0.21/0.43 % prop_solver_calls: 1
% 0.21/0.43 % prop_fast_solver_calls: 36
% 0.21/0.43 % prop_num_of_clauses: 42
% 0.21/0.43 % prop_preprocess_simplified: 149
% 0.21/0.43 % prop_fo_subsumed: 0
% 0.21/0.43 % prop_solver_time: 0.
% 0.21/0.43 % prop_fast_solver_time: 0.
% 0.21/0.43 % prop_unsat_core_time: 0.
% 0.21/0.43
% 0.21/0.43 % ------ QBF
% 0.21/0.43
% 0.21/0.43 % qbf_q_res: 0
% 0.21/0.43 % qbf_num_tautologies: 0
% 0.21/0.43 % qbf_prep_cycles: 0
% 0.21/0.43
% 0.21/0.43 % ------ BMC1
% 0.21/0.43
% 0.21/0.43 % bmc1_current_bound: -1
% 0.21/0.43 % bmc1_last_solved_bound: -1
% 0.21/0.43 % bmc1_unsat_core_size: -1
% 0.21/0.43 % bmc1_unsat_core_parents_size: -1
% 0.21/0.43 % bmc1_merge_next_fun: 0
% 0.21/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.43
% 0.21/0.43 % ------ Instantiation
% 0.21/0.43
% 0.21/0.43 % inst_num_of_clauses: 33
% 0.21/0.43 % inst_num_in_passive: 0
% 0.21/0.43 % inst_num_in_active: 0
% 0.21/0.43 % inst_num_in_unprocessed: 33
% 0.21/0.43 % inst_num_of_loops: 0
% 0.21/0.43 % inst_num_of_learning_restarts: 0
% 0.21/0.43 % inst_num_moves_active_passive: 0
% 0.21/0.43 % inst_lit_activity: 0
% 0.21/0.43 % inst_lit_activity_moves: 0
% 0.21/0.43 % inst_num_tautologies: 0
% 0.21/0.43 % inst_num_prop_implied: 0
% 0.21/0.43 % inst_num_existing_simplified: 0
% 0.21/0.43 % inst_num_eq_res_simplified: 0
% 0.21/0.43 % inst_num_child_elim: 0
% 0.21/0.43 % inst_num_of_dismatching_blockings: 0
% 0.21/0.43 % inst_num_of_non_proper_insts: 0
% 0.21/0.43 % inst_num_of_duplicates: 0
% 0.21/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.43 % inst_dismatching_checking_time: 0.
% 0.21/0.43
% 0.21/0.43 % ------ Resolution
% 0.21/0.43
% 0.21/0.43 % res_num_of_clauses: 34
% 0.21/0.43 % res_num_in_passive: 2
% 0.21/0.43 % res_num_in_active: 16
% 0.21/0.43 % res_num_of_loops: 16
% 0.21/0.43 % res_forward_subset_subsumed: 16
% 0.21/0.43 % res_backward_subset_subsumed: 2
% 0.21/0.43 % res_forward_subsumed: 8
% 0.21/0.43 % res_backward_subsumed: 2
% 0.21/0.43 % res_forward_subsumption_resolution: 5
% 0.21/0.43 % res_backward_subsumption_resolution: 3
% 0.21/0.43 % res_clause_to_clause_subsumption: 18
% 0.21/0.43 % res_orphan_elimination: 0
% 0.21/0.43 % res_tautology_del: 0
% 0.21/0.43 % res_num_eq_res_simplified: 0
% 0.21/0.43 % res_num_sel_changes: 0
% 0.21/0.43 % res_moves_from_active_to_pass: 0
% 0.21/0.43
% 0.21/0.43 % Status Unsatisfiable
% 0.21/0.43 % SZS status Unsatisfiable
% 0.21/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------