TSTP Solution File: SYN553-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN553-1 : TPTP v8.1.0. Released v2.5.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 : 600s
% DateTime : Thu Jul 21 07:29:54 EDT 2022
% Result : Unsatisfiable 1.04s 1.21s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 94 ( 62 unt; 0 def)
% Number of atoms : 152 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 139 ( 81 ~; 58 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 181 ( 0 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
file('<stdin>',not_p2_9) ).
fof(c_0_1,negated_conjecture,
! [X7,X8,X9] : p2(f8(X8,f8(X7,X9)),f8(f8(X8,X7),X9)),
file('<stdin>',p2_7) ).
fof(c_0_2,negated_conjecture,
! [X10,X11,X12,X13] :
( p2(f8(X13,X12),f8(X11,X10))
| ~ p2(X13,X11)
| ~ p2(X12,X10) ),
file('<stdin>',p2_8) ).
fof(c_0_3,negated_conjecture,
! [X2,X3] : p2(f8(X3,X2),f8(X2,X3)),
file('<stdin>',p2_5) ).
fof(c_0_4,negated_conjecture,
! [X4,X5,X6] :
( p2(X6,X5)
| ~ p2(X6,X4)
| ~ p2(X4,X5) ),
file('<stdin>',p2_6) ).
fof(c_0_5,negated_conjecture,
~ p2(c3,f5(f6(c7))),
file('<stdin>',not_p2_4) ).
fof(c_0_6,negated_conjecture,
~ p2(c4,f5(f6(c7))),
file('<stdin>',not_p2_3) ).
fof(c_0_7,negated_conjecture,
! [X1] : p2(X1,X1),
file('<stdin>',p2_1) ).
fof(c_0_8,negated_conjecture,
p2(c3,c4),
file('<stdin>',p2_2) ).
fof(c_0_9,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_10,negated_conjecture,
! [X7,X8,X9] : p2(f8(X8,f8(X7,X9)),f8(f8(X8,X7),X9)),
c_0_1 ).
fof(c_0_11,negated_conjecture,
! [X10,X11,X12,X13] :
( p2(f8(X13,X12),f8(X11,X10))
| ~ p2(X13,X11)
| ~ p2(X12,X10) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_12,negated_conjecture,
! [X2,X3] : p2(f8(X3,X2),f8(X2,X3)),
c_0_3 ).
fof(c_0_13,negated_conjecture,
! [X4,X5,X6] :
( p2(X6,X5)
| ~ p2(X6,X4)
| ~ p2(X4,X5) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_14,negated_conjecture,
~ p2(c3,f5(f6(c7))),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_15,negated_conjecture,
~ p2(c4,f5(f6(c7))),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_16,negated_conjecture,
! [X1] : p2(X1,X1),
c_0_7 ).
fof(c_0_17,negated_conjecture,
p2(c3,c4),
c_0_8 ).
fof(c_0_18,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
c_0_9 ).
fof(c_0_19,negated_conjecture,
! [X10,X11,X12] : p2(f8(X11,f8(X10,X12)),f8(f8(X11,X10),X12)),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_20,negated_conjecture,
! [X14,X15,X16,X17] :
( p2(f8(X17,X16),f8(X15,X14))
| ~ p2(X17,X15)
| ~ p2(X16,X14) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_21,negated_conjecture,
! [X4,X5] : p2(f8(X5,X4),f8(X4,X5)),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_22,negated_conjecture,
! [X7,X8,X9] :
( p2(X9,X8)
| ~ p2(X9,X7)
| ~ p2(X7,X8) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_23,negated_conjecture,
~ p2(c3,f5(f6(c7))),
c_0_14 ).
fof(c_0_24,negated_conjecture,
~ p2(c4,f5(f6(c7))),
c_0_15 ).
fof(c_0_25,negated_conjecture,
! [X2] : p2(X2,X2),
inference(variable_rename,[status(thm)],[c_0_16]) ).
fof(c_0_26,negated_conjecture,
p2(c3,c4),
c_0_17 ).
cnf(c_0_27,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
p2(f8(X1,f8(X2,X3)),f8(f8(X1,X2),X3)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( p2(f8(X3,X1),f8(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,negated_conjecture,
p2(f8(X1,X2),f8(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
~ p2(c3,f5(f6(c7))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,negated_conjecture,
~ p2(c4,f5(f6(c7))),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
p2(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
p2(c3,c4),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
c_0_27,
[final] ).
cnf(c_0_37,negated_conjecture,
p2(f8(X1,f8(X2,X3)),f8(f8(X1,X2),X3)),
c_0_28,
[final] ).
cnf(c_0_38,negated_conjecture,
( p2(f8(X3,X1),f8(X4,X2))
| ~ p2(X1,X2)
| ~ p2(X3,X4) ),
c_0_29,
[final] ).
cnf(c_0_39,negated_conjecture,
p2(f8(X1,X2),f8(X2,X1)),
c_0_30,
[final] ).
cnf(c_0_40,negated_conjecture,
( p2(X3,X2)
| ~ p2(X1,X2)
| ~ p2(X3,X1) ),
c_0_31,
[final] ).
cnf(c_0_41,negated_conjecture,
~ p2(c3,f5(f6(c7))),
c_0_32,
[final] ).
cnf(c_0_42,negated_conjecture,
~ p2(c4,f5(f6(c7))),
c_0_33,
[final] ).
cnf(c_0_43,negated_conjecture,
p2(X1,X1),
c_0_34,
[final] ).
cnf(c_0_44,negated_conjecture,
p2(c3,c4),
c_0_35,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_1,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X1,X2)
| p2(X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_f8a40b.p',c_0_40) ).
cnf(c_14,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X1,X2)
| p2(X0,X2) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_49,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X1,X2)
| p2(X0,X2) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_64,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X1,X2)
| p2(X0,X2) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_67,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X1,X2)
| p2(X0,X2) ),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_86,negated_conjecture,
( ~ p2(X0,X1)
| ~ p2(X1,X2)
| p2(X0,X2) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_6,negated_conjecture,
p2(f8(X0,X1),f8(X1,X0)),
file('/export/starexec/sandbox/tmp/iprover_modulo_f8a40b.p',c_0_39) ).
cnf(c_24,negated_conjecture,
p2(f8(X0,X1),f8(X1,X0)),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_54,negated_conjecture,
p2(f8(X0,X1),f8(X1,X0)),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_59,negated_conjecture,
p2(f8(X0,X1),f8(X1,X0)),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_72,negated_conjecture,
p2(f8(X0,X1),f8(X1,X0)),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_96,negated_conjecture,
p2(f8(X0,X1),f8(X1,X0)),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_118,plain,
( ~ p2(X0,f8(X1,X2))
| p2(X0,f8(X2,X1)) ),
inference(resolution,[status(thm)],[c_86,c_96]) ).
cnf(c_119,plain,
( ~ p2(X0,f8(X1,X2))
| p2(X0,f8(X2,X1)) ),
inference(rewriting,[status(thm)],[c_118]) ).
cnf(c_5,negated_conjecture,
p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
file('/export/starexec/sandbox/tmp/iprover_modulo_f8a40b.p',c_0_37) ).
cnf(c_22,negated_conjecture,
p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_53,negated_conjecture,
p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_60,negated_conjecture,
p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_71,negated_conjecture,
p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_94,negated_conjecture,
p2(f8(X0,f8(X1,X2)),f8(f8(X0,X1),X2)),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_152,plain,
p2(f8(X0,f8(X1,X2)),f8(X2,f8(X0,X1))),
inference(resolution,[status(thm)],[c_119,c_94]) ).
cnf(c_153,plain,
p2(f8(X0,f8(X1,X2)),f8(X2,f8(X0,X1))),
inference(rewriting,[status(thm)],[c_152]) ).
cnf(c_160,plain,
( ~ p2(X0,f8(X1,f8(X2,X3)))
| p2(X0,f8(X3,f8(X1,X2))) ),
inference(resolution,[status(thm)],[c_153,c_86]) ).
cnf(c_161,plain,
( ~ p2(X0,f8(X1,f8(X2,X3)))
| p2(X0,f8(X3,f8(X1,X2))) ),
inference(rewriting,[status(thm)],[c_160]) ).
cnf(c_0,negated_conjecture,
( p2(f8(X0,X1),f8(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_f8a40b.p',c_0_38) ).
cnf(c_12,negated_conjecture,
( p2(f8(X0,X1),f8(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_48,negated_conjecture,
( p2(f8(X0,X1),f8(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_65,negated_conjecture,
( p2(f8(X0,X1),f8(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_66,negated_conjecture,
( p2(f8(X0,X1),f8(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_84,negated_conjecture,
( p2(f8(X0,X1),f8(X2,X3))
| ~ p2(X0,X2)
| ~ p2(X1,X3) ),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_150,plain,
( p2(f8(X0,X1),f8(X2,X3))
| ~ p2(X0,X3)
| ~ p2(X1,X2) ),
inference(resolution,[status(thm)],[c_119,c_84]) ).
cnf(c_151,plain,
( p2(f8(X0,X1),f8(X2,X3))
| ~ p2(X0,X3)
| ~ p2(X1,X2) ),
inference(rewriting,[status(thm)],[c_150]) ).
cnf(c_354,plain,
( p2(f8(X0,X1),f8(X2,f8(X3,X4)))
| ~ p2(X0,f8(X4,X2))
| ~ p2(X1,X3) ),
inference(resolution,[status(thm)],[c_161,c_151]) ).
cnf(c_357,plain,
( p2(f8(X0,X1),f8(X2,f8(X3,X4)))
| ~ p2(X0,f8(X4,X2))
| ~ p2(X1,X3) ),
inference(rewriting,[status(thm)],[c_354]) ).
cnf(c_2,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
file('/export/starexec/sandbox/tmp/iprover_modulo_f8a40b.p',c_0_36) ).
cnf(c_16,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_50,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_63,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_68,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_88,negated_conjecture,
~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_34725,plain,
( ~ p2(f8(f9(c4),c4),f8(c4,f9(c4)))
| ~ p2(f9(c3),f9(c3)) ),
inference(resolution,[status(thm)],[c_357,c_88]) ).
cnf(c_34726,plain,
( ~ p2(f8(f9(c4),c4),f8(c4,f9(c4)))
| ~ p2(f9(c3),f9(c3)) ),
inference(rewriting,[status(thm)],[c_34725]) ).
cnf(c_7,negated_conjecture,
p2(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_f8a40b.p',c_0_43) ).
cnf(c_26,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_55,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_58,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_73,negated_conjecture,
p2(X0,X0),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_98,plain,
p2(X0,X0),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_35779,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_34726,c_98,c_96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN553-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 13:56:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % Orientation found
% 0.12/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_16697e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_f8a40b.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_02b2ca | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.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_16697e.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 true
% 0.20/0.43 % Has equality false
% 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
% 1.04/1.21 % --inst_prop_sim_new false
% 1.04/1.21 % --inst_orphan_elimination true
% 1.04/1.21 % --inst_learning_loop_flag true
% 1.04/1.21 % --inst_learning_start 3000
% 1.04/1.21 % --inst_learning_factor 2
% 1.04/1.21 % --inst_start_prop_sim_after_learn 3
% 1.04/1.21 % --inst_sel_renew solver
% 1.04/1.21 % --inst_lit_activity_flag true
% 1.04/1.21 % --inst_out_proof true
% 1.04/1.21
% 1.04/1.21 % ------ Resolution Options
% 1.04/1.21
% 1.04/1.21 % --resolution_flag true
% 1.04/1.21 % --res_lit_sel kbo_max
% 1.04/1.21 % --res_to_prop_solver none
% 1.04/1.21 % --res_prop_simpl_new false
% 1.04/1.21 % --res_prop_simpl_given false
% 1.04/1.21 % --res_passive_queue_type priority_queues
% 1.04/1.21 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.04/1.21 % --res_passive_queues_freq [15;5]
% 1.04/1.21 % --res_forward_subs full
% 1.04/1.21 % --res_backward_subs full
% 1.04/1.21 % --res_forward_subs_resolution true
% 1.04/1.21 % --res_backward_subs_resolution true
% 1.04/1.21 % --res_orphan_elimination false
% 1.04/1.21 % --res_time_limit 1000.
% 1.04/1.21 % --res_out_proof true
% 1.04/1.21 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_16697e.s
% 1.04/1.21 % --modulo true
% 1.04/1.21
% 1.04/1.21 % ------ Combination Options
% 1.04/1.21
% 1.04/1.21 % --comb_res_mult 1000
% 1.04/1.21 % --comb_inst_mult 300
% 1.04/1.21 % ------
% 1.04/1.21
% 1.04/1.21
% 1.04/1.21
% 1.04/1.21 % ------ Proving...
% 1.04/1.21 %
% 1.04/1.21
% 1.04/1.21
% 1.04/1.21 % Resolution empty clause
% 1.04/1.21
% 1.04/1.21 % ------ Statistics
% 1.04/1.21
% 1.04/1.21 % ------ General
% 1.04/1.21
% 1.04/1.21 % num_of_input_clauses: 9
% 1.04/1.21 % num_of_input_neg_conjectures: 9
% 1.04/1.21 % num_of_splits: 0
% 1.04/1.21 % num_of_split_atoms: 0
% 1.04/1.21 % num_of_sem_filtered_clauses: 0
% 1.04/1.21 % num_of_subtypes: 0
% 1.04/1.21 % monotx_restored_types: 0
% 1.04/1.21 % sat_num_of_epr_types: 0
% 1.04/1.21 % sat_num_of_non_cyclic_types: 0
% 1.04/1.21 % sat_guarded_non_collapsed_types: 0
% 1.04/1.21 % is_epr: 0
% 1.04/1.21 % is_horn: 1
% 1.04/1.21 % has_eq: 0
% 1.04/1.21 % num_pure_diseq_elim: 0
% 1.04/1.21 % simp_replaced_by: 0
% 1.04/1.21 % res_preprocessed: 18
% 1.04/1.21 % prep_upred: 0
% 1.04/1.21 % prep_unflattend: 0
% 1.04/1.21 % pred_elim_cands: 0
% 1.04/1.21 % pred_elim: 0
% 1.04/1.21 % pred_elim_cl: 0
% 1.04/1.21 % pred_elim_cycles: 0
% 1.04/1.21 % forced_gc_time: 0
% 1.04/1.21 % gc_basic_clause_elim: 0
% 1.04/1.21 % parsing_time: 0.
% 1.04/1.21 % sem_filter_time: 0.
% 1.04/1.21 % pred_elim_time: 0.
% 1.04/1.21 % out_proof_time: 0.
% 1.04/1.21 % monotx_time: 0.
% 1.04/1.21 % subtype_inf_time: 0.
% 1.04/1.21 % unif_index_cands_time: 0.006
% 1.04/1.21 % unif_index_add_time: 0.
% 1.04/1.21 % total_time: 0.8
% 1.04/1.21 % num_of_symbols: 33
% 1.04/1.21 % num_of_terms: 32689
% 1.04/1.21
% 1.04/1.21 % ------ Propositional Solver
% 1.04/1.21
% 1.04/1.21 % prop_solver_calls: 1
% 1.04/1.21 % prop_fast_solver_calls: 39
% 1.04/1.21 % prop_num_of_clauses: 12
% 1.04/1.21 % prop_preprocess_simplified: 128
% 1.04/1.21 % prop_fo_subsumed: 0
% 1.04/1.21 % prop_solver_time: 0.
% 1.04/1.21 % prop_fast_solver_time: 0.
% 1.04/1.21 % prop_unsat_core_time: 0.
% 1.04/1.21
% 1.04/1.21 % ------ QBF
% 1.04/1.21
% 1.04/1.21 % qbf_q_res: 0
% 1.04/1.21 % qbf_num_tautologies: 0
% 1.04/1.21 % qbf_prep_cycles: 0
% 1.04/1.21
% 1.04/1.21 % ------ BMC1
% 1.04/1.21
% 1.04/1.21 % bmc1_current_bound: -1
% 1.04/1.21 % bmc1_last_solved_bound: -1
% 1.04/1.21 % bmc1_unsat_core_size: -1
% 1.04/1.21 % bmc1_unsat_core_parents_size: -1
% 1.04/1.21 % bmc1_merge_next_fun: 0
% 1.04/1.21 % bmc1_unsat_core_clauses_time: 0.
% 1.04/1.21
% 1.04/1.21 % ------ Instantiation
% 1.04/1.21
% 1.04/1.21 % inst_num_of_clauses: 9
% 1.04/1.21 % inst_num_in_passive: 0
% 1.04/1.21 % inst_num_in_active: 0
% 1.04/1.21 % inst_num_in_unprocessed: 9
% 1.04/1.21 % inst_num_of_loops: 0
% 1.04/1.21 % inst_num_of_learning_restarts: 0
% 1.04/1.21 % inst_num_moves_active_passive: 0
% 1.04/1.21 % inst_lit_activity: 0
% 1.04/1.21 % inst_lit_activity_moves: 0
% 1.04/1.21 % inst_num_tautologies: 0
% 1.04/1.21 % inst_num_prop_implied: 0
% 1.04/1.21 % inst_num_existing_simplified: 0
% 1.04/1.21 % inst_num_eq_res_simplified: 0
% 1.04/1.21 % inst_num_child_elim: 0
% 1.04/1.21 % inst_num_of_dismatching_blockings: 0
% 1.04/1.21 % inst_num_of_non_proper_insts: 0
% 1.04/1.21 % inst_num_of_duplicates: 0
% 1.04/1.21 % inst_inst_num_from_inst_to_res: 0
% 1.04/1.21 % inst_dismatching_checking_time: 0.
% 1.04/1.21
% 1.04/1.21 % ------ Resolution
% 1.04/1.21
% 1.04/1.21 % res_num_of_clauses: 15381
% 1.04/1.21 % res_num_in_passive: 15069
% 1.04/1.21 % res_num_in_active: 316
% 1.04/1.21 % res_num_of_loops: 321
% 1.04/1.21 % res_forward_subset_subsumed: 1670
% 1.04/1.21 % res_backward_subset_subsumed: 5
% 1.04/1.21 % res_forward_subsumed: 4
% 1.04/1.21 % res_backward_subsumed: 0
% 1.04/1.21 % res_forward_subsumption_resolution: 3
% 1.04/1.21 % res_backward_subsumption_resolution: 0
% 1.04/1.21 % res_clause_to_clause_subsumption: 11892
% 1.04/1.21 % res_orphan_elimination: 0
% 1.04/1.21 % res_tautology_del: 2
% 1.04/1.21 % res_num_eq_res_simplified: 0
% 1.04/1.21 % res_num_sel_changes: 0
% 1.04/1.21 % res_moves_from_active_to_pass: 0
% 1.04/1.21
% 1.04/1.21 % Status Unsatisfiable
% 1.04/1.21 % SZS status Unsatisfiable
% 1.04/1.21 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------