TSTP Solution File: PUZ021-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n021.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:44 EDT 2022
% Result : Unsatisfiable 23.63s 23.85s
% Output : CNFRefutation 23.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 24
% Syntax : Number of formulae : 171 ( 1 unt; 0 def)
% Number of atoms : 412 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 480 ( 239 ~; 241 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 344 ( 16 sgn 93 !; 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,
! [X1,X2,X3] :
( a_truth(and(X3,X2),X1)
| ~ a_truth(X3,X1)
| ~ a_truth(X2,X1) ),
file('<stdin>',conjunction3) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( ~ a_truth(and(X3,X2),X1)
| a_truth(X3,X1) ),
file('<stdin>',conjunction1) ).
fof(c_0_2,axiom,
! [X1,X2,X3] :
( ~ a_truth(and(X3,X2),X1)
| a_truth(X2,X1) ),
file('<stdin>',conjunction2) ).
fof(c_0_3,axiom,
! [X1,X2,X3] :
( ~ a_truth(knave(X3),X1)
| ~ says(X3,X2)
| ~ a_truth(X2,X1) ),
file('<stdin>',knaves_lie1) ).
fof(c_0_4,axiom,
! [X1,X2,X3] :
( ~ a_truth(knight(X3),X1)
| ~ says(X3,X2)
| a_truth(X2,X1) ),
file('<stdin>',knights_tell_truth1) ).
fof(c_0_5,axiom,
! [X1,X2,X3] :
( ~ a_truth(knight(X3),X1)
| says(X3,X2)
| ~ a_truth(X2,X1) ),
file('<stdin>',knights_tell_truth2) ).
fof(c_0_6,axiom,
! [X2,X3] :
( ~ a_truth(knight(X3),X2)
| ~ a_truth(knave(X3),X2) ),
file('<stdin>',not_knight_and_knave) ).
fof(c_0_7,axiom,
! [X2,X3] :
( ~ a_truth(rich(X3),X2)
| ~ a_truth(poor(X3),X2) ),
file('<stdin>',not_rich_and_poor) ).
fof(c_0_8,axiom,
! [X1,X2,X3] :
( ~ a_truth(knave(X3),X1)
| says(X3,X2)
| a_truth(X2,X1) ),
file('<stdin>',knaves_lie2) ).
fof(c_0_9,axiom,
! [X2,X3] :
( a_truth(knight(X3),X2)
| a_truth(knave(X3),X2) ),
file('<stdin>',knight_or_knave) ).
fof(c_0_10,axiom,
! [X2,X3] :
( a_truth(rich(X3),X2)
| a_truth(poor(X3),X2) ),
file('<stdin>',rich_or_poor) ).
fof(c_0_11,plain,
! [X1,X2,X3] :
( a_truth(and(X3,X2),X1)
| ~ a_truth(X3,X1)
| ~ a_truth(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_12,plain,
! [X1,X2,X3] :
( ~ a_truth(and(X3,X2),X1)
| a_truth(X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_13,plain,
! [X1,X2,X3] :
( ~ a_truth(and(X3,X2),X1)
| a_truth(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_14,plain,
! [X1,X2,X3] :
( ~ a_truth(knave(X3),X1)
| ~ says(X3,X2)
| ~ a_truth(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_15,plain,
! [X1,X2,X3] :
( ~ a_truth(knight(X3),X1)
| ~ says(X3,X2)
| a_truth(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_16,plain,
! [X1,X2,X3] :
( ~ a_truth(knight(X3),X1)
| says(X3,X2)
| ~ a_truth(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_17,plain,
! [X2,X3] :
( ~ a_truth(knight(X3),X2)
| ~ a_truth(knave(X3),X2) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X2,X3] :
( ~ a_truth(rich(X3),X2)
| ~ a_truth(poor(X3),X2) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_19,plain,
! [X1,X2,X3] :
( ~ a_truth(knave(X3),X1)
| says(X3,X2)
| a_truth(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_20,axiom,
! [X2,X3] :
( a_truth(knight(X3),X2)
| a_truth(knave(X3),X2) ),
c_0_9 ).
fof(c_0_21,axiom,
! [X2,X3] :
( a_truth(rich(X3),X2)
| a_truth(poor(X3),X2) ),
c_0_10 ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( a_truth(and(X6,X5),X4)
| ~ a_truth(X6,X4)
| ~ a_truth(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ~ a_truth(and(X6,X5),X4)
| a_truth(X6,X4) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_24,plain,
! [X4,X5,X6] :
( ~ a_truth(and(X6,X5),X4)
| a_truth(X5,X4) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[c_0_13])])]) ).
fof(c_0_25,plain,
! [X4,X5,X6] :
( ~ a_truth(knave(X6),X4)
| ~ says(X6,X5)
| ~ a_truth(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_26,plain,
! [X4,X5,X6] :
( ~ a_truth(knight(X6),X4)
| ~ says(X6,X5)
| a_truth(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_27,plain,
! [X4,X5,X6] :
( ~ a_truth(knight(X6),X4)
| says(X6,X5)
| ~ a_truth(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_28,plain,
! [X4,X5] :
( ~ a_truth(knight(X5),X4)
| ~ a_truth(knave(X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_29,plain,
! [X4,X5] :
( ~ a_truth(rich(X5),X4)
| ~ a_truth(poor(X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_30,plain,
! [X4,X5,X6] :
( ~ a_truth(knave(X6),X4)
| says(X6,X5)
| a_truth(X5,X4) ),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
! [X4,X5] :
( a_truth(knight(X5),X4)
| a_truth(knave(X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_32,plain,
! [X4,X5] :
( a_truth(rich(X5),X4)
| a_truth(poor(X5),X4) ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( a_truth(and(X3,X1),X2)
| ~ a_truth(X1,X2)
| ~ a_truth(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( a_truth(X1,X2)
| ~ a_truth(and(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
( a_truth(X1,X2)
| ~ a_truth(and(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
( ~ a_truth(X1,X2)
| ~ says(X3,X1)
| ~ a_truth(knave(X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
( a_truth(X1,X2)
| ~ says(X3,X1)
| ~ a_truth(knight(X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( says(X3,X1)
| ~ a_truth(X1,X2)
| ~ a_truth(knight(X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( ~ a_truth(knave(X1),X2)
| ~ a_truth(knight(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
( ~ a_truth(poor(X1),X2)
| ~ a_truth(rich(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
( a_truth(X1,X2)
| says(X3,X1)
| ~ a_truth(knave(X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
( a_truth(knave(X1),X2)
| a_truth(knight(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( a_truth(poor(X1),X2)
| a_truth(rich(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
( a_truth(and(X3,X1),X2)
| ~ a_truth(X1,X2)
| ~ a_truth(X3,X2) ),
c_0_33,
[final] ).
cnf(c_0_45,plain,
( a_truth(X1,X2)
| ~ a_truth(and(X1,X3),X2) ),
c_0_34,
[final] ).
cnf(c_0_46,plain,
( a_truth(X1,X2)
| ~ a_truth(and(X3,X1),X2) ),
c_0_35,
[final] ).
cnf(c_0_47,plain,
( ~ a_truth(X1,X2)
| ~ says(X3,X1)
| ~ a_truth(knave(X3),X2) ),
c_0_36,
[final] ).
cnf(c_0_48,plain,
( a_truth(X1,X2)
| ~ says(X3,X1)
| ~ a_truth(knight(X3),X2) ),
c_0_37,
[final] ).
cnf(c_0_49,plain,
( says(X3,X1)
| ~ a_truth(X1,X2)
| ~ a_truth(knight(X3),X2) ),
c_0_38,
[final] ).
cnf(c_0_50,plain,
( ~ a_truth(knave(X1),X2)
| ~ a_truth(knight(X1),X2) ),
c_0_39,
[final] ).
cnf(c_0_51,plain,
( ~ a_truth(poor(X1),X2)
| ~ a_truth(rich(X1),X2) ),
c_0_40,
[final] ).
cnf(c_0_52,plain,
( a_truth(X1,X2)
| says(X3,X1)
| ~ a_truth(knave(X3),X2) ),
c_0_41,
[final] ).
cnf(c_0_53,plain,
( a_truth(knave(X1),X2)
| a_truth(knight(X1),X2) ),
c_0_42,
[final] ).
cnf(c_0_54,plain,
( a_truth(poor(X1),X2)
| a_truth(rich(X1),X2) ),
c_0_43,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_44_0,axiom,
( a_truth(and(X3,X1),X2)
| ~ a_truth(X1,X2)
| ~ a_truth(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_1,axiom,
( ~ a_truth(X1,X2)
| a_truth(and(X3,X1),X2)
| ~ a_truth(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_44_2,axiom,
( ~ a_truth(X3,X2)
| ~ a_truth(X1,X2)
| a_truth(and(X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_44]) ).
cnf(c_0_45_0,axiom,
( a_truth(X1,X2)
| ~ a_truth(and(X1,X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_45_1,axiom,
( ~ a_truth(and(X1,X3),X2)
| a_truth(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_45]) ).
cnf(c_0_46_0,axiom,
( a_truth(X1,X2)
| ~ a_truth(and(X3,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_46_1,axiom,
( ~ a_truth(and(X3,X1),X2)
| a_truth(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_46]) ).
cnf(c_0_47_0,axiom,
( ~ a_truth(X1,X2)
| ~ says(X3,X1)
| ~ a_truth(knave(X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_1,axiom,
( ~ says(X3,X1)
| ~ a_truth(X1,X2)
| ~ a_truth(knave(X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_47_2,axiom,
( ~ a_truth(knave(X3),X2)
| ~ says(X3,X1)
| ~ a_truth(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_47]) ).
cnf(c_0_48_0,axiom,
( a_truth(X1,X2)
| ~ says(X3,X1)
| ~ a_truth(knight(X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_1,axiom,
( ~ says(X3,X1)
| a_truth(X1,X2)
| ~ a_truth(knight(X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_48_2,axiom,
( ~ a_truth(knight(X3),X2)
| ~ says(X3,X1)
| a_truth(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_48]) ).
cnf(c_0_49_0,axiom,
( says(X3,X1)
| ~ a_truth(X1,X2)
| ~ a_truth(knight(X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_1,axiom,
( ~ a_truth(X1,X2)
| says(X3,X1)
| ~ a_truth(knight(X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_49_2,axiom,
( ~ a_truth(knight(X3),X2)
| ~ a_truth(X1,X2)
| says(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_49]) ).
cnf(c_0_50_0,axiom,
( ~ a_truth(knave(X1),X2)
| ~ a_truth(knight(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_50_1,axiom,
( ~ a_truth(knight(X1),X2)
| ~ a_truth(knave(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_50]) ).
cnf(c_0_51_0,axiom,
( ~ a_truth(poor(X1),X2)
| ~ a_truth(rich(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_51_1,axiom,
( ~ a_truth(rich(X1),X2)
| ~ a_truth(poor(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_51]) ).
cnf(c_0_52_0,axiom,
( a_truth(X1,X2)
| says(X3,X1)
| ~ a_truth(knave(X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_1,axiom,
( says(X3,X1)
| a_truth(X1,X2)
| ~ a_truth(knave(X3),X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_52_2,axiom,
( ~ a_truth(knave(X3),X2)
| says(X3,X1)
| a_truth(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_52]) ).
cnf(c_0_53_0,axiom,
( a_truth(knave(X1),X2)
| a_truth(knight(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_53_1,axiom,
( a_truth(knight(X1),X2)
| a_truth(knave(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_53]) ).
cnf(c_0_54_0,axiom,
( a_truth(poor(X1),X2)
| a_truth(rich(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
cnf(c_0_54_1,axiom,
( a_truth(rich(X1),X2)
| a_truth(poor(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_54]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
! [X1] :
( ~ says(me,X1)
| ~ a_truth(and(knave(me),rich(me)),X1) ),
file('<stdin>',prove_statement_exists1) ).
fof(c_0_1_002,negated_conjecture,
! [X1] :
( says(me,X1)
| a_truth(and(knave(me),rich(me)),X1) ),
file('<stdin>',prove_statement_exists2) ).
fof(c_0_2_003,negated_conjecture,
! [X1] :
( ~ says(me,X1)
| ~ a_truth(and(knave(me),rich(me)),X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_004,negated_conjecture,
! [X1] :
( says(me,X1)
| a_truth(and(knave(me),rich(me)),X1) ),
c_0_1 ).
fof(c_0_4_005,negated_conjecture,
! [X2] :
( ~ says(me,X2)
| ~ a_truth(and(knave(me),rich(me)),X2) ),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5_006,negated_conjecture,
! [X2] :
( says(me,X2)
| a_truth(and(knave(me),rich(me)),X2) ),
inference(variable_rename,[status(thm)],[c_0_3]) ).
cnf(c_0_6_007,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X1)
| ~ says(me,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X1)
| says(me,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X1)
| ~ says(me,X1) ),
c_0_6,
[final] ).
cnf(c_0_9_010,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X1)
| says(me,X1) ),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_10,plain,
( ~ a_truth(knight(X0),X1)
| ~ says(X0,X2)
| a_truth(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_48_0) ).
cnf(c_65,plain,
( ~ a_truth(knight(X0),X1)
| ~ says(X0,X2)
| a_truth(X2,X1) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_23637,plain,
( a_truth(and(X0,X1),X2)
| ~ a_truth(knight(X3),X2)
| ~ says(X3,and(X0,X1)) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_461420,plain,
( a_truth(and(and(knave(me),rich(me)),poor(X0)),X1)
| ~ a_truth(knight(X2),X1)
| ~ says(X2,and(and(knave(me),rich(me)),poor(X0))) ),
inference(instantiation,[status(thm)],[c_23637]) ).
cnf(c_464050,plain,
( a_truth(and(and(knave(me),rich(me)),poor(X0)),poor(X1))
| ~ a_truth(knight(X2),poor(X1))
| ~ says(X2,and(and(knave(me),rich(me)),poor(X0))) ),
inference(instantiation,[status(thm)],[c_461420]) ).
cnf(c_464051,plain,
( a_truth(and(and(knave(me),rich(me)),poor(me)),poor(me))
| ~ a_truth(knight(me),poor(me))
| ~ says(me,and(and(knave(me),rich(me)),poor(me))) ),
inference(instantiation,[status(thm)],[c_464050]) ).
cnf(c_20,plain,
( ~ a_truth(knave(X0),X1)
| says(X0,X2)
| a_truth(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_52_0) ).
cnf(c_75,plain,
( ~ a_truth(knave(X0),X1)
| says(X0,X2)
| a_truth(X2,X1) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_65682,plain,
( ~ a_truth(knave(X0),rich(me))
| a_truth(X1,rich(me))
| says(X0,X1) ),
inference(instantiation,[status(thm)],[c_75]) ).
cnf(c_66790,plain,
( a_truth(and(and(knave(me),rich(me)),poor(X0)),rich(me))
| ~ a_truth(knave(X1),rich(me))
| says(X1,and(and(knave(me),rich(me)),poor(X0))) ),
inference(instantiation,[status(thm)],[c_65682]) ).
cnf(c_66791,plain,
( a_truth(and(and(knave(me),rich(me)),poor(me)),rich(me))
| ~ a_truth(knave(me),rich(me))
| says(me,and(and(knave(me),rich(me)),poor(me))) ),
inference(instantiation,[status(thm)],[c_66790]) ).
cnf(c_66781,plain,
( ~ a_truth(knave(X0),rich(me))
| a_truth(poor(X1),rich(me))
| says(X0,poor(X1)) ),
inference(instantiation,[status(thm)],[c_65682]) ).
cnf(c_66782,plain,
( ~ a_truth(knave(me),rich(me))
| a_truth(poor(me),rich(me))
| says(me,poor(me)) ),
inference(instantiation,[status(thm)],[c_66781]) ).
cnf(c_5,plain,
( ~ a_truth(and(X0,X1),X2)
| a_truth(X1,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_46_0) ).
cnf(c_60,plain,
( ~ a_truth(and(X0,X1),X2)
| a_truth(X1,X2) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_24146,plain,
( ~ a_truth(and(X0,poor(X1)),X2)
| a_truth(poor(X1),X2) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_24556,plain,
( ~ a_truth(and(and(knave(me),rich(me)),poor(X0)),X1)
| a_truth(poor(X0),X1) ),
inference(instantiation,[status(thm)],[c_24146]) ).
cnf(c_66424,plain,
( ~ a_truth(and(and(knave(me),rich(me)),poor(X0)),rich(me))
| a_truth(poor(X0),rich(me)) ),
inference(instantiation,[status(thm)],[c_24556]) ).
cnf(c_66426,plain,
( ~ a_truth(and(and(knave(me),rich(me)),poor(me)),rich(me))
| a_truth(poor(me),rich(me)) ),
inference(instantiation,[status(thm)],[c_66424]) ).
cnf(c_19,plain,
( ~ a_truth(poor(X0),X1)
| ~ a_truth(rich(X0),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_51_1) ).
cnf(c_74,plain,
( ~ a_truth(poor(X0),X1)
| ~ a_truth(rich(X0),X1) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_66402,plain,
( ~ a_truth(poor(X0),rich(me))
| ~ a_truth(rich(X0),rich(me)) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_66409,plain,
( ~ a_truth(poor(me),rich(me))
| ~ a_truth(rich(me),rich(me)) ),
inference(instantiation,[status(thm)],[c_66402]) ).
cnf(c_24,plain,
( a_truth(knave(X0),X1)
| a_truth(knight(X0),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_53_1) ).
cnf(c_79,plain,
( a_truth(knave(X0),X1)
| a_truth(knight(X0),X1) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_24525,plain,
( a_truth(knave(me),poor(X0))
| a_truth(knight(me),poor(X0)) ),
inference(instantiation,[status(thm)],[c_79]) ).
cnf(c_24527,plain,
( a_truth(knave(me),poor(me))
| a_truth(knight(me),poor(me)) ),
inference(instantiation,[status(thm)],[c_24525]) ).
cnf(c_3,plain,
( ~ a_truth(and(X0,X1),X2)
| a_truth(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_45_0) ).
cnf(c_58,plain,
( ~ a_truth(and(X0,X1),X2)
| a_truth(X0,X2) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_23736,plain,
( ~ a_truth(and(and(knave(me),rich(me)),X0),X1)
| a_truth(and(knave(me),rich(me)),X1) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_24123,plain,
( ~ a_truth(and(and(knave(me),rich(me)),X0),poor(X1))
| a_truth(and(knave(me),rich(me)),poor(X1)) ),
inference(instantiation,[status(thm)],[c_23736]) ).
cnf(c_24475,plain,
( ~ a_truth(and(and(knave(me),rich(me)),poor(X0)),poor(X1))
| a_truth(and(knave(me),rich(me)),poor(X1)) ),
inference(instantiation,[status(thm)],[c_24123]) ).
cnf(c_24477,plain,
( ~ a_truth(and(and(knave(me),rich(me)),poor(me)),poor(me))
| a_truth(and(knave(me),rich(me)),poor(me)) ),
inference(instantiation,[status(thm)],[c_24475]) ).
cnf(c_21,plain,
( ~ a_truth(knave(X0),X1)
| a_truth(X2,X1)
| says(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_52_1) ).
cnf(c_76,plain,
( ~ a_truth(knave(X0),X1)
| a_truth(X2,X1)
| says(X0,X2) ),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_23554,plain,
( a_truth(and(knave(me),rich(me)),X0)
| ~ a_truth(knave(X1),X0)
| says(X1,and(knave(me),rich(me))) ),
inference(instantiation,[status(thm)],[c_76]) ).
cnf(c_24262,plain,
( a_truth(and(knave(me),rich(me)),poor(X0))
| ~ a_truth(knave(X1),poor(X0))
| says(X1,and(knave(me),rich(me))) ),
inference(instantiation,[status(thm)],[c_23554]) ).
cnf(c_24263,plain,
( a_truth(and(knave(me),rich(me)),poor(me))
| ~ a_truth(knave(me),poor(me))
| says(me,and(knave(me),rich(me))) ),
inference(instantiation,[status(thm)],[c_24262]) ).
cnf(c_23342,plain,
( ~ a_truth(and(knave(me),rich(me)),X0)
| a_truth(rich(me),X0) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_24107,plain,
( ~ a_truth(and(knave(me),rich(me)),rich(me))
| a_truth(rich(me),rich(me)) ),
inference(instantiation,[status(thm)],[c_23342]) ).
cnf(c_23343,plain,
( ~ a_truth(and(knave(me),rich(me)),X0)
| a_truth(knave(me),X0) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_24108,plain,
( ~ a_truth(and(knave(me),rich(me)),rich(me))
| a_truth(knave(me),rich(me)) ),
inference(instantiation,[status(thm)],[c_23343]) ).
cnf(c_9,plain,
( ~ a_truth(X0,X1)
| ~ says(X2,X0)
| ~ a_truth(knave(X2),X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_47_2) ).
cnf(c_64,plain,
( ~ a_truth(X0,X1)
| ~ says(X2,X0)
| ~ a_truth(knave(X2),X1) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_23483,plain,
( ~ a_truth(knave(X0),X1)
| ~ a_truth(rich(X2),X1)
| ~ says(X0,rich(X2)) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_23904,plain,
( ~ a_truth(knave(me),knave(X0))
| ~ a_truth(rich(X1),knave(X0))
| ~ says(me,rich(X1)) ),
inference(instantiation,[status(thm)],[c_23483]) ).
cnf(c_23915,plain,
( ~ a_truth(knave(me),knave(me))
| ~ a_truth(rich(me),knave(me))
| ~ says(me,rich(me)) ),
inference(instantiation,[status(thm)],[c_23904]) ).
cnf(c_23562,plain,
( ~ a_truth(and(knave(me),rich(me)),knave(X0))
| a_truth(rich(me),knave(X0)) ),
inference(instantiation,[status(thm)],[c_23342]) ).
cnf(c_23563,plain,
( ~ a_truth(and(knave(me),rich(me)),knave(me))
| a_truth(rich(me),knave(me)) ),
inference(instantiation,[status(thm)],[c_23562]) ).
cnf(c_23560,plain,
( ~ a_truth(and(knave(me),rich(me)),knave(X0))
| a_truth(knave(me),knave(X0)) ),
inference(instantiation,[status(thm)],[c_23343]) ).
cnf(c_23561,plain,
( ~ a_truth(and(knave(me),rich(me)),knave(me))
| a_truth(knave(me),knave(me)) ),
inference(instantiation,[status(thm)],[c_23560]) ).
cnf(c_28,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X0)
| says(me,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_9) ).
cnf(c_43,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X0)
| says(me,X0) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_50,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X0)
| says(me,X0) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_51,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X0)
| says(me,X0) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_54,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X0)
| says(me,X0) ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_83,negated_conjecture,
( a_truth(and(knave(me),rich(me)),X0)
| says(me,X0) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_23553,plain,
( a_truth(and(knave(me),rich(me)),rich(me))
| says(me,rich(me)) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_23337,plain,
( ~ a_truth(and(knave(me),rich(me)),X0)
| ~ a_truth(knave(X1),X0)
| ~ says(X1,and(knave(me),rich(me))) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_23440,plain,
( ~ a_truth(and(knave(me),rich(me)),knave(X0))
| ~ a_truth(knave(X1),knave(X0))
| ~ says(X1,and(knave(me),rich(me))) ),
inference(instantiation,[status(thm)],[c_23337]) ).
cnf(c_23441,plain,
( ~ a_truth(and(knave(me),rich(me)),knave(me))
| ~ a_truth(knave(me),knave(me))
| ~ says(me,and(knave(me),rich(me))) ),
inference(instantiation,[status(thm)],[c_23440]) ).
cnf(c_27,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X0)
| ~ says(me,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_8) ).
cnf(c_41,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X0)
| ~ says(me,X0) ),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_49,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X0)
| ~ says(me,X0) ),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_52,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X0)
| ~ says(me,X0) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_53,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X0)
| ~ says(me,X0) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_82,negated_conjecture,
( ~ a_truth(and(knave(me),rich(me)),X0)
| ~ says(me,X0) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_23350,plain,
( ~ a_truth(and(knave(me),rich(me)),poor(X0))
| ~ says(me,poor(X0)) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_23351,plain,
( ~ a_truth(and(knave(me),rich(me)),poor(me))
| ~ says(me,poor(me)) ),
inference(instantiation,[status(thm)],[c_23350]) ).
cnf(c_23329,plain,
( a_truth(knave(X0),X1)
| ~ a_truth(knight(me),X1)
| ~ says(me,knave(X0)) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_23330,plain,
( a_truth(knave(me),me)
| ~ a_truth(knight(me),me)
| ~ says(me,knave(me)) ),
inference(instantiation,[status(thm)],[c_23329]) ).
cnf(c_23308,plain,
( a_truth(and(knave(me),rich(me)),knave(X0))
| says(me,knave(X0)) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_23309,plain,
( a_truth(and(knave(me),rich(me)),knave(me))
| says(me,knave(me)) ),
inference(instantiation,[status(thm)],[c_23308]) ).
cnf(c_7,plain,
( ~ a_truth(knave(X0),X1)
| ~ says(X0,X2)
| ~ a_truth(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p',c_0_47_0) ).
cnf(c_62,plain,
( ~ a_truth(knave(X0),X1)
| ~ says(X0,X2)
| ~ a_truth(X2,X1) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_23283,plain,
( ~ a_truth(knave(X0),X1)
| ~ a_truth(knave(X2),X1)
| ~ says(X0,knave(X2)) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_23284,plain,
( ~ a_truth(knave(me),me)
| ~ says(me,knave(me)) ),
inference(instantiation,[status(thm)],[c_23283]) ).
cnf(c_32,plain,
( a_truth(knave(me),me)
| a_truth(knight(me),me) ),
inference(instantiation,[status(thm)],[c_24]) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_464051,c_66791,c_66782,c_66426,c_66409,c_24527,c_24477,c_24263,c_24107,c_24108,c_23915,c_23563,c_23561,c_23553,c_23441,c_23351,c_23330,c_23309,c_23284,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat May 28 21:40:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % Orientation found
% 0.12/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_9057d8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_e6c146.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_405c68 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9057d8.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 23.63/23.85 % --inst_prop_sim_new false
% 23.63/23.85 % --inst_orphan_elimination true
% 23.63/23.85 % --inst_learning_loop_flag true
% 23.63/23.85 % --inst_learning_start 3000
% 23.63/23.85 % --inst_learning_factor 2
% 23.63/23.85 % --inst_start_prop_sim_after_learn 3
% 23.63/23.85 % --inst_sel_renew solver
% 23.63/23.85 % --inst_lit_activity_flag true
% 23.63/23.85 % --inst_out_proof true
% 23.63/23.85
% 23.63/23.85 % ------ Resolution Options
% 23.63/23.85
% 23.63/23.85 % --resolution_flag true
% 23.63/23.85 % --res_lit_sel kbo_max
% 23.63/23.85 % --res_to_prop_solver none
% 23.63/23.85 % --res_prop_simpl_new false
% 23.63/23.85 % --res_prop_simpl_given false
% 23.63/23.85 % --res_passive_queue_type priority_queues
% 23.63/23.85 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 23.63/23.85 % --res_passive_queues_freq [15;5]
% 23.63/23.85 % --res_forward_subs full
% 23.63/23.85 % --res_backward_subs full
% 23.63/23.85 % --res_forward_subs_resolution true
% 23.63/23.85 % --res_backward_subs_resolution true
% 23.63/23.85 % --res_orphan_elimination false
% 23.63/23.85 % --res_time_limit 1000.
% 23.63/23.85 % --res_out_proof true
% 23.63/23.85 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9057d8.s
% 23.63/23.85 % --modulo true
% 23.63/23.85
% 23.63/23.85 % ------ Combination Options
% 23.63/23.85
% 23.63/23.85 % --comb_res_mult 1000
% 23.63/23.85 % --comb_inst_mult 300
% 23.63/23.85 % ------
% 23.63/23.85
% 23.63/23.85
% 23.63/23.85
% 23.63/23.85 % ------ Proving...
% 23.63/23.85 %
% 23.63/23.85
% 23.63/23.85
% 23.63/23.85 % ------ Statistics
% 23.63/23.85
% 23.63/23.85 % ------ General
% 23.63/23.85
% 23.63/23.85 % num_of_input_clauses: 29
% 23.63/23.85 % num_of_input_neg_conjectures: 2
% 23.63/23.85 % num_of_splits: 0
% 23.63/23.85 % num_of_split_atoms: 0
% 23.63/23.85 % num_of_sem_filtered_clauses: 0
% 23.63/23.85 % num_of_subtypes: 0
% 23.63/23.85 % monotx_restored_types: 0
% 23.63/23.85 % sat_num_of_epr_types: 0
% 23.63/23.85 % sat_num_of_non_cyclic_types: 0
% 23.63/23.85 % sat_guarded_non_collapsed_types: 0
% 23.63/23.85 % is_epr: 0
% 23.63/23.85 % is_horn: 0
% 23.63/23.85 % has_eq: 0
% 23.63/23.85 % num_pure_diseq_elim: 0
% 23.63/23.85 % simp_replaced_by: 0
% 23.63/23.85 % res_preprocessed: 4
% 23.63/23.85 % prep_upred: 0
% 23.63/23.85 % prep_unflattend: 0
% 23.63/23.85 % pred_elim_cands: 0
% 23.63/23.85 % pred_elim: 0
% 23.63/23.85 % pred_elim_cl: 0
% 23.63/23.85 % pred_elim_cycles: 0
% 23.63/23.85 % forced_gc_time: 0
% 23.63/23.85 % gc_basic_clause_elim: 0
% 23.63/23.85 % parsing_time: 0.001
% 23.63/23.85 % sem_filter_time: 0.
% 23.63/23.85 % pred_elim_time: 0.
% 23.63/23.85 % out_proof_time: 0.002
% 23.63/23.85 % monotx_time: 0.
% 23.63/23.85 % subtype_inf_time: 0.
% 23.63/23.85 % unif_index_cands_time: 0.021
% 23.63/23.85 % unif_index_add_time: 0.005
% 23.63/23.85 % total_time: 23.439
% 23.63/23.85 % num_of_symbols: 33
% 23.63/23.85 % num_of_terms: 11722
% 23.63/23.85
% 23.63/23.85 % ------ Propositional Solver
% 23.63/23.85
% 23.63/23.85 % prop_solver_calls: 12
% 23.63/23.85 % prop_fast_solver_calls: 12
% 23.63/23.85 % prop_num_of_clauses: 2619
% 23.63/23.85 % prop_preprocess_simplified: 3140
% 23.63/23.85 % prop_fo_subsumed: 0
% 23.63/23.85 % prop_solver_time: 0.
% 23.63/23.85 % prop_fast_solver_time: 0.
% 23.63/23.85 % prop_unsat_core_time: 0.
% 23.63/23.85
% 23.63/23.85 % ------ QBF
% 23.63/23.85
% 23.63/23.85 % qbf_q_res: 0
% 23.63/23.85 % qbf_num_tautologies: 0
% 23.63/23.85 % qbf_prep_cycles: 0
% 23.63/23.85
% 23.63/23.85 % ------ BMC1
% 23.63/23.85
% 23.63/23.85 % bmc1_current_bound: -1
% 23.63/23.85 % bmc1_last_solved_bound: -1
% 23.63/23.85 % bmc1_unsat_core_size: -1
% 23.63/23.85 % bmc1_unsat_core_parents_size: -1
% 23.63/23.85 % bmc1_merge_next_fun: 0
% 23.63/23.85 % bmc1_unsat_core_clauses_time: 0.
% 23.63/23.85
% 23.63/23.85 % ------ Instantiation
% 23.63/23.85
% 23.63/23.85 % inst_num_of_clauses: 1503
% 23.63/23.85 % inst_num_in_passive: 708
% 23.63/23.85 % inst_num_in_active: 639
% 23.63/23.85 % inst_num_in_unprocessed: 152
% 23.63/23.85 % inst_num_of_loops: 827
% 23.63/23.85 % inst_num_of_learning_restarts: 0
% 23.63/23.85 % inst_num_moves_active_passive: 181
% 23.63/23.85 % inst_lit_activity: 143
% 23.63/23.85 % inst_lit_activity_moves: 0
% 23.63/23.85 % inst_num_tautologies: 2
% 23.63/23.85 % inst_num_prop_implied: 0
% 23.63/23.85 % inst_num_existing_simplified: 0
% 23.63/23.85 % inst_num_eq_res_simplified: 0
% 23.63/23.85 % inst_num_child_elim: 0
% 23.63/23.85 % inst_num_of_dismatching_blockings: 2933
% 23.63/23.85 % inst_num_of_non_proper_insts: 5346
% 23.63/23.85 % inst_num_of_duplicates: 2854
% 23.63/23.85 % inst_inst_num_from_inst_to_res: 0
% 23.63/23.85 % inst_dismatching_checking_time: 0.01
% 23.63/23.85
% 23.63/23.85 % ------ Resolution
% 23.63/23.85
% 23.63/23.85 % res_num_of_clauses: 108802
% 23.63/23.85 % res_num_in_passive: 108030
% 23.63/23.85 % res_num_in_active: 1189
% 23.63/23.85 % res_num_of_loops: 3000
% 23.63/23.85 % res_forward_subset_subsumed: 97707
% 23.63/23.85 % res_backward_subset_subsumed: 457
% 23.63/23.85 % res_forward_subsumed: 1627
% 23.63/23.85 % res_backward_subsumed: 54
% 23.63/23.85 % res_forward_subsumption_resolution: 636
% 23.63/23.85 % res_backward_subsumption_resolution: 3
% 23.63/23.85 % res_clause_to_clause_subsumption: 247862
% 23.63/23.85 % res_orphan_elimination: 0
% 23.63/23.85 % res_tautology_del: 7885
% 23.63/23.85 % res_num_eq_res_simplified: 0
% 23.63/23.85 % res_num_sel_changes: 0
% 23.63/23.85 % res_moves_from_active_to_pass: 0
% 23.63/23.85
% 23.63/23.85 % Status Unsatisfiable
% 23.63/23.85 % SZS status Unsatisfiable
% 23.63/23.85 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------