TSTP Solution File: SET978+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n012.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:19:00 EDT 2022
% Result : Theorem 0.35s 0.52s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 77 ( 31 unt; 0 def)
% Number of atoms : 130 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 120 ( 67 ~; 41 |; 4 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 14 con; 0-2 aty)
% Number of variables : 116 ( 32 sgn 32 !; 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,X3,X4] :
( ( disjoint(X1,X2)
| disjoint(X3,X4) )
=> disjoint(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('<stdin>',t127_zfmisc_1) ).
fof(c_0_1,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('<stdin>',symmetry_r1_xboole_0) ).
fof(c_0_2,axiom,
! [X1,X2] :
( X1 != X2
=> disjoint(singleton(X1),singleton(X2)) ),
file('<stdin>',t17_zfmisc_1) ).
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,X3,X4] :
( ( disjoint(X1,X2)
| disjoint(X3,X4) )
=> disjoint(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
c_0_0 ).
fof(c_0_6,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
c_0_1 ).
fof(c_0_7,axiom,
! [X1,X2] :
( X1 != X2
=> disjoint(singleton(X1),singleton(X2)) ),
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,
! [X5,X6,X7,X8] :
( ( ~ disjoint(X5,X6)
| disjoint(cartesian_product2(X5,X7),cartesian_product2(X6,X8)) )
& ( ~ disjoint(X7,X8)
| disjoint(cartesian_product2(X5,X7),cartesian_product2(X6,X8)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_11,plain,
! [X3,X4] :
( ~ disjoint(X3,X4)
| disjoint(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( X3 = X4
| disjoint(singleton(X3),singleton(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_13,plain,
~ empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_14,plain,
empty(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
cnf(c_0_15,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( disjoint(singleton(X1),singleton(X2))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
empty(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X1,X3) ),
c_0_15,
[final] ).
cnf(c_0_22,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X2,X4) ),
c_0_16,
[final] ).
cnf(c_0_23,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
c_0_17,
[final] ).
cnf(c_0_24,plain,
( disjoint(singleton(X1),singleton(X2))
| X1 = X2 ),
c_0_18,
[final] ).
cnf(c_0_25,plain,
~ empty(esk2_0),
c_0_19,
[final] ).
cnf(c_0_26,plain,
empty(esk1_0),
c_0_20,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_21_0,axiom,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_21_1,axiom,
( ~ disjoint(X1,X3)
| disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_21]) ).
cnf(c_0_22_0,axiom,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_22_1,axiom,
( ~ disjoint(X2,X4)
| disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) ),
inference(literals_permutation,[status(thm)],[c_0_22]) ).
cnf(c_0_23_0,axiom,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_23_1,axiom,
( ~ disjoint(X2,X1)
| disjoint(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_23]) ).
cnf(c_0_24_0,axiom,
( disjoint(singleton(X1),singleton(X2))
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_24_1,axiom,
( X1 = X2
| disjoint(singleton(X1),singleton(X2)) ),
inference(literals_permutation,[status(thm)],[c_0_24]) ).
cnf(c_0_25_0,axiom,
~ empty(sk1_esk2_0),
inference(literals_permutation,[status(thm)],[c_0_25]) ).
cnf(c_0_26_0,axiom,
empty(sk1_esk1_0),
inference(literals_permutation,[status(thm)],[c_0_26]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
! [X1,X2,X3,X4] :
( X1 != X2
=> ( disjoint(cartesian_product2(singleton(X1),X3),cartesian_product2(singleton(X2),X4))
& disjoint(cartesian_product2(X3,singleton(X1)),cartesian_product2(X4,singleton(X2))) ) ),
file('<stdin>',t131_zfmisc_1) ).
fof(c_0_1_002,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( X1 != X2
=> ( disjoint(cartesian_product2(singleton(X1),X3),cartesian_product2(singleton(X2),X4))
& disjoint(cartesian_product2(X3,singleton(X1)),cartesian_product2(X4,singleton(X2))) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
( esk1_0 != esk2_0
& ( ~ disjoint(cartesian_product2(singleton(esk1_0),esk3_0),cartesian_product2(singleton(esk2_0),esk4_0))
| ~ disjoint(cartesian_product2(esk5_0,singleton(esk1_0)),cartesian_product2(esk6_0,singleton(esk2_0))) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3_004,negated_conjecture,
( ~ disjoint(cartesian_product2(esk5_0,singleton(esk1_0)),cartesian_product2(esk6_0,singleton(esk2_0)))
| ~ disjoint(cartesian_product2(singleton(esk1_0),esk3_0),cartesian_product2(singleton(esk2_0),esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( ~ disjoint(cartesian_product2(esk5_0,singleton(esk1_0)),cartesian_product2(esk6_0,singleton(esk2_0)))
| ~ disjoint(cartesian_product2(singleton(esk1_0),esk3_0),cartesian_product2(singleton(esk2_0),esk4_0)) ),
c_0_3,
[final] ).
cnf(c_0_6_007,negated_conjecture,
esk2_0 != esk1_0,
c_0_4,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_11,negated_conjecture,
sk2_esk2_0 != sk2_esk1_0,
file('/export/starexec/sandbox2/tmp/iprover_modulo_97677e.p',c_0_6) ).
cnf(c_16,negated_conjecture,
sk2_esk2_0 != sk2_esk1_0,
inference(copy,[status(esa)],[c_11]) ).
cnf(c_23,negated_conjecture,
sk2_esk2_0 != sk2_esk1_0,
inference(copy,[status(esa)],[c_16]) ).
cnf(c_24,negated_conjecture,
sk2_esk2_0 != sk2_esk1_0,
inference(copy,[status(esa)],[c_23]) ).
cnf(c_27,negated_conjecture,
sk2_esk2_0 != sk2_esk1_0,
inference(copy,[status(esa)],[c_24]) ).
cnf(c_62,negated_conjecture,
sk2_esk2_0 != sk2_esk1_0,
inference(copy,[status(esa)],[c_27]) ).
cnf(c_2,plain,
( disjoint(singleton(X0),singleton(X1))
| X0 = X1 ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_97677e.p',c_0_24_1) ).
cnf(c_44,plain,
( disjoint(singleton(X0),singleton(X1))
| X0 = X1 ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_66,plain,
disjoint(singleton(sk2_esk2_0),singleton(sk2_esk1_0)),
inference(resolution,[status(thm)],[c_62,c_44]) ).
cnf(c_67,plain,
disjoint(singleton(sk2_esk2_0),singleton(sk2_esk1_0)),
inference(rewriting,[status(thm)],[c_66]) ).
cnf(c_8,plain,
( disjoint(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
| ~ disjoint(X0,X2) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_97677e.p',c_0_21_1) ).
cnf(c_56,plain,
( disjoint(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
| ~ disjoint(X0,X2) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_80,plain,
disjoint(cartesian_product2(singleton(sk2_esk2_0),X0),cartesian_product2(singleton(sk2_esk1_0),X1)),
inference(resolution,[status(thm)],[c_67,c_56]) ).
cnf(c_81,plain,
disjoint(cartesian_product2(singleton(sk2_esk2_0),X0),cartesian_product2(singleton(sk2_esk1_0),X1)),
inference(rewriting,[status(thm)],[c_80]) ).
cnf(c_10,negated_conjecture,
( ~ disjoint(cartesian_product2(singleton(sk2_esk1_0),sk2_esk3_0),cartesian_product2(singleton(sk2_esk2_0),sk2_esk4_0))
| ~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_97677e.p',c_0_5) ).
cnf(c_14,negated_conjecture,
( ~ disjoint(cartesian_product2(singleton(sk2_esk1_0),sk2_esk3_0),cartesian_product2(singleton(sk2_esk2_0),sk2_esk4_0))
| ~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_22,negated_conjecture,
( ~ disjoint(cartesian_product2(singleton(sk2_esk1_0),sk2_esk3_0),cartesian_product2(singleton(sk2_esk2_0),sk2_esk4_0))
| ~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_25,negated_conjecture,
( ~ disjoint(cartesian_product2(singleton(sk2_esk1_0),sk2_esk3_0),cartesian_product2(singleton(sk2_esk2_0),sk2_esk4_0))
| ~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))) ),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_26,negated_conjecture,
( ~ disjoint(cartesian_product2(singleton(sk2_esk1_0),sk2_esk3_0),cartesian_product2(singleton(sk2_esk2_0),sk2_esk4_0))
| ~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))) ),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_60,negated_conjecture,
( ~ disjoint(cartesian_product2(singleton(sk2_esk1_0),sk2_esk3_0),cartesian_product2(singleton(sk2_esk2_0),sk2_esk4_0))
| ~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_5,plain,
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_97677e.p',c_0_23_0) ).
cnf(c_50,plain,
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_72,plain,
( ~ disjoint(cartesian_product2(singleton(sk2_esk2_0),sk2_esk4_0),cartesian_product2(singleton(sk2_esk1_0),sk2_esk3_0))
| ~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))) ),
inference(resolution,[status(thm)],[c_60,c_50]) ).
cnf(c_73,plain,
( ~ disjoint(cartesian_product2(singleton(sk2_esk2_0),sk2_esk4_0),cartesian_product2(singleton(sk2_esk1_0),sk2_esk3_0))
| ~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))) ),
inference(rewriting,[status(thm)],[c_72]) ).
cnf(c_106,plain,
~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))),
inference(backward_subsumption_resolution,[status(thm)],[c_81,c_73]) ).
cnf(c_107,negated_conjecture,
~ disjoint(cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0)),cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0))),
inference(rewriting,[status(thm)],[c_106]) ).
cnf(c_116,plain,
~ disjoint(cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0)),cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0))),
inference(resolution,[status(thm)],[c_107,c_50]) ).
cnf(c_117,plain,
~ disjoint(cartesian_product2(sk2_esk6_0,singleton(sk2_esk2_0)),cartesian_product2(sk2_esk5_0,singleton(sk2_esk1_0))),
inference(rewriting,[status(thm)],[c_116]) ).
cnf(c_6,plain,
( disjoint(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
| ~ disjoint(X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_97677e.p',c_0_22_1) ).
cnf(c_52,plain,
( disjoint(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
| ~ disjoint(X1,X3) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_78,plain,
disjoint(cartesian_product2(X0,singleton(sk2_esk2_0)),cartesian_product2(X1,singleton(sk2_esk1_0))),
inference(resolution,[status(thm)],[c_67,c_52]) ).
cnf(c_79,plain,
disjoint(cartesian_product2(X0,singleton(sk2_esk2_0)),cartesian_product2(X1,singleton(sk2_esk1_0))),
inference(rewriting,[status(thm)],[c_78]) ).
cnf(c_119,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_117,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % Command : iprover_modulo %s %d
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 9 16:00:44 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Running in mono-core mode
% 0.21/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42 % FOF problem with conjecture
% 0.21/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_130b46.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_97677e.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_fe3365 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_130b46.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...%
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % ------ Statistics
% 0.21/0.44
% 0.21/0.44 % ------ General
% 0.21/0.44
% 0.21/0.44 % num_of_input_clauses: 3
% 0.21/0.44 % num_of_input_neg_conjectures: 0
% 0.21/0.44 % num_of_splits: 0
% 0.21/0.44 % num_of_split_atoms: 0
% 0.21/0.44 % num_of_sem_filtered_clauses: 0
% 0.21/0.44 % num_of_subtypes: 0
% 0.21/0.44 % monotx_restored_types: 0
% 0.21/0.44 % sat_num_of_epr_types: 0
% 0.21/0.44 % sat_num_of_non_cyclic_types: 0
% 0.21/0.44 % sat_guarded_non_collapsed_types: 0
% 0.21/0.44 % is_epr: 0
% 0.21/0.44 % is_horn: 0
% 0.21/0.44 % has_eq: 0
% 0.21/0.44 % num_pure_diseq_elim: 0
% 0.21/0.44 % simp_replaced_by: 0
% 0.21/0.44 % res_preprocessed: 0
% 0.21/0.44 % prep_upred: 0
% 0.21/0.44 % prep_unflattend: 0
% 0.21/0.44 % pred_elim_cands: 0
% 0.21/0.44 % pred_elim: 0
% 0.21/0.44 % pred_elim_cl: 0
% 0.21/0.44 % pred_elim_cycles: 0
% 0.21/0.44 % forced_gc_time: 0
% 0.21/0.44 % gc_basic_clause_elim: 0
% 0.21/0.44 % parsing_time: 0.
% 0.21/0.44 % sem_filter_time: 0.
% 0.21/0.44 % pred_elim_time: 0.
% 0.21/0.44 % out_proof_time: 0.
% 0.21/0.44 % monotx_time: 0.
% 0.21/0.44 % subtype_inf_time: 0.
% 0.21/0.44 % unif_index_cands_time: 0.
% 0.21/0.44 % unFatal error: exception Failure("Parse error in: /export/starexec/sandbox2/tmp/iprover_modulo_97677e.p line: 6 near token: '!='")
% 0.21/0.44 if_index_add_time: 0.
% 0.21/0.44 % total_time: 0.017
% 0.21/0.44 % num_of_symbols: 29
% 0.21/0.44 % num_of_terms: 18
% 0.21/0.44
% 0.21/0.44 % ------ Propositional Solver
% 0.21/0.44
% 0.21/0.44 % prop_solver_calls: 0
% 0.21/0.44 % prop_fast_solver_calls: 0
% 0.21/0.44 % prop_num_of_clauses: 0
% 0.21/0.44 % prop_preprocess_simplified: 0
% 0.21/0.44 % prop_fo_subsumed: 0
% 0.21/0.44 % prop_solver_time: 0.
% 0.21/0.44 % prop_fast_solver_time: 0.
% 0.21/0.44 % prop_unsat_core_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ QBF
% 0.21/0.44
% 0.21/0.44 % qbf_q_res: 0
% 0.21/0.44 % qbf_num_tautologies: 0
% 0.21/0.44 % qbf_prep_cycles: 0
% 0.21/0.44
% 0.21/0.44 % ------ BMC1
% 0.21/0.44
% 0.21/0.44 % bmc1_current_bound: -1
% 0.21/0.44 % bmc1_last_solved_bound: -1
% 0.21/0.44 % bmc1_unsat_core_size: -1
% 0.21/0.44 % bmc1_unsat_core_parents_size: -1
% 0.21/0.44 % bmc1_merge_next_fun: 0
% 0.21/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation
% 0.21/0.44
% 0.21/0.44 % inst_num_of_clauses: undef
% 0.21/0.44 % inst_num_in_passive: undef
% 0.21/0.44 % inst_num_in_active: 0
% 0.21/0.44 % inst_num_in_unprocessed: 0
% 0.21/0.44 % inst_num_of_loops: 0
% 0.21/0.44 % inst_num_of_learning_restarts: 0
% 0.21/0.44 % inst_num_moves_active_passive: 0
% 0.21/0.44 % inst_lit_activity: 0
% 0.21/0.44 % inst_lit_activity_moves: 0
% 0.21/0.44 % inst_num_tautologies: 0
% 0.21/0.44 % inst_num_prop_implied: 0
% 0.21/0.44 % inst_num_existing_simplified: 0
% 0.21/0.44 % inst_num_eq_res_simplified: 0
% 0.21/0.44 % inst_num_child_elim: 0
% 0.21/0.44 % inst_num_of_dismatching_blockings: 0
% 0.21/0.44 % inst_num_of_non_proper_insts: 0
% 0.21/0.44 % inst_num_of_duplicates: 0
% 0.21/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.44 % inst_dismatching_checking_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Resolution
% 0.21/0.44
% 0.21/0.44 % res_num_of_clauses: undef
% 0.21/0.44 % res_num_in_passive: undef
% 0.21/0.44 % res_num_in_active: 0
% 0.21/0.44 % res_num_of_loops: 0
% 0.21/0.44 % res_forward_subset_subsumed: 0
% 0.21/0.44 % res_backward_subset_subsumed: 0
% 0.21/0.44 % res_forward_subsumed: 0
% 0.21/0.44 % res_backward_subsumed: 0
% 0.21/0.44 % res_forward_subsumption_resolution: 0
% 0.21/0.44 % res_backward_subsumption_resolution: 0
% 0.21/0.44 % res_clause_to_clause_subsumption: 0
% 0.21/0.44 % res_orphan_elimination: 0
% 0.21/0.44 % res_tautology_del: 0
% 0.21/0.44 % res_num_eq_res_simplified: 0
% 0.21/0.44 % res_num_sel_changes: 0
% 0.21/0.44 % res_moves_from_active_to_pass: 0
% 0.21/0.44
% 0.21/0.44 % Status Unknown
% 0.21/0.48 % Orienting using strategy ClausalAll
% 0.21/0.48 % FOF problem with conjecture
% 0.21/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_130b46.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_97677e.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_9f66e7 | grep -v "SZS"
% 0.21/0.51
% 0.21/0.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % ------ iProver source info
% 0.21/0.51
% 0.21/0.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.51 % git: non_committed_changes: true
% 0.21/0.51 % git: last_make_outside_of_git: true
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % ------ Input Options
% 0.21/0.51
% 0.21/0.51 % --out_options all
% 0.21/0.51 % --tptp_safe_out true
% 0.21/0.51 % --problem_path ""
% 0.21/0.51 % --include_path ""
% 0.21/0.51 % --clausifier .//eprover
% 0.21/0.51 % --clausifier_options --tstp-format
% 0.21/0.51 % --stdin false
% 0.21/0.51 % --dbg_backtrace false
% 0.21/0.51 % --dbg_dump_prop_clauses false
% 0.21/0.51 % --dbg_dump_prop_clauses_file -
% 0.21/0.51 % --dbg_out_stat false
% 0.21/0.51
% 0.21/0.51 % ------ General Options
% 0.21/0.51
% 0.21/0.51 % --fof false
% 0.21/0.51 % --time_out_real 150.
% 0.21/0.51 % --time_out_prep_mult 0.2
% 0.21/0.51 % --time_out_virtual -1.
% 0.21/0.51 % --schedule none
% 0.21/0.51 % --ground_splitting input
% 0.21/0.51 % --splitting_nvd 16
% 0.21/0.51 % --non_eq_to_eq false
% 0.21/0.51 % --prep_gs_sim true
% 0.21/0.51 % --prep_unflatten false
% 0.21/0.51 % --prep_res_sim true
% 0.21/0.51 % --prep_upred true
% 0.21/0.51 % --res_sim_input true
% 0.21/0.51 % --clause_weak_htbl true
% 0.21/0.51 % --gc_record_bc_elim false
% 0.21/0.51 % --symbol_type_check false
% 0.21/0.51 % --clausify_out false
% 0.21/0.51 % --large_theory_mode false
% 0.21/0.51 % --prep_sem_filter none
% 0.21/0.51 % --prep_sem_filter_out false
% 0.21/0.51 % --preprocessed_out false
% 0.21/0.51 % --sub_typing false
% 0.21/0.51 % --brand_transform false
% 0.21/0.51 % --pure_diseq_elim true
% 0.21/0.51 % --min_unsat_core false
% 0.21/0.51 % --pred_elim true
% 0.21/0.51 % --add_important_lit false
% 0.21/0.51 % --soft_assumptions false
% 0.21/0.51 % --reset_solvers false
% 0.21/0.51 % --bc_imp_inh []
% 0.21/0.51 % --conj_cone_tolerance 1.5
% 0.21/0.51 % --prolific_symb_bound 500
% 0.21/0.51 % --lt_threshold 2000
% 0.21/0.51
% 0.21/0.51 % ------ SAT Options
% 0.21/0.51
% 0.21/0.51 % --sat_mode false
% 0.21/0.51 % --sat_fm_restart_options ""
% 0.21/0.51 % --sat_gr_def false
% 0.21/0.51 % --sat_epr_types true
% 0.21/0.51 % --sat_non_cyclic_types false
% 0.21/0.51 % --sat_finite_models false
% 0.21/0.51 % --sat_fm_lemmas false
% 0.21/0.51 % --sat_fm_prep false
% 0.21/0.51 % --sat_fm_uc_incr true
% 0.21/0.51 % --sat_out_model small
% 0.21/0.51 % --sat_out_clauses false
% 0.21/0.51
% 0.21/0.51 % ------ QBF Options
% 0.21/0.51
% 0.21/0.51 % --qbf_mode false
% 0.21/0.51 % --qbf_elim_univ true
% 0.21/0.51 % --qbf_sk_in true
% 0.21/0.51 % --qbf_pred_elim true
% 0.21/0.51 % --qbf_split 32
% 0.21/0.51
% 0.21/0.51 % ------ BMC1 Options
% 0.21/0.51
% 0.21/0.51 % --bmc1_incremental false
% 0.21/0.51 % --bmc1_axioms reachable_all
% 0.21/0.51 % --bmc1_min_bound 0
% 0.21/0.51 % --bmc1_max_bound -1
% 0.21/0.51 % --bmc1_max_bound_default -1
% 0.21/0.51 % --bmc1_symbol_reachability true
% 0.21/0.51 % --bmc1_property_lemmas false
% 0.21/0.51 % --bmc1_k_induction false
% 0.21/0.51 % --bmc1_non_equiv_states false
% 0.21/0.51 % --bmc1_deadlock false
% 0.21/0.51 % --bmc1_ucm false
% 0.21/0.51 % --bmc1_add_unsat_core none
% 0.21/0.51 % --bmc1_unsat_core_children false
% 0.21/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.51 % --bmc1_out_stat full
% 0.21/0.51 % --bmc1_ground_init false
% 0.21/0.51 % --bmc1_pre_inst_next_state false
% 0.21/0.51 % --bmc1_pre_inst_state false
% 0.21/0.51 % --bmc1_pre_inst_reach_state false
% 0.21/0.51 % --bmc1_out_unsat_core false
% 0.21/0.51 % --bmc1_aig_witness_out false
% 0.21/0.51 % --bmc1_verbose false
% 0.21/0.51 % --bmc1_dump_clauses_tptp false
% 0.21/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.51 % --bmc1_dump_file -
% 0.21/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.51 % --bmc1_ucm_extend_mode 1
% 0.21/0.51 % --bmc1_ucm_init_mode 2
% 0.21/0.51 % --bmc1_ucm_cone_mode none
% 0.21/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.51 % --bmc1_ucm_relax_model 4
% 0.21/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.51 % --bmc1_ucm_layered_model none
% 0.21/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.51
% 0.21/0.51 % ------ AIG Options
% 0.21/0.51
% 0.21/0.51 % --aig_mode false
% 0.21/0.51
% 0.21/0.51 % ------ Instantiation Options
% 0.21/0.51
% 0.21/0.51 % --instantiation_flag true
% 0.21/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.51 % --inst_solver_per_active 750
% 0.21/0.51 % --inst_solver_calls_frac 0.5
% 0.21/0.51 % --inst_passive_queue_type priority_queues
% 0.21/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.51 % --inst_passive_queues_freq [25;2]
% 0.21/0.51 % --inst_dismatching true
% 0.21/0.51 % --inst_eager_unprocessed_to_passive true
% 0.21/0.51 % --inst_prop_sim_given true
% 0.21/0.51 % --inst_prop_sim_new false
% 0.21/0.51 % --inst_orphan_elimination true
% 0.21/0.51 % --inst_learning_loop_flag true
% 0.21/0.51 % --inst_learning_start 3000
% 0.21/0.51 % --inst_learning_factor 2
% 0.21/0.51 % --inst_start_prop_sim_after_learn 3
% 0.21/0.51 % --inst_sel_renew solver
% 0.21/0.51 % --inst_lit_activity_flag true
% 0.21/0.51 % --inst_out_proof true
% 0.21/0.51
% 0.21/0.51 % ------ Resolution Options
% 0.21/0.51
% 0.21/0.51 % --resolution_flag true
% 0.21/0.51 % --res_lit_sel kbo_max
% 0.21/0.51 % --res_to_prop_solver none
% 0.21/0.51 % --res_prop_simpl_new false
% 0.21/0.51 % --res_prop_simpl_given false
% 0.21/0.51 % --res_passive_queue_type priority_queues
% 0.21/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.51 % --res_passive_queues_freq [15;5]
% 0.21/0.51 % --res_forward_subs full
% 0.21/0.51 % --res_backward_subs full
% 0.21/0.51 % --res_forward_subs_resolution true
% 0.21/0.51 % --res_backward_subs_resolution true
% 0.21/0.51 % --res_orphan_elimination false
% 0.21/0.51 % --res_time_limit 1000.
% 0.21/0.51 % --res_out_proof true
% 0.21/0.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_130b46.s
% 0.21/0.51 % --modulo true
% 0.21/0.51
% 0.21/0.51 % ------ Combination Options
% 0.21/0.51
% 0.21/0.51 % --comb_res_mult 1000
% 0.21/0.51 % --comb_inst_mult 300
% 0.21/0.51 % ------
% 0.21/0.51
% 0.21/0.51 % ------ Parsing...% successful
% 0.21/0.51
% 0.21/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.21/0.51
% 0.21/0.51 % ------ Proving...
% 0.21/0.51 % ------ Problem Properties
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % EPR false
% 0.21/0.51 % Horn false
% 0.21/0.51 % Has equality true
% 0.21/0.51
% 0.21/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.51
% 0.21/0.51
% 0.21/0.51 % % ------ Current options:
% 0.21/0.51
% 0.21/0.51 % ------ Input Options
% 0.21/0.51
% 0.21/0.51 % --out_options all
% 0.21/0.51 % --tptp_safe_out true
% 0.21/0.51 % --problem_path ""
% 0.21/0.51 % --include_path ""
% 0.21/0.51 % --clausifier .//eprover
% 0.21/0.51 % --clausifier_options --tstp-format
% 0.21/0.51 % --stdin false
% 0.21/0.51 % --dbg_backtrace false
% 0.21/0.51 % --dbg_dump_prop_clauses false
% 0.21/0.51 % --dbg_dump_prop_clauses_file -
% 0.21/0.51 % --dbg_out_stat false
% 0.21/0.51
% 0.21/0.51 % ------ General Options
% 0.21/0.51
% 0.21/0.51 % --fof false
% 0.21/0.51 % --time_out_real 150.
% 0.21/0.51 % --time_out_prep_mult 0.2
% 0.21/0.51 % --time_out_virtual -1.
% 0.21/0.51 % --schedule none
% 0.21/0.51 % --ground_splitting input
% 0.21/0.51 % --splitting_nvd 16
% 0.21/0.51 % --non_eq_to_eq false
% 0.21/0.51 % --prep_gs_sim true
% 0.21/0.51 % --prep_unflatten false
% 0.21/0.51 % --prep_res_sim true
% 0.21/0.51 % --prep_upred true
% 0.21/0.51 % --res_sim_input true
% 0.21/0.51 % --clause_weak_htbl true
% 0.21/0.51 % --gc_record_bc_elim false
% 0.21/0.51 % --symbol_type_check false
% 0.21/0.51 % --clausify_out false
% 0.21/0.51 % --large_theory_mode false
% 0.21/0.51 % --prep_sem_filter none
% 0.21/0.51 % --prep_sem_filter_out false
% 0.21/0.51 % --preprocessed_out false
% 0.21/0.51 % --sub_typing false
% 0.21/0.51 % --brand_transform false
% 0.21/0.51 % --pure_diseq_elim true
% 0.21/0.51 % --min_unsat_core false
% 0.21/0.51 % --pred_elim true
% 0.21/0.51 % --add_important_lit false
% 0.21/0.51 % --soft_assumptions false
% 0.21/0.51 % --reset_solvers false
% 0.21/0.51 % --bc_imp_inh []
% 0.21/0.51 % --conj_cone_tolerance 1.5
% 0.21/0.51 % --prolific_symb_bound 500
% 0.21/0.51 % --lt_threshold 2000
% 0.21/0.51
% 0.21/0.51 % ------ SAT Options
% 0.21/0.51
% 0.21/0.51 % --sat_mode false
% 0.21/0.51 % --sat_fm_restart_options ""
% 0.21/0.51 % --sat_gr_def false
% 0.21/0.51 % --sat_epr_types true
% 0.21/0.51 % --sat_non_cyclic_types false
% 0.21/0.51 % --sat_finite_models false
% 0.21/0.51 % --sat_fm_lemmas false
% 0.21/0.51 % --sat_fm_prep false
% 0.21/0.51 % --sat_fm_uc_incr true
% 0.21/0.51 % --sat_out_model small
% 0.21/0.51 % --sat_out_clauses false
% 0.21/0.51
% 0.21/0.51 % ------ QBF Options
% 0.21/0.51
% 0.21/0.51 % --qbf_mode false
% 0.21/0.51 % --qbf_elim_univ true
% 0.21/0.51 % --qbf_sk_in true
% 0.21/0.51 % --qbf_pred_elim true
% 0.21/0.51 % --qbf_split 32
% 0.21/0.51
% 0.21/0.51 % ------ BMC1 Options
% 0.21/0.51
% 0.21/0.51 % --bmc1_incremental false
% 0.21/0.51 % --bmc1_axioms reachable_all
% 0.21/0.51 % --bmc1_min_bound 0
% 0.21/0.51 % --bmc1_max_bound -1
% 0.21/0.51 % --bmc1_max_bound_default -1
% 0.21/0.51 % --bmc1_symbol_reachability true
% 0.21/0.51 % --bmc1_property_lemmas false
% 0.21/0.51 % --bmc1_k_induction false
% 0.21/0.51 % --bmc1_non_equiv_states false
% 0.21/0.51 % --bmc1_deadlock false
% 0.21/0.51 % --bmc1_ucm false
% 0.21/0.51 % --bmc1_add_unsat_core none
% 0.21/0.51 % --bmc1_unsat_core_children false
% 0.21/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.51 % --bmc1_out_stat full
% 0.21/0.51 % --bmc1_ground_init false
% 0.21/0.51 % --bmc1_pre_inst_next_state false
% 0.21/0.51 % --bmc1_pre_inst_state false
% 0.21/0.51 % --bmc1_pre_inst_reach_state false
% 0.21/0.51 % --bmc1_out_unsat_core false
% 0.21/0.51 % --bmc1_aig_witness_out false
% 0.21/0.51 % --bmc1_verbose false
% 0.21/0.51 % --bmc1_dump_clauses_tptp false
% 0.21/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.51 % --bmc1_dump_file -
% 0.21/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.51 % --bmc1_ucm_extend_mode 1
% 0.21/0.51 % --bmc1_ucm_init_mode 2
% 0.21/0.51 % --bmc1_ucm_cone_mode none
% 0.21/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.51 % --bmc1_ucm_relax_model 4
% 0.21/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.51 % --bmc1_ucm_layered_model none
% 0.21/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.51
% 0.21/0.51 % ------ AIG Options
% 0.21/0.51
% 0.21/0.51 % --aig_mode false
% 0.21/0.51
% 0.21/0.51 % ------ Instantiation Options
% 0.21/0.51
% 0.21/0.51 % --instantiation_flag true
% 0.21/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.51 % --inst_solver_per_active 750
% 0.21/0.51 % --inst_solver_calls_frac 0.5
% 0.21/0.51 % --inst_passive_queue_type priority_queues
% 0.21/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.51 % --inst_passive_queues_freq [25;2]
% 0.21/0.51 % --inst_dismatching true
% 0.21/0.51 % --inst_eager_unprocessed_to_passive true
% 0.21/0.51 % --inst_prop_sim_given true
% 0.21/0.52 % --inst_prop_sim_new false
% 0.21/0.52 % --inst_orphan_elimination true
% 0.21/0.52 % --inst_learning_loop_flag true
% 0.21/0.52 % --inst_learning_start 3000
% 0.21/0.52 % --inst_learning_factor 2
% 0.21/0.52 % --inst_start_prop_sim_after_learn 3
% 0.21/0.52 % --inst_sel_renew solver
% 0.21/0.52 % --inst_lit_activity_flag true
% 0.21/0.52 % --inst_out_proof true
% 0.21/0.52
% 0.21/0.52 % ------ Resolution Options
% 0.21/0.52
% 0.21/0.52 % --resolution_flag true
% 0.21/0.52 % --res_lit_sel kbo_max
% 0.21/0.52 % --res_to_prop_solver none
% 0.21/0.52 % --res_prop_simpl_new false
% 0.21/0.52 % --res_prop_simpl_given false
% 0.21/0.52 % --res_passive_queue_type priority_queues
% 0.21/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.52 % --res_passive_queues_freq [15;5]
% 0.21/0.52 % --res_forward_subs full
% 0.21/0.52 % --res_backward_subs full
% 0.21/0.52 % --res_forward_subs_resolution true
% 0.21/0.52 % --res_backward_subs_resolution true
% 0.21/0.52 % --res_orphan_elimination false
% 0.21/0.52 % --res_time_limit 1000.
% 0.21/0.52 % --res_out_proof true
% 0.21/0.52 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_130b46.s
% 0.21/0.52 % --modulo true
% 0.21/0.52
% 0.21/0.52 % ------ Combination Options
% 0.21/0.52
% 0.21/0.52 % --comb_res_mult 1000
% 0.21/0.52 % --comb_inst_mult 300
% 0.21/0.52 % ------
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 % ------ Proving...
% 0.21/0.52 %
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 % Resolution empty clause
% 0.21/0.52
% 0.21/0.52 % ------ Statistics
% 0.21/0.52
% 0.21/0.52 % ------ General
% 0.21/0.52
% 0.21/0.52 % num_of_input_clauses: 12
% 0.21/0.52 % num_of_input_neg_conjectures: 2
% 0.21/0.52 % num_of_splits: 0
% 0.21/0.52 % num_of_split_atoms: 0
% 0.21/0.52 % num_of_sem_filtered_clauses: 0
% 0.21/0.52 % num_of_subtypes: 0
% 0.21/0.52 % monotx_restored_types: 0
% 0.21/0.52 % sat_num_of_epr_types: 0
% 0.21/0.52 % sat_num_of_non_cyclic_types: 0
% 0.21/0.52 % sat_guarded_non_collapsed_types: 0
% 0.21/0.52 % is_epr: 0
% 0.21/0.52 % is_horn: 0
% 0.21/0.52 % has_eq: 1
% 0.21/0.52 % num_pure_diseq_elim: 0
% 0.21/0.52 % simp_replaced_by: 0
% 0.21/0.52 % res_preprocessed: 4
% 0.21/0.52 % prep_upred: 0
% 0.21/0.52 % prep_unflattend: 0
% 0.21/0.52 % pred_elim_cands: 0
% 0.21/0.52 % pred_elim: 0
% 0.21/0.52 % pred_elim_cl: 0
% 0.21/0.52 % pred_elim_cycles: 0
% 0.21/0.52 % forced_gc_time: 0
% 0.21/0.52 % gc_basic_clause_elim: 0
% 0.21/0.52 % parsing_time: 0.
% 0.21/0.52 % sem_filter_time: 0.
% 0.21/0.52 % pred_elim_time: 0.
% 0.21/0.52 % out_proof_time: 0.001
% 0.21/0.52 % monotx_time: 0.
% 0.21/0.52 % subtype_inf_time: 0.
% 0.21/0.52 % unif_index_cands_time: 0.
% 0.21/0.52 % unif_index_add_time: 0.
% 0.21/0.52 % total_time: 0.024
% 0.21/0.52 % num_of_symbols: 37
% 0.21/0.52 % num_of_terms: 104
% 0.21/0.52
% 0.21/0.52 % ------ Propositional Solver
% 0.21/0.52
% 0.21/0.52 % prop_solver_calls: 1
% 0.21/0.52 % prop_fast_solver_calls: 9
% 0.21/0.52 % prop_num_of_clauses: 13
% 0.21/0.52 % prop_preprocess_simplified: 43
% 0.21/0.52 % prop_fo_subsumed: 0
% 0.21/0.52 % prop_solver_time: 0.
% 0.21/0.52 % prop_fast_solver_time: 0.
% 0.21/0.52 % prop_unsat_core_time: 0.
% 0.21/0.52
% 0.21/0.52 % ------ QBF
% 0.21/0.52
% 0.21/0.52 % qbf_q_res: 0
% 0.21/0.52 % qbf_num_tautologies: 0
% 0.21/0.52 % qbf_prep_cycles: 0
% 0.21/0.52
% 0.21/0.52 % ------ BMC1
% 0.21/0.52
% 0.21/0.52 % bmc1_current_bound: -1
% 0.21/0.52 % bmc1_last_solved_bound: -1
% 0.21/0.52 % bmc1_unsat_core_size: -1
% 0.21/0.52 % bmc1_unsat_core_parents_size: -1
% 0.21/0.52 % bmc1_merge_next_fun: 0
% 0.21/0.52 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.52
% 0.21/0.52 % ------ Instantiation
% 0.21/0.52
% 0.21/0.52 % inst_num_of_clauses: 12
% 0.21/0.52 % inst_num_in_passive: 0
% 0.21/0.52 % inst_num_in_active: 0
% 0.21/0.52 % inst_num_in_unprocessed: 12
% 0.21/0.52 % inst_num_of_loops: 0
% 0.21/0.52 % inst_num_of_learning_restarts: 0
% 0.21/0.52 % inst_num_moves_active_passive: 0
% 0.21/0.52 % inst_lit_activity: 0
% 0.21/0.52 % inst_lit_activity_moves: 0
% 0.21/0.52 % inst_num_tautologies: 0
% 0.21/0.52 % inst_num_prop_implied: 0
% 0.21/0.52 % inst_num_existing_simplified: 0
% 0.21/0.52 % inst_num_eq_res_simplified: 0
% 0.21/0.52 % inst_num_child_elim: 0
% 0.21/0.52 % inst_num_of_dismatching_blockings: 0
% 0.21/0.52 % inst_num_of_non_proper_insts: 0
% 0.21/0.52 % inst_num_of_duplicates: 0
% 0.21/0.52 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.52 % inst_dismatching_checking_time: 0.
% 0.21/0.52
% 0.21/0.52 % ------ Resolution
% 0.21/0.52
% 0.21/0.52 % res_num_of_clauses: 23
% 0.21/0.52 % res_num_in_passive: 6
% 0.21/0.52 % res_num_in_active: 13
% 0.21/0.52 % res_num_of_loops: 9
% 0.21/0.52 % res_forward_subset_subsumed: 7
% 0.21/0.52 % res_backward_subset_subsumed: 0
% 0.21/0.52 % res_forward_subsumed: 0
% 0.21/0.52 % res_backward_subsumed: 1
% 0.21/0.52 % res_forward_subsumption_resolution: 1
% 0.21/0.52 % res_backward_subsumption_resolution: 1
% 0.21/0.52 % res_clause_to_clause_subsumption: 31
% 0.21/0.52 % res_orphan_elimination: 0
% 0.21/0.52 % res_tautology_del: 0
% 0.21/0.52 % res_num_eq_res_simplified: 0
% 0.21/0.52 % res_num_sel_changes: 0
% 0.21/0.52 % res_moves_from_active_to_pass: 0
% 0.21/0.52
% 0.35/0.52 % Status Unsatisfiable
% 0.35/0.52 % SZS status Theorem
% 0.35/0.52 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------