TSTP Solution File: SET830-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET830-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:01 EDT 2022
% Result : Unsatisfiable 0.20s 0.56s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 20
% Syntax : Number of formulae : 124 ( 36 unt; 0 def)
% Number of atoms : 252 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 254 ( 126 ~; 128 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 245 ( 16 sgn 69 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X4,X1,X2,X3] :
( ~ c_in(X4,X1,X3)
| ~ c_in(X4,X2,X3)
| c_in(X4,c_inter(X2,X1,X3),X3) ),
file('<stdin>',cls_Set_OIntI_0) ).
fof(c_0_1,axiom,
! [X1,X2,X3] :
( ~ c_in(c_Main_OsubsetI__1(X2,X1,X3),X1,X3)
| c_lessequals(X2,X1,tc_set(X3)) ),
file('<stdin>',cls_Set_OsubsetI_1) ).
fof(c_0_2,axiom,
! [X4,X1,X2,X3] :
( ~ c_in(X4,c_inter(X2,X1,X3),X3)
| c_in(X4,X1,X3) ),
file('<stdin>',cls_Set_OIntE_0) ).
fof(c_0_3,axiom,
! [X4,X1,X2,X3] :
( ~ c_in(X4,c_inter(X2,X1,X3),X3)
| c_in(X4,X2,X3) ),
file('<stdin>',cls_Set_OIntE_1) ).
fof(c_0_4,axiom,
! [X4,X1,X2,X3] :
( ~ c_in(X4,X2,X3)
| ~ c_lessequals(X2,X1,tc_set(X3))
| c_in(X4,X1,X3) ),
file('<stdin>',cls_Set_OsubsetD_0) ).
fof(c_0_5,axiom,
! [X1,X2,X3] :
( c_in(c_Main_OsubsetI__1(X2,X1,X3),X2,X3)
| c_lessequals(X2,X1,tc_set(X3)) ),
file('<stdin>',cls_Set_OsubsetI_0) ).
fof(c_0_6,plain,
! [X4,X1,X2,X3] :
( ~ c_in(X4,X1,X3)
| ~ c_in(X4,X2,X3)
| c_in(X4,c_inter(X2,X1,X3),X3) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_7,plain,
! [X1,X2,X3] :
( ~ c_in(c_Main_OsubsetI__1(X2,X1,X3),X1,X3)
| c_lessequals(X2,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_8,plain,
! [X4,X1,X2,X3] :
( ~ c_in(X4,c_inter(X2,X1,X3),X3)
| c_in(X4,X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_9,plain,
! [X4,X1,X2,X3] :
( ~ c_in(X4,c_inter(X2,X1,X3),X3)
| c_in(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_10,plain,
! [X4,X1,X2,X3] :
( ~ c_in(X4,X2,X3)
| ~ c_lessequals(X2,X1,tc_set(X3))
| c_in(X4,X1,X3) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_11,axiom,
! [X1,X2,X3] :
( c_in(c_Main_OsubsetI__1(X2,X1,X3),X2,X3)
| c_lessequals(X2,X1,tc_set(X3)) ),
c_0_5 ).
fof(c_0_12,plain,
! [X5,X6,X7,X8] :
( ~ c_in(X5,X6,X8)
| ~ c_in(X5,X7,X8)
| c_in(X5,c_inter(X7,X6,X8),X8) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ~ c_in(c_Main_OsubsetI__1(X5,X4,X6),X4,X6)
| c_lessequals(X5,X4,tc_set(X6)) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X5,X6,X7,X8] :
( ~ c_in(X5,c_inter(X7,X6,X8),X8)
| c_in(X5,X6,X8) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X5,X6,X7,X8] :
( ~ c_in(X5,c_inter(X7,X6,X8),X8)
| c_in(X5,X7,X8) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X5,X6,X7,X8] :
( ~ c_in(X5,X7,X8)
| ~ c_lessequals(X7,X6,tc_set(X8))
| c_in(X5,X6,X8) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X4,X5,X6] :
( c_in(c_Main_OsubsetI__1(X5,X4,X6),X5,X6)
| c_lessequals(X5,X4,tc_set(X6)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( c_in(X1,c_inter(X2,X3,X4),X4)
| ~ c_in(X1,X2,X4)
| ~ c_in(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,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_13]) ).
cnf(c_0_20,plain,
( c_in(X1,X2,X3)
| ~ c_in(X1,c_inter(X4,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( c_in(X1,X2,X3)
| ~ c_in(X1,c_inter(X2,X4,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,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_16]) ).
cnf(c_0_23,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_17]) ).
cnf(c_0_24,plain,
( c_in(X1,c_inter(X2,X3,X4),X4)
| ~ c_in(X1,X2,X4)
| ~ c_in(X1,X3,X4) ),
c_0_18,
[final] ).
cnf(c_0_25,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
c_0_19,
[final] ).
cnf(c_0_26,plain,
( c_in(X1,X2,X3)
| ~ c_in(X1,c_inter(X4,X2,X3),X3) ),
c_0_20,
[final] ).
cnf(c_0_27,plain,
( c_in(X1,X2,X3)
| ~ c_in(X1,c_inter(X2,X4,X3),X3) ),
c_0_21,
[final] ).
cnf(c_0_28,plain,
( c_in(X1,X2,X3)
| ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,X4,X3) ),
c_0_22,
[final] ).
cnf(c_0_29,plain,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
c_0_23,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_24_0,axiom,
( c_in(X1,c_inter(X2,X3,X4),X4)
| ~ c_in(X1,X2,X4)
| ~ c_in(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( ~ c_in(X1,X2,X4)
| c_in(X1,c_inter(X2,X3,X4),X4)
| ~ c_in(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_2,axiom,
( ~ c_in(X1,X3,X4)
| ~ c_in(X1,X2,X4)
| c_in(X1,c_inter(X2,X3,X4),X4) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_25_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_25]) ).
cnf(c_0_25_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_25]) ).
cnf(c_0_26_0,axiom,
( c_in(X1,X2,X3)
| ~ c_in(X1,c_inter(X4,X2,X3),X3) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_1,axiom,
( ~ c_in(X1,c_inter(X4,X2,X3),X3)
| c_in(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_27_0,axiom,
( c_in(X1,X2,X3)
| ~ c_in(X1,c_inter(X2,X4,X3),X3) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( ~ c_in(X1,c_inter(X2,X4,X3),X3)
| c_in(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_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_28]) ).
cnf(c_0_28_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_28]) ).
cnf(c_0_28_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_28]) ).
cnf(c_0_29_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_29]) ).
cnf(c_0_29_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_29]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
! [X1] :
( c_lessequals(X1,v_X,tc_set(t_a))
| ~ c_lessequals(X1,v_Z,tc_set(t_a))
| ~ c_lessequals(X1,v_Y,tc_set(t_a)) ),
file('<stdin>',cls_conjecture_5) ).
fof(c_0_1_002,negated_conjecture,
~ c_in(v_x,v_X,t_a),
file('<stdin>',cls_conjecture_4) ).
fof(c_0_2_003,negated_conjecture,
c_in(v_x,v_Z,t_a),
file('<stdin>',cls_conjecture_3) ).
fof(c_0_3_004,negated_conjecture,
c_in(v_x,v_Y,t_a),
file('<stdin>',cls_conjecture_2) ).
fof(c_0_4_005,negated_conjecture,
! [X1] :
( c_lessequals(X1,v_X,tc_set(t_a))
| ~ c_lessequals(X1,v_Z,tc_set(t_a))
| ~ c_lessequals(X1,v_Y,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_5_006,negated_conjecture,
~ c_in(v_x,v_X,t_a),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_6_007,negated_conjecture,
c_in(v_x,v_Z,t_a),
c_0_2 ).
fof(c_0_7_008,negated_conjecture,
c_in(v_x,v_Y,t_a),
c_0_3 ).
fof(c_0_8_009,negated_conjecture,
! [X2] :
( c_lessequals(X2,v_X,tc_set(t_a))
| ~ c_lessequals(X2,v_Z,tc_set(t_a))
| ~ c_lessequals(X2,v_Y,tc_set(t_a)) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_9_010,negated_conjecture,
~ c_in(v_x,v_X,t_a),
c_0_5 ).
fof(c_0_10_011,negated_conjecture,
c_in(v_x,v_Z,t_a),
c_0_6 ).
fof(c_0_11_012,negated_conjecture,
c_in(v_x,v_Y,t_a),
c_0_7 ).
cnf(c_0_12_013,negated_conjecture,
( c_lessequals(X1,v_X,tc_set(t_a))
| ~ c_lessequals(X1,v_Y,tc_set(t_a))
| ~ c_lessequals(X1,v_Z,tc_set(t_a)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13_014,negated_conjecture,
~ c_in(v_x,v_X,t_a),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14_015,negated_conjecture,
c_in(v_x,v_Z,t_a),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15_016,negated_conjecture,
c_in(v_x,v_Y,t_a),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16_017,negated_conjecture,
( c_lessequals(X1,v_X,tc_set(t_a))
| ~ c_lessequals(X1,v_Y,tc_set(t_a))
| ~ c_lessequals(X1,v_Z,tc_set(t_a)) ),
c_0_12,
[final] ).
cnf(c_0_17_018,negated_conjecture,
~ c_in(v_x,v_X,t_a),
c_0_13,
[final] ).
cnf(c_0_18_019,negated_conjecture,
c_in(v_x,v_Z,t_a),
c_0_14,
[final] ).
cnf(c_0_19_020,negated_conjecture,
c_in(v_x,v_Y,t_a),
c_0_15,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_14,negated_conjecture,
( c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a))
| ~ c_lessequals(X0,v_Z,tc_set(t_a)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_16) ).
cnf(c_23,negated_conjecture,
( c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a))
| ~ c_lessequals(X0,v_Z,tc_set(t_a)) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_39,negated_conjecture,
( c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a))
| ~ c_lessequals(X0,v_Z,tc_set(t_a)) ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_46,negated_conjecture,
( c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a))
| ~ c_lessequals(X0,v_Z,tc_set(t_a)) ),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_49,negated_conjecture,
( c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a))
| ~ c_lessequals(X0,v_Z,tc_set(t_a)) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_101,plain,
( c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a))
| ~ c_lessequals(X0,v_Z,tc_set(t_a)) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_3,plain,
( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_25_0) ).
cnf(c_75,plain,
( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_132,plain,
( ~ c_in(c_Main_OsubsetI__1(X0,v_Z,t_a),v_Z,t_a)
| c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_101,c_75]) ).
cnf(c_133,plain,
( ~ c_in(c_Main_OsubsetI__1(X0,v_Z,t_a),v_Z,t_a)
| c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a)) ),
inference(rewriting,[status(thm)],[c_132]) ).
cnf(c_7,plain,
( ~ c_in(X0,c_inter(X1,X2,X3),X3)
| c_in(X0,X1,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_27_0) ).
cnf(c_83,plain,
( ~ c_in(X0,c_inter(X1,X2,X3),X3)
| c_in(X0,X1,X3) ),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_215,plain,
( ~ c_in(c_Main_OsubsetI__1(X0,v_Z,t_a),c_inter(v_Z,X1,t_a),t_a)
| c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_133,c_83]) ).
cnf(c_216,plain,
( ~ c_in(c_Main_OsubsetI__1(X0,v_Z,t_a),c_inter(v_Z,X1,t_a),t_a)
| c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a)) ),
inference(rewriting,[status(thm)],[c_215]) ).
cnf(c_12,plain,
( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_29_0) ).
cnf(c_93,plain,
( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_131,plain,
( c_in(c_Main_OsubsetI__1(X0,v_Z,t_a),X0,t_a)
| c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_101,c_93]) ).
cnf(c_134,plain,
( c_in(c_Main_OsubsetI__1(X0,v_Z,t_a),X0,t_a)
| c_lessequals(X0,v_X,tc_set(t_a))
| ~ c_lessequals(X0,v_Y,tc_set(t_a)) ),
inference(rewriting,[status(thm)],[c_131]) ).
cnf(c_455,plain,
( c_lessequals(c_inter(v_Z,X0,t_a),v_X,tc_set(t_a))
| ~ c_lessequals(c_inter(v_Z,X0,t_a),v_Y,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_216,c_134]) ).
cnf(c_456,plain,
( c_lessequals(c_inter(v_Z,X0,t_a),v_X,tc_set(t_a))
| ~ c_lessequals(c_inter(v_Z,X0,t_a),v_Y,tc_set(t_a)) ),
inference(rewriting,[status(thm)],[c_455]) ).
cnf(c_462,plain,
( ~ c_in(c_Main_OsubsetI__1(c_inter(v_Z,X0,t_a),v_Y,t_a),v_Y,t_a)
| c_lessequals(c_inter(v_Z,X0,t_a),v_X,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_456,c_75]) ).
cnf(c_463,plain,
( ~ c_in(c_Main_OsubsetI__1(c_inter(v_Z,X0,t_a),v_Y,t_a),v_Y,t_a)
| c_lessequals(c_inter(v_Z,X0,t_a),v_X,tc_set(t_a)) ),
inference(rewriting,[status(thm)],[c_462]) ).
cnf(c_5,plain,
( ~ c_in(X0,c_inter(X1,X2,X3),X3)
| c_in(X0,X2,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_26_0) ).
cnf(c_79,plain,
( ~ c_in(X0,c_inter(X1,X2,X3),X3)
| c_in(X0,X2,X3) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_1107,plain,
( ~ c_in(c_Main_OsubsetI__1(c_inter(v_Z,X0,t_a),v_Y,t_a),c_inter(X1,v_Y,t_a),t_a)
| c_lessequals(c_inter(v_Z,X0,t_a),v_X,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_463,c_79]) ).
cnf(c_1108,plain,
( ~ c_in(c_Main_OsubsetI__1(c_inter(v_Z,X0,t_a),v_Y,t_a),c_inter(X1,v_Y,t_a),t_a)
| c_lessequals(c_inter(v_Z,X0,t_a),v_X,tc_set(t_a)) ),
inference(rewriting,[status(thm)],[c_1107]) ).
cnf(c_461,plain,
( c_in(c_Main_OsubsetI__1(c_inter(v_Z,X0,t_a),v_Y,t_a),c_inter(v_Z,X0,t_a),t_a)
| c_lessequals(c_inter(v_Z,X0,t_a),v_X,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_456,c_93]) ).
cnf(c_464,plain,
( c_in(c_Main_OsubsetI__1(c_inter(v_Z,X0,t_a),v_Y,t_a),c_inter(v_Z,X0,t_a),t_a)
| c_lessequals(c_inter(v_Z,X0,t_a),v_X,tc_set(t_a)) ),
inference(rewriting,[status(thm)],[c_461]) ).
cnf(c_5151,plain,
c_lessequals(c_inter(v_Z,v_Y,t_a),v_X,tc_set(t_a)),
inference(resolution,[status(thm)],[c_1108,c_464]) ).
cnf(c_5152,plain,
c_lessequals(c_inter(v_Z,v_Y,t_a),v_X,tc_set(t_a)),
inference(rewriting,[status(thm)],[c_5151]) ).
cnf(c_17,negated_conjecture,
c_in(v_x,v_Y,t_a),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_19) ).
cnf(c_29,negated_conjecture,
c_in(v_x,v_Y,t_a),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_42,negated_conjecture,
c_in(v_x,v_Y,t_a),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_43,negated_conjecture,
c_in(v_x,v_Y,t_a),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_48,negated_conjecture,
c_in(v_x,v_Y,t_a),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_99,plain,
c_in(v_x,v_Y,t_a),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_2,plain,
( c_in(X0,c_inter(X1,X2,X3),X3)
| ~ c_in(X0,X1,X3)
| ~ c_in(X0,X2,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_24_2) ).
cnf(c_73,plain,
( c_in(X0,c_inter(X1,X2,X3),X3)
| ~ c_in(X0,X1,X3)
| ~ c_in(X0,X2,X3) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_113,plain,
( c_in(v_x,c_inter(X0,v_Y,t_a),t_a)
| ~ c_in(v_x,X0,t_a) ),
inference(resolution,[status(thm)],[c_99,c_73]) ).
cnf(c_114,plain,
( c_in(v_x,c_inter(X0,v_Y,t_a),t_a)
| ~ c_in(v_x,X0,t_a) ),
inference(rewriting,[status(thm)],[c_113]) ).
cnf(c_11,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_c8f193.p',c_0_28_2) ).
cnf(c_91,plain,
( c_in(X0,X1,X2)
| ~ c_lessequals(X3,X1,tc_set(X2))
| ~ c_in(X0,X3,X2) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_92,plain,
( c_in(X0,X1,X2)
| ~ c_in(X0,X3,X2)
| ~ c_lessequals(X3,X1,tc_set(X2)) ),
inference(rewriting,[status(thm)],[c_91]) ).
cnf(c_195,plain,
( ~ c_in(v_x,X0,t_a)
| c_in(v_x,X1,t_a)
| ~ c_lessequals(c_inter(X0,v_Y,t_a),X1,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_114,c_92]) ).
cnf(c_196,plain,
( ~ c_in(v_x,X0,t_a)
| c_in(v_x,X1,t_a)
| ~ c_lessequals(c_inter(X0,v_Y,t_a),X1,tc_set(t_a)) ),
inference(rewriting,[status(thm)],[c_195]) ).
cnf(c_5167,plain,
( c_in(v_x,v_X,t_a)
| ~ c_in(v_x,v_Z,t_a) ),
inference(resolution,[status(thm)],[c_5152,c_196]) ).
cnf(c_5168,plain,
( c_in(v_x,v_X,t_a)
| ~ c_in(v_x,v_Z,t_a) ),
inference(rewriting,[status(thm)],[c_5167]) ).
cnf(c_16,negated_conjecture,
c_in(v_x,v_Z,t_a),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_18) ).
cnf(c_27,negated_conjecture,
c_in(v_x,v_Z,t_a),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_41,negated_conjecture,
c_in(v_x,v_Z,t_a),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_44,negated_conjecture,
c_in(v_x,v_Z,t_a),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_47,negated_conjecture,
c_in(v_x,v_Z,t_a),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_97,plain,
c_in(v_x,v_Z,t_a),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_15,negated_conjecture,
~ c_in(v_x,v_X,t_a),
file('/export/starexec/sandbox/tmp/iprover_modulo_c8f193.p',c_0_17) ).
cnf(c_25,negated_conjecture,
~ c_in(v_x,v_X,t_a),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_40,negated_conjecture,
~ c_in(v_x,v_X,t_a),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_45,negated_conjecture,
~ c_in(v_x,v_X,t_a),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_50,negated_conjecture,
~ c_in(v_x,v_X,t_a),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_103,plain,
~ c_in(v_x,v_X,t_a),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_5205,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5168,c_97,c_103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET830-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 05:19:07 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.20/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.39 % Orientation found
% 0.20/0.39 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0880cf.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_c8f193.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_91aaca | grep -v "SZS"
% 0.20/0.41
% 0.20/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ iProver source info
% 0.20/0.41
% 0.20/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.41 % git: non_committed_changes: true
% 0.20/0.41 % git: last_make_outside_of_git: true
% 0.20/0.41
% 0.20/0.41 %
% 0.20/0.41 % ------ Input Options
% 0.20/0.41
% 0.20/0.41 % --out_options all
% 0.20/0.41 % --tptp_safe_out true
% 0.20/0.41 % --problem_path ""
% 0.20/0.41 % --include_path ""
% 0.20/0.41 % --clausifier .//eprover
% 0.20/0.41 % --clausifier_options --tstp-format
% 0.20/0.41 % --stdin false
% 0.20/0.41 % --dbg_backtrace false
% 0.20/0.41 % --dbg_dump_prop_clauses false
% 0.20/0.41 % --dbg_dump_prop_clauses_file -
% 0.20/0.41 % --dbg_out_stat false
% 0.20/0.41
% 0.20/0.41 % ------ General Options
% 0.20/0.41
% 0.20/0.41 % --fof false
% 0.20/0.41 % --time_out_real 150.
% 0.20/0.41 % --time_out_prep_mult 0.2
% 0.20/0.41 % --time_out_virtual -1.
% 0.20/0.41 % --schedule none
% 0.20/0.41 % --ground_splitting input
% 0.20/0.41 % --splitting_nvd 16
% 0.20/0.41 % --non_eq_to_eq false
% 0.20/0.41 % --prep_gs_sim true
% 0.20/0.41 % --prep_unflatten false
% 0.20/0.41 % --prep_res_sim true
% 0.20/0.41 % --prep_upred true
% 0.20/0.41 % --res_sim_input true
% 0.20/0.41 % --clause_weak_htbl true
% 0.20/0.41 % --gc_record_bc_elim false
% 0.20/0.41 % --symbol_type_check false
% 0.20/0.41 % --clausify_out false
% 0.20/0.41 % --large_theory_mode false
% 0.20/0.41 % --prep_sem_filter none
% 0.20/0.41 % --prep_sem_filter_out false
% 0.20/0.41 % --preprocessed_out false
% 0.20/0.41 % --sub_typing false
% 0.20/0.41 % --brand_transform false
% 0.20/0.41 % --pure_diseq_elim true
% 0.20/0.41 % --min_unsat_core false
% 0.20/0.41 % --pred_elim true
% 0.20/0.41 % --add_important_lit false
% 0.20/0.41 % --soft_assumptions false
% 0.20/0.41 % --reset_solvers false
% 0.20/0.41 % --bc_imp_inh []
% 0.20/0.41 % --conj_cone_tolerance 1.5
% 0.20/0.41 % --prolific_symb_bound 500
% 0.20/0.41 % --lt_threshold 2000
% 0.20/0.41
% 0.20/0.41 % ------ SAT Options
% 0.20/0.41
% 0.20/0.41 % --sat_mode false
% 0.20/0.41 % --sat_fm_restart_options ""
% 0.20/0.41 % --sat_gr_def false
% 0.20/0.41 % --sat_epr_types true
% 0.20/0.41 % --sat_non_cyclic_types false
% 0.20/0.41 % --sat_finite_models false
% 0.20/0.41 % --sat_fm_lemmas false
% 0.20/0.41 % --sat_fm_prep false
% 0.20/0.41 % --sat_fm_uc_incr true
% 0.20/0.41 % --sat_out_model small
% 0.20/0.41 % --sat_out_clauses false
% 0.20/0.41
% 0.20/0.41 % ------ QBF Options
% 0.20/0.41
% 0.20/0.41 % --qbf_mode false
% 0.20/0.41 % --qbf_elim_univ true
% 0.20/0.41 % --qbf_sk_in true
% 0.20/0.41 % --qbf_pred_elim true
% 0.20/0.41 % --qbf_split 32
% 0.20/0.41
% 0.20/0.41 % ------ BMC1 Options
% 0.20/0.41
% 0.20/0.41 % --bmc1_incremental false
% 0.20/0.41 % --bmc1_axioms reachable_all
% 0.20/0.41 % --bmc1_min_bound 0
% 0.20/0.41 % --bmc1_max_bound -1
% 0.20/0.41 % --bmc1_max_bound_default -1
% 0.20/0.41 % --bmc1_symbol_reachability true
% 0.20/0.41 % --bmc1_property_lemmas false
% 0.20/0.41 % --bmc1_k_induction false
% 0.20/0.41 % --bmc1_non_equiv_states false
% 0.20/0.41 % --bmc1_deadlock false
% 0.20/0.41 % --bmc1_ucm false
% 0.20/0.41 % --bmc1_add_unsat_core none
% 0.20/0.41 % --bmc1_unsat_core_children false
% 0.20/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.41 % --bmc1_out_stat full
% 0.20/0.41 % --bmc1_ground_init false
% 0.20/0.41 % --bmc1_pre_inst_next_state false
% 0.20/0.41 % --bmc1_pre_inst_state false
% 0.20/0.41 % --bmc1_pre_inst_reach_state false
% 0.20/0.41 % --bmc1_out_unsat_core false
% 0.20/0.41 % --bmc1_aig_witness_out false
% 0.20/0.41 % --bmc1_verbose false
% 0.20/0.41 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0880cf.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ 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.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn false
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 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.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.56 % --inst_prop_sim_new false
% 0.20/0.56 % --inst_orphan_elimination true
% 0.20/0.56 % --inst_learning_loop_flag true
% 0.20/0.56 % --inst_learning_start 3000
% 0.20/0.56 % --inst_learning_factor 2
% 0.20/0.56 % --inst_start_prop_sim_after_learn 3
% 0.20/0.56 % --inst_sel_renew solver
% 0.20/0.56 % --inst_lit_activity_flag true
% 0.20/0.56 % --inst_out_proof true
% 0.20/0.56
% 0.20/0.56 % ------ Resolution Options
% 0.20/0.56
% 0.20/0.56 % --resolution_flag true
% 0.20/0.56 % --res_lit_sel kbo_max
% 0.20/0.56 % --res_to_prop_solver none
% 0.20/0.56 % --res_prop_simpl_new false
% 0.20/0.56 % --res_prop_simpl_given false
% 0.20/0.56 % --res_passive_queue_type priority_queues
% 0.20/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.56 % --res_passive_queues_freq [15;5]
% 0.20/0.56 % --res_forward_subs full
% 0.20/0.56 % --res_backward_subs full
% 0.20/0.56 % --res_forward_subs_resolution true
% 0.20/0.56 % --res_backward_subs_resolution true
% 0.20/0.56 % --res_orphan_elimination false
% 0.20/0.56 % --res_time_limit 1000.
% 0.20/0.56 % --res_out_proof true
% 0.20/0.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_0880cf.s
% 0.20/0.56 % --modulo true
% 0.20/0.56
% 0.20/0.56 % ------ Combination Options
% 0.20/0.56
% 0.20/0.56 % --comb_res_mult 1000
% 0.20/0.56 % --comb_inst_mult 300
% 0.20/0.56 % ------
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 % ------ Proving...
% 0.20/0.56 %
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 % Resolution empty clause
% 0.20/0.56
% 0.20/0.56 % ------ Statistics
% 0.20/0.56
% 0.20/0.56 % ------ General
% 0.20/0.56
% 0.20/0.56 % num_of_input_clauses: 18
% 0.20/0.56 % num_of_input_neg_conjectures: 4
% 0.20/0.56 % num_of_splits: 0
% 0.20/0.56 % num_of_split_atoms: 0
% 0.20/0.56 % num_of_sem_filtered_clauses: 0
% 0.20/0.56 % num_of_subtypes: 0
% 0.20/0.56 % monotx_restored_types: 0
% 0.20/0.56 % sat_num_of_epr_types: 0
% 0.20/0.56 % sat_num_of_non_cyclic_types: 0
% 0.20/0.56 % sat_guarded_non_collapsed_types: 0
% 0.20/0.56 % is_epr: 0
% 0.20/0.56 % is_horn: 0
% 0.20/0.56 % has_eq: 0
% 0.20/0.56 % num_pure_diseq_elim: 0
% 0.20/0.56 % simp_replaced_by: 0
% 0.20/0.56 % res_preprocessed: 8
% 0.20/0.56 % prep_upred: 0
% 0.20/0.56 % prep_unflattend: 0
% 0.20/0.56 % pred_elim_cands: 0
% 0.20/0.56 % pred_elim: 0
% 0.20/0.56 % pred_elim_cl: 0
% 0.20/0.56 % pred_elim_cycles: 0
% 0.20/0.56 % forced_gc_time: 0
% 0.20/0.56 % gc_basic_clause_elim: 0
% 0.20/0.56 % parsing_time: 0.
% 0.20/0.56 % sem_filter_time: 0.
% 0.20/0.56 % pred_elim_time: 0.
% 0.20/0.56 % out_proof_time: 0.001
% 0.20/0.56 % monotx_time: 0.
% 0.20/0.56 % subtype_inf_time: 0.
% 0.20/0.56 % unif_index_cands_time: 0.001
% 0.20/0.56 % unif_index_add_time: 0.
% 0.20/0.56 % total_time: 0.163
% 0.20/0.56 % num_of_symbols: 35
% 0.20/0.56 % num_of_terms: 2916
% 0.20/0.56
% 0.20/0.56 % ------ Propositional Solver
% 0.20/0.56
% 0.20/0.56 % prop_solver_calls: 1
% 0.20/0.56 % prop_fast_solver_calls: 18
% 0.20/0.56 % prop_num_of_clauses: 19
% 0.20/0.56 % prop_preprocess_simplified: 87
% 0.20/0.56 % prop_fo_subsumed: 0
% 0.20/0.56 % prop_solver_time: 0.
% 0.20/0.56 % prop_fast_solver_time: 0.
% 0.20/0.56 % prop_unsat_core_time: 0.
% 0.20/0.56
% 0.20/0.56 % ------ QBF
% 0.20/0.56
% 0.20/0.56 % qbf_q_res: 0
% 0.20/0.56 % qbf_num_tautologies: 0
% 0.20/0.56 % qbf_prep_cycles: 0
% 0.20/0.56
% 0.20/0.56 % ------ BMC1
% 0.20/0.56
% 0.20/0.56 % bmc1_current_bound: -1
% 0.20/0.56 % bmc1_last_solved_bound: -1
% 0.20/0.56 % bmc1_unsat_core_size: -1
% 0.20/0.56 % bmc1_unsat_core_parents_size: -1
% 0.20/0.56 % bmc1_merge_next_fun: 0
% 0.20/0.56 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.56
% 0.20/0.56 % ------ Instantiation
% 0.20/0.56
% 0.20/0.56 % inst_num_of_clauses: 18
% 0.20/0.56 % inst_num_in_passive: 0
% 0.20/0.56 % inst_num_in_active: 0
% 0.20/0.56 % inst_num_in_unprocessed: 18
% 0.20/0.56 % inst_num_of_loops: 0
% 0.20/0.56 % inst_num_of_learning_restarts: 0
% 0.20/0.56 % inst_num_moves_active_passive: 0
% 0.20/0.56 % inst_lit_activity: 0
% 0.20/0.56 % inst_lit_activity_moves: 0
% 0.20/0.56 % inst_num_tautologies: 0
% 0.20/0.56 % inst_num_prop_implied: 0
% 0.20/0.56 % inst_num_existing_simplified: 0
% 0.20/0.56 % inst_num_eq_res_simplified: 0
% 0.20/0.56 % inst_num_child_elim: 0
% 0.20/0.56 % inst_num_of_dismatching_blockings: 0
% 0.20/0.56 % inst_num_of_non_proper_insts: 0
% 0.20/0.56 % inst_num_of_duplicates: 0
% 0.20/0.56 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.56 % inst_dismatching_checking_time: 0.
% 0.20/0.56
% 0.20/0.56 % ------ Resolution
% 0.20/0.56
% 0.20/0.56 % res_num_of_clauses: 1089
% 0.20/0.56 % res_num_in_passive: 782
% 0.20/0.56 % res_num_in_active: 300
% 0.20/0.56 % res_num_of_loops: 353
% 0.20/0.56 % res_forward_subset_subsumed: 671
% 0.20/0.56 % res_backward_subset_subsumed: 4
% 0.20/0.56 % res_forward_subsumed: 58
% 0.20/0.56 % res_backward_subsumed: 0
% 0.20/0.56 % res_forward_subsumption_resolution: 4
% 0.20/0.56 % res_backward_subsumption_resolution: 0
% 0.20/0.56 % res_clause_to_clause_subsumption: 2684
% 0.20/0.56 % res_orphan_elimination: 0
% 0.20/0.56 % res_tautology_del: 50
% 0.20/0.56 % res_num_eq_res_simplified: 0
% 0.20/0.56 % res_num_sel_changes: 0
% 0.20/0.56 % res_moves_from_active_to_pass: 0
% 0.20/0.56
% 0.20/0.56 % Status Unsatisfiable
% 0.20/0.56 % SZS status Unsatisfiable
% 0.20/0.56 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------