TSTP Solution File: SET879+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET879+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n011.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:18:16 EDT 2022
% Result : Theorem 5.98s 6.15s
% Output : CNFRefutation 5.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 80 ( 13 unt; 0 def)
% Number of atoms : 192 ( 110 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 215 ( 103 ~; 97 |; 5 &)
% ( 8 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 131 ( 0 sgn 30 !; 4 ?)
% 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] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('<stdin>',d1_tarski) ).
fof(c_0_1,axiom,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
file('<stdin>',l34_zfmisc_1) ).
fof(c_0_2,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('<stdin>',antisymmetry_r2_hidden) ).
fof(c_0_3,axiom,
? [X1] : ~ empty(X1),
file('<stdin>',rc2_xboole_0) ).
fof(c_0_4,axiom,
? [X1] : empty(X1),
file('<stdin>',rc1_xboole_0) ).
fof(c_0_5,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
c_0_0 ).
fof(c_0_6,plain,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_7,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_8,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_9,axiom,
? [X1] : empty(X1),
c_0_4 ).
fof(c_0_10,plain,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X7 != X4
| in(X7,X5)
| X5 != singleton(X4) )
& ( ~ in(esk1_2(X8,X9),X9)
| esk1_2(X8,X9) != X8
| X9 = singleton(X8) )
& ( in(esk1_2(X8,X9),X9)
| esk1_2(X8,X9) = X8
| X9 = singleton(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_11,plain,
! [X3,X4,X5,X6] :
( ( set_difference(singleton(X3),X4) != singleton(X3)
| ~ in(X3,X4) )
& ( in(X5,X6)
| set_difference(singleton(X5),X6) = singleton(X5) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_13,plain,
~ empty(esk3_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_14,plain,
empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
cnf(c_0_15,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) != X2
| ~ in(esk1_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ in(X1,X2)
| set_difference(singleton(X1),X2) != singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) = X2
| in(esk1_2(X2,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( set_difference(singleton(X1),X2) = singleton(X1)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
~ empty(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) != X2
| ~ in(esk1_2(X2,X1),X1) ),
c_0_15,
[final] ).
cnf(c_0_25,plain,
( ~ in(X1,X2)
| set_difference(singleton(X1),X2) != singleton(X1) ),
c_0_16,
[final] ).
cnf(c_0_26,plain,
( X1 = singleton(X2)
| esk1_2(X2,X1) = X2
| in(esk1_2(X2,X1),X1) ),
c_0_17,
[final] ).
cnf(c_0_27,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
c_0_18,
[final] ).
cnf(c_0_28,plain,
( set_difference(singleton(X1),X2) = singleton(X1)
| in(X1,X2) ),
c_0_19,
[final] ).
cnf(c_0_29,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
c_0_20,
[final] ).
cnf(c_0_30,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
c_0_21,
[final] ).
cnf(c_0_31,plain,
~ empty(esk3_0),
c_0_22,
[final] ).
cnf(c_0_32,plain,
empty(esk2_0),
c_0_23,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_24_0,axiom,
( X1 = singleton(X2)
| sk1_esk1_2(X2,X1) != X2
| ~ in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( sk1_esk1_2(X2,X1) != X2
| X1 = singleton(X2)
| ~ in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_2,axiom,
( ~ in(sk1_esk1_2(X2,X1),X1)
| sk1_esk1_2(X2,X1) != X2
| X1 = singleton(X2) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_25_0,axiom,
( ~ in(X1,X2)
| set_difference(singleton(X1),X2) != singleton(X1) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_25_1,axiom,
( set_difference(singleton(X1),X2) != singleton(X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_26_0,axiom,
( X1 = singleton(X2)
| sk1_esk1_2(X2,X1) = X2
| in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_1,axiom,
( sk1_esk1_2(X2,X1) = X2
| X1 = singleton(X2)
| in(sk1_esk1_2(X2,X1),X1) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_26_2,axiom,
( in(sk1_esk1_2(X2,X1),X1)
| sk1_esk1_2(X2,X1) = X2
| X1 = singleton(X2) ),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
cnf(c_0_27_0,axiom,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_27_1,axiom,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_27]) ).
cnf(c_0_28_0,axiom,
( set_difference(singleton(X1),X2) = singleton(X1)
| in(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_28_1,axiom,
( in(X1,X2)
| set_difference(singleton(X1),X2) = singleton(X1) ),
inference(literals_permutation,[status(thm)],[c_0_28]) ).
cnf(c_0_29_0,axiom,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_1,axiom,
( X1 != singleton(X2)
| X3 = X2
| ~ in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_29_2,axiom,
( ~ in(X3,X1)
| X1 != singleton(X2)
| X3 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_29]) ).
cnf(c_0_30_0,axiom,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_1,axiom,
( X1 != singleton(X2)
| in(X3,X1)
| X3 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_30_2,axiom,
( X3 != X2
| X1 != singleton(X2)
| in(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_30]) ).
cnf(c_0_31_0,axiom,
~ empty(sk1_esk3_0),
inference(literals_permutation,[status(thm)],[c_0_31]) ).
cnf(c_0_32_0,axiom,
empty(sk1_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_32]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2] :
( set_difference(singleton(X1),singleton(X2)) = singleton(X1)
<=> X1 != X2 ),
file('<stdin>',t20_zfmisc_1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2] :
( set_difference(singleton(X1),singleton(X2)) = singleton(X1)
<=> X1 != X2 ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( ( set_difference(singleton(esk1_0),singleton(esk2_0)) != singleton(esk1_0)
| esk1_0 = esk2_0 )
& ( set_difference(singleton(esk1_0),singleton(esk2_0)) = singleton(esk1_0)
| esk1_0 != esk2_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,
( esk1_0 = esk2_0
| set_difference(singleton(esk1_0),singleton(esk2_0)) != singleton(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( set_difference(singleton(esk1_0),singleton(esk2_0)) = singleton(esk1_0)
| esk1_0 != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( esk1_0 = esk2_0
| set_difference(singleton(esk1_0),singleton(esk2_0)) != singleton(esk1_0) ),
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
( set_difference(singleton(esk1_0),singleton(esk2_0)) = singleton(esk1_0)
| esk1_0 != esk2_0 ),
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_4,plain,
( X0 != X1
| X2 != singleton(X1)
| in(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p',c_0_30_0) ).
cnf(c_46,plain,
( X0 != X1
| X2 != singleton(X1)
| in(X0,X2) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_28458,plain,
( in(sk2_esk1_0,X0)
| sk2_esk1_0 != sk2_esk2_0
| X0 != singleton(sk2_esk2_0) ),
inference(instantiation,[status(thm)],[c_46]) ).
cnf(c_28958,plain,
( in(sk2_esk1_0,singleton(X0))
| singleton(X0) != singleton(sk2_esk2_0)
| sk2_esk1_0 != sk2_esk2_0 ),
inference(instantiation,[status(thm)],[c_28458]) ).
cnf(c_29753,plain,
( in(sk2_esk1_0,singleton(sk2_esk2_0))
| singleton(sk2_esk2_0) != singleton(sk2_esk2_0)
| sk2_esk1_0 != sk2_esk2_0 ),
inference(instantiation,[status(thm)],[c_28958]) ).
cnf(c_66502,plain,
( in(sk2_esk1_0,singleton(sk2_esk2_0))
| sk2_esk1_0 != sk2_esk2_0 ),
inference(equality_resolution_simp,[status(esa)],[c_29753]) ).
cnf(c_5,plain,
( X0 = X1
| X2 != singleton(X1)
| ~ in(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p',c_0_29_2) ).
cnf(c_47,plain,
( X0 = X1
| X2 != singleton(X1)
| ~ in(X0,X2) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_28375,plain,
( ~ in(sk2_esk1_0,singleton(sk2_esk2_0))
| singleton(sk2_esk2_0) != singleton(X0)
| sk2_esk1_0 = X0 ),
inference(instantiation,[status(thm)],[c_47]) ).
cnf(c_29204,plain,
( ~ in(sk2_esk1_0,singleton(sk2_esk2_0))
| singleton(sk2_esk2_0) != singleton(sk2_esk2_0)
| sk2_esk1_0 = sk2_esk2_0 ),
inference(instantiation,[status(thm)],[c_28375]) ).
cnf(c_29849,plain,
( ~ in(sk2_esk1_0,singleton(sk2_esk2_0))
| sk2_esk1_0 = sk2_esk2_0 ),
inference(equality_resolution_simp,[status(esa)],[c_29204]) ).
cnf(c_16,plain,
( set_difference(singleton(X0),X1) != singleton(X0)
| ~ in(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p',c_0_25_0) ).
cnf(c_58,plain,
( set_difference(singleton(X0),X1) != singleton(X0)
| ~ in(X0,X1) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_28380,plain,
( ~ in(sk2_esk1_0,singleton(sk2_esk2_0))
| set_difference(singleton(sk2_esk1_0),singleton(sk2_esk2_0)) != singleton(sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_8,plain,
( set_difference(singleton(X0),X1) = singleton(X0)
| in(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p',c_0_28_1) ).
cnf(c_50,plain,
( set_difference(singleton(X0),X1) = singleton(X0)
| in(X0,X1) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_28354,plain,
( in(sk2_esk1_0,singleton(sk2_esk2_0))
| set_difference(singleton(sk2_esk1_0),singleton(sk2_esk2_0)) = singleton(sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_20,negated_conjecture,
( set_difference(singleton(sk2_esk1_0),singleton(sk2_esk2_0)) != singleton(sk2_esk1_0)
| sk2_esk1_0 = sk2_esk2_0 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p',c_0_5) ).
cnf(c_21,negated_conjecture,
( set_difference(singleton(sk2_esk1_0),singleton(sk2_esk2_0)) = singleton(sk2_esk1_0)
| sk2_esk1_0 != sk2_esk2_0 ),
file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p',c_0_6) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_66502,c_29849,c_28380,c_28354,c_20,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET879+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 17:24:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e11143.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c4e1c6 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e11143.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality true
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e11143.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % warning: shown sat in sat incomplete mode
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 cnf(c_9,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) != singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_5) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_18,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) != singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_26,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) != singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_29,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) != singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_30,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) != singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_61,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) != singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_7,plain,
% 0.20/0.43 ( in(sk1_esk1_2(X0,X1),X0)
% 0.20/0.43 | sk1_esk1_2(X0,X1) = X1
% 0.20/0.43 | X0 = singleton(X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_23_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_57,plain,
% 0.20/0.43 ( in(sk1_esk1_2(X0,X1),X0)
% 0.20/0.43 | sk1_esk1_2(X0,X1) = X1
% 0.20/0.43 | X0 = singleton(X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_72,plain,
% 0.20/0.43 ( in(sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0),set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)))
% 0.20/0.43 | sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0) = sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_61,c_57]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_73,plain,
% 0.20/0.43 ( in(sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0),set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)))
% 0.20/0.43 | sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0) = sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_72]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_4,plain,
% 0.20/0.43 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_26_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_51,plain,
% 0.20/0.43 ( ~ in(X0,X1) | ~ in(X1,X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_111,plain,
% 0.20/0.43 ( ~ in(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0))
% 0.20/0.43 | sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0) = sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_73,c_51]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_112,plain,
% 0.20/0.43 ( ~ in(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0))
% 0.20/0.43 | sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0) = sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_111]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_2,plain,
% 0.20/0.43 ( in(X0,X1) | set_difference(singleton(X0),X1) = singleton(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_28_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_47,plain,
% 0.20/0.43 ( in(X0,X1) | set_difference(singleton(X0),X1) = singleton(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_69,plain,
% 0.20/0.43 ( in(sk3_esk1_0,singleton(sk3_esk2_0)) | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_61,c_47]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_70,plain,
% 0.20/0.43 ( in(sk3_esk1_0,singleton(sk3_esk2_0)) | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_69]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_91,plain,
% 0.20/0.43 ( ~ in(singleton(sk3_esk2_0),sk3_esk1_0) | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_70,c_51]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_92,plain,
% 0.20/0.43 ( ~ in(singleton(sk3_esk2_0),sk3_esk1_0) | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_91]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_10,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) = singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 != sk3_esk2_0 ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_6) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_20,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) = singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 != sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_27,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) = singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 != sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_28,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) = singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 != sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_31,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) = singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 != sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_63,negated_conjecture,
% 0.20/0.43 ( set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)) = singleton(sk3_esk1_0)
% 0.20/0.43 | sk3_esk1_0 != sk3_esk2_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_6,plain,
% 0.20/0.43 ( ~ in(X0,X1) | X0 = X2 | X1 != singleton(X2) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_24_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_55,plain,
% 0.20/0.43 ( ~ in(X0,X1) | X0 = X2 | X1 != singleton(X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_56,plain,
% 0.20/0.43 ( ~ in(X0,X1) | X1 != singleton(X2) | X0 = X2 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_55]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_83,plain,
% 0.20/0.43 ( ~ in(X0,set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)))
% 0.20/0.43 | sk3_esk1_0 != sk3_esk2_0
% 0.20/0.43 | X0 = sk3_esk1_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_63,c_56]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_84,plain,
% 0.20/0.43 ( ~ in(X0,set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)))
% 0.20/0.43 | sk3_esk1_0 != sk3_esk2_0
% 0.20/0.43 | X0 = sk3_esk1_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_83]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_5,plain,
% 0.20/0.43 ( ~ in(X0,X1) | set_difference(singleton(X0),X1) != singleton(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_25_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_53,plain,
% 0.20/0.43 ( ~ in(X0,X1) | set_difference(singleton(X0),X1) != singleton(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_81,plain,
% 0.20/0.43 ( ~ in(sk3_esk1_0,singleton(sk3_esk2_0)) | sk3_esk1_0 != sk3_esk2_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_63,c_53]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_82,plain,
% 0.20/0.43 ( ~ in(sk3_esk1_0,singleton(sk3_esk2_0)) | sk3_esk1_0 != sk3_esk2_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_81]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_8,plain,
% 0.20/0.43 ( ~ in(sk1_esk1_2(X0,X1),X0)
% 0.20/0.43 | sk1_esk1_2(X0,X1) != X1
% 0.20/0.43 | X0 = singleton(X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_22_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_59,plain,
% 0.20/0.43 ( ~ in(sk1_esk1_2(X0,X1),X0)
% 0.20/0.43 | sk1_esk1_2(X0,X1) != X1
% 0.20/0.43 | X0 = singleton(X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_71,plain,
% 0.20/0.43 ( ~ in(sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0),set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)))
% 0.20/0.43 | sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_61,c_59]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_74,plain,
% 0.20/0.43 ( ~ in(sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0),set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)))
% 0.20/0.43 | sk1_esk1_2(set_difference(singleton(sk3_esk1_0),singleton(sk3_esk2_0)),sk3_esk1_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 = sk3_esk2_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_71]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_3,plain,
% 0.20/0.43 ( X0 != X1 | in(X0,X2) | X2 != singleton(X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_27_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_49,plain,
% 0.20/0.43 ( X0 != X1 | in(X0,X2) | X2 != singleton(X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_50,plain,
% 0.20/0.43 ( in(X0,X1) | X1 != singleton(X2) | X0 != X2 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_49]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_1,plain,
% 0.20/0.43 ( empty(sk2_esk2_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_9_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_45,plain,( empty(sk2_esk2_0) ),inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( ~ empty(sk2_esk1_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p', c_0_8_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_43,plain,( ~ empty(sk2_esk1_0) ),inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 11
% 0.20/0.43 % num_of_input_neg_conjectures: 2
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 1
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 4
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.025
% 0.20/0.43 % num_of_symbols: 34
% 0.20/0.43 % num_of_terms: 90
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 12
% 0.20/0.43 % prop_num_of_clauses: 18
% 0.20/0.43 % prop_preprocess_simplified: 34
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 11
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 11
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 20
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 18
% 0.20/0.44 % res_num_of_loops: 11
% 0.20/0.44 % res_forward_subset_subsumed: 0
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 1
% 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: 10
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 4
% 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.47 % Orienting using strategy ClausalAll
% 0.20/0.47 % FOF problem with conjecture
% 0.20/0.47 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e11143.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b8ac99.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_4e4451 | grep -v "SZS"
% 0.20/0.50
% 0.20/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ iProver source info
% 0.20/0.50
% 0.20/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.50 % git: non_committed_changes: true
% 0.20/0.50 % git: last_make_outside_of_git: true
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.50 % --inst_prop_sim_new false
% 0.20/0.50 % --inst_orphan_elimination true
% 0.20/0.50 % --inst_learning_loop_flag true
% 0.20/0.50 % --inst_learning_start 3000
% 0.20/0.50 % --inst_learning_factor 2
% 0.20/0.50 % --inst_start_prop_sim_after_learn 3
% 0.20/0.50 % --inst_sel_renew solver
% 0.20/0.50 % --inst_lit_activity_flag true
% 0.20/0.50 % --inst_out_proof true
% 0.20/0.50
% 0.20/0.50 % ------ Resolution Options
% 0.20/0.50
% 0.20/0.50 % --resolution_flag true
% 0.20/0.50 % --res_lit_sel kbo_max
% 0.20/0.50 % --res_to_prop_solver none
% 0.20/0.50 % --res_prop_simpl_new false
% 0.20/0.50 % --res_prop_simpl_given false
% 0.20/0.50 % --res_passive_queue_type priority_queues
% 0.20/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.50 % --res_passive_queues_freq [15;5]
% 0.20/0.50 % --res_forward_subs full
% 0.20/0.50 % --res_backward_subs full
% 0.20/0.50 % --res_forward_subs_resolution true
% 0.20/0.50 % --res_backward_subs_resolution true
% 0.20/0.50 % --res_orphan_elimination false
% 0.20/0.50 % --res_time_limit 1000.
% 0.20/0.50 % --res_out_proof true
% 0.20/0.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e11143.s
% 0.20/0.50 % --modulo true
% 0.20/0.50
% 0.20/0.50 % ------ Combination Options
% 0.20/0.50
% 0.20/0.50 % --comb_res_mult 1000
% 0.20/0.50 % --comb_inst_mult 300
% 0.20/0.50 % ------
% 0.20/0.50
% 0.20/0.50 % ------ Parsing...% successful
% 0.20/0.50
% 0.20/0.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.50
% 0.20/0.50 % ------ Proving...
% 0.20/0.50 % ------ Problem Properties
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % EPR false
% 0.20/0.50 % Horn false
% 0.20/0.50 % Has equality true
% 0.20/0.50
% 0.20/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 % % ------ Current options:
% 0.20/0.50
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 5.98/6.15 % --inst_prop_sim_new false
% 5.98/6.15 % --inst_orphan_elimination true
% 5.98/6.15 % --inst_learning_loop_flag true
% 5.98/6.15 % --inst_learning_start 3000
% 5.98/6.15 % --inst_learning_factor 2
% 5.98/6.15 % --inst_start_prop_sim_after_learn 3
% 5.98/6.15 % --inst_sel_renew solver
% 5.98/6.15 % --inst_lit_activity_flag true
% 5.98/6.15 % --inst_out_proof true
% 5.98/6.15
% 5.98/6.15 % ------ Resolution Options
% 5.98/6.15
% 5.98/6.15 % --resolution_flag true
% 5.98/6.15 % --res_lit_sel kbo_max
% 5.98/6.15 % --res_to_prop_solver none
% 5.98/6.15 % --res_prop_simpl_new false
% 5.98/6.15 % --res_prop_simpl_given false
% 5.98/6.15 % --res_passive_queue_type priority_queues
% 5.98/6.15 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.98/6.15 % --res_passive_queues_freq [15;5]
% 5.98/6.15 % --res_forward_subs full
% 5.98/6.15 % --res_backward_subs full
% 5.98/6.15 % --res_forward_subs_resolution true
% 5.98/6.15 % --res_backward_subs_resolution true
% 5.98/6.15 % --res_orphan_elimination false
% 5.98/6.15 % --res_time_limit 1000.
% 5.98/6.15 % --res_out_proof true
% 5.98/6.15 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e11143.s
% 5.98/6.15 % --modulo true
% 5.98/6.15
% 5.98/6.15 % ------ Combination Options
% 5.98/6.15
% 5.98/6.15 % --comb_res_mult 1000
% 5.98/6.15 % --comb_inst_mult 300
% 5.98/6.15 % ------
% 5.98/6.15
% 5.98/6.15
% 5.98/6.15
% 5.98/6.15 % ------ Proving...
% 5.98/6.15 %
% 5.98/6.15
% 5.98/6.15
% 5.98/6.15 % ------ Statistics
% 5.98/6.15
% 5.98/6.15 % ------ General
% 5.98/6.15
% 5.98/6.15 % num_of_input_clauses: 22
% 5.98/6.15 % num_of_input_neg_conjectures: 2
% 5.98/6.15 % num_of_splits: 0
% 5.98/6.15 % num_of_split_atoms: 0
% 5.98/6.15 % num_of_sem_filtered_clauses: 0
% 5.98/6.15 % num_of_subtypes: 0
% 5.98/6.15 % monotx_restored_types: 0
% 5.98/6.15 % sat_num_of_epr_types: 0
% 5.98/6.15 % sat_num_of_non_cyclic_types: 0
% 5.98/6.15 % sat_guarded_non_collapsed_types: 0
% 5.98/6.15 % is_epr: 0
% 5.98/6.15 % is_horn: 0
% 5.98/6.15 % has_eq: 1
% 5.98/6.15 % num_pure_diseq_elim: 0
% 5.98/6.15 % simp_replaced_by: 0
% 5.98/6.15 % res_preprocessed: 4
% 5.98/6.15 % prep_upred: 0
% 5.98/6.15 % prep_unflattend: 0
% 5.98/6.15 % pred_elim_cands: 0
% 5.98/6.15 % pred_elim: 0
% 5.98/6.15 % pred_elim_cl: 0
% 5.98/6.15 % pred_elim_cycles: 0
% 5.98/6.15 % forced_gc_time: 0
% 5.98/6.15 % gc_basic_clause_elim: 0
% 5.98/6.15 % parsing_time: 0.001
% 5.98/6.15 % sem_filter_time: 0.
% 5.98/6.15 % pred_elim_time: 0.
% 5.98/6.15 % out_proof_time: 0.
% 5.98/6.15 % monotx_time: 0.
% 5.98/6.15 % subtype_inf_time: 0.
% 5.98/6.15 % unif_index_cands_time: 0.004
% 5.98/6.15 % unif_index_add_time: 0.005
% 5.98/6.15 % total_time: 5.67
% 5.98/6.15 % num_of_symbols: 34
% 5.98/6.15 % num_of_terms: 10558
% 5.98/6.15
% 5.98/6.15 % ------ Propositional Solver
% 5.98/6.15
% 5.98/6.15 % prop_solver_calls: 12
% 5.98/6.15 % prop_fast_solver_calls: 12
% 5.98/6.15 % prop_num_of_clauses: 786
% 5.98/6.15 % prop_preprocess_simplified: 982
% 5.98/6.15 % prop_fo_subsumed: 0
% 5.98/6.15 % prop_solver_time: 0.
% 5.98/6.15 % prop_fast_solver_time: 0.
% 5.98/6.15 % prop_unsat_core_time: 0.
% 5.98/6.15
% 5.98/6.15 % ------ QBF
% 5.98/6.15
% 5.98/6.15 % qbf_q_res: 0
% 5.98/6.15 % qbf_num_tautologies: 0
% 5.98/6.15 % qbf_prep_cycles: 0
% 5.98/6.15
% 5.98/6.15 % ------ BMC1
% 5.98/6.15
% 5.98/6.15 % bmc1_current_bound: -1
% 5.98/6.15 % bmc1_last_solved_bound: -1
% 5.98/6.15 % bmc1_unsat_core_size: -1
% 5.98/6.15 % bmc1_unsat_core_parents_size: -1
% 5.98/6.15 % bmc1_merge_next_fun: 0
% 5.98/6.15 % bmc1_unsat_core_clauses_time: 0.
% 5.98/6.15
% 5.98/6.15 % ------ Instantiation
% 5.98/6.15
% 5.98/6.15 % inst_num_of_clauses: 460
% 5.98/6.15 % inst_num_in_passive: 221
% 5.98/6.15 % inst_num_in_active: 214
% 5.98/6.15 % inst_num_in_unprocessed: 23
% 5.98/6.15 % inst_num_of_loops: 323
% 5.98/6.15 % inst_num_of_learning_restarts: 0
% 5.98/6.15 % inst_num_moves_active_passive: 103
% 5.98/6.15 % inst_lit_activity: 37
% 5.98/6.15 % inst_lit_activity_moves: 0
% 5.98/6.15 % inst_num_tautologies: 0
% 5.98/6.15 % inst_num_prop_implied: 0
% 5.98/6.15 % inst_num_existing_simplified: 0
% 5.98/6.15 % inst_num_eq_res_simplified: 2
% 5.98/6.15 % inst_num_child_elim: 0
% 5.98/6.15 % inst_num_of_dismatching_blockings: 806
% 5.98/6.15 % inst_num_of_non_proper_insts: 931
% 5.98/6.15 % inst_num_of_duplicates: 682
% 5.98/6.15 % inst_inst_num_from_inst_to_res: 0
% 5.98/6.15 % inst_dismatching_checking_time: 0.
% 5.98/6.15
% 5.98/6.15 % ------ Resolution
% 5.98/6.15
% 5.98/6.15 % res_num_of_clauses: 3746
% 5.98/6.15 % res_num_in_passive: 1741
% 5.98/6.15 % res_num_in_active: 1995
% 5.98/6.15 % res_num_of_loops: 2000
% 5.98/6.15 % res_forward_subset_subsumed: 40
% 5.98/6.15 % res_backward_subset_subsumed: 0
% 5.98/6.15 % res_forward_subsumed: 14
% 5.98/6.15 % res_backward_subsumed: 0
% 5.98/6.15 % res_forward_subsumption_resolution: 0
% 5.98/6.15 % res_backward_subsumption_resolution: 0
% 5.98/6.15 % res_clause_to_clause_subsumption: 127555
% 5.98/6.15 % res_orphan_elimination: 0
% 5.98/6.15 % res_tautology_del: 1
% 5.98/6.15 % res_num_eq_res_simplified: 0
% 5.98/6.15 % res_num_sel_changes: 0
% 5.98/6.15 % res_moves_from_active_to_pass: 0
% 5.98/6.15
% 5.98/6.15 % Status Unsatisfiable
% 5.98/6.15 % SZS status Theorem
% 5.98/6.15 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------