TSTP Solution File: SYN312-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN312-1 : TPTP v8.1.0. Bugfixed v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n016.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:26:28 EDT 2022
% Result : Unsatisfiable 14.59s 14.78s
% Output : CNFRefutation 14.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 106 ( 19 unt; 0 def)
% Number of atoms : 210 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 214 ( 110 ~; 104 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 187 ( 0 sgn 48 !; 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,
! [X1,X2,X3,X4] :
( p(X4,X1,X2)
| ~ p(X4,X3,X2)
| ~ p(X3,X1,X2) ),
file('<stdin>',clause1) ).
fof(c_0_1,negated_conjecture,
! [X2,X3,X4] :
( p(g(X4),X3,X2)
| ~ p(X4,X3,X2) ),
file('<stdin>',clause5) ).
fof(c_0_2,negated_conjecture,
! [X2,X3,X4] :
( p(X4,X3,f(X2))
| ~ p(X4,X3,X2) ),
file('<stdin>',clause4) ).
fof(c_0_3,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
file('<stdin>',clause8) ).
fof(c_0_4,negated_conjecture,
! [X2,X3,X4] :
( p(X3,X4,X2)
| ~ p(X4,X3,X2) ),
file('<stdin>',clause3) ).
fof(c_0_5,negated_conjecture,
! [X2,X3,X4] :
( p(X2,X3,X4)
| ~ p(X4,X3,X2) ),
file('<stdin>',clause2) ).
fof(c_0_6,negated_conjecture,
p(f(b),d,c),
file('<stdin>',clause7) ).
fof(c_0_7,negated_conjecture,
p(a,f(b),c),
file('<stdin>',clause6) ).
fof(c_0_8,negated_conjecture,
! [X1,X2,X3,X4] :
( p(X4,X1,X2)
| ~ p(X4,X3,X2)
| ~ p(X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_9,negated_conjecture,
! [X2,X3,X4] :
( p(g(X4),X3,X2)
| ~ p(X4,X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_10,negated_conjecture,
! [X2,X3,X4] :
( p(X4,X3,f(X2))
| ~ p(X4,X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_11,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_12,negated_conjecture,
! [X2,X3,X4] :
( p(X3,X4,X2)
| ~ p(X4,X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_13,negated_conjecture,
! [X2,X3,X4] :
( p(X2,X3,X4)
| ~ p(X4,X3,X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_14,negated_conjecture,
p(f(b),d,c),
c_0_6 ).
fof(c_0_15,negated_conjecture,
p(a,f(b),c),
c_0_7 ).
fof(c_0_16,negated_conjecture,
! [X5,X6,X7,X8] :
( p(X8,X5,X6)
| ~ p(X8,X7,X6)
| ~ p(X7,X5,X6) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_17,negated_conjecture,
! [X5,X6,X7] :
( p(g(X7),X6,X5)
| ~ p(X7,X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_18,negated_conjecture,
! [X5,X6,X7] :
( p(X7,X6,f(X5))
| ~ p(X7,X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_19,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
c_0_11 ).
fof(c_0_20,negated_conjecture,
! [X5,X6,X7] :
( p(X6,X7,X5)
| ~ p(X7,X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_21,negated_conjecture,
! [X5,X6,X7] :
( p(X5,X6,X7)
| ~ p(X7,X6,X5) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_22,negated_conjecture,
p(f(b),d,c),
c_0_14 ).
fof(c_0_23,negated_conjecture,
p(a,f(b),c),
c_0_15 ).
cnf(c_0_24,negated_conjecture,
( p(X4,X2,X3)
| ~ p(X1,X2,X3)
| ~ p(X4,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( p(g(X1),X2,X3)
| ~ p(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( p(X1,X2,f(X3))
| ~ p(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( p(X2,X1,X3)
| ~ p(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( p(X3,X2,X1)
| ~ p(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
p(f(b),d,c),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
p(a,f(b),c),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( p(X4,X2,X3)
| ~ p(X1,X2,X3)
| ~ p(X4,X1,X3) ),
c_0_24,
[final] ).
cnf(c_0_33,negated_conjecture,
( p(g(X1),X2,X3)
| ~ p(X1,X2,X3) ),
c_0_25,
[final] ).
cnf(c_0_34,negated_conjecture,
( p(X1,X2,f(X3))
| ~ p(X1,X2,X3) ),
c_0_26,
[final] ).
cnf(c_0_35,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
c_0_27,
[final] ).
cnf(c_0_36,negated_conjecture,
( p(X2,X1,X3)
| ~ p(X1,X2,X3) ),
c_0_28,
[final] ).
cnf(c_0_37,negated_conjecture,
( p(X3,X2,X1)
| ~ p(X1,X2,X3) ),
c_0_29,
[final] ).
cnf(c_0_38,negated_conjecture,
p(f(b),d,c),
c_0_30,
[final] ).
cnf(c_0_39,negated_conjecture,
p(a,f(b),c),
c_0_31,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_2,negated_conjecture,
( p(X0,X1,f(X2))
| ~ p(X0,X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dd326c.p',c_0_34) ).
cnf(c_14,negated_conjecture,
( p(X0,X1,f(X2))
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_44,negated_conjecture,
( p(X0,X1,f(X2))
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_55,negated_conjecture,
( p(X0,X1,f(X2))
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_60,negated_conjecture,
( p(X0,X1,f(X2))
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_68,negated_conjecture,
( p(X0,X1,f(X2))
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_1083802,plain,
( ~ p(c,X0,g(d))
| p(c,X0,f(g(d))) ),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_1083803,plain,
( ~ p(c,c,g(d))
| p(c,c,f(g(d))) ),
inference(instantiation,[status(thm)],[c_1083802]) ).
cnf(c_1,negated_conjecture,
( p(g(X0),X1,X2)
| ~ p(X0,X1,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dd326c.p',c_0_33) ).
cnf(c_12,negated_conjecture,
( p(g(X0),X1,X2)
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_43,negated_conjecture,
( p(g(X0),X1,X2)
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_56,negated_conjecture,
( p(g(X0),X1,X2)
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_59,negated_conjecture,
( p(g(X0),X1,X2)
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_67,negated_conjecture,
( p(g(X0),X1,X2)
| ~ p(X0,X1,X2) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_1083447,plain,
( p(g(c),X0,f(g(d)))
| ~ p(c,X0,f(g(d))) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_1083448,plain,
( p(g(c),c,f(g(d)))
| ~ p(c,c,f(g(d))) ),
inference(instantiation,[status(thm)],[c_1083447]) ).
cnf(c_1083295,plain,
( p(g(c),X0,f(g(a)))
| ~ p(c,X0,f(g(a))) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_1083296,plain,
( p(g(c),c,f(g(a)))
| ~ p(c,c,f(g(a))) ),
inference(instantiation,[status(thm)],[c_1083295]) ).
cnf(c_4,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X2,X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dd326c.p',c_0_37) ).
cnf(c_18,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X2,X1,X0) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_46,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X2,X1,X0) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_53,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X2,X1,X0) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_62,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X2,X1,X0) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_70,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X2,X1,X0) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_1083292,plain,
( ~ p(g(c),X0,f(g(d)))
| p(f(g(d)),X0,g(c)) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_1083293,plain,
( ~ p(g(c),c,f(g(d)))
| p(f(g(d)),c,g(c)) ),
inference(instantiation,[status(thm)],[c_1083292]) ).
cnf(c_3,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X1,X0,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dd326c.p',c_0_36) ).
cnf(c_16,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X1,X0,X2) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_45,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X1,X0,X2) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_54,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X1,X0,X2) ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_61,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X1,X0,X2) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_69,negated_conjecture,
( ~ p(X0,X1,X2)
| p(X1,X0,X2) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_1083244,plain,
( ~ p(f(g(a)),X0,f(g(c)))
| p(X0,f(g(a)),f(g(c))) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_1083245,plain,
( ~ p(f(g(a)),c,f(g(c)))
| p(c,f(g(a)),f(g(c))) ),
inference(instantiation,[status(thm)],[c_1083244]) ).
cnf(c_1083224,plain,
( ~ p(f(g(d)),X0,g(c))
| p(f(g(d)),X0,f(g(c))) ),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_1083225,plain,
( ~ p(f(g(d)),c,g(c))
| p(f(g(d)),c,f(g(c))) ),
inference(instantiation,[status(thm)],[c_1083224]) ).
cnf(c_1083221,plain,
( ~ p(g(c),X0,f(g(a)))
| p(f(g(a)),X0,g(c)) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_1083222,plain,
( ~ p(g(c),c,f(g(a)))
| p(f(g(a)),c,g(c)) ),
inference(instantiation,[status(thm)],[c_1083221]) ).
cnf(c_469028,plain,
( ~ p(f(g(a)),X0,g(c))
| p(f(g(a)),X0,f(g(c))) ),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_469029,plain,
( ~ p(f(g(a)),c,g(c))
| p(f(g(a)),c,f(g(c))) ),
inference(instantiation,[status(thm)],[c_469028]) ).
cnf(c_0,negated_conjecture,
( ~ p(X0,X1,X2)
| ~ p(X1,X3,X2)
| p(X0,X3,X2) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_dd326c.p',c_0_32) ).
cnf(c_10,negated_conjecture,
( ~ p(X0,X1,X2)
| ~ p(X1,X3,X2)
| p(X0,X3,X2) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_42,negated_conjecture,
( ~ p(X0,X1,X2)
| ~ p(X1,X3,X2)
| p(X0,X3,X2) ),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_57,negated_conjecture,
( ~ p(X0,X1,X2)
| ~ p(X1,X3,X2)
| p(X0,X3,X2) ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_58,negated_conjecture,
( ~ p(X0,X1,X2)
| ~ p(X1,X3,X2)
| p(X0,X3,X2) ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_66,negated_conjecture,
( ~ p(X0,X1,X2)
| ~ p(X1,X3,X2)
| p(X0,X3,X2) ),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_469017,plain,
( p(f(g(d)),f(g(a)),f(g(c)))
| ~ p(f(g(d)),X0,f(g(c)))
| ~ p(X0,f(g(a)),f(g(c))) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_469018,plain,
( p(f(g(d)),f(g(a)),f(g(c)))
| ~ p(f(g(d)),c,f(g(c)))
| ~ p(c,f(g(a)),f(g(c))) ),
inference(instantiation,[status(thm)],[c_469017]) ).
cnf(c_49272,plain,
( p(f(g(a)),f(g(d)),f(g(c)))
| ~ p(f(g(d)),f(g(a)),f(g(c))) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_49141,plain,
( ~ p(f(b),X0,g(d))
| ~ p(c,f(b),g(d))
| p(c,X0,g(d)) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_49146,plain,
( ~ p(f(b),c,g(d))
| ~ p(c,f(b),g(d))
| p(c,c,g(d)) ),
inference(instantiation,[status(thm)],[c_49141]) ).
cnf(c_49143,plain,
( p(f(b),c,g(d))
| ~ p(c,f(b),g(d)) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_48931,plain,
( ~ p(f(b),X0,f(g(a)))
| ~ p(c,f(b),f(g(a)))
| p(c,X0,f(g(a))) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_48936,plain,
( ~ p(f(b),c,f(g(a)))
| ~ p(c,f(b),f(g(a)))
| p(c,c,f(g(a))) ),
inference(instantiation,[status(thm)],[c_48931]) ).
cnf(c_48929,plain,
( ~ p(f(b),c,g(a))
| p(f(b),c,f(g(a))) ),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_48799,plain,
( ~ p(g(d),f(b),c)
| p(c,f(b),g(d)) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_48729,plain,
( p(f(b),c,g(a))
| ~ p(c,f(b),g(a)) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_48730,plain,
( ~ p(c,f(b),g(a))
| p(c,f(b),f(g(a))) ),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_48683,plain,
( p(g(d),f(b),c)
| ~ p(d,f(b),c) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_48662,plain,
( ~ p(g(a),f(b),c)
| p(c,f(b),g(a)) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_48647,plain,
( ~ p(f(b),d,c)
| p(d,f(b),c) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_48644,plain,
( p(g(a),f(b),c)
| ~ p(a,f(b),c) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_5,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
file('/export/starexec/sandbox/tmp/iprover_modulo_dd326c.p',c_0_35) ).
cnf(c_6,negated_conjecture,
p(f(b),d,c),
file('/export/starexec/sandbox/tmp/iprover_modulo_dd326c.p',c_0_38) ).
cnf(c_7,negated_conjecture,
p(a,f(b),c),
file('/export/starexec/sandbox/tmp/iprover_modulo_dd326c.p',c_0_39) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_1083803,c_1083448,c_1083296,c_1083293,c_1083245,c_1083225,c_1083222,c_469029,c_469018,c_49272,c_49146,c_49143,c_48936,c_48929,c_48799,c_48729,c_48730,c_48683,c_48662,c_48647,c_48644,c_5,c_6,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN312-1 : TPTP v8.1.0. Bugfixed v2.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 13:30:13 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42 % Orientation found
% 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/sandbox/tmp/iprover_proof_5c591b.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_dd326c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c97b9a | 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/sandbox/tmp/iprover_proof_5c591b.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...% successful
% 0.21/0.44
% 0.21/0.44 % ------ 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.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % ------ Problem Properties
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % EPR false
% 0.21/0.44 % Horn true
% 0.21/0.44 % Has equality false
% 0.21/0.44
% 0.21/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % % ------ Current options:
% 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.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 14.59/14.78 % --inst_prop_sim_new false
% 14.59/14.78 % --inst_orphan_elimination true
% 14.59/14.78 % --inst_learning_loop_flag true
% 14.59/14.78 % --inst_learning_start 3000
% 14.59/14.78 % --inst_learning_factor 2
% 14.59/14.78 % --inst_start_prop_sim_after_learn 3
% 14.59/14.78 % --inst_sel_renew solver
% 14.59/14.78 % --inst_lit_activity_flag true
% 14.59/14.78 % --inst_out_proof true
% 14.59/14.78
% 14.59/14.78 % ------ Resolution Options
% 14.59/14.78
% 14.59/14.78 % --resolution_flag true
% 14.59/14.78 % --res_lit_sel kbo_max
% 14.59/14.78 % --res_to_prop_solver none
% 14.59/14.78 % --res_prop_simpl_new false
% 14.59/14.78 % --res_prop_simpl_given false
% 14.59/14.78 % --res_passive_queue_type priority_queues
% 14.59/14.78 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 14.59/14.78 % --res_passive_queues_freq [15;5]
% 14.59/14.78 % --res_forward_subs full
% 14.59/14.78 % --res_backward_subs full
% 14.59/14.78 % --res_forward_subs_resolution true
% 14.59/14.78 % --res_backward_subs_resolution true
% 14.59/14.78 % --res_orphan_elimination false
% 14.59/14.78 % --res_time_limit 1000.
% 14.59/14.78 % --res_out_proof true
% 14.59/14.78 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5c591b.s
% 14.59/14.78 % --modulo true
% 14.59/14.78
% 14.59/14.78 % ------ Combination Options
% 14.59/14.78
% 14.59/14.78 % --comb_res_mult 1000
% 14.59/14.78 % --comb_inst_mult 300
% 14.59/14.78 % ------
% 14.59/14.78
% 14.59/14.78
% 14.59/14.78
% 14.59/14.78 % ------ Proving...
% 14.59/14.78 %
% 14.59/14.78
% 14.59/14.78
% 14.59/14.78 % ------ Statistics
% 14.59/14.78
% 14.59/14.78 % ------ General
% 14.59/14.78
% 14.59/14.78 % num_of_input_clauses: 8
% 14.59/14.78 % num_of_input_neg_conjectures: 8
% 14.59/14.78 % num_of_splits: 0
% 14.59/14.78 % num_of_split_atoms: 0
% 14.59/14.78 % num_of_sem_filtered_clauses: 0
% 14.59/14.78 % num_of_subtypes: 0
% 14.59/14.78 % monotx_restored_types: 0
% 14.59/14.78 % sat_num_of_epr_types: 0
% 14.59/14.78 % sat_num_of_non_cyclic_types: 0
% 14.59/14.78 % sat_guarded_non_collapsed_types: 0
% 14.59/14.78 % is_epr: 0
% 14.59/14.78 % is_horn: 1
% 14.59/14.78 % has_eq: 0
% 14.59/14.78 % num_pure_diseq_elim: 0
% 14.59/14.78 % simp_replaced_by: 0
% 14.59/14.78 % res_preprocessed: 16
% 14.59/14.78 % prep_upred: 0
% 14.59/14.78 % prep_unflattend: 0
% 14.59/14.78 % pred_elim_cands: 0
% 14.59/14.78 % pred_elim: 0
% 14.59/14.78 % pred_elim_cl: 0
% 14.59/14.78 % pred_elim_cycles: 0
% 14.59/14.78 % forced_gc_time: 0
% 14.59/14.78 % gc_basic_clause_elim: 0
% 14.59/14.78 % parsing_time: 0.
% 14.59/14.78 % sem_filter_time: 0.
% 14.59/14.78 % pred_elim_time: 0.
% 14.59/14.78 % out_proof_time: 0.002
% 14.59/14.78 % monotx_time: 0.
% 14.59/14.78 % subtype_inf_time: 0.
% 14.59/14.78 % unif_index_cands_time: 0.108
% 14.59/14.78 % unif_index_add_time: 0.009
% 14.59/14.78 % total_time: 14.351
% 14.59/14.78 % num_of_symbols: 32
% 14.59/14.78 % num_of_terms: 42215
% 14.59/14.78
% 14.59/14.78 % ------ Propositional Solver
% 14.59/14.78
% 14.59/14.78 % prop_solver_calls: 15
% 14.59/14.78 % prop_fast_solver_calls: 42
% 14.59/14.78 % prop_num_of_clauses: 1165
% 14.59/14.78 % prop_preprocess_simplified: 1279
% 14.59/14.78 % prop_fo_subsumed: 0
% 14.59/14.78 % prop_solver_time: 0.
% 14.59/14.78 % prop_fast_solver_time: 0.
% 14.59/14.78 % prop_unsat_core_time: 0.
% 14.59/14.78
% 14.59/14.78 % ------ QBF
% 14.59/14.78
% 14.59/14.78 % qbf_q_res: 0
% 14.59/14.78 % qbf_num_tautologies: 0
% 14.59/14.78 % qbf_prep_cycles: 0
% 14.59/14.78
% 14.59/14.78 % ------ BMC1
% 14.59/14.78
% 14.59/14.78 % bmc1_current_bound: -1
% 14.59/14.78 % bmc1_last_solved_bound: -1
% 14.59/14.78 % bmc1_unsat_core_size: -1
% 14.59/14.78 % bmc1_unsat_core_parents_size: -1
% 14.59/14.78 % bmc1_merge_next_fun: 0
% 14.59/14.78 % bmc1_unsat_core_clauses_time: 0.
% 14.59/14.78
% 14.59/14.78 % ------ Instantiation
% 14.59/14.78
% 14.59/14.78 % inst_num_of_clauses: 942
% 14.59/14.78 % inst_num_in_passive: 64
% 14.59/14.78 % inst_num_in_active: 726
% 14.59/14.78 % inst_num_in_unprocessed: 144
% 14.59/14.78 % inst_num_of_loops: 776
% 14.59/14.78 % inst_num_of_learning_restarts: 0
% 14.59/14.78 % inst_num_moves_active_passive: 38
% 14.59/14.78 % inst_lit_activity: 505
% 14.59/14.78 % inst_lit_activity_moves: 1
% 14.59/14.78 % inst_num_tautologies: 6
% 14.59/14.78 % inst_num_prop_implied: 0
% 14.59/14.78 % inst_num_existing_simplified: 0
% 14.59/14.78 % inst_num_eq_res_simplified: 0
% 14.59/14.78 % inst_num_child_elim: 0
% 14.59/14.78 % inst_num_of_dismatching_blockings: 61
% 14.59/14.78 % inst_num_of_non_proper_insts: 1082
% 14.59/14.78 % inst_num_of_duplicates: 86
% 14.59/14.78 % inst_inst_num_from_inst_to_res: 0
% 14.59/14.78 % inst_dismatching_checking_time: 0.004
% 14.59/14.78
% 14.59/14.78 % ------ Resolution
% 14.59/14.78
% 14.59/14.78 % res_num_of_clauses: 396083
% 14.59/14.78 % res_num_in_passive: 395027
% 14.59/14.78 % res_num_in_active: 2975
% 14.59/14.78 % res_num_of_loops: 3000
% 14.59/14.78 % res_forward_subset_subsumed: 131643
% 14.59/14.78 % res_backward_subset_subsumed: 1925
% 14.59/14.78 % res_forward_subsumed: 24
% 14.59/14.78 % res_backward_subsumed: 1
% 14.59/14.78 % res_forward_subsumption_resolution: 1
% 14.59/14.78 % res_backward_subsumption_resolution: 0
% 14.59/14.78 % res_clause_to_clause_subsumption: 117102
% 14.59/14.78 % res_orphan_elimination: 0
% 14.59/14.78 % res_tautology_del: 3892
% 14.59/14.78 % res_num_eq_res_simplified: 0
% 14.59/14.78 % res_num_sel_changes: 0
% 14.59/14.78 % res_moves_from_active_to_pass: 0
% 14.59/14.78
% 14.59/14.78 % Status Unsatisfiable
% 14.59/14.78 % SZS status Unsatisfiable
% 14.59/14.78 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------