TSTP Solution File: SET842-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET842-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.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 : Tue Jul 19 02:17:27 EDT 2022
% Result : Unsatisfiable 2.00s 2.25s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 71 ( 7 unt; 0 def)
% Number of atoms : 147 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 148 ( 72 ~; 76 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 160 ( 0 sgn 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X5,X2,X3] :
( ~ c_in(c_Main_OsubsetI__1(X2,X5,X3),X5,X3)
| c_lessequals(X2,X5,tc_set(X3)) ),
file('<stdin>',cls_Set_OsubsetI_1) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( ~ c_in(X2,c_Union(X1,X3),X3)
| c_in(c_Main_OUnionE__1(X2,X1,X3),X1,tc_set(X3)) ),
file('<stdin>',cls_Set_OUnionE_0) ).
fof(c_0_2,axiom,
! [X1,X2,X3] :
( ~ c_in(X2,c_Union(X1,X3),X3)
| c_in(X2,c_Main_OUnionE__1(X2,X1,X3),X3) ),
file('<stdin>',cls_Set_OUnionE_1) ).
fof(c_0_3,axiom,
! [X4,X5,X2,X3] :
( ~ c_in(X4,X2,X3)
| ~ c_lessequals(X2,X5,tc_set(X3))
| c_in(X4,X5,X3) ),
file('<stdin>',cls_Set_OsubsetD_0) ).
fof(c_0_4,axiom,
! [X5,X2,X3] :
( c_in(c_Main_OsubsetI__1(X2,X5,X3),X2,X3)
| c_lessequals(X2,X5,tc_set(X3)) ),
file('<stdin>',cls_Set_OsubsetI_0) ).
fof(c_0_5,plain,
! [X5,X2,X3] :
( ~ c_in(c_Main_OsubsetI__1(X2,X5,X3),X5,X3)
| c_lessequals(X2,X5,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( ~ c_in(X2,c_Union(X1,X3),X3)
| c_in(c_Main_OUnionE__1(X2,X1,X3),X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_7,plain,
! [X1,X2,X3] :
( ~ c_in(X2,c_Union(X1,X3),X3)
| c_in(X2,c_Main_OUnionE__1(X2,X1,X3),X3) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_8,plain,
! [X4,X5,X2,X3] :
( ~ c_in(X4,X2,X3)
| ~ c_lessequals(X2,X5,tc_set(X3))
| c_in(X4,X5,X3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_9,axiom,
! [X5,X2,X3] :
( c_in(c_Main_OsubsetI__1(X2,X5,X3),X2,X3)
| c_lessequals(X2,X5,tc_set(X3)) ),
c_0_4 ).
fof(c_0_10,plain,
! [X6,X7,X8] :
( ~ c_in(c_Main_OsubsetI__1(X7,X6,X8),X6,X8)
| c_lessequals(X7,X6,tc_set(X8)) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ c_in(X5,c_Union(X4,X6),X6)
| c_in(c_Main_OUnionE__1(X5,X4,X6),X4,tc_set(X6)) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( ~ c_in(X5,c_Union(X4,X6),X6)
| c_in(X5,c_Main_OUnionE__1(X5,X4,X6),X6) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X6,X7,X8,X9] :
( ~ c_in(X6,X8,X9)
| ~ c_lessequals(X8,X7,tc_set(X9))
| c_in(X6,X7,X9) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X6,X7,X8] :
( c_in(c_Main_OsubsetI__1(X7,X6,X8),X7,X8)
| c_lessequals(X7,X6,tc_set(X8)) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,c_Union(X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
c_0_15,
[final] ).
cnf(c_0_21,plain,
( c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,c_Union(X2,X3),X3) ),
c_0_16,
[final] ).
cnf(c_0_22,plain,
( c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
c_0_17,
[final] ).
cnf(c_0_23,plain,
( c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,X4,X3) ),
c_0_18,
[final] ).
cnf(c_0_24,plain,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
c_0_19,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_20_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_1,axiom,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_21_0,axiom,
( c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,c_Union(X2,X3),X3) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_1,axiom,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_22_0,axiom,
( c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_1,axiom,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_23_0,axiom,
( c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_1,axiom,
( ~ c_lessequals(X4,X2,tc_set(X3))
| c_in(X1,X2,X3)
| ~ c_in(X1,X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_2,axiom,
( ~ c_in(X1,X4,X3)
| ~ c_lessequals(X4,X2,tc_set(X3))
| c_in(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_24_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
! [X1] :
( c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
file('<stdin>',cls_conjecture_4) ).
fof(c_0_1_002,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('<stdin>',cls_conjecture_3) ).
fof(c_0_2_003,negated_conjecture,
! [X1] :
( c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3_004,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4_005,negated_conjecture,
! [X2] :
( c_lessequals(X2,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X2,v_Y,tc_set(tc_set(t_a))) ),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5_006,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
c_0_3 ).
cnf(c_0_6_007,negated_conjecture,
( c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7_008,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8_009,negated_conjecture,
( c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
c_0_6,
[final] ).
cnf(c_0_9_010,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
c_0_7,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_2,plain,
( c_in(X0,X1,X2)
| ~ c_lessequals(X3,X1,tc_set(X2))
| ~ c_in(X0,X3,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p',c_0_23_2) ).
cnf(c_34,plain,
( c_in(X0,X1,X2)
| ~ c_lessequals(X3,X1,tc_set(X2))
| ~ c_in(X0,X3,X2) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_17072,plain,
( ~ c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),tc_set(t_a))
| c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),X0,tc_set(t_a))
| ~ c_lessequals(c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a))) ),
inference(instantiation,[status(thm)],[c_34]) ).
cnf(c_17094,plain,
( ~ c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),tc_set(t_a))
| c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_m,tc_set(t_a))
| ~ c_lessequals(c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
inference(instantiation,[status(thm)],[c_17072]) ).
cnf(c_11,negated_conjecture,
( ~ c_in(X0,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p',c_0_8) ).
cnf(c_18,negated_conjecture,
( ~ c_in(X0,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_26,negated_conjecture,
( ~ c_in(X0,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_29,negated_conjecture,
( ~ c_in(X0,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_30,negated_conjecture,
( ~ c_in(X0,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_43,negated_conjecture,
( ~ c_in(X0,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a))) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_17071,plain,
( ~ c_in(c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a)))
| c_lessequals(c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
inference(instantiation,[status(thm)],[c_43]) ).
cnf(c_8,plain,
( ~ c_in(X0,c_Union(X1,X2),X2)
| c_in(c_Main_OUnionE__1(X0,X1,X2),X1,tc_set(X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p',c_0_21_0) ).
cnf(c_40,plain,
( ~ c_in(X0,c_Union(X1,X2),X2)
| c_in(c_Main_OUnionE__1(X0,X1,X2),X1,tc_set(X2)) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_17063,plain,
( ~ c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Union(v_Y,tc_set(t_a)),tc_set(t_a))
| c_in(c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))) ),
inference(instantiation,[status(thm)],[c_40]) ).
cnf(c_6,plain,
( ~ c_in(X0,c_Union(X1,X2),X2)
| c_in(X0,c_Main_OUnionE__1(X0,X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p',c_0_22_0) ).
cnf(c_38,plain,
( ~ c_in(X0,c_Union(X1,X2),X2)
| c_in(X0,c_Main_OUnionE__1(X0,X1,X2),X2) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_17065,plain,
( ~ c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Union(v_Y,tc_set(t_a)),tc_set(t_a))
| c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),tc_set(t_a)) ),
inference(instantiation,[status(thm)],[c_38]) ).
cnf(c_9,plain,
( c_lessequals(X0,X1,tc_set(X2))
| ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p',c_0_20_1) ).
cnf(c_41,plain,
( c_lessequals(X0,X1,tc_set(X2))
| ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_17057,plain,
( ~ c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_m,tc_set(t_a))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
inference(instantiation,[status(thm)],[c_41]) ).
cnf(c_0,plain,
( c_lessequals(X0,X1,tc_set(X2))
| c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p',c_0_24_1) ).
cnf(c_32,plain,
( c_lessequals(X0,X1,tc_set(X2))
| c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_17055,plain,
( c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Union(v_Y,tc_set(t_a)),tc_set(t_a))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
inference(instantiation,[status(thm)],[c_32]) ).
cnf(c_12,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p',c_0_9) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_17094,c_17071,c_17063,c_17065,c_17057,c_17055,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET842-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n015.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 : Sun Jul 10 05:30:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/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/sandbox/tmp/iprover_proof_4f8cd4.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_1157bf.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_2b3f77 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --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/sandbox/tmp/iprover_proof_4f8cd4.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
% 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/sandbox/tmp/iprover_proof_4f8cd4.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
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % warning: shown sat in sat incomplete mode
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 cnf(c_11,negated_conjecture,
% 0.20/0.43 ( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
% 0.20/0.43 | ~ c_in(X0,v_Y,tc_set(tc_set(t_a))) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p', c_0_8) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_18,negated_conjecture,
% 0.20/0.43 ( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
% 0.20/0.43 | ~ c_in(X0,v_Y,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_26,negated_conjecture,
% 0.20/0.43 ( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
% 0.20/0.43 | ~ c_in(X0,v_Y,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_29,negated_conjecture,
% 0.20/0.43 ( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
% 0.20/0.43 | ~ c_in(X0,v_Y,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_30,negated_conjecture,
% 0.20/0.43 ( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
% 0.20/0.43 | ~ c_in(X0,v_Y,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_67,negated_conjecture,
% 0.20/0.43 ( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
% 0.20/0.43 | ~ c_in(X0,v_Y,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_2,plain,
% 0.20/0.43 ( ~ c_in(X0,c_Union(X1,X2),X2)
% 0.20/0.43 | c_in(c_Main_OUnionE__1(X0,X1,X2),X1,tc_set(X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p', c_0_21_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_49,plain,
% 0.20/0.43 ( ~ c_in(X0,c_Union(X1,X2),X2)
% 0.20/0.43 | c_in(c_Main_OUnionE__1(X0,X1,X2),X1,tc_set(X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_50,plain,
% 0.20/0.43 ( c_in(c_Main_OUnionE__1(X0,X1,X2),X1,tc_set(X2))
% 0.20/0.43 | ~ c_in(X0,c_Union(X1,X2),X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_49]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_81,plain,
% 0.20/0.43 ( c_lessequals(c_Main_OUnionE__1(X0,v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
% 0.20/0.43 | ~ c_in(X0,c_Union(v_Y,tc_set(t_a)),tc_set(t_a)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_67,c_50]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_82,plain,
% 0.20/0.43 ( c_lessequals(c_Main_OUnionE__1(X0,v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
% 0.20/0.43 | ~ c_in(X0,c_Union(v_Y,tc_set(t_a)),tc_set(t_a)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_81]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_12,negated_conjecture,
% 0.20/0.43 ( ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p', c_0_9) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_20,negated_conjecture,
% 0.20/0.43 ( ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_27,negated_conjecture,
% 0.20/0.43 ( ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_28,negated_conjecture,
% 0.20/0.43 ( ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_31,negated_conjecture,
% 0.20/0.43 ( ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_69,negated_conjecture,
% 0.20/0.43 ( ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
% 0.20/0.43 | c_lessequals(X0,X1,tc_set(X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p', c_0_20_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_45,plain,
% 0.20/0.43 ( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
% 0.20/0.43 | c_lessequals(X0,X1,tc_set(X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_46,plain,
% 0.20/0.43 ( c_lessequals(X0,X1,tc_set(X2))
% 0.20/0.43 | ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_45]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_74,plain,
% 0.20/0.43 ( ~ c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_m,tc_set(t_a)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_69,c_46]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_75,plain,
% 0.20/0.43 ( ~ c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_m,tc_set(t_a)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_74]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_9,plain,
% 0.20/0.43 ( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
% 0.20/0.43 | c_lessequals(X0,X1,tc_set(X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p', c_0_24_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_63,plain,
% 0.20/0.43 ( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
% 0.20/0.43 | c_lessequals(X0,X1,tc_set(X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_64,plain,
% 0.20/0.43 ( c_lessequals(X0,X1,tc_set(X2))
% 0.20/0.43 | c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_63]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_73,plain,
% 0.20/0.43 ( c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Union(v_Y,tc_set(t_a)),tc_set(t_a)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_69,c_64]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_76,plain,
% 0.20/0.43 ( c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Union(v_Y,tc_set(t_a)),tc_set(t_a)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_73]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_8,plain,
% 0.20/0.43 ( c_in(X0,X1,X2) | ~ c_lessequals(X3,X1,tc_set(X2)) | ~ c_in(X0,X3,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p', c_0_23_2) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_61,plain,
% 0.20/0.43 ( c_in(X0,X1,X2) | ~ c_lessequals(X3,X1,tc_set(X2)) | ~ c_in(X0,X3,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_62,plain,
% 0.20/0.43 ( ~ c_lessequals(X0,X1,tc_set(X2)) | c_in(X3,X1,X2) | ~ c_in(X3,X0,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_61]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_6,plain,
% 0.20/0.43 ( ~ c_in(X0,X1,X2) | ~ c_lessequals(X1,X3,tc_set(X2)) | c_in(X0,X3,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p', c_0_23_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_57,plain,
% 0.20/0.43 ( ~ c_in(X0,X1,X2) | ~ c_lessequals(X1,X3,tc_set(X2)) | c_in(X0,X3,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_58,plain,
% 0.20/0.43 ( ~ c_lessequals(X0,X1,tc_set(X2)) | ~ c_in(X3,X0,X2) | c_in(X3,X1,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_57]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_4,plain,
% 0.20/0.43 ( ~ c_in(X0,c_Union(X1,X2),X2)
% 0.20/0.43 | c_in(X0,c_Main_OUnionE__1(X0,X1,X2),X2) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_1157bf.p', c_0_22_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_53,plain,
% 0.20/0.43 ( ~ c_in(X0,c_Union(X1,X2),X2)
% 0.20/0.43 | c_in(X0,c_Main_OUnionE__1(X0,X1,X2),X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_54,plain,
% 0.20/0.43 ( c_in(X0,c_Main_OUnionE__1(X0,X1,X2),X2)
% 0.20/0.43 | ~ c_in(X0,c_Union(X1,X2),X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_53]) ).
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 13
% 0.20/0.43 % num_of_input_neg_conjectures: 2
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 0
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 4
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.025
% 0.20/0.43 % num_of_symbols: 34
% 0.20/0.43 % num_of_terms: 89
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 9
% 0.20/0.43 % prop_num_of_clauses: 13
% 0.20/0.43 % prop_preprocess_simplified: 61
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 13
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 13
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 18
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 11
% 0.20/0.43 % res_num_of_loops: 9
% 0.20/0.43 % res_forward_subset_subsumed: 5
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 3
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 0
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 4
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 0
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unknown
% 0.20/0.47 % Orienting using strategy ClausalAll
% 0.20/0.47 % Orientation found
% 0.20/0.47 % 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_4f8cd4.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_1157bf.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_06d1e0 | grep -v "SZS"
% 0.20/0.49
% 0.20/0.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ iProver source info
% 0.20/0.49
% 0.20/0.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.49 % git: non_committed_changes: true
% 0.20/0.49 % git: last_make_outside_of_git: true
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ Input Options
% 0.20/0.49
% 0.20/0.49 % --out_options all
% 0.20/0.49 % --tptp_safe_out true
% 0.20/0.49 % --problem_path ""
% 0.20/0.49 % --include_path ""
% 0.20/0.49 % --clausifier .//eprover
% 0.20/0.49 % --clausifier_options --tstp-format
% 0.20/0.49 % --stdin false
% 0.20/0.49 % --dbg_backtrace false
% 0.20/0.49 % --dbg_dump_prop_clauses false
% 0.20/0.49 % --dbg_dump_prop_clauses_file -
% 0.20/0.49 % --dbg_out_stat false
% 0.20/0.49
% 0.20/0.49 % ------ General Options
% 0.20/0.49
% 0.20/0.49 % --fof false
% 0.20/0.49 % --time_out_real 150.
% 0.20/0.49 % --time_out_prep_mult 0.2
% 0.20/0.49 % --time_out_virtual -1.
% 0.20/0.49 % --schedule none
% 0.20/0.49 % --ground_splitting input
% 0.20/0.49 % --splitting_nvd 16
% 0.20/0.49 % --non_eq_to_eq false
% 0.20/0.49 % --prep_gs_sim true
% 0.20/0.49 % --prep_unflatten false
% 0.20/0.49 % --prep_res_sim true
% 0.20/0.49 % --prep_upred true
% 0.20/0.49 % --res_sim_input true
% 0.20/0.49 % --clause_weak_htbl true
% 0.20/0.49 % --gc_record_bc_elim false
% 0.20/0.49 % --symbol_type_check false
% 0.20/0.49 % --clausify_out false
% 0.20/0.49 % --large_theory_mode false
% 0.20/0.49 % --prep_sem_filter none
% 0.20/0.49 % --prep_sem_filter_out false
% 0.20/0.49 % --preprocessed_out false
% 0.20/0.49 % --sub_typing false
% 0.20/0.49 % --brand_transform false
% 0.20/0.49 % --pure_diseq_elim true
% 0.20/0.49 % --min_unsat_core false
% 0.20/0.49 % --pred_elim true
% 0.20/0.49 % --add_important_lit false
% 0.20/0.49 % --soft_assumptions false
% 0.20/0.49 % --reset_solvers false
% 0.20/0.49 % --bc_imp_inh []
% 0.20/0.49 % --conj_cone_tolerance 1.5
% 0.20/0.49 % --prolific_symb_bound 500
% 0.20/0.49 % --lt_threshold 2000
% 0.20/0.49
% 0.20/0.49 % ------ SAT Options
% 0.20/0.49
% 0.20/0.49 % --sat_mode false
% 0.20/0.49 % --sat_fm_restart_options ""
% 0.20/0.49 % --sat_gr_def false
% 0.20/0.49 % --sat_epr_types true
% 0.20/0.49 % --sat_non_cyclic_types false
% 0.20/0.49 % --sat_finite_models false
% 0.20/0.49 % --sat_fm_lemmas false
% 0.20/0.49 % --sat_fm_prep false
% 0.20/0.49 % --sat_fm_uc_incr true
% 0.20/0.49 % --sat_out_model small
% 0.20/0.49 % --sat_out_clauses false
% 0.20/0.49
% 0.20/0.49 % ------ QBF Options
% 0.20/0.49
% 0.20/0.49 % --qbf_mode false
% 0.20/0.49 % --qbf_elim_univ true
% 0.20/0.49 % --qbf_sk_in true
% 0.20/0.49 % --qbf_pred_elim true
% 0.20/0.49 % --qbf_split 32
% 0.20/0.49
% 0.20/0.49 % ------ BMC1 Options
% 0.20/0.49
% 0.20/0.49 % --bmc1_incremental false
% 0.20/0.49 % --bmc1_axioms reachable_all
% 0.20/0.49 % --bmc1_min_bound 0
% 0.20/0.49 % --bmc1_max_bound -1
% 0.20/0.49 % --bmc1_max_bound_default -1
% 0.20/0.49 % --bmc1_symbol_reachability true
% 0.20/0.49 % --bmc1_property_lemmas false
% 0.20/0.49 % --bmc1_k_induction false
% 0.20/0.49 % --bmc1_non_equiv_states false
% 0.20/0.49 % --bmc1_deadlock false
% 0.20/0.49 % --bmc1_ucm false
% 0.20/0.49 % --bmc1_add_unsat_core none
% 0.20/0.49 % --bmc1_unsat_core_children false
% 0.20/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.49 % --bmc1_out_stat full
% 0.20/0.49 % --bmc1_ground_init false
% 0.20/0.49 % --bmc1_pre_inst_next_state false
% 0.20/0.49 % --bmc1_pre_inst_state false
% 0.20/0.49 % --bmc1_pre_inst_reach_state false
% 0.20/0.49 % --bmc1_out_unsat_core false
% 0.20/0.49 % --bmc1_aig_witness_out false
% 0.20/0.49 % --bmc1_verbose false
% 0.20/0.49 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.50 % --inst_prop_sim_new false
% 0.20/0.50 % --inst_orphan_elimination true
% 0.20/0.50 % --inst_learning_loop_flag true
% 0.20/0.50 % --inst_learning_start 3000
% 0.20/0.50 % --inst_learning_factor 2
% 0.20/0.50 % --inst_start_prop_sim_after_learn 3
% 0.20/0.50 % --inst_sel_renew solver
% 0.20/0.50 % --inst_lit_activity_flag true
% 0.20/0.50 % --inst_out_proof true
% 0.20/0.50
% 0.20/0.50 % ------ Resolution Options
% 0.20/0.50
% 0.20/0.50 % --resolution_flag true
% 0.20/0.50 % --res_lit_sel kbo_max
% 0.20/0.50 % --res_to_prop_solver none
% 0.20/0.50 % --res_prop_simpl_new false
% 0.20/0.50 % --res_prop_simpl_given false
% 0.20/0.50 % --res_passive_queue_type priority_queues
% 0.20/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.50 % --res_passive_queues_freq [15;5]
% 0.20/0.50 % --res_forward_subs full
% 0.20/0.50 % --res_backward_subs full
% 0.20/0.50 % --res_forward_subs_resolution true
% 0.20/0.50 % --res_backward_subs_resolution true
% 0.20/0.50 % --res_orphan_elimination false
% 0.20/0.50 % --res_time_limit 1000.
% 0.20/0.50 % --res_out_proof true
% 0.20/0.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4f8cd4.s
% 0.20/0.50 % --modulo true
% 0.20/0.50
% 0.20/0.50 % ------ Combination Options
% 0.20/0.50
% 0.20/0.50 % --comb_res_mult 1000
% 0.20/0.50 % --comb_inst_mult 300
% 0.20/0.50 % ------
% 0.20/0.50
% 0.20/0.50 % ------ Parsing...% successful
% 0.20/0.50
% 0.20/0.50 % ------ 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.50
% 0.20/0.50 % ------ Proving...
% 0.20/0.50 % ------ Problem Properties
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % EPR false
% 0.20/0.50 % Horn false
% 0.20/0.50 % Has equality false
% 0.20/0.50
% 0.20/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 % % ------ Current options:
% 0.20/0.50
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 2.00/2.25 % --inst_prop_sim_new false
% 2.00/2.25 % --inst_orphan_elimination true
% 2.00/2.25 % --inst_learning_loop_flag true
% 2.00/2.25 % --inst_learning_start 3000
% 2.00/2.25 % --inst_learning_factor 2
% 2.00/2.25 % --inst_start_prop_sim_after_learn 3
% 2.00/2.25 % --inst_sel_renew solver
% 2.00/2.25 % --inst_lit_activity_flag true
% 2.00/2.25 % --inst_out_proof true
% 2.00/2.25
% 2.00/2.25 % ------ Resolution Options
% 2.00/2.25
% 2.00/2.25 % --resolution_flag true
% 2.00/2.25 % --res_lit_sel kbo_max
% 2.00/2.25 % --res_to_prop_solver none
% 2.00/2.25 % --res_prop_simpl_new false
% 2.00/2.25 % --res_prop_simpl_given false
% 2.00/2.25 % --res_passive_queue_type priority_queues
% 2.00/2.25 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.00/2.25 % --res_passive_queues_freq [15;5]
% 2.00/2.25 % --res_forward_subs full
% 2.00/2.25 % --res_backward_subs full
% 2.00/2.25 % --res_forward_subs_resolution true
% 2.00/2.25 % --res_backward_subs_resolution true
% 2.00/2.25 % --res_orphan_elimination false
% 2.00/2.25 % --res_time_limit 1000.
% 2.00/2.25 % --res_out_proof true
% 2.00/2.25 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4f8cd4.s
% 2.00/2.25 % --modulo true
% 2.00/2.25
% 2.00/2.25 % ------ Combination Options
% 2.00/2.25
% 2.00/2.25 % --comb_res_mult 1000
% 2.00/2.25 % --comb_inst_mult 300
% 2.00/2.25 % ------
% 2.00/2.25
% 2.00/2.25
% 2.00/2.25
% 2.00/2.25 % ------ Proving...
% 2.00/2.25 %
% 2.00/2.25
% 2.00/2.25
% 2.00/2.25 % ------ Statistics
% 2.00/2.25
% 2.00/2.25 % ------ General
% 2.00/2.25
% 2.00/2.25 % num_of_input_clauses: 13
% 2.00/2.25 % num_of_input_neg_conjectures: 2
% 2.00/2.25 % num_of_splits: 0
% 2.00/2.25 % num_of_split_atoms: 0
% 2.00/2.25 % num_of_sem_filtered_clauses: 0
% 2.00/2.25 % num_of_subtypes: 0
% 2.00/2.25 % monotx_restored_types: 0
% 2.00/2.25 % sat_num_of_epr_types: 0
% 2.00/2.25 % sat_num_of_non_cyclic_types: 0
% 2.00/2.25 % sat_guarded_non_collapsed_types: 0
% 2.00/2.25 % is_epr: 0
% 2.00/2.25 % is_horn: 0
% 2.00/2.25 % has_eq: 0
% 2.00/2.25 % num_pure_diseq_elim: 0
% 2.00/2.25 % simp_replaced_by: 0
% 2.00/2.25 % res_preprocessed: 4
% 2.00/2.25 % prep_upred: 0
% 2.00/2.25 % prep_unflattend: 0
% 2.00/2.25 % pred_elim_cands: 0
% 2.00/2.25 % pred_elim: 0
% 2.00/2.25 % pred_elim_cl: 0
% 2.00/2.25 % pred_elim_cycles: 0
% 2.00/2.25 % forced_gc_time: 0
% 2.00/2.25 % gc_basic_clause_elim: 0
% 2.00/2.25 % parsing_time: 0.001
% 2.00/2.25 % sem_filter_time: 0.
% 2.00/2.25 % pred_elim_time: 0.
% 2.00/2.25 % out_proof_time: 0.
% 2.00/2.25 % monotx_time: 0.
% 2.00/2.25 % subtype_inf_time: 0.
% 2.00/2.25 % unif_index_cands_time: 0.001
% 2.00/2.25 % unif_index_add_time: 0.007
% 2.00/2.25 % total_time: 1.768
% 2.00/2.25 % num_of_symbols: 34
% 2.00/2.25 % num_of_terms: 4861
% 2.00/2.25
% 2.00/2.25 % ------ Propositional Solver
% 2.00/2.25
% 2.00/2.25 % prop_solver_calls: 5
% 2.00/2.25 % prop_fast_solver_calls: 9
% 2.00/2.25 % prop_num_of_clauses: 36
% 2.00/2.25 % prop_preprocess_simplified: 97
% 2.00/2.25 % prop_fo_subsumed: 0
% 2.00/2.25 % prop_solver_time: 0.
% 2.00/2.25 % prop_fast_solver_time: 0.
% 2.00/2.25 % prop_unsat_core_time: 0.
% 2.00/2.25
% 2.00/2.25 % ------ QBF
% 2.00/2.25
% 2.00/2.25 % qbf_q_res: 0
% 2.00/2.25 % qbf_num_tautologies: 0
% 2.00/2.25 % qbf_prep_cycles: 0
% 2.00/2.25
% 2.00/2.25 % ------ BMC1
% 2.00/2.25
% 2.00/2.25 % bmc1_current_bound: -1
% 2.00/2.25 % bmc1_last_solved_bound: -1
% 2.00/2.25 % bmc1_unsat_core_size: -1
% 2.00/2.25 % bmc1_unsat_core_parents_size: -1
% 2.00/2.25 % bmc1_merge_next_fun: 0
% 2.00/2.25 % bmc1_unsat_core_clauses_time: 0.
% 2.00/2.25
% 2.00/2.25 % ------ Instantiation
% 2.00/2.25
% 2.00/2.25 % inst_num_of_clauses: 28
% 2.00/2.25 % inst_num_in_passive: 0
% 2.00/2.25 % inst_num_in_active: 20
% 2.00/2.25 % inst_num_in_unprocessed: 6
% 2.00/2.25 % inst_num_of_loops: 24
% 2.00/2.25 % inst_num_of_learning_restarts: 0
% 2.00/2.25 % inst_num_moves_active_passive: 0
% 2.00/2.25 % inst_lit_activity: 10
% 2.00/2.25 % inst_lit_activity_moves: 0
% 2.00/2.25 % inst_num_tautologies: 0
% 2.00/2.25 % inst_num_prop_implied: 0
% 2.00/2.25 % inst_num_existing_simplified: 0
% 2.00/2.25 % inst_num_eq_res_simplified: 0
% 2.00/2.25 % inst_num_child_elim: 0
% 2.00/2.25 % inst_num_of_dismatching_blockings: 0
% 2.00/2.25 % inst_num_of_non_proper_insts: 14
% 2.00/2.25 % inst_num_of_duplicates: 16
% 2.00/2.25 % inst_inst_num_from_inst_to_res: 0
% 2.00/2.25 % inst_dismatching_checking_time: 0.
% 2.00/2.25
% 2.00/2.25 % ------ Resolution
% 2.00/2.25
% 2.00/2.25 % res_num_of_clauses: 1685
% 2.00/2.25 % res_num_in_passive: 678
% 2.00/2.25 % res_num_in_active: 1001
% 2.00/2.25 % res_num_of_loops: 1000
% 2.00/2.25 % res_forward_subset_subsumed: 7
% 2.00/2.25 % res_backward_subset_subsumed: 0
% 2.00/2.25 % res_forward_subsumed: 5
% 2.00/2.25 % res_backward_subsumed: 0
% 2.00/2.25 % res_forward_subsumption_resolution: 0
% 2.00/2.25 % res_backward_subsumption_resolution: 0
% 2.00/2.25 % res_clause_to_clause_subsumption: 29008
% 2.00/2.25 % res_orphan_elimination: 0
% 2.00/2.25 % res_tautology_del: 0
% 2.00/2.25 % res_num_eq_res_simplified: 0
% 2.00/2.25 % res_num_sel_changes: 0
% 2.00/2.25 % res_moves_from_active_to_pass: 0
% 2.00/2.25
% 2.00/2.25 % Status Unsatisfiable
% 2.00/2.25 % SZS status Unsatisfiable
% 2.00/2.25 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------