%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET625+3 : TPTP v8.1.0. Released v2.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:14:50 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 95 ( 37 unt; 0 def)
% Number of atoms : 186 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 169 ( 78 ~; 71 |; 10 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 142 ( 0 sgn 35 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('<stdin>',subset_defn) ).
fof(c_0_1,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('<stdin>',intersect_defn) ).
fof(c_0_2,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
file('<stdin>',symmetry_of_intersect) ).
fof(c_0_3,axiom,
! [X1] : subset(X1,X1),
file('<stdin>',reflexivity_of_subset) ).
fof(c_0_4,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
c_0_0 ).
fof(c_0_5,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
c_0_1 ).
fof(c_0_6,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
c_0_2 ).
fof(c_0_7,axiom,
! [X1] : subset(X1,X1),
c_0_3 ).
fof(c_0_8,plain,
! [X4,X5,X6,X7,X8] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk2_2(X7,X8),X7)
| subset(X7,X8) )
& ( ~ member(esk2_2(X7,X8),X8)
| subset(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_9,plain,
! [X4,X5,X7,X8,X9] :
( ( member(esk1_2(X4,X5),X4)
| ~ intersect(X4,X5) )
& ( member(esk1_2(X4,X5),X5)
| ~ intersect(X4,X5) )
& ( ~ member(X9,X7)
| ~ member(X9,X8)
| intersect(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ intersect(X3,X4)
| intersect(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_11,plain,
! [X2] : subset(X2,X2),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
c_0_12,
[final] ).
cnf(c_0_21,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
c_0_13,
[final] ).
cnf(c_0_22,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
c_0_14,
[final] ).
cnf(c_0_23,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
c_0_15,
[final] ).
cnf(c_0_24,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
c_0_16,
[final] ).
cnf(c_0_25,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
c_0_17,
[final] ).
cnf(c_0_26,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
c_0_18,
[final] ).
cnf(c_0_27,plain,
subset(X1,X1),
c_0_19,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_20_0,axiom,
( subset(X1,X2)
| ~ member(sk1_esk2_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_20_1,axiom,
( ~ member(sk1_esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_20]) ).
cnf(c_0_21_0,axiom,
( member(sk1_esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_1,axiom,
( ~ intersect(X1,X2)
| member(sk1_esk1_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_22_0,axiom,
( member(sk1_esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_1,axiom,
( ~ intersect(X1,X2)
| member(sk1_esk1_2(X1,X2),X2) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_23_0,axiom,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_1,axiom,
( ~ member(X1,X3)
| member(X1,X2)
| ~ subset(X3,X2) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_2,axiom,
( ~ subset(X3,X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_24_0,axiom,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( ~ member(X3,X2)
| intersect(X1,X2)
| ~ member(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_2,axiom,
( ~ member(X3,X1)
| ~ member(X3,X2)
| intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_25_0,axiom,
( subset(X1,X2)
| member(sk1_esk2_2(X1,X2),X1) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_1,axiom,
( member(sk1_esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_26_0,axiom,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_1,axiom,
( ~ intersect(X2,X1)
| intersect(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_27_0,axiom,
subset(X1,X1),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2,X3] :
( ( intersect(X1,X2)
& subset(X2,X3) )
=> intersect(X1,X3) ),
file('<stdin>',prove_th101) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2,X3] :
( ( intersect(X1,X2)
& subset(X2,X3) )
=> intersect(X1,X3) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( intersect(esk1_0,esk2_0)
& subset(esk2_0,esk3_0)
& ~ intersect(esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3_004,negated_conjecture,
~ intersect(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
intersect(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
subset(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
~ intersect(esk1_0,esk3_0),
c_0_3,
[final] ).
cnf(c_0_7_008,negated_conjecture,
intersect(esk1_0,esk2_0),
c_0_4,
[final] ).
cnf(c_0_8_009,negated_conjecture,
subset(esk2_0,esk3_0),
c_0_5,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_18,negated_conjecture,
intersect(sk2_esk1_0,sk2_esk2_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p',c_0_7) ).
cnf(c_27,negated_conjecture,
intersect(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_38,negated_conjecture,
intersect(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_41,negated_conjecture,
intersect(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_44,negated_conjecture,
intersect(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_102,negated_conjecture,
intersect(sk2_esk1_0,sk2_esk2_0),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_13,plain,
( member(sk1_esk1_2(X0,X1),X0)
| ~ intersect(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p',c_0_21_1) ).
cnf(c_92,plain,
( member(sk1_esk1_2(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_93,plain,
( ~ intersect(X0,X1)
| member(sk1_esk1_2(X0,X1),X0) ),
inference(rewriting,[status(thm)],[c_92]) ).
cnf(c_110,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),
inference(resolution,[status(thm)],[c_102,c_93]) ).
cnf(c_113,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk1_0),
inference(rewriting,[status(thm)],[c_110]) ).
cnf(c_5,plain,
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p',c_0_24_2) ).
cnf(c_76,plain,
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_142,plain,
( intersect(sk2_esk1_0,X0)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),X0) ),
inference(resolution,[status(thm)],[c_113,c_76]) ).
cnf(c_143,plain,
( intersect(sk2_esk1_0,X0)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),X0) ),
inference(rewriting,[status(thm)],[c_142]) ).
cnf(c_10,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p',c_0_23_0) ).
cnf(c_86,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_180,plain,
( ~ subset(X0,X1)
| intersect(sk2_esk1_0,X1)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),X0) ),
inference(resolution,[status(thm)],[c_143,c_86]) ).
cnf(c_181,plain,
( ~ subset(X0,X1)
| intersect(sk2_esk1_0,X1)
| ~ member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),X0) ),
inference(rewriting,[status(thm)],[c_180]) ).
cnf(c_11,plain,
( member(sk1_esk1_2(X0,X1),X1)
| ~ intersect(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p',c_0_22_1) ).
cnf(c_88,plain,
( member(sk1_esk1_2(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_89,plain,
( ~ intersect(X0,X1)
| member(sk1_esk1_2(X0,X1),X1) ),
inference(rewriting,[status(thm)],[c_88]) ).
cnf(c_111,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk2_0),
inference(resolution,[status(thm)],[c_102,c_89]) ).
cnf(c_112,plain,
member(sk1_esk1_2(sk2_esk1_0,sk2_esk2_0),sk2_esk2_0),
inference(rewriting,[status(thm)],[c_111]) ).
cnf(c_236,plain,
( ~ subset(sk2_esk2_0,X0)
| intersect(sk2_esk1_0,X0) ),
inference(resolution,[status(thm)],[c_181,c_112]) ).
cnf(c_237,plain,
( ~ subset(sk2_esk2_0,X0)
| intersect(sk2_esk1_0,X0) ),
inference(rewriting,[status(thm)],[c_236]) ).
cnf(c_17,negated_conjecture,
~ intersect(sk2_esk1_0,sk2_esk3_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p',c_0_6) ).
cnf(c_25,negated_conjecture,
~ intersect(sk2_esk1_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_37,negated_conjecture,
~ intersect(sk2_esk1_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_42,negated_conjecture,
~ intersect(sk2_esk1_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_43,negated_conjecture,
~ intersect(sk2_esk1_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_100,negated_conjecture,
~ intersect(sk2_esk1_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_282,plain,
~ subset(sk2_esk2_0,sk2_esk3_0),
inference(resolution,[status(thm)],[c_237,c_100]) ).
cnf(c_283,plain,
~ subset(sk2_esk2_0,sk2_esk3_0),
inference(rewriting,[status(thm)],[c_282]) ).
cnf(c_19,negated_conjecture,
subset(sk2_esk2_0,sk2_esk3_0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p',c_0_8) ).
cnf(c_29,negated_conjecture,
subset(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_39,negated_conjecture,
subset(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_40,negated_conjecture,
subset(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_45,negated_conjecture,
subset(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_104,negated_conjecture,
subset(sk2_esk2_0,sk2_esk3_0),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_285,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_283,c_104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 11:25:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.42 % FOF problem with conjecture
% 0.20/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_50fc51.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_0a5a40 | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_50fc51.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % ------ Problem Properties
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % EPR false
% 0.20/0.44 % Horn false
% 0.20/0.44 % Has equality false
% 0.20/0.44
% 0.20/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % % ------ Current options:
% 0.20/0.44
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_50fc51.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % warning: shown sat in sat incomplete mode
% 0.20/0.44 %
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 cnf(c_9,negated_conjecture,
% 0.20/0.44 ( intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_7) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_18,negated_conjecture,
% 0.20/0.44 ( intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_29,negated_conjecture,
% 0.20/0.44 ( intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_32,negated_conjecture,
% 0.20/0.44 ( intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_35,negated_conjecture,
% 0.20/0.44 ( intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_32]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_66,negated_conjecture,
% 0.20/0.44 ( intersect(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_35]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_1,plain,
% 0.20/0.44 ( intersect(X0,X1) | ~ intersect(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_32_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_50,plain,
% 0.20/0.44 ( intersect(X0,X1) | ~ intersect(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_74,plain,
% 0.20/0.44 ( intersect(sk3_esk2_0,sk3_esk1_0) ),
% 0.20/0.44 inference(resolution,[status(thm)],[c_66,c_50]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_75,plain,
% 0.20/0.44 ( intersect(sk3_esk2_0,sk3_esk1_0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_74]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_7,plain,
% 0.20/0.44 ( ~ member(sk1_esk2_2(X0,X1),X0) | subset(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_26_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_62,plain,
% 0.20/0.44 ( ~ member(sk1_esk2_2(X0,X1),X0) | subset(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_63,plain,
% 0.20/0.44 ( subset(X0,X1) | ~ member(sk1_esk2_2(X1,X0),X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_62]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_6,plain,
% 0.20/0.44 ( ~ member(X0,X1) | ~ member(X0,X2) | intersect(X1,X2) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_27_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_60,plain,
% 0.20/0.44 ( ~ member(X0,X1) | ~ member(X0,X2) | intersect(X1,X2) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_61,plain,
% 0.20/0.44 ( intersect(X0,X1) | ~ member(X2,X0) | ~ member(X2,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_60]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_5,plain,
% 0.20/0.44 ( member(sk1_esk2_2(X0,X1),X1) | subset(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_28_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_58,plain,
% 0.20/0.44 ( member(sk1_esk2_2(X0,X1),X1) | subset(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_59,plain,
% 0.20/0.44 ( subset(X0,X1) | member(sk1_esk2_2(X1,X0),X0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_58]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_4,plain,
% 0.20/0.44 ( member(sk1_esk1_2(X0,X1),X1) | ~ intersect(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_29_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_56,plain,
% 0.20/0.44 ( member(sk1_esk1_2(X0,X1),X1) | ~ intersect(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_57,plain,
% 0.20/0.44 ( ~ intersect(X0,X1) | member(sk1_esk1_2(X1,X0),X0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_56]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_3,plain,
% 0.20/0.44 ( member(sk1_esk1_2(X0,X1),X0) | ~ intersect(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_30_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_54,plain,
% 0.20/0.44 ( member(sk1_esk1_2(X0,X1),X0) | ~ intersect(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_55,plain,
% 0.20/0.44 ( ~ intersect(X0,X1) | member(sk1_esk1_2(X1,X0),X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_54]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_2,plain,
% 0.20/0.44 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_31_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_52,plain,
% 0.20/0.44 ( ~ member(X0,X1) | member(X0,X2) | ~ subset(X1,X2) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_53,plain,
% 0.20/0.44 ( ~ subset(X0,X1) | ~ member(X2,X0) | member(X2,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_52]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_10,negated_conjecture,
% 0.20/0.44 ( subset(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_8) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_20,negated_conjecture,
% 0.20/0.44 ( subset(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_30,negated_conjecture,
% 0.20/0.44 ( subset(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_31,negated_conjecture,
% 0.20/0.44 ( subset(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_36,negated_conjecture,
% 0.20/0.44 ( subset(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_68,negated_conjecture,
% 0.20/0.44 ( subset(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_8,negated_conjecture,
% 0.20/0.44 ( ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_6) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_16,negated_conjecture,
% 0.20/0.44 ( ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_28,negated_conjecture,
% 0.20/0.44 ( ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_33,negated_conjecture,
% 0.20/0.44 ( ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_34,negated_conjecture,
% 0.20/0.44 ( ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_64,negated_conjecture,
% 0.20/0.44 ( ~ intersect(sk3_esk1_0,sk3_esk3_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_0,plain,
% 0.20/0.44 ( subset(X0,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p', c_0_33_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_48,plain,( subset(X0,X0) ),inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Statistics
% 0.20/0.44
% 0.20/0.44 % ------ General
% 0.20/0.44
% 0.20/0.44 % num_of_input_clauses: 11
% 0.20/0.44 % num_of_input_neg_conjectures: 3
% 0.20/0.44 % num_of_splits: 0
% 0.20/0.44 % num_of_split_atoms: 0
% 0.20/0.44 % num_of_sem_filtered_clauses: 0
% 0.20/0.44 % num_of_subtypes: 0
% 0.20/0.44 % monotx_restored_types: 0
% 0.20/0.44 % sat_num_of_epr_types: 0
% 0.20/0.44 % sat_num_of_non_cyclic_types: 0
% 0.20/0.44 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 0
% 0.20/0.44 % has_eq: 0
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 6
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 0
% 0.20/0.44 % pred_elim: 0
% 0.20/0.44 % pred_elim_cl: 0
% 0.20/0.44 % pred_elim_cycles: 0
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.
% 0.20/0.44 % out_proof_time: 0.
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.013
% 0.20/0.44 % num_of_symbols: 33
% 0.20/0.44 % num_of_terms: 83
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 1
% 0.20/0.44 % prop_fast_solver_calls: 9
% 0.20/0.44 % prop_num_of_clauses: 16
% 0.20/0.44 % prop_preprocess_simplified: 46
% 0.20/0.44 % prop_fo_subsumed: 0
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: 11
% 0.20/0.44 % inst_num_in_passive: 0
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 11
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: 18
% 0.20/0.44 % res_num_in_passive: 0
% 0.20/0.44 % res_num_in_active: 12
% 0.20/0.44 % res_num_of_loops: 11
% 0.20/0.44 % res_forward_subset_subsumed: 1
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 6
% 0.20/0.44 % res_backward_subsumed: 0
% 0.20/0.44 % res_forward_subsumption_resolution: 0
% 0.20/0.44 % res_backward_subsumption_resolution: 0
% 0.20/0.44 % res_clause_to_clause_subsumption: 11
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 0
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unknown
% 0.20/0.48 % Orienting using strategy ClausalAll
% 0.20/0.48 % FOF problem with conjecture
% 0.20/0.48 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_50fc51.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c5ad67.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_de18b8 | grep -v "SZS"
% 0.20/0.51
% 0.20/0.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % ------ iProver source info
% 0.20/0.51
% 0.20/0.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.51 % git: non_committed_changes: true
% 0.20/0.51 % git: last_make_outside_of_git: true
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 0.20/0.51 % --inst_prop_sim_new false
% 0.20/0.51 % --inst_orphan_elimination true
% 0.20/0.51 % --inst_learning_loop_flag true
% 0.20/0.51 % --inst_learning_start 3000
% 0.20/0.51 % --inst_learning_factor 2
% 0.20/0.51 % --inst_start_prop_sim_after_learn 3
% 0.20/0.51 % --inst_sel_renew solver
% 0.20/0.51 % --inst_lit_activity_flag true
% 0.20/0.51 % --inst_out_proof true
% 0.20/0.51
% 0.20/0.51 % ------ Resolution Options
% 0.20/0.51
% 0.20/0.51 % --resolution_flag true
% 0.20/0.51 % --res_lit_sel kbo_max
% 0.20/0.51 % --res_to_prop_solver none
% 0.20/0.51 % --res_prop_simpl_new false
% 0.20/0.51 % --res_prop_simpl_given false
% 0.20/0.51 % --res_passive_queue_type priority_queues
% 0.20/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.51 % --res_passive_queues_freq [15;5]
% 0.20/0.51 % --res_forward_subs full
% 0.20/0.51 % --res_backward_subs full
% 0.20/0.51 % --res_forward_subs_resolution true
% 0.20/0.51 % --res_backward_subs_resolution true
% 0.20/0.51 % --res_orphan_elimination false
% 0.20/0.51 % --res_time_limit 1000.
% 0.20/0.51 % --res_out_proof true
% 0.20/0.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_50fc51.s
% 0.20/0.51 % --modulo true
% 0.20/0.51
% 0.20/0.51 % ------ Combination Options
% 0.20/0.51
% 0.20/0.51 % --comb_res_mult 1000
% 0.20/0.51 % --comb_inst_mult 300
% 0.20/0.51 % ------
% 0.20/0.51
% 0.20/0.51 % ------ Parsing...% successful
% 0.20/0.51
% 0.20/0.51 % ------ 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.51
% 0.20/0.51 % ------ Proving...
% 0.20/0.51 % ------ Problem Properties
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % EPR false
% 0.20/0.51 % Horn false
% 0.20/0.51 % Has equality false
% 0.20/0.51
% 0.20/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % % ------ Current options:
% 0.20/0.51
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 0.20/0.52 % --inst_prop_sim_new false
% 0.20/0.52 % --inst_orphan_elimination true
% 0.20/0.52 % --inst_learning_loop_flag true
% 0.20/0.52 % --inst_learning_start 3000
% 0.20/0.52 % --inst_learning_factor 2
% 0.20/0.52 % --inst_start_prop_sim_after_learn 3
% 0.20/0.52 % --inst_sel_renew solver
% 0.20/0.52 % --inst_lit_activity_flag true
% 0.20/0.52 % --inst_out_proof true
% 0.20/0.52
% 0.20/0.52 % ------ Resolution Options
% 0.20/0.52
% 0.20/0.52 % --resolution_flag true
% 0.20/0.52 % --res_lit_sel kbo_max
% 0.20/0.52 % --res_to_prop_solver none
% 0.20/0.52 % --res_prop_simpl_new false
% 0.20/0.52 % --res_prop_simpl_given false
% 0.20/0.52 % --res_passive_queue_type priority_queues
% 0.20/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.52 % --res_passive_queues_freq [15;5]
% 0.20/0.52 % --res_forward_subs full
% 0.20/0.52 % --res_backward_subs full
% 0.20/0.52 % --res_forward_subs_resolution true
% 0.20/0.52 % --res_backward_subs_resolution true
% 0.20/0.52 % --res_orphan_elimination false
% 0.20/0.52 % --res_time_limit 1000.
% 0.20/0.52 % --res_out_proof true
% 0.20/0.52 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_50fc51.s
% 0.20/0.52 % --modulo true
% 0.20/0.52
% 0.20/0.52 % ------ Combination Options
% 0.20/0.52
% 0.20/0.52 % --comb_res_mult 1000
% 0.20/0.52 % --comb_inst_mult 300
% 0.20/0.52 % ------
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 % ------ Proving...
% 0.20/0.52 %
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 % Resolution empty clause
% 0.20/0.52
% 0.20/0.52 % ------ Statistics
% 0.20/0.52
% 0.20/0.52 % ------ General
% 0.20/0.52
% 0.20/0.52 % num_of_input_clauses: 20
% 0.20/0.52 % num_of_input_neg_conjectures: 3
% 0.20/0.52 % num_of_splits: 0
% 0.20/0.52 % num_of_split_atoms: 0
% 0.20/0.52 % num_of_sem_filtered_clauses: 0
% 0.20/0.52 % num_of_subtypes: 0
% 0.20/0.52 % monotx_restored_types: 0
% 0.20/0.52 % sat_num_of_epr_types: 0
% 0.20/0.52 % sat_num_of_non_cyclic_types: 0
% 0.20/0.52 % sat_guarded_non_collapsed_types: 0
% 0.20/0.52 % is_epr: 0
% 0.20/0.52 % is_horn: 0
% 0.20/0.52 % has_eq: 0
% 0.20/0.52 % num_pure_diseq_elim: 0
% 0.20/0.52 % simp_replaced_by: 0
% 0.20/0.52 % res_preprocessed: 6
% 0.20/0.52 % prep_upred: 0
% 0.20/0.52 % prep_unflattend: 0
% 0.20/0.52 % pred_elim_cands: 0
% 0.20/0.52 % pred_elim: 0
% 0.20/0.52 % pred_elim_cl: 0
% 0.20/0.52 % pred_elim_cycles: 0
% 0.20/0.52 % forced_gc_time: 0
% 0.20/0.52 % gc_basic_clause_elim: 0
% 0.20/0.52 % parsing_time: 0.
% 0.20/0.52 % sem_filter_time: 0.
% 0.20/0.52 % pred_elim_time: 0.
% 0.20/0.52 % out_proof_time: 0.001
% 0.20/0.52 % monotx_time: 0.
% 0.20/0.52 % subtype_inf_time: 0.
% 0.20/0.52 % unif_index_cands_time: 0.
% 0.20/0.52 % unif_index_add_time: 0.
% 0.20/0.52 % total_time: 0.025
% 0.20/0.52 % num_of_symbols: 33
% 0.20/0.52 % num_of_terms: 122
% 0.20/0.52
% 0.20/0.52 % ------ Propositional Solver
% 0.20/0.52
% 0.20/0.52 % prop_solver_calls: 1
% 0.20/0.52 % prop_fast_solver_calls: 9
% 0.20/0.52 % prop_num_of_clauses: 19
% 0.20/0.52 % prop_preprocess_simplified: 79
% 0.20/0.52 % prop_fo_subsumed: 0
% 0.20/0.52 % prop_solver_time: 0.
% 0.20/0.52 % prop_fast_solver_time: 0.
% 0.20/0.52 % prop_unsat_core_time: 0.
% 0.20/0.52
% 0.20/0.52 % ------ QBF
% 0.20/0.52
% 0.20/0.52 % qbf_q_res: 0
% 0.20/0.52 % qbf_num_tautologies: 0
% 0.20/0.52 % qbf_prep_cycles: 0
% 0.20/0.52
% 0.20/0.52 % ------ BMC1
% 0.20/0.52
% 0.20/0.52 % bmc1_current_bound: -1
% 0.20/0.52 % bmc1_last_solved_bound: -1
% 0.20/0.52 % bmc1_unsat_core_size: -1
% 0.20/0.52 % bmc1_unsat_core_parents_size: -1
% 0.20/0.52 % bmc1_merge_next_fun: 0
% 0.20/0.52 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation
% 0.20/0.52
% 0.20/0.52 % inst_num_of_clauses: 20
% 0.20/0.52 % inst_num_in_passive: 0
% 0.20/0.52 % inst_num_in_active: 0
% 0.20/0.52 % inst_num_in_unprocessed: 20
% 0.20/0.52 % inst_num_of_loops: 0
% 0.20/0.52 % inst_num_of_learning_restarts: 0
% 0.20/0.52 % inst_num_moves_active_passive: 0
% 0.20/0.52 % inst_lit_activity: 0
% 0.20/0.52 % inst_lit_activity_moves: 0
% 0.20/0.52 % inst_num_tautologies: 0
% 0.20/0.52 % inst_num_prop_implied: 0
% 0.20/0.52 % inst_num_existing_simplified: 0
% 0.20/0.52 % inst_num_eq_res_simplified: 0
% 0.20/0.52 % inst_num_child_elim: 0
% 0.20/0.52 % inst_num_of_dismatching_blockings: 0
% 0.20/0.52 % inst_num_of_non_proper_insts: 0
% 0.20/0.52 % inst_num_of_duplicates: 0
% 0.20/0.52 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.52 % inst_dismatching_checking_time: 0.
% 0.20/0.52
% 0.20/0.52 % ------ Resolution
% 0.20/0.52
% 0.20/0.52 % res_num_of_clauses: 61
% 0.20/0.52 % res_num_in_passive: 20
% 0.20/0.52 % res_num_in_active: 33
% 0.20/0.52 % res_num_of_loops: 26
% 0.20/0.52 % res_forward_subset_subsumed: 18
% 0.20/0.52 % res_backward_subset_subsumed: 0
% 0.20/0.52 % res_forward_subsumed: 3
% 0.20/0.52 % res_backward_subsumed: 0
% 0.20/0.52 % res_forward_subsumption_resolution: 1
% 0.20/0.52 % res_backward_subsumption_resolution: 0
% 0.20/0.52 % res_clause_to_clause_subsumption: 51
% 0.20/0.52 % res_orphan_elimination: 0
% 0.20/0.52 % res_tautology_del: 0
% 0.20/0.52 % res_num_eq_res_simplified: 0
% 0.20/0.52 % res_num_sel_changes: 0
% 0.20/0.52 % res_moves_from_active_to_pass: 0
% 0.20/0.52
% 0.20/0.52 % Status Unsatisfiable
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------