TSTP Solution File: LCL066-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LCL066-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 11:30:15 EDT 2022
% Result : Unsatisfiable 133.27s 133.45s
% Output : CNFRefutation 133.27s
% 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(cn_49,axiom,
is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
input ).
fof(cn_49_0,plain,
! [X,Y] :
( is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X)))
| $false ),
inference(orientation,[status(thm)],[cn_49]) ).
cnf(cn_35,axiom,
is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
input ).
fof(cn_35_0,plain,
! [X,Y,Z] :
( is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z))))
| $false ),
inference(orientation,[status(thm)],[cn_35]) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X,implies(Y,X))),
input ).
fof(cn_18_0,plain,
! [X,Y] :
( is_a_theorem(implies(X,implies(Y,X)))
| $false ),
inference(orientation,[status(thm)],[cn_18]) ).
fof(def_lhs_atom1,axiom,
! [Y,X] :
( lhs_atom1(Y,X)
<=> is_a_theorem(implies(X,implies(Y,X))) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X,Y] :
( lhs_atom1(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[cn_18_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Z,Y,X] :
( lhs_atom2(Z,Y,X)
<=> is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X,Y,Z] :
( lhs_atom2(Z,Y,X)
| $false ),
inference(fold_definition,[status(thm)],[cn_35_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
! [Y,X] :
( lhs_atom3(Y,X)
<=> is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ),
inference(definition,[],]) ).
fof(to_be_clausified_2,plain,
! [X,Y] :
( lhs_atom3(Y,X)
| $false ),
inference(fold_definition,[status(thm)],[cn_49_0,def_lhs_atom3]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X3,X1,X2] :
( lhs_atom2(X3,X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
! [X1,X2] :
( lhs_atom3(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_2,axiom,
! [X1,X2] :
( lhs_atom1(X1,X2)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_3,plain,
! [X3,X1,X2] : lhs_atom2(X3,X1,X2),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_4,plain,
! [X1,X2] : lhs_atom3(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_5,plain,
! [X1,X2] : lhs_atom1(X1,X2),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_6,plain,
! [X4,X5,X6] : lhs_atom2(X4,X5,X6),
inference(variable_rename,[status(thm)],[c_0_3]) ).
fof(c_0_7,plain,
! [X3,X4] : lhs_atom3(X3,X4),
inference(variable_rename,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X3,X4] : lhs_atom1(X3,X4),
inference(variable_rename,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
lhs_atom2(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
lhs_atom3(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
lhs_atom1(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
lhs_atom2(X1,X2,X3),
c_0_9,
[final] ).
cnf(c_0_13,plain,
lhs_atom3(X1,X2),
c_0_10,
[final] ).
cnf(c_0_14,plain,
lhs_atom1(X1,X2),
c_0_11,
[final] ).
% End CNF derivation
cnf(c_0_12_0,axiom,
is_a_theorem(implies(implies(X3,implies(X2,X1)),implies(implies(X3,X2),implies(X3,X1)))),
inference(unfold_definition,[status(thm)],[c_0_12,def_lhs_atom2]) ).
cnf(c_0_13_0,axiom,
is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))),
inference(unfold_definition,[status(thm)],[c_0_13,def_lhs_atom3]) ).
cnf(c_0_14_0,axiom,
is_a_theorem(implies(X2,implies(X1,X2))),
inference(unfold_definition,[status(thm)],[c_0_14,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2] :
( ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(X1) ),
file('<stdin>',condensed_detachment) ).
fof(c_0_1_002,plain,
! [X1,X2] :
( ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_003,plain,
! [X3,X4] :
( ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(X4)
| is_a_theorem(X3) ),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3_004,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
c_0_3,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_4_0,axiom,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_1,axiom,
( ~ is_a_theorem(X2)
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_2,axiom,
( ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(X1) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_006,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('<stdin>',prove_cn_3) ).
fof(c_0_1_007,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_008,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
c_0_1 ).
cnf(c_0_3_009,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_010,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_6,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_297d7f.p',c_0_4) ).
cnf(c_10,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_14,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_15,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_16,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_36,plain,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_0,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_297d7f.p',c_0_4_0) ).
cnf(c_24,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_40,plain,
( ~ is_a_theorem(implies(X0,implies(a,implies(not(a),b))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_36,c_24]) ).
cnf(c_41,plain,
( ~ is_a_theorem(implies(X0,implies(a,implies(not(a),b))))
| ~ is_a_theorem(X0) ),
inference(rewriting,[status(thm)],[c_40]) ).
cnf(c_46,plain,
( ~ is_a_theorem(implies(X0,implies(X1,implies(a,implies(not(a),b)))))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_41,c_24]) ).
cnf(c_47,plain,
( ~ is_a_theorem(implies(X0,implies(X1,implies(a,implies(not(a),b)))))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(rewriting,[status(thm)],[c_46]) ).
cnf(c_5,plain,
is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_297d7f.p',c_0_12_0) ).
cnf(c_34,plain,
is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_72,plain,
( ~ is_a_theorem(implies(a,implies(X0,implies(not(a),b))))
| ~ is_a_theorem(implies(a,X0)) ),
inference(resolution,[status(thm)],[c_47,c_34]) ).
cnf(c_73,plain,
( ~ is_a_theorem(implies(a,implies(X0,implies(not(a),b))))
| ~ is_a_theorem(implies(a,X0)) ),
inference(rewriting,[status(thm)],[c_72]) ).
cnf(c_104,plain,
( ~ is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(X1,implies(a,implies(X0,implies(not(a),b)))))
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_73,c_24]) ).
cnf(c_105,plain,
( ~ is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(X1,implies(a,implies(X0,implies(not(a),b)))))
| ~ is_a_theorem(X1) ),
inference(rewriting,[status(thm)],[c_104]) ).
cnf(c_3,plain,
is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_297d7f.p',c_0_14_0) ).
cnf(c_30,plain,
is_a_theorem(implies(X0,implies(X1,X0))),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_186,plain,
( ~ is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(X0,implies(not(a),b))) ),
inference(resolution,[status(thm)],[c_105,c_30]) ).
cnf(c_187,plain,
( ~ is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(X0,implies(not(a),b))) ),
inference(rewriting,[status(thm)],[c_186]) ).
cnf(c_268,plain,
( ~ is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(X1,implies(X0,implies(not(a),b))))
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_187,c_24]) ).
cnf(c_269,plain,
( ~ is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(X1,implies(X0,implies(not(a),b))))
| ~ is_a_theorem(X1) ),
inference(rewriting,[status(thm)],[c_268]) ).
cnf(c_560,plain,
( ~ is_a_theorem(implies(not(a),implies(X0,b)))
| ~ is_a_theorem(implies(a,implies(not(a),X0))) ),
inference(resolution,[status(thm)],[c_269,c_34]) ).
cnf(c_561,plain,
( ~ is_a_theorem(implies(not(a),implies(X0,b)))
| ~ is_a_theorem(implies(a,implies(not(a),X0))) ),
inference(rewriting,[status(thm)],[c_560]) ).
cnf(c_1442,plain,
( ~ is_a_theorem(implies(a,implies(not(a),X0)))
| ~ is_a_theorem(implies(X1,implies(not(a),implies(X0,b))))
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_561,c_24]) ).
cnf(c_1443,plain,
( ~ is_a_theorem(implies(a,implies(not(a),X0)))
| ~ is_a_theorem(implies(X1,implies(not(a),implies(X0,b))))
| ~ is_a_theorem(X1) ),
inference(rewriting,[status(thm)],[c_1442]) ).
cnf(c_2598,plain,
( ~ is_a_theorem(implies(a,implies(not(a),X0)))
| ~ is_a_theorem(implies(X1,implies(X2,implies(not(a),implies(X0,b)))))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_1443,c_24]) ).
cnf(c_2599,plain,
( ~ is_a_theorem(implies(a,implies(not(a),X0)))
| ~ is_a_theorem(implies(X1,implies(X2,implies(not(a),implies(X0,b)))))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(rewriting,[status(thm)],[c_2598]) ).
cnf(c_6150,plain,
( ~ is_a_theorem(implies(not(a),implies(X0,implies(X1,b))))
| ~ is_a_theorem(implies(not(a),X0))
| ~ is_a_theorem(implies(a,implies(not(a),X1))) ),
inference(resolution,[status(thm)],[c_2599,c_34]) ).
cnf(c_6151,plain,
( ~ is_a_theorem(implies(not(a),implies(X0,implies(X1,b))))
| ~ is_a_theorem(implies(not(a),X0))
| ~ is_a_theorem(implies(a,implies(not(a),X1))) ),
inference(rewriting,[status(thm)],[c_6150]) ).
cnf(c_19346,plain,
( ~ is_a_theorem(implies(not(a),X0))
| ~ is_a_theorem(implies(a,implies(not(a),X1)))
| ~ is_a_theorem(implies(X2,implies(not(a),implies(X0,implies(X1,b)))))
| ~ is_a_theorem(X2) ),
inference(resolution,[status(thm)],[c_6151,c_24]) ).
cnf(c_19347,plain,
( ~ is_a_theorem(implies(not(a),X0))
| ~ is_a_theorem(implies(a,implies(not(a),X1)))
| ~ is_a_theorem(implies(X2,implies(not(a),implies(X0,implies(X1,b)))))
| ~ is_a_theorem(X2) ),
inference(rewriting,[status(thm)],[c_19346]) ).
cnf(c_45603,plain,
( ~ is_a_theorem(implies(not(a),X0))
| ~ is_a_theorem(implies(a,implies(not(a),X1)))
| ~ is_a_theorem(implies(X0,implies(X1,b))) ),
inference(resolution,[status(thm)],[c_19347,c_30]) ).
cnf(c_45604,plain,
( ~ is_a_theorem(implies(not(a),X0))
| ~ is_a_theorem(implies(a,implies(not(a),X1)))
| ~ is_a_theorem(implies(X0,implies(X1,b))) ),
inference(rewriting,[status(thm)],[c_45603]) ).
cnf(c_4,plain,
is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/tmp/iprover_modulo_297d7f.p',c_0_13_0) ).
cnf(c_32,plain,
is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_85543,plain,
( ~ is_a_theorem(implies(not(a),implies(not(b),not(X0))))
| ~ is_a_theorem(implies(a,implies(not(a),X0))) ),
inference(resolution,[status(thm)],[c_45604,c_32]) ).
cnf(c_85544,plain,
( ~ is_a_theorem(implies(not(a),implies(not(b),not(X0))))
| ~ is_a_theorem(implies(a,implies(not(a),X0))) ),
inference(rewriting,[status(thm)],[c_85543]) ).
cnf(c_368986,plain,
~ is_a_theorem(implies(a,implies(not(a),a))),
inference(resolution,[status(thm)],[c_85544,c_30]) ).
cnf(c_368987,plain,
~ is_a_theorem(implies(a,implies(not(a),a))),
inference(rewriting,[status(thm)],[c_368986]) ).
cnf(c_939661,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_368987,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL066-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 2 14:01:29 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f6e651.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_297d7f.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_5bd545 | 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.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f6e651.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ 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.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn true
% 0.20/0.42 % Has equality false
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 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.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
% 133.27/133.45 % --inst_prop_sim_new false
% 133.27/133.45 % --inst_orphan_elimination true
% 133.27/133.45 % --inst_learning_loop_flag true
% 133.27/133.45 % --inst_learning_start 3000
% 133.27/133.45 % --inst_learning_factor 2
% 133.27/133.45 % --inst_start_prop_sim_after_learn 3
% 133.27/133.45 % --inst_sel_renew solver
% 133.27/133.45 % --inst_lit_activity_flag true
% 133.27/133.45 % --inst_out_proof true
% 133.27/133.45
% 133.27/133.45 % ------ Resolution Options
% 133.27/133.45
% 133.27/133.45 % --resolution_flag true
% 133.27/133.45 % --res_lit_sel kbo_max
% 133.27/133.45 % --res_to_prop_solver none
% 133.27/133.45 % --res_prop_simpl_new false
% 133.27/133.45 % --res_prop_simpl_given false
% 133.27/133.45 % --res_passive_queue_type priority_queues
% 133.27/133.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 133.27/133.45 % --res_passive_queues_freq [15;5]
% 133.27/133.45 % --res_forward_subs full
% 133.27/133.45 % --res_backward_subs full
% 133.27/133.45 % --res_forward_subs_resolution true
% 133.27/133.45 % --res_backward_subs_resolution true
% 133.27/133.45 % --res_orphan_elimination false
% 133.27/133.45 % --res_time_limit 1000.
% 133.27/133.45 % --res_out_proof true
% 133.27/133.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f6e651.s
% 133.27/133.45 % --modulo true
% 133.27/133.45
% 133.27/133.45 % ------ Combination Options
% 133.27/133.45
% 133.27/133.45 % --comb_res_mult 1000
% 133.27/133.45 % --comb_inst_mult 300
% 133.27/133.45 % ------
% 133.27/133.45
% 133.27/133.45
% 133.27/133.45
% 133.27/133.45 % ------ Proving...
% 133.27/133.45 %
% 133.27/133.45
% 133.27/133.45
% 133.27/133.45 % Resolution empty clause
% 133.27/133.45
% 133.27/133.45 % ------ Statistics
% 133.27/133.45
% 133.27/133.45 % ------ General
% 133.27/133.45
% 133.27/133.45 % num_of_input_clauses: 7
% 133.27/133.45 % num_of_input_neg_conjectures: 1
% 133.27/133.45 % num_of_splits: 0
% 133.27/133.45 % num_of_split_atoms: 0
% 133.27/133.45 % num_of_sem_filtered_clauses: 0
% 133.27/133.45 % num_of_subtypes: 0
% 133.27/133.45 % monotx_restored_types: 0
% 133.27/133.45 % sat_num_of_epr_types: 0
% 133.27/133.45 % sat_num_of_non_cyclic_types: 0
% 133.27/133.45 % sat_guarded_non_collapsed_types: 0
% 133.27/133.45 % is_epr: 0
% 133.27/133.45 % is_horn: 1
% 133.27/133.45 % has_eq: 0
% 133.27/133.45 % num_pure_diseq_elim: 0
% 133.27/133.45 % simp_replaced_by: 0
% 133.27/133.45 % res_preprocessed: 2
% 133.27/133.45 % prep_upred: 0
% 133.27/133.45 % prep_unflattend: 0
% 133.27/133.45 % pred_elim_cands: 0
% 133.27/133.45 % pred_elim: 0
% 133.27/133.45 % pred_elim_cl: 0
% 133.27/133.45 % pred_elim_cycles: 0
% 133.27/133.45 % forced_gc_time: 0
% 133.27/133.45 % gc_basic_clause_elim: 0
% 133.27/133.45 % parsing_time: 0.
% 133.27/133.45 % sem_filter_time: 0.
% 133.27/133.45 % pred_elim_time: 0.
% 133.27/133.45 % out_proof_time: 0.001
% 133.27/133.45 % monotx_time: 0.
% 133.27/133.45 % subtype_inf_time: 0.
% 133.27/133.45 % unif_index_cands_time: 0.651
% 133.27/133.45 % unif_index_add_time: 0.124
% 133.27/133.45 % total_time: 133.042
% 133.27/133.45 % num_of_symbols: 30
% 133.27/133.45 % num_of_terms: 1933751
% 133.27/133.45
% 133.27/133.45 % ------ Propositional Solver
% 133.27/133.45
% 133.27/133.45 % prop_solver_calls: 64
% 133.27/133.45 % prop_fast_solver_calls: 3
% 133.27/133.45 % prop_num_of_clauses: 83033
% 133.27/133.45 % prop_preprocess_simplified: 165466
% 133.27/133.45 % prop_fo_subsumed: 0
% 133.27/133.45 % prop_solver_time: 0.053
% 133.27/133.45 % prop_fast_solver_time: 0.
% 133.27/133.45 % prop_unsat_core_time: 0.
% 133.27/133.45
% 133.27/133.45 % ------ QBF
% 133.27/133.45
% 133.27/133.45 % qbf_q_res: 0
% 133.27/133.45 % qbf_num_tautologies: 0
% 133.27/133.45 % qbf_prep_cycles: 0
% 133.27/133.45
% 133.27/133.45 % ------ BMC1
% 133.27/133.45
% 133.27/133.45 % bmc1_current_bound: -1
% 133.27/133.45 % bmc1_last_solved_bound: -1
% 133.27/133.45 % bmc1_unsat_core_size: -1
% 133.27/133.45 % bmc1_unsat_core_parents_size: -1
% 133.27/133.45 % bmc1_merge_next_fun: 0
% 133.27/133.45 % bmc1_unsat_core_clauses_time: 0.
% 133.27/133.45
% 133.27/133.45 % ------ Instantiation
% 133.27/133.45
% 133.27/133.45 % inst_num_of_clauses: 38471
% 133.27/133.45 % inst_num_in_passive: 28504
% 133.27/133.45 % inst_num_in_active: 3102
% 133.27/133.45 % inst_num_in_unprocessed: 6840
% 133.27/133.45 % inst_num_of_loops: 3299
% 133.27/133.45 % inst_num_of_learning_restarts: 1
% 133.27/133.45 % inst_num_moves_active_passive: 170
% 133.27/133.45 % inst_lit_activity: 2850
% 133.27/133.45 % inst_lit_activity_moves: 4
% 133.27/133.45 % inst_num_tautologies: 25
% 133.27/133.45 % inst_num_prop_implied: 0
% 133.27/133.45 % inst_num_existing_simplified: 0
% 133.27/133.45 % inst_num_eq_res_simplified: 0
% 133.27/133.45 % inst_num_child_elim: 0
% 133.27/133.45 % inst_num_of_dismatching_blockings: 226372
% 133.27/133.45 % inst_num_of_non_proper_insts: 34063
% 133.27/133.45 % inst_num_of_duplicates: 58612
% 133.27/133.45 % inst_inst_num_from_inst_to_res: 0
% 133.27/133.45 % inst_dismatching_checking_time: 3.27
% 133.27/133.45
% 133.27/133.45 % ------ Resolution
% 133.27/133.45
% 133.27/133.45 % res_num_of_clauses: 44364
% 133.27/133.45 % res_num_in_passive: 24157
% 133.27/133.45 % res_num_in_active: 20093
% 133.27/133.45 % res_num_of_loops: 21553
% 133.27/133.45 % res_forward_subset_subsumed: 8403
% 133.27/133.45 % res_backward_subset_subsumed: 163
% 133.27/133.45 % res_forward_subsumed: 1169
% 133.27/133.45 % res_backward_subsumed: 25
% 133.27/133.45 % res_forward_subsumption_resolution: 279
% 133.27/133.45 % res_backward_subsumption_resolution: 0
% 133.27/133.45 % res_clause_to_clause_subsumption: 5578567
% 133.27/133.45 % res_orphan_elimination: 0
% 133.27/133.45 % res_tautology_del: 0
% 133.27/133.45 % res_num_eq_res_simplified: 0
% 133.27/133.45 % res_num_sel_changes: 0
% 133.27/133.45 % res_moves_from_active_to_pass: 0
% 133.27/133.45
% 133.27/133.45 % Status Unsatisfiable
% 133.27/133.45 % SZS status Unsatisfiable
% 133.27/133.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------