TSTP Solution File: PUZ009-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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:41 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 24
% Syntax : Number of formulae : 136 ( 7 unt; 0 def)
% Number of atoms : 307 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 329 ( 158 ~; 171 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 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,
( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight ),
file('<stdin>',c10) ).
fof(c_0_1,axiom,
( ~ a_is_a_knight
| ~ e_is_a_knight
| c_is_a_knight ),
file('<stdin>',c15) ).
fof(c_0_2,axiom,
( ~ b_is_a_knight
| c_is_a_knight
| d_is_a_knight ),
file('<stdin>',c5) ).
fof(c_0_3,axiom,
( d_is_a_knight
| ~ b_is_a_knight
| c_is_a_knight ),
file('<stdin>',c14) ).
fof(c_0_4,axiom,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
file('<stdin>',c1) ).
fof(c_0_5,axiom,
( ~ a_is_a_knight
| ~ d_is_a_knight ),
file('<stdin>',c2) ).
fof(c_0_6,axiom,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
file('<stdin>',c3) ).
fof(c_0_7,axiom,
( ~ c_is_a_knight
| ~ d_is_a_knight ),
file('<stdin>',c6) ).
fof(c_0_8,axiom,
( ~ d_is_a_knight
| ~ a_is_a_knight ),
file('<stdin>',c7) ).
fof(c_0_9,axiom,
( ~ d_is_a_knight
| ~ c_is_a_knight ),
file('<stdin>',c9) ).
fof(c_0_10,axiom,
( d_is_a_knight
| a_is_a_knight
| c_is_a_knight ),
file('<stdin>',c13) ).
fof(c_0_11,axiom,
( ~ d_is_a_knight
| b_is_a_knight ),
file('<stdin>',c8) ).
fof(c_0_12,axiom,
( e_is_a_knight
| ~ c_is_a_knight ),
file('<stdin>',c12) ).
fof(c_0_13,axiom,
( a_is_a_knight
| ~ c_is_a_knight ),
file('<stdin>',c17) ).
fof(c_0_14,axiom,
( b_is_a_knight
| a_is_a_knight ),
file('<stdin>',c4) ).
fof(c_0_15,axiom,
( e_is_a_knight
| d_is_a_knight ),
file('<stdin>',c11) ).
fof(c_0_16,axiom,
( a_is_a_knight
| e_is_a_knight ),
file('<stdin>',c16) ).
fof(c_0_17,plain,
( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_18,plain,
( ~ a_is_a_knight
| ~ e_is_a_knight
| c_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_19,plain,
( ~ b_is_a_knight
| c_is_a_knight
| d_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_20,plain,
( d_is_a_knight
| ~ b_is_a_knight
| c_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_21,plain,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_22,plain,
( ~ a_is_a_knight
| ~ d_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_23,plain,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_24,plain,
( ~ c_is_a_knight
| ~ d_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_25,plain,
( ~ d_is_a_knight
| ~ a_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_26,plain,
( ~ d_is_a_knight
| ~ c_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_27,axiom,
( d_is_a_knight
| a_is_a_knight
| c_is_a_knight ),
c_0_10 ).
fof(c_0_28,plain,
( ~ d_is_a_knight
| b_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_29,plain,
( e_is_a_knight
| ~ c_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_30,plain,
( a_is_a_knight
| ~ c_is_a_knight ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_31,axiom,
( b_is_a_knight
| a_is_a_knight ),
c_0_14 ).
fof(c_0_32,axiom,
( e_is_a_knight
| d_is_a_knight ),
c_0_15 ).
fof(c_0_33,axiom,
( a_is_a_knight
| e_is_a_knight ),
c_0_16 ).
fof(c_0_34,plain,
( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight ),
c_0_17 ).
fof(c_0_35,plain,
( ~ a_is_a_knight
| ~ e_is_a_knight
| c_is_a_knight ),
c_0_18 ).
fof(c_0_36,plain,
( ~ b_is_a_knight
| c_is_a_knight
| d_is_a_knight ),
c_0_19 ).
fof(c_0_37,plain,
( d_is_a_knight
| ~ b_is_a_knight
| c_is_a_knight ),
c_0_20 ).
fof(c_0_38,plain,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
c_0_21 ).
fof(c_0_39,plain,
( ~ a_is_a_knight
| ~ d_is_a_knight ),
c_0_22 ).
fof(c_0_40,plain,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
c_0_23 ).
fof(c_0_41,plain,
( ~ c_is_a_knight
| ~ d_is_a_knight ),
c_0_24 ).
fof(c_0_42,plain,
( ~ d_is_a_knight
| ~ a_is_a_knight ),
c_0_25 ).
fof(c_0_43,plain,
( ~ d_is_a_knight
| ~ c_is_a_knight ),
c_0_26 ).
fof(c_0_44,axiom,
( d_is_a_knight
| a_is_a_knight
| c_is_a_knight ),
c_0_27 ).
fof(c_0_45,plain,
( ~ d_is_a_knight
| b_is_a_knight ),
c_0_28 ).
fof(c_0_46,plain,
( e_is_a_knight
| ~ c_is_a_knight ),
c_0_29 ).
fof(c_0_47,plain,
( a_is_a_knight
| ~ c_is_a_knight ),
c_0_30 ).
fof(c_0_48,axiom,
( b_is_a_knight
| a_is_a_knight ),
c_0_31 ).
fof(c_0_49,axiom,
( e_is_a_knight
| d_is_a_knight ),
c_0_32 ).
fof(c_0_50,axiom,
( a_is_a_knight
| e_is_a_knight ),
c_0_33 ).
cnf(c_0_51,plain,
( c_is_a_knight
| ~ d_is_a_knight
| ~ e_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,plain,
( c_is_a_knight
| ~ e_is_a_knight
| ~ a_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,plain,
( d_is_a_knight
| c_is_a_knight
| ~ b_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_54,plain,
( c_is_a_knight
| d_is_a_knight
| ~ b_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_55,plain,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_56,plain,
( ~ d_is_a_knight
| ~ a_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_57,plain,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_58,plain,
( ~ d_is_a_knight
| ~ c_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_59,plain,
( ~ a_is_a_knight
| ~ d_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_60,plain,
( ~ c_is_a_knight
| ~ d_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_61,plain,
( c_is_a_knight
| a_is_a_knight
| d_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_62,plain,
( b_is_a_knight
| ~ d_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_63,plain,
( e_is_a_knight
| ~ c_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_64,plain,
( a_is_a_knight
| ~ c_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_65,plain,
( a_is_a_knight
| b_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_66,plain,
( d_is_a_knight
| e_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_67,plain,
( e_is_a_knight
| a_is_a_knight ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_68,plain,
( c_is_a_knight
| ~ d_is_a_knight
| ~ e_is_a_knight ),
c_0_51,
[final] ).
cnf(c_0_69,plain,
( c_is_a_knight
| ~ e_is_a_knight
| ~ a_is_a_knight ),
c_0_52,
[final] ).
cnf(c_0_70,plain,
( d_is_a_knight
| c_is_a_knight
| ~ b_is_a_knight ),
c_0_53,
[final] ).
cnf(c_0_71,plain,
( c_is_a_knight
| d_is_a_knight
| ~ b_is_a_knight ),
c_0_54,
[final] ).
cnf(c_0_72,plain,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
c_0_55,
[final] ).
cnf(c_0_73,plain,
( ~ d_is_a_knight
| ~ a_is_a_knight ),
c_0_56,
[final] ).
cnf(c_0_74,plain,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
c_0_57,
[final] ).
cnf(c_0_75,plain,
( ~ d_is_a_knight
| ~ c_is_a_knight ),
c_0_58,
[final] ).
cnf(c_0_76,plain,
( ~ a_is_a_knight
| ~ d_is_a_knight ),
c_0_59,
[final] ).
cnf(c_0_77,plain,
( ~ c_is_a_knight
| ~ d_is_a_knight ),
c_0_60,
[final] ).
cnf(c_0_78,plain,
( c_is_a_knight
| a_is_a_knight
| d_is_a_knight ),
c_0_61,
[final] ).
cnf(c_0_79,plain,
( b_is_a_knight
| ~ d_is_a_knight ),
c_0_62,
[final] ).
cnf(c_0_80,plain,
( e_is_a_knight
| ~ c_is_a_knight ),
c_0_63,
[final] ).
cnf(c_0_81,plain,
( a_is_a_knight
| ~ c_is_a_knight ),
c_0_64,
[final] ).
cnf(c_0_82,plain,
( a_is_a_knight
| b_is_a_knight ),
c_0_65,
[final] ).
cnf(c_0_83,plain,
( d_is_a_knight
| e_is_a_knight ),
c_0_66,
[final] ).
cnf(c_0_84,plain,
( e_is_a_knight
| a_is_a_knight ),
c_0_67,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_68_0,axiom,
( c_is_a_knight
| ~ d_is_a_knight
| ~ e_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_1,axiom,
( ~ d_is_a_knight
| c_is_a_knight
| ~ e_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_68_2,axiom,
( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_68]) ).
cnf(c_0_69_0,axiom,
( c_is_a_knight
| ~ e_is_a_knight
| ~ a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_69_1,axiom,
( ~ e_is_a_knight
| c_is_a_knight
| ~ a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_69_2,axiom,
( ~ a_is_a_knight
| ~ e_is_a_knight
| c_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_69]) ).
cnf(c_0_70_0,axiom,
( d_is_a_knight
| c_is_a_knight
| ~ b_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_1,axiom,
( c_is_a_knight
| d_is_a_knight
| ~ b_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_70_2,axiom,
( ~ b_is_a_knight
| c_is_a_knight
| d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_70]) ).
cnf(c_0_71_0,axiom,
( c_is_a_knight
| d_is_a_knight
| ~ b_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_1,axiom,
( d_is_a_knight
| c_is_a_knight
| ~ b_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_71_2,axiom,
( ~ b_is_a_knight
| d_is_a_knight
| c_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_71]) ).
cnf(c_0_72_0,axiom,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_72_1,axiom,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_72]) ).
cnf(c_0_73_0,axiom,
( ~ d_is_a_knight
| ~ a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_73_1,axiom,
( ~ a_is_a_knight
| ~ d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_73]) ).
cnf(c_0_74_0,axiom,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_74_1,axiom,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_74]) ).
cnf(c_0_75_0,axiom,
( ~ d_is_a_knight
| ~ c_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_75_1,axiom,
( ~ c_is_a_knight
| ~ d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_75]) ).
cnf(c_0_76_0,axiom,
( ~ a_is_a_knight
| ~ d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_76_1,axiom,
( ~ d_is_a_knight
| ~ a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_76]) ).
cnf(c_0_77_0,axiom,
( ~ c_is_a_knight
| ~ d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_77_1,axiom,
( ~ d_is_a_knight
| ~ c_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_77]) ).
cnf(c_0_78_0,axiom,
( c_is_a_knight
| a_is_a_knight
| d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_1,axiom,
( a_is_a_knight
| c_is_a_knight
| d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_78_2,axiom,
( d_is_a_knight
| a_is_a_knight
| c_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_78]) ).
cnf(c_0_79_0,axiom,
( b_is_a_knight
| ~ d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_79_1,axiom,
( ~ d_is_a_knight
| b_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_79]) ).
cnf(c_0_80_0,axiom,
( e_is_a_knight
| ~ c_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_80_1,axiom,
( ~ c_is_a_knight
| e_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_80]) ).
cnf(c_0_81_0,axiom,
( a_is_a_knight
| ~ c_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_81_1,axiom,
( ~ c_is_a_knight
| a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_81]) ).
cnf(c_0_82_0,axiom,
( a_is_a_knight
| b_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_82_1,axiom,
( b_is_a_knight
| a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_82]) ).
cnf(c_0_83_0,axiom,
( d_is_a_knight
| e_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_83_1,axiom,
( e_is_a_knight
| d_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_83]) ).
cnf(c_0_84_0,axiom,
( e_is_a_knight
| a_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
cnf(c_0_84_1,axiom,
( a_is_a_knight
| e_is_a_knight ),
inference(literals_permutation,[status(thm)],[c_0_84]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
b_is_a_knight,
file('<stdin>',c18) ).
fof(c_0_1_002,negated_conjecture,
b_is_a_knight,
c_0_0 ).
fof(c_0_2_003,negated_conjecture,
b_is_a_knight,
c_0_1 ).
cnf(c_0_3_004,negated_conjecture,
b_is_a_knight,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
b_is_a_knight,
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_2,plain,
( c_is_a_knight
| ~ d_is_a_knight
| ~ e_is_a_knight ),
file('/export/starexec/sandbox/tmp/iprover_modulo_adf7e7.p',c_0_68_2) ).
cnf(c_17,plain,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
file('/export/starexec/sandbox/tmp/iprover_modulo_adf7e7.p',c_0_74_1) ).
cnf(c_26,plain,
( c_is_a_knight
| a_is_a_knight
| d_is_a_knight ),
file('/export/starexec/sandbox/tmp/iprover_modulo_adf7e7.p',c_0_78_2) ).
cnf(c_32,plain,
( a_is_a_knight
| ~ c_is_a_knight ),
file('/export/starexec/sandbox/tmp/iprover_modulo_adf7e7.p',c_0_81_1) ).
cnf(c_38,plain,
( e_is_a_knight
| a_is_a_knight ),
file('/export/starexec/sandbox/tmp/iprover_modulo_adf7e7.p',c_0_84_1) ).
cnf(c_39,negated_conjecture,
b_is_a_knight,
file('/export/starexec/sandbox/tmp/iprover_modulo_adf7e7.p',c_0_4) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_2,c_17,c_26,c_32,c_38,c_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun May 29 02:56:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % Orientation found
% 0.20/0.41 % 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_41326c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_adf7e7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_2dcbf2 | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_41326c.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Statistics
% 0.20/0.44
% 0.20/0.44 % ------ General
% 0.20/0.44
% 0.20/0.44 % num_of_input_clauses: 40
% 0.20/0.44 % num_of_input_neg_conjectures: 1
% 0.20/0.44 % num_of_splits: 0
% 0.20/0.44 % num_of_split_atoms: 0
% 0.20/0.44 % num_of_sem_filtered_clauses: 0
% 0.20/0.44 % num_of_subtypes: 0
% 0.20/0.44 % monotx_restored_types: 0
% 0.20/0.44 % sat_num_of_epr_types: 0
% 0.20/0.44 % sat_num_of_non_cyclic_types: 0
% 0.20/0.44 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 0
% 0.20/0.44 % has_eq: 0
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 0
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 0
% 0.20/0.44 % pred_elim: 0
% 0.20/0.44 % pred_elim_cl: 0
% 0.20/0.44 % pred_elim_cycles: 0
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.
% 0.20/0.44 % out_proof_time: 0.
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.018
% 0.20/0.44 % num_of_symbols: 30
% 0.20/0.44 % num_of_terms: 18
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 0
% 0.20/0.44 % prop_fast_solver_calls: 1
% 0.20/0.44 % prop_num_of_clauses: 12
% 0.20/0.44 % prop_preprocess_simplified: 31
% 0.20/0.44 % prop_fo_subsumed: 0
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: undef
% 0.20/0.44 % inst_num_in_passive: undef
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 0
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: undef
% 0.20/0.44 % res_num_in_passive: undef
% 0.20/0.44 % res_num_in_active: 0
% 0.20/0.44 % res_num_of_loops: 0
% 0.20/0.44 % res_forward_subset_subsumed: 0
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 0
% 0.20/0.44 % res_backward_subsumed: 0
% 0.20/0.44 % res_forward_subsumption_resolution: 0
% 0.20/0.44 % res_backward_subsumption_resolution: 0
% 0.20/0.44 % res_clause_to_clause_subsumption: 0
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 0
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unsatisfiable
% 0.20/0.44 % SZS status Unsatisfiable
% 0.20/0.44 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------