%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : ARI764-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n013.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 : 300s
% DateTime : Tue May 5 06:16:48 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.50s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(double2,axiom,
d(s(X)) = s(s(d(X))),
input ).
fof(double2_0,plain,
! [X] :
( d(s(X)) = s(s(d(X)))
| $false ),
inference(orientation,[status(thm)],[double2]) ).
cnf(double1,axiom,
d(zero) = zero,
input ).
fof(double1_0,plain,
( d(zero) = zero
| $false ),
inference(orientation,[status(thm)],[double1]) ).
cnf(rule9,axiom,
quot(s(X),s(Y)) = s(quot(minus(X,Y),s(Y))),
input ).
fof(rule9_0,plain,
! [X,Y] :
( quot(s(X),s(Y)) = s(quot(minus(X,Y),s(Y)))
| $false ),
inference(orientation,[status(thm)],[rule9]) ).
cnf(rule8,axiom,
quot(zero,s(Y)) = zero,
input ).
fof(rule8_0,plain,
! [Y] :
( quot(zero,s(Y)) = zero
| $false ),
inference(orientation,[status(thm)],[rule8]) ).
cnf(rule7,axiom,
ifMinus(false,s(X),Y) = s(minus(X,Y)),
input ).
fof(rule7_0,plain,
! [X,Y] :
( ifMinus(false,s(X),Y) = s(minus(X,Y))
| $false ),
inference(orientation,[status(thm)],[rule7]) ).
cnf(rule6,axiom,
ifMinus(true,s(X),Y) = zero,
input ).
fof(rule6_0,plain,
! [X,Y] :
( ifMinus(true,s(X),Y) = zero
| $false ),
inference(orientation,[status(thm)],[rule6]) ).
cnf(rule5,axiom,
minus(s(X),Y) = ifMinus(le(s(X),Y),s(X),Y),
input ).
fof(rule5_0,plain,
! [X,Y] :
( minus(s(X),Y) = ifMinus(le(s(X),Y),s(X),Y)
| $false ),
inference(orientation,[status(thm)],[rule5]) ).
cnf(rule4,axiom,
minus(zero,Y) = zero,
input ).
fof(rule4_0,plain,
! [Y] :
( minus(zero,Y) = zero
| $false ),
inference(orientation,[status(thm)],[rule4]) ).
cnf(rule3,axiom,
le(s(X),s(Y)) = le(X,Y),
input ).
fof(rule3_0,plain,
! [X,Y] :
( le(s(X),s(Y)) = le(X,Y)
| $false ),
inference(orientation,[status(thm)],[rule3]) ).
cnf(rule2,axiom,
le(s(X),zero) = false,
input ).
fof(rule2_0,plain,
! [X] :
( le(s(X),zero) = false
| $false ),
inference(orientation,[status(thm)],[rule2]) ).
cnf(rule1,axiom,
le(zero,Y) = true,
input ).
fof(rule1_0,plain,
! [Y] :
( le(zero,Y) = true
| $false ),
inference(orientation,[status(thm)],[rule1]) ).
fof(def_lhs_atom1,axiom,
! [Y] :
( lhs_atom1(Y)
<=> le(zero,Y) = true ),
inference(definition,[],[]) ).
fof(to_be_clausified_0,plain,
! [Y] :
( lhs_atom1(Y)
| $false ),
inference(fold_definition,[status(thm)],[rule1_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [X] :
( lhs_atom2(X)
<=> le(s(X),zero) = false ),
inference(definition,[],[]) ).
fof(to_be_clausified_1,plain,
! [X] :
( lhs_atom2(X)
| $false ),
inference(fold_definition,[status(thm)],[rule2_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [Y,X] :
( lhs_atom3(Y,X)
<=> le(s(X),s(Y)) = le(X,Y) ),
inference(definition,[],[]) ).
fof(to_be_clausified_2,plain,
! [X,Y] :
( lhs_atom3(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[rule3_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
! [Y] :
( lhs_atom4(Y)
<=> minus(zero,Y) = zero ),
inference(definition,[],[]) ).
fof(to_be_clausified_3,plain,
! [Y] :
( lhs_atom4(Y)
| $false ),
inference(fold_definition,[status(thm)],[rule4_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
! [Y,X] :
( lhs_atom5(Y,X)
<=> minus(s(X),Y) = ifMinus(le(s(X),Y),s(X),Y) ),
inference(definition,[],[]) ).
fof(to_be_clausified_4,plain,
! [X,Y] :
( lhs_atom5(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[rule5_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
! [Y,X] :
( lhs_atom6(Y,X)
<=> ifMinus(true,s(X),Y) = zero ),
inference(definition,[],[]) ).
fof(to_be_clausified_5,plain,
! [X,Y] :
( lhs_atom6(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[rule6_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
! [Y,X] :
( lhs_atom7(Y,X)
<=> ifMinus(false,s(X),Y) = s(minus(X,Y)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_6,plain,
! [X,Y] :
( lhs_atom7(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[rule7_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
! [Y] :
( lhs_atom8(Y)
<=> quot(zero,s(Y)) = zero ),
inference(definition,[],[]) ).
fof(to_be_clausified_7,plain,
! [Y] :
( lhs_atom8(Y)
| $false ),
inference(fold_definition,[status(thm)],[rule8_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
! [Y,X] :
( lhs_atom9(Y,X)
<=> quot(s(X),s(Y)) = s(quot(minus(X,Y),s(Y))) ),
inference(definition,[],[]) ).
fof(to_be_clausified_8,plain,
! [X,Y] :
( lhs_atom9(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[rule9_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
( lhs_atom10
<=> d(zero) = zero ),
inference(definition,[],[]) ).
fof(to_be_clausified_9,plain,
( lhs_atom10
| $false ),
inference(fold_definition,[status(thm)],[double1_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
! [X] :
( lhs_atom11(X)
<=> d(s(X)) = s(s(d(X))) ),
inference(definition,[],[]) ).
fof(to_be_clausified_10,plain,
! [X] :
( lhs_atom11(X)
| $false ),
inference(fold_definition,[status(thm)],[double2_0,def_lhs_atom11]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2] :
( lhs_atom9(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_1,axiom,
! [X1,X2] :
( lhs_atom7(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_2,axiom,
! [X1,X2] :
( lhs_atom6(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_3,axiom,
! [X1,X2] :
( lhs_atom5(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_4,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_5,axiom,
! [X2] :
( lhs_atom11(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_6,axiom,
! [X1] :
( lhs_atom8(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_7,axiom,
! [X1] :
( lhs_atom4(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_8,axiom,
! [X2] :
( lhs_atom2(X2)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_9,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_10,axiom,
( lhs_atom10
| ~ $true ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_11,plain,
! [X1,X2] : lhs_atom9(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_12,plain,
! [X1,X2] : lhs_atom7(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_13,plain,
! [X1,X2] : lhs_atom6(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_14,plain,
! [X1,X2] : lhs_atom5(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_15,plain,
! [X1,X2] : lhs_atom3(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_16,plain,
! [X2] : lhs_atom11(X2),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_17,plain,
! [X1] : lhs_atom8(X1),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X1] : lhs_atom4(X1),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_19,plain,
! [X2] : lhs_atom2(X2),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_20,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_21,plain,
lhs_atom10,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X3,X4] : lhs_atom9(X3,X4),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X3,X4] : lhs_atom7(X3,X4),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_24,plain,
! [X3,X4] : lhs_atom6(X3,X4),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_25,plain,
! [X3,X4] : lhs_atom5(X3,X4),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_26,plain,
! [X3,X4] : lhs_atom3(X3,X4),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_27,plain,
! [X3] : lhs_atom11(X3),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_28,plain,
! [X2] : lhs_atom8(X2),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_29,plain,
! [X2] : lhs_atom4(X2),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_30,plain,
! [X3] : lhs_atom2(X3),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_20]) ).
fof(c_0_32,plain,
lhs_atom10,
c_0_21 ).
cnf(c_0_33,plain,
lhs_atom9(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
lhs_atom7(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
lhs_atom6(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
lhs_atom5(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
lhs_atom3(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
lhs_atom11(X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
lhs_atom8(X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
lhs_atom4(X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
lhs_atom2(X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
lhs_atom10,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
lhs_atom9(X1,X2),
c_0_33,
[final] ).
cnf(c_0_45,plain,
lhs_atom7(X1,X2),
c_0_34,
[final] ).
cnf(c_0_46,plain,
lhs_atom6(X1,X2),
c_0_35,
[final] ).
cnf(c_0_47,plain,
lhs_atom5(X1,X2),
c_0_36,
[final] ).
cnf(c_0_48,plain,
lhs_atom3(X1,X2),
c_0_37,
[final] ).
cnf(c_0_49,plain,
lhs_atom11(X1),
c_0_38,
[final] ).
cnf(c_0_50,plain,
lhs_atom8(X1),
c_0_39,
[final] ).
cnf(c_0_51,plain,
lhs_atom4(X1),
c_0_40,
[final] ).
cnf(c_0_52,plain,
lhs_atom2(X1),
c_0_41,
[final] ).
cnf(c_0_53,plain,
lhs_atom1(X1),
c_0_42,
[final] ).
cnf(c_0_54,plain,
lhs_atom10,
c_0_43,
[final] ).
% End CNF derivation
cnf(c_0_44_0,axiom,
quot(s(X2),s(X1)) = s(quot(minus(X2,X1),s(X1))),
inference(unfold_definition,[status(thm)],[c_0_44,def_lhs_atom9]) ).
cnf(c_0_45_0,axiom,
ifMinus(false,s(X2),X1) = s(minus(X2,X1)),
inference(unfold_definition,[status(thm)],[c_0_45,def_lhs_atom7]) ).
cnf(c_0_46_0,axiom,
ifMinus(true,s(X2),X1) = zero,
inference(unfold_definition,[status(thm)],[c_0_46,def_lhs_atom6]) ).
cnf(c_0_47_0,axiom,
minus(s(X2),X1) = ifMinus(le(s(X2),X1),s(X2),X1),
inference(unfold_definition,[status(thm)],[c_0_47,def_lhs_atom5]) ).
cnf(c_0_48_0,axiom,
le(s(X2),s(X1)) = le(X2,X1),
inference(unfold_definition,[status(thm)],[c_0_48,def_lhs_atom3]) ).
cnf(c_0_49_0,axiom,
d(s(X1)) = s(s(d(X1))),
inference(unfold_definition,[status(thm)],[c_0_49,def_lhs_atom11]) ).
cnf(c_0_50_0,axiom,
quot(zero,s(X1)) = zero,
inference(unfold_definition,[status(thm)],[c_0_50,def_lhs_atom8]) ).
cnf(c_0_51_0,axiom,
minus(zero,X1) = zero,
inference(unfold_definition,[status(thm)],[c_0_51,def_lhs_atom4]) ).
cnf(c_0_52_0,axiom,
le(s(X1),zero) = false,
inference(unfold_definition,[status(thm)],[c_0_52,def_lhs_atom2]) ).
cnf(c_0_53_0,axiom,
le(zero,X1) = true,
inference(unfold_definition,[status(thm)],[c_0_53,def_lhs_atom1]) ).
cnf(c_0_54_0,axiom,
d(zero) = zero,
inference(unfold_definition,[status(thm)],[c_0_54,def_lhs_atom10]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
file('<stdin>',goal) ).
fof(c_0_1_002,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
c_0_0 ).
fof(c_0_2_003,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
c_0_1 ).
cnf(c_0_3_004,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_11,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_d072b0.p',c_0_4) ).
cnf(c_22,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
inference(copy,[status(esa)],[c_11]) ).
cnf(c_26,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_27,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_28,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_52,negated_conjecture,
quot(d(d(s(s(s(s(zero)))))),s(s(s(s(zero))))) != s(s(s(s(zero)))),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_53,plain,
s(s(s(s(zero)))) != s(s(s(s(zero)))),
inference(rewriting,[status(thm)],[c_52]) ).
cnf(c_54,plain,
$false,
inference(equality_resolution_simp,[status(esa)],[c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ARI764-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : iprover_modulo %s %d
% 0.15/0.32 % Computer : n013.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 18:34:41 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.33 % Running in mono-core mode
% 0.17/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.17/0.39 % Orientation found
% 0.17/0.39 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_195641.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_d072b0.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_ce3f46 | grep -v "SZS"
% 0.17/0.41
% 0.17/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.17/0.41
% 0.17/0.41 %
% 0.17/0.41 % ------ iProver source info
% 0.17/0.41
% 0.17/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.17/0.41 % git: non_committed_changes: true
% 0.17/0.41 % git: last_make_outside_of_git: true
% 0.17/0.41
% 0.17/0.41 %
% 0.17/0.41 % ------ Input Options
% 0.17/0.41
% 0.17/0.41 % --out_options all
% 0.17/0.41 % --tptp_safe_out true
% 0.17/0.41 % --problem_path ""
% 0.17/0.41 % --include_path ""
% 0.17/0.41 % --clausifier .//eprover
% 0.17/0.41 % --clausifier_options --tstp-format
% 0.17/0.41 % --stdin false
% 0.17/0.41 % --dbg_backtrace false
% 0.17/0.41 % --dbg_dump_prop_clauses false
% 0.17/0.41 % --dbg_dump_prop_clauses_file -
% 0.17/0.41 % --dbg_out_stat false
% 0.17/0.41
% 0.17/0.41 % ------ General Options
% 0.17/0.41
% 0.17/0.41 % --fof false
% 0.17/0.41 % --time_out_real 150.
% 0.17/0.41 % --time_out_prep_mult 0.2
% 0.17/0.41 % --time_out_virtual -1.
% 0.17/0.41 % --schedule none
% 0.17/0.41 % --ground_splitting input
% 0.17/0.41 % --splitting_nvd 16
% 0.17/0.41 % --non_eq_to_eq false
% 0.17/0.41 % --prep_gs_sim true
% 0.17/0.41 % --prep_unflatten false
% 0.17/0.41 % --prep_res_sim true
% 0.17/0.41 % --prep_upred true
% 0.17/0.41 % --res_sim_input true
% 0.17/0.41 % --clause_weak_htbl true
% 0.17/0.41 % --gc_record_bc_elim false
% 0.17/0.41 % --symbol_type_check false
% 0.17/0.41 % --clausify_out false
% 0.17/0.41 % --large_theory_mode false
% 0.17/0.41 % --prep_sem_filter none
% 0.17/0.41 % --prep_sem_filter_out false
% 0.17/0.41 % --preprocessed_out false
% 0.17/0.41 % --sub_typing false
% 0.17/0.41 % --brand_transform false
% 0.17/0.41 % --pure_diseq_elim true
% 0.17/0.41 % --min_unsat_core false
% 0.17/0.41 % --pred_elim true
% 0.17/0.41 % --add_important_lit false
% 0.17/0.41 % --soft_assumptions false
% 0.17/0.41 % --reset_solvers false
% 0.17/0.41 % --bc_imp_inh []
% 0.17/0.41 % --conj_cone_tolerance 1.5
% 0.17/0.41 % --prolific_symb_bound 500
% 0.17/0.41 % --lt_threshold 2000
% 0.17/0.41
% 0.17/0.41 % ------ SAT Options
% 0.17/0.41
% 0.17/0.41 % --sat_mode false
% 0.17/0.41 % --sat_fm_restart_options ""
% 0.17/0.41 % --sat_gr_def false
% 0.17/0.41 % --sat_epr_types true
% 0.17/0.41 % --sat_non_cyclic_types false
% 0.17/0.41 % --sat_finite_models false
% 0.17/0.41 % --sat_fm_lemmas false
% 0.17/0.41 % --sat_fm_prep false
% 0.17/0.41 % --sat_fm_uc_incr true
% 0.17/0.41 % --sat_out_model small
% 0.17/0.41 % --sat_out_clauses false
% 0.17/0.41
% 0.17/0.41 % ------ QBF Options
% 0.17/0.41
% 0.17/0.41 % --qbf_mode false
% 0.17/0.41 % --qbf_elim_univ true
% 0.17/0.41 % --qbf_sk_in true
% 0.17/0.41 % --qbf_pred_elim true
% 0.17/0.41 % --qbf_split 32
% 0.17/0.41
% 0.17/0.41 % ------ BMC1 Options
% 0.17/0.41
% 0.17/0.41 % --bmc1_incremental false
% 0.17/0.41 % --bmc1_axioms reachable_all
% 0.17/0.41 % --bmc1_min_bound 0
% 0.17/0.41 % --bmc1_max_bound -1
% 0.17/0.41 % --bmc1_max_bound_default -1
% 0.17/0.41 % --bmc1_symbol_reachability true
% 0.17/0.41 % --bmc1_property_lemmas false
% 0.17/0.41 % --bmc1_k_induction false
% 0.17/0.41 % --bmc1_non_equiv_states false
% 0.17/0.41 % --bmc1_deadlock false
% 0.17/0.41 % --bmc1_ucm false
% 0.17/0.41 % --bmc1_add_unsat_core none
% 0.17/0.41 % --bmc1_unsat_core_children false
% 0.17/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.17/0.41 % --bmc1_out_stat full
% 0.17/0.41 % --bmc1_ground_init false
% 0.17/0.41 % --bmc1_pre_inst_next_state false
% 0.17/0.41 % --bmc1_pre_inst_state false
% 0.17/0.41 % --bmc1_pre_inst_reach_state false
% 0.17/0.41 % --bmc1_out_unsat_core false
% 0.17/0.41 % --bmc1_aig_witness_out false
% 0.17/0.41 % --bmc1_verbose false
% 0.17/0.41 % --bmc1_dump_clauses_tptp false
% 0.23/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.23/0.50 % --bmc1_dump_file -
% 0.23/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.23/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.23/0.50 % --bmc1_ucm_extend_mode 1
% 0.23/0.50 % --bmc1_ucm_init_mode 2
% 0.23/0.50 % --bmc1_ucm_cone_mode none
% 0.23/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.23/0.50 % --bmc1_ucm_relax_model 4
% 0.23/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.23/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.23/0.50 % --bmc1_ucm_layered_model none
% 0.23/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.23/0.50
% 0.23/0.50 % ------ AIG Options
% 0.23/0.50
% 0.23/0.50 % --aig_mode false
% 0.23/0.50
% 0.23/0.50 % ------ Instantiation Options
% 0.23/0.50
% 0.23/0.50 % --instantiation_flag true
% 0.23/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.23/0.50 % --inst_solver_per_active 750
% 0.23/0.50 % --inst_solver_calls_frac 0.5
% 0.23/0.50 % --inst_passive_queue_type priority_queues
% 0.23/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.23/0.50 % --inst_passive_queues_freq [25;2]
% 0.23/0.50 % --inst_dismatching true
% 0.23/0.50 % --inst_eager_unprocessed_to_passive true
% 0.23/0.50 % --inst_prop_sim_given true
% 0.23/0.50 % --inst_prop_sim_new false
% 0.23/0.50 % --inst_orphan_elimination true
% 0.23/0.50 % --inst_learning_loop_flag true
% 0.23/0.50 % --inst_learning_start 3000
% 0.23/0.50 % --inst_learning_factor 2
% 0.23/0.50 % --inst_start_prop_sim_after_learn 3
% 0.23/0.50 % --inst_sel_renew solver
% 0.23/0.50 % --inst_lit_activity_flag true
% 0.23/0.50 % --inst_out_proof true
% 0.23/0.50
% 0.23/0.50 % ------ Resolution Options
% 0.23/0.50
% 0.23/0.50 % --resolution_flag true
% 0.23/0.50 % --res_lit_sel kbo_max
% 0.23/0.50 % --res_to_prop_solver none
% 0.23/0.50 % --res_prop_simpl_new false
% 0.23/0.50 % --res_prop_simpl_given false
% 0.23/0.50 % --res_passive_queue_type priority_queues
% 0.23/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.23/0.50 % --res_passive_queues_freq [15;5]
% 0.23/0.50 % --res_forward_subs full
% 0.23/0.50 % --res_backward_subs full
% 0.23/0.50 % --res_forward_subs_resolution true
% 0.23/0.50 % --res_backward_subs_resolution true
% 0.23/0.50 % --res_orphan_elimination false
% 0.23/0.50 % --res_time_limit 1000.
% 0.23/0.50 % --res_out_proof true
% 0.23/0.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_195641.s
% 0.23/0.50 % --modulo true
% 0.23/0.50
% 0.23/0.50 % ------ Combination Options
% 0.23/0.50
% 0.23/0.50 % --comb_res_mult 1000
% 0.23/0.50 % --comb_inst_mult 300
% 0.23/0.50 % ------
% 0.23/0.50
% 0.23/0.50 % ------ Parsing...% successful
% 0.23/0.50
% 0.23/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.23/0.50
% 0.23/0.50 % ------ Proving...
% 0.23/0.50 % ------ Problem Properties
% 0.23/0.50
% 0.23/0.50 %
% 0.23/0.50 % EPR false
% 0.23/0.50 % Horn true
% 0.23/0.50 % Has equality true
% 0.23/0.50
% 0.23/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.23/0.50
% 0.23/0.50
% 0.23/0.50 Compiling...
% 0.23/0.50 Loading plugin: done.
% 0.23/0.50 %
% 0.23/0.50
% 0.23/0.50
% 0.23/0.50 % Resolution empty clause
% 0.23/0.50
% 0.23/0.50 % ------ Statistics
% 0.23/0.50
% 0.23/0.50 % ------ General
% 0.23/0.50
% 0.23/0.50 % num_of_input_clauses: 12
% 0.23/0.50 % num_of_input_neg_conjectures: 1
% 0.23/0.50 % num_of_splits: 0
% 0.23/0.50 % num_of_split_atoms: 0
% 0.23/0.50 % num_of_sem_filtered_clauses: 0
% 0.23/0.50 % num_of_subtypes: 0
% 0.23/0.50 % monotx_restored_types: 0
% 0.23/0.50 % sat_num_of_epr_types: 0
% 0.23/0.50 % sat_num_of_non_cyclic_types: 0
% 0.23/0.50 % sat_guarded_non_collapsed_types: 0
% 0.23/0.50 % is_epr: 0
% 0.23/0.50 % is_horn: 1
% 0.23/0.50 % has_eq: 1
% 0.23/0.50 % num_pure_diseq_elim: 0
% 0.23/0.50 % simp_replaced_by: 0
% 0.23/0.50 % res_preprocessed: 2
% 0.23/0.50 % prep_upred: 0
% 0.23/0.50 % prep_unflattend: 0
% 0.23/0.50 % pred_elim_cands: 0
% 0.23/0.50 % pred_elim: 0
% 0.23/0.50 % pred_elim_cl: 0
% 0.23/0.50 % pred_elim_cycles: 0
% 0.23/0.50 % forced_gc_time: 0
% 0.23/0.50 % gc_basic_clause_elim: 0
% 0.23/0.50 % parsing_time: 0.
% 0.23/0.50 % sem_filter_time: 0.
% 0.23/0.50 % pred_elim_time: 0.
% 0.23/0.50 % out_proof_time: 0.
% 0.23/0.50 % monotx_time: 0.
% 0.23/0.50 % subtype_inf_time: 0.
% 0.23/0.50 % unif_index_cands_time: 0.
% 0.23/0.50 % unif_index_add_time: 0.
% 0.23/0.50 % total_time: 0.099
% 0.23/0.50 % num_of_symbols: 34
% 0.23/0.50 % num_of_terms: 101
% 0.23/0.50
% 0.23/0.50 % ------ Propositional Solver
% 0.23/0.50
% 0.23/0.50 % prop_solver_calls: 1
% 0.23/0.50 % prop_fast_solver_calls: 3
% 0.23/0.50 % prop_num_of_clauses: 22
% 0.23/0.50 % prop_preprocess_simplified: 30
% 0.23/0.50 % prop_fo_subsumed: 0
% 0.23/0.50 % prop_solver_time: 0.
% 0.23/0.50 % prop_fast_solver_time: 0.
% 0.23/0.50 % prop_unsat_core_time: 0.
% 0.23/0.50
% 0.23/0.50 % ------ QBF
% 0.23/0.50
% 0.23/0.50 % qbf_q_res: 0
% 0.23/0.50 % qbf_num_tautologies: 0
% 0.23/0.50 % qbf_prep_cycles: 0
% 0.23/0.50
% 0.23/0.50 % ------ BMC1
% 0.23/0.50
% 0.23/0.50 % bmc1_current_bound: -1
% 0.23/0.50 % bmc1_last_solved_bound: -1
% 0.23/0.50 % bmc1_unsat_core_size: -1
% 0.23/0.50 % bmc1_unsat_core_parents_size: -1
% 0.23/0.50 % bmc1_merge_next_fun: 0
% 0.23/0.50 % bmc1_unsat_core_clauses_time: 0.
% 0.23/0.50
% 0.23/0.50 % ------ Instantiation
% 0.23/0.50
% 0.23/0.50 % inst_num_of_clauses: 12
% 0.23/0.50 % inst_num_in_passive: 0
% 0.23/0.50 % inst_num_in_active: 0
% 0.23/0.50 % inst_num_in_unprocessed: 12
% 0.23/0.50 % inst_num_of_loops: 0
% 0.23/0.50 % inst_num_of_learning_restarts: 0
% 0.23/0.50 % inst_num_moves_active_passive: 0
% 0.23/0.50 % inst_lit_activity: 0
% 0.23/0.50 % inst_lit_activity_moves: 0
% 0.23/0.50 % inst_num_tautologies: 0
% 0.23/0.50 % inst_num_prop_implied: 0
% 0.23/0.50 % inst_num_existing_simplified: 0
% 0.23/0.50 % inst_num_eq_res_simplified: 0
% 0.23/0.50 % inst_num_child_elim: 0
% 0.23/0.50 % inst_num_of_dismatching_blockings: 0
% 0.23/0.50 % inst_num_of_non_proper_insts: 0
% 0.23/0.50 % inst_num_of_duplicates: 0
% 0.23/0.50 % inst_inst_num_from_inst_to_res: 0
% 0.23/0.50 % inst_dismatching_checking_time: 0.
% 0.23/0.50
% 0.23/0.50 % ------ Resolution
% 0.23/0.50
% 0.23/0.50 % res_num_of_clauses: 12
% 0.23/0.50 % res_num_in_passive: 0
% 0.23/0.50 % res_num_in_active: 0
% 0.23/0.50 % res_num_of_loops: 0
% 0.23/0.50 % res_forward_subset_subsumed: 0
% 0.23/0.50 % res_backward_subset_subsumed: 0
% 0.23/0.50 % res_forward_subsumed: 0
% 0.23/0.50 % res_backward_subsumed: 0
% 0.23/0.50 % res_forward_subsumption_resolution: 0
% 0.23/0.50 % res_backward_subsumption_resolution: 0
% 0.23/0.50 % res_clause_to_clause_subsumption: 0
% 0.23/0.50 % res_orphan_elimination: 0
% 0.23/0.50 % res_tautology_del: 0
% 0.23/0.50 % res_num_eq_res_simplified: 0
% 0.23/0.50 % res_num_sel_changes: 0
% 0.23/0.50 % res_moves_from_active_to_pass: 0
% 0.23/0.50
% 0.23/0.50 % Status Unsatisfiable
% 0.23/0.50 % SZS status Unsatisfiable
% 0.23/0.50 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------