TSTP Solution File: SWV009-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n011.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 : Wed Jul 20 19:07:00 EDT 2022
% Result : Unsatisfiable 0.22s 0.46s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 112 ( 58 unt; 0 def)
% Number of atoms : 251 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 292 ( 153 ~; 139 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 88 ( 0 sgn 24 !; 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] :
( ~ less_or_equal(m,X2)
| ~ less(X2,i)
| ~ less(j,X1)
| ~ less_or_equal(X1,n)
| less_or_equal(a(X2),a(X1)) ),
file('<stdin>',clause_6) ).
fof(c_0_1,negated_conjecture,
! [X1,X2] :
( ~ less_or_equal(i,X2)
| ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,n)
| less_or_equal(a(X2),a(X1)) ),
file('<stdin>',clause_8) ).
fof(c_0_2,negated_conjecture,
! [X1,X2] :
( ~ less_or_equal(m,X2)
| ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,j)
| less_or_equal(a(X2),a(X1)) ),
file('<stdin>',clause_7) ).
fof(c_0_3,negated_conjecture,
~ less_or_equal(a(p),a(q)),
file('<stdin>',clause_9) ).
fof(c_0_4,negated_conjecture,
! [X1,X2] :
( less_or_equal(X2,X1)
| less(X1,X2) ),
file('<stdin>',clause_1) ).
fof(c_0_5,negated_conjecture,
less_or_equal(q,n),
file('<stdin>',clause_5) ).
fof(c_0_6,negated_conjecture,
less_or_equal(p,q),
file('<stdin>',clause_4) ).
fof(c_0_7,negated_conjecture,
less_or_equal(m,p),
file('<stdin>',clause_3) ).
fof(c_0_8,negated_conjecture,
less(j,i),
file('<stdin>',clause_2) ).
fof(c_0_9,negated_conjecture,
! [X1,X2] :
( ~ less_or_equal(m,X2)
| ~ less(X2,i)
| ~ less(j,X1)
| ~ less_or_equal(X1,n)
| less_or_equal(a(X2),a(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_10,negated_conjecture,
! [X1,X2] :
( ~ less_or_equal(i,X2)
| ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,n)
| less_or_equal(a(X2),a(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_11,negated_conjecture,
! [X1,X2] :
( ~ less_or_equal(m,X2)
| ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,j)
| less_or_equal(a(X2),a(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_12,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_13,negated_conjecture,
! [X1,X2] :
( less_or_equal(X2,X1)
| less(X1,X2) ),
c_0_4 ).
fof(c_0_14,negated_conjecture,
less_or_equal(q,n),
c_0_5 ).
fof(c_0_15,negated_conjecture,
less_or_equal(p,q),
c_0_6 ).
fof(c_0_16,negated_conjecture,
less_or_equal(m,p),
c_0_7 ).
fof(c_0_17,negated_conjecture,
less(j,i),
c_0_8 ).
fof(c_0_18,negated_conjecture,
! [X3,X4] :
( ~ less_or_equal(m,X4)
| ~ less(X4,i)
| ~ less(j,X3)
| ~ less_or_equal(X3,n)
| less_or_equal(a(X4),a(X3)) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_19,negated_conjecture,
! [X3,X4] :
( ~ less_or_equal(i,X4)
| ~ less_or_equal(X4,X3)
| ~ less_or_equal(X3,n)
| less_or_equal(a(X4),a(X3)) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_20,negated_conjecture,
! [X3,X4] :
( ~ less_or_equal(m,X4)
| ~ less_or_equal(X4,X3)
| ~ less_or_equal(X3,j)
| less_or_equal(a(X4),a(X3)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_21,negated_conjecture,
~ less_or_equal(a(p),a(q)),
c_0_12 ).
fof(c_0_22,negated_conjecture,
! [X3,X4] :
( less_or_equal(X4,X3)
| less(X3,X4) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_23,negated_conjecture,
less_or_equal(q,n),
c_0_14 ).
fof(c_0_24,negated_conjecture,
less_or_equal(p,q),
c_0_15 ).
fof(c_0_25,negated_conjecture,
less_or_equal(m,p),
c_0_16 ).
fof(c_0_26,negated_conjecture,
less(j,i),
c_0_17 ).
cnf(c_0_27,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(X2,n)
| ~ less(j,X2)
| ~ less(X1,i)
| ~ less_or_equal(m,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(X2,n)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(i,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(X2,j)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(m,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( less(X1,X2)
| less_or_equal(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
less_or_equal(q,n),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,negated_conjecture,
less_or_equal(p,q),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
less_or_equal(m,p),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
less(j,i),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(X2,n)
| ~ less(j,X2)
| ~ less(X1,i)
| ~ less_or_equal(m,X1) ),
c_0_27,
[final] ).
cnf(c_0_37,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(X2,n)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(i,X1) ),
c_0_28,
[final] ).
cnf(c_0_38,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(X2,j)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(m,X1) ),
c_0_29,
[final] ).
cnf(c_0_39,negated_conjecture,
~ less_or_equal(a(p),a(q)),
c_0_30,
[final] ).
cnf(c_0_40,negated_conjecture,
( less(X1,X2)
| less_or_equal(X2,X1) ),
c_0_31,
[final] ).
cnf(c_0_41,negated_conjecture,
less_or_equal(q,n),
c_0_32,
[final] ).
cnf(c_0_42,negated_conjecture,
less_or_equal(p,q),
c_0_33,
[final] ).
cnf(c_0_43,negated_conjecture,
less_or_equal(m,p),
c_0_34,
[final] ).
cnf(c_0_44,negated_conjecture,
less(j,i),
c_0_35,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_0,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_748b14.p',c_0_36) ).
cnf(c_13,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_49,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i) ),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_66,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_67,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i) ),
inference(copy,[status(esa)],[c_66]) ).
cnf(c_85,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i) ),
inference(copy,[status(esa)],[c_67]) ).
cnf(c_4,negated_conjecture,
~ less_or_equal(a(p),a(q)),
file('/export/starexec/sandbox/tmp/iprover_modulo_748b14.p',c_0_39) ).
cnf(c_21,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_53,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_62,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_71,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_93,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(copy,[status(esa)],[c_71]) ).
cnf(c_147,plain,
( ~ less_or_equal(m,p)
| ~ less_or_equal(q,n)
| ~ less(j,q)
| ~ less(p,i) ),
inference(resolution,[status(thm)],[c_85,c_93]) ).
cnf(c_148,plain,
( ~ less_or_equal(m,p)
| ~ less_or_equal(q,n)
| ~ less(j,q)
| ~ less(p,i) ),
inference(rewriting,[status(thm)],[c_147]) ).
cnf(c_5,negated_conjecture,
less_or_equal(q,n),
file('/export/starexec/sandbox/tmp/iprover_modulo_748b14.p',c_0_41) ).
cnf(c_23,negated_conjecture,
less_or_equal(q,n),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_54,negated_conjecture,
less_or_equal(q,n),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_61,negated_conjecture,
less_or_equal(q,n),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_72,negated_conjecture,
less_or_equal(q,n),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_95,negated_conjecture,
less_or_equal(q,n),
inference(copy,[status(esa)],[c_72]) ).
cnf(c_7,negated_conjecture,
less_or_equal(m,p),
file('/export/starexec/sandbox/tmp/iprover_modulo_748b14.p',c_0_43) ).
cnf(c_27,negated_conjecture,
less_or_equal(m,p),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_56,negated_conjecture,
less_or_equal(m,p),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_59,negated_conjecture,
less_or_equal(m,p),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_74,negated_conjecture,
less_or_equal(m,p),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_99,negated_conjecture,
less_or_equal(m,p),
inference(copy,[status(esa)],[c_74]) ).
cnf(c_165,plain,
( ~ less(j,q)
| ~ less(p,i) ),
inference(forward_subsumption_resolution,[status(thm)],[c_148,c_95,c_99]) ).
cnf(c_166,plain,
( ~ less(j,q)
| ~ less(p,i) ),
inference(rewriting,[status(thm)],[c_165]) ).
cnf(c_3,negated_conjecture,
( less_or_equal(X0,X1)
| less(X1,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_748b14.p',c_0_40) ).
cnf(c_19,negated_conjecture,
( less_or_equal(X0,X1)
| less(X1,X0) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_52,negated_conjecture,
( less_or_equal(X0,X1)
| less(X1,X0) ),
inference(copy,[status(esa)],[c_19]) ).
cnf(c_63,negated_conjecture,
( less_or_equal(X0,X1)
| less(X1,X0) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_70,negated_conjecture,
( less_or_equal(X0,X1)
| less(X1,X0) ),
inference(copy,[status(esa)],[c_63]) ).
cnf(c_91,negated_conjecture,
( less_or_equal(X0,X1)
| less(X1,X0) ),
inference(copy,[status(esa)],[c_70]) ).
cnf(c_169,plain,
( less_or_equal(i,p)
| ~ less(j,q) ),
inference(resolution,[status(thm)],[c_166,c_91]) ).
cnf(c_170,plain,
( less_or_equal(i,p)
| ~ less(j,q) ),
inference(rewriting,[status(thm)],[c_169]) ).
cnf(c_1,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_748b14.p',c_0_37) ).
cnf(c_15,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_50,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_65,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_68,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_65]) ).
cnf(c_87,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_68]) ).
cnf(c_125,plain,
( ~ less_or_equal(i,p)
| ~ less_or_equal(p,q)
| ~ less_or_equal(q,n) ),
inference(resolution,[status(thm)],[c_87,c_93]) ).
cnf(c_126,plain,
( ~ less_or_equal(i,p)
| ~ less_or_equal(p,q)
| ~ less_or_equal(q,n) ),
inference(rewriting,[status(thm)],[c_125]) ).
cnf(c_6,negated_conjecture,
less_or_equal(p,q),
file('/export/starexec/sandbox/tmp/iprover_modulo_748b14.p',c_0_42) ).
cnf(c_25,negated_conjecture,
less_or_equal(p,q),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_55,negated_conjecture,
less_or_equal(p,q),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_60,negated_conjecture,
less_or_equal(p,q),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_73,negated_conjecture,
less_or_equal(p,q),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_97,negated_conjecture,
less_or_equal(p,q),
inference(copy,[status(esa)],[c_73]) ).
cnf(c_152,plain,
~ less_or_equal(i,p),
inference(forward_subsumption_resolution,[status(thm)],[c_126,c_95,c_97]) ).
cnf(c_153,plain,
~ less_or_equal(i,p),
inference(rewriting,[status(thm)],[c_152]) ).
cnf(c_173,plain,
~ less(j,q),
inference(forward_subsumption_resolution,[status(thm)],[c_170,c_153]) ).
cnf(c_174,plain,
~ less(j,q),
inference(rewriting,[status(thm)],[c_173]) ).
cnf(c_176,plain,
less_or_equal(q,j),
inference(resolution,[status(thm)],[c_174,c_91]) ).
cnf(c_177,plain,
less_or_equal(q,j),
inference(rewriting,[status(thm)],[c_176]) ).
cnf(c_2,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_748b14.p',c_0_38) ).
cnf(c_17,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_51,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_17]) ).
cnf(c_64,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_69,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_64]) ).
cnf(c_89,negated_conjecture,
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1) ),
inference(copy,[status(esa)],[c_69]) ).
cnf(c_135,plain,
( ~ less_or_equal(m,p)
| ~ less_or_equal(p,q)
| ~ less_or_equal(q,j) ),
inference(resolution,[status(thm)],[c_89,c_93]) ).
cnf(c_136,plain,
( ~ less_or_equal(m,p)
| ~ less_or_equal(p,q)
| ~ less_or_equal(q,j) ),
inference(rewriting,[status(thm)],[c_135]) ).
cnf(c_158,plain,
~ less_or_equal(q,j),
inference(forward_subsumption_resolution,[status(thm)],[c_136,c_97,c_99]) ).
cnf(c_159,plain,
~ less_or_equal(q,j),
inference(rewriting,[status(thm)],[c_158]) ).
cnf(c_179,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_177,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : iprover_modulo %s %d
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 00:04:36 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Running in mono-core mode
% 0.22/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.42 % Orientation found
% 0.22/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_2a8704.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_748b14.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_843de9 | grep -v "SZS"
% 0.22/0.45
% 0.22/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.45
% 0.22/0.45 %
% 0.22/0.45 % ------ iProver source info
% 0.22/0.45
% 0.22/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.45 % git: non_committed_changes: true
% 0.22/0.45 % git: last_make_outside_of_git: true
% 0.22/0.45
% 0.22/0.45 %
% 0.22/0.45 % ------ Input Options
% 0.22/0.45
% 0.22/0.45 % --out_options all
% 0.22/0.45 % --tptp_safe_out true
% 0.22/0.45 % --problem_path ""
% 0.22/0.45 % --include_path ""
% 0.22/0.45 % --clausifier .//eprover
% 0.22/0.45 % --clausifier_options --tstp-format
% 0.22/0.45 % --stdin false
% 0.22/0.45 % --dbg_backtrace false
% 0.22/0.45 % --dbg_dump_prop_clauses false
% 0.22/0.45 % --dbg_dump_prop_clauses_file -
% 0.22/0.45 % --dbg_out_stat false
% 0.22/0.45
% 0.22/0.45 % ------ General Options
% 0.22/0.45
% 0.22/0.45 % --fof false
% 0.22/0.45 % --time_out_real 150.
% 0.22/0.45 % --time_out_prep_mult 0.2
% 0.22/0.45 % --time_out_virtual -1.
% 0.22/0.45 % --schedule none
% 0.22/0.45 % --ground_splitting input
% 0.22/0.45 % --splitting_nvd 16
% 0.22/0.45 % --non_eq_to_eq false
% 0.22/0.45 % --prep_gs_sim true
% 0.22/0.45 % --prep_unflatten false
% 0.22/0.45 % --prep_res_sim true
% 0.22/0.45 % --prep_upred true
% 0.22/0.45 % --res_sim_input true
% 0.22/0.45 % --clause_weak_htbl true
% 0.22/0.45 % --gc_record_bc_elim false
% 0.22/0.45 % --symbol_type_check false
% 0.22/0.45 % --clausify_out false
% 0.22/0.45 % --large_theory_mode false
% 0.22/0.45 % --prep_sem_filter none
% 0.22/0.45 % --prep_sem_filter_out false
% 0.22/0.45 % --preprocessed_out false
% 0.22/0.45 % --sub_typing false
% 0.22/0.45 % --brand_transform false
% 0.22/0.45 % --pure_diseq_elim true
% 0.22/0.45 % --min_unsat_core false
% 0.22/0.45 % --pred_elim true
% 0.22/0.45 % --add_important_lit false
% 0.22/0.45 % --soft_assumptions false
% 0.22/0.45 % --reset_solvers false
% 0.22/0.45 % --bc_imp_inh []
% 0.22/0.45 % --conj_cone_tolerance 1.5
% 0.22/0.45 % --prolific_symb_bound 500
% 0.22/0.45 % --lt_threshold 2000
% 0.22/0.45
% 0.22/0.45 % ------ SAT Options
% 0.22/0.45
% 0.22/0.45 % --sat_mode false
% 0.22/0.45 % --sat_fm_restart_options ""
% 0.22/0.45 % --sat_gr_def false
% 0.22/0.45 % --sat_epr_types true
% 0.22/0.45 % --sat_non_cyclic_types false
% 0.22/0.45 % --sat_finite_models false
% 0.22/0.45 % --sat_fm_lemmas false
% 0.22/0.45 % --sat_fm_prep false
% 0.22/0.45 % --sat_fm_uc_incr true
% 0.22/0.45 % --sat_out_model small
% 0.22/0.45 % --sat_out_clauses false
% 0.22/0.45
% 0.22/0.45 % ------ QBF Options
% 0.22/0.45
% 0.22/0.45 % --qbf_mode false
% 0.22/0.45 % --qbf_elim_univ true
% 0.22/0.45 % --qbf_sk_in true
% 0.22/0.45 % --qbf_pred_elim true
% 0.22/0.45 % --qbf_split 32
% 0.22/0.45
% 0.22/0.45 % ------ BMC1 Options
% 0.22/0.45
% 0.22/0.45 % --bmc1_incremental false
% 0.22/0.45 % --bmc1_axioms reachable_all
% 0.22/0.45 % --bmc1_min_bound 0
% 0.22/0.45 % --bmc1_max_bound -1
% 0.22/0.45 % --bmc1_max_bound_default -1
% 0.22/0.45 % --bmc1_symbol_reachability true
% 0.22/0.45 % --bmc1_property_lemmas false
% 0.22/0.45 % --bmc1_k_induction false
% 0.22/0.45 % --bmc1_non_equiv_states false
% 0.22/0.45 % --bmc1_deadlock false
% 0.22/0.45 % --bmc1_ucm false
% 0.22/0.45 % --bmc1_add_unsat_core none
% 0.22/0.45 % --bmc1_unsat_core_children false
% 0.22/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.45 % --bmc1_out_stat full
% 0.22/0.45 % --bmc1_ground_init false
% 0.22/0.45 % --bmc1_pre_inst_next_state false
% 0.22/0.45 % --bmc1_pre_inst_state false
% 0.22/0.45 % --bmc1_pre_inst_reach_state false
% 0.22/0.45 % --bmc1_out_unsat_core false
% 0.22/0.45 % --bmc1_aig_witness_out false
% 0.22/0.45 % --bmc1_verbose false
% 0.22/0.45 % --bmc1_dump_clauses_tptp false
% 0.22/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.45 % --bmc1_dump_file -
% 0.22/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.45 % --bmc1_ucm_extend_mode 1
% 0.22/0.45 % --bmc1_ucm_init_mode 2
% 0.22/0.45 % --bmc1_ucm_cone_mode none
% 0.22/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.45 % --bmc1_ucm_relax_model 4
% 0.22/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.45 % --bmc1_ucm_layered_model none
% 0.22/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.45
% 0.22/0.45 % ------ AIG Options
% 0.22/0.45
% 0.22/0.45 % --aig_mode false
% 0.22/0.45
% 0.22/0.45 % ------ Instantiation Options
% 0.22/0.45
% 0.22/0.45 % --instantiation_flag true
% 0.22/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.45 % --inst_solver_per_active 750
% 0.22/0.45 % --inst_solver_calls_frac 0.5
% 0.22/0.45 % --inst_passive_queue_type priority_queues
% 0.22/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.45 % --inst_passive_queues_freq [25;2]
% 0.22/0.45 % --inst_dismatching true
% 0.22/0.45 % --inst_eager_unprocessed_to_passive true
% 0.22/0.45 % --inst_prop_sim_given true
% 0.22/0.45 % --inst_prop_sim_new false
% 0.22/0.45 % --inst_orphan_elimination true
% 0.22/0.45 % --inst_learning_loop_flag true
% 0.22/0.45 % --inst_learning_start 3000
% 0.22/0.45 % --inst_learning_factor 2
% 0.22/0.45 % --inst_start_prop_sim_after_learn 3
% 0.22/0.45 % --inst_sel_renew solver
% 0.22/0.45 % --inst_lit_activity_flag true
% 0.22/0.45 % --inst_out_proof true
% 0.22/0.45
% 0.22/0.45 % ------ Resolution Options
% 0.22/0.45
% 0.22/0.45 % --resolution_flag true
% 0.22/0.45 % --res_lit_sel kbo_max
% 0.22/0.45 % --res_to_prop_solver none
% 0.22/0.45 % --res_prop_simpl_new false
% 0.22/0.45 % --res_prop_simpl_given false
% 0.22/0.45 % --res_passive_queue_type priority_queues
% 0.22/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.45 % --res_passive_queues_freq [15;5]
% 0.22/0.45 % --res_forward_subs full
% 0.22/0.45 % --res_backward_subs full
% 0.22/0.45 % --res_forward_subs_resolution true
% 0.22/0.45 % --res_backward_subs_resolution true
% 0.22/0.45 % --res_orphan_elimination false
% 0.22/0.45 % --res_time_limit 1000.
% 0.22/0.45 % --res_out_proof true
% 0.22/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_2a8704.s
% 0.22/0.45 % --modulo true
% 0.22/0.45
% 0.22/0.45 % ------ Combination Options
% 0.22/0.45
% 0.22/0.45 % --comb_res_mult 1000
% 0.22/0.45 % --comb_inst_mult 300
% 0.22/0.45 % ------
% 0.22/0.45
% 0.22/0.45 % ------ Parsing...% successful
% 0.22/0.45
% 0.22/0.45 % ------ 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.22/0.45
% 0.22/0.45 % ------ Proving...
% 0.22/0.45 % ------ Problem Properties
% 0.22/0.45
% 0.22/0.45 %
% 0.22/0.45 % EPR false
% 0.22/0.45 % Horn false
% 0.22/0.45 % Has equality false
% 0.22/0.45
% 0.22/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45 % % ------ Current options:
% 0.22/0.45
% 0.22/0.45 % ------ Input Options
% 0.22/0.45
% 0.22/0.45 % --out_options all
% 0.22/0.45 % --tptp_safe_out true
% 0.22/0.45 % --problem_path ""
% 0.22/0.45 % --include_path ""
% 0.22/0.45 % --clausifier .//eprover
% 0.22/0.45 % --clausifier_options --tstp-format
% 0.22/0.45 % --stdin false
% 0.22/0.45 % --dbg_backtrace false
% 0.22/0.45 % --dbg_dump_prop_clauses false
% 0.22/0.45 % --dbg_dump_prop_clauses_file -
% 0.22/0.45 % --dbg_out_stat false
% 0.22/0.45
% 0.22/0.45 % ------ General Options
% 0.22/0.45
% 0.22/0.45 % --fof false
% 0.22/0.45 % --time_out_real 150.
% 0.22/0.45 % --time_out_prep_mult 0.2
% 0.22/0.45 % --time_out_virtual -1.
% 0.22/0.45 % --schedule none
% 0.22/0.45 % --ground_splitting input
% 0.22/0.45 % --splitting_nvd 16
% 0.22/0.45 % --non_eq_to_eq false
% 0.22/0.45 % --prep_gs_sim true
% 0.22/0.45 % --prep_unflatten false
% 0.22/0.45 % --prep_res_sim true
% 0.22/0.45 % --prep_upred true
% 0.22/0.45 % --res_sim_input true
% 0.22/0.45 % --clause_weak_htbl true
% 0.22/0.45 % --gc_record_bc_elim false
% 0.22/0.45 % --symbol_type_check false
% 0.22/0.45 % --clausify_out false
% 0.22/0.45 % --large_theory_mode false
% 0.22/0.45 % --prep_sem_filter none
% 0.22/0.45 % --prep_sem_filter_out false
% 0.22/0.45 % --preprocessed_out false
% 0.22/0.45 % --sub_typing false
% 0.22/0.45 % --brand_transform false
% 0.22/0.45 % --pure_diseq_elim true
% 0.22/0.45 % --min_unsat_core false
% 0.22/0.45 % --pred_elim true
% 0.22/0.45 % --add_important_lit false
% 0.22/0.45 % --soft_assumptions false
% 0.22/0.45 % --reset_solvers false
% 0.22/0.45 % --bc_imp_inh []
% 0.22/0.45 % --conj_cone_tolerance 1.5
% 0.22/0.45 % --prolific_symb_bound 500
% 0.22/0.45 % --lt_threshold 2000
% 0.22/0.45
% 0.22/0.45 % ------ SAT Options
% 0.22/0.45
% 0.22/0.45 % --sat_mode false
% 0.22/0.45 % --sat_fm_restart_options ""
% 0.22/0.45 % --sat_gr_def false
% 0.22/0.45 % --sat_epr_types true
% 0.22/0.45 % --sat_non_cyclic_types false
% 0.22/0.45 % --sat_finite_models false
% 0.22/0.45 % --sat_fm_lemmas false
% 0.22/0.45 % --sat_fm_prep false
% 0.22/0.45 % --sat_fm_uc_incr true
% 0.22/0.45 % --sat_out_model small
% 0.22/0.45 % --sat_out_clauses false
% 0.22/0.45
% 0.22/0.45 % ------ QBF Options
% 0.22/0.45
% 0.22/0.45 % --qbf_mode false
% 0.22/0.45 % --qbf_elim_univ true
% 0.22/0.45 % --qbf_sk_in true
% 0.22/0.45 % --qbf_pred_elim true
% 0.22/0.45 % --qbf_split 32
% 0.22/0.45
% 0.22/0.45 % ------ BMC1 Options
% 0.22/0.45
% 0.22/0.45 % --bmc1_incremental false
% 0.22/0.45 % --bmc1_axioms reachable_all
% 0.22/0.45 % --bmc1_min_bound 0
% 0.22/0.45 % --bmc1_max_bound -1
% 0.22/0.45 % --bmc1_max_bound_default -1
% 0.22/0.45 % --bmc1_symbol_reachability true
% 0.22/0.45 % --bmc1_property_lemmas false
% 0.22/0.45 % --bmc1_k_induction false
% 0.22/0.45 % --bmc1_non_equiv_states false
% 0.22/0.45 % --bmc1_deadlock false
% 0.22/0.45 % --bmc1_ucm false
% 0.22/0.45 % --bmc1_add_unsat_core none
% 0.22/0.45 % --bmc1_unsat_core_children false
% 0.22/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.45 % --bmc1_out_stat full
% 0.22/0.45 % --bmc1_ground_init false
% 0.22/0.45 % --bmc1_pre_inst_next_state false
% 0.22/0.45 % --bmc1_pre_inst_state false
% 0.22/0.45 % --bmc1_pre_inst_reach_state false
% 0.22/0.45 % --bmc1_out_unsat_core false
% 0.22/0.45 % --bmc1_aig_witness_out false
% 0.22/0.45 % --bmc1_verbose false
% 0.22/0.45 % --bmc1_dump_clauses_tptp false
% 0.22/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.45 % --bmc1_dump_file -
% 0.22/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.45 % --bmc1_ucm_extend_mode 1
% 0.22/0.45 % --bmc1_ucm_init_mode 2
% 0.22/0.45 % --bmc1_ucm_cone_mode none
% 0.22/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.45 % --bmc1_ucm_relax_model 4
% 0.22/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.45 % --bmc1_ucm_layered_model none
% 0.22/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.45
% 0.22/0.45 % ------ AIG Options
% 0.22/0.45
% 0.22/0.45 % --aig_mode false
% 0.22/0.45
% 0.22/0.45 % ------ Instantiation Options
% 0.22/0.45
% 0.22/0.45 % --instantiation_flag true
% 0.22/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.45 % --inst_solver_per_active 750
% 0.22/0.45 % --inst_solver_calls_frac 0.5
% 0.22/0.45 % --inst_passive_queue_type priority_queues
% 0.22/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.45 % --inst_passive_queues_freq [25;2]
% 0.22/0.45 % --inst_dismatching true
% 0.22/0.45 % --inst_eager_unprocessed_to_passive true
% 0.22/0.45 % --inst_prop_sim_given true
% 0.22/0.45 % --inst_prop_sim_new false
% 0.22/0.45 % --inst_orphan_elimination true
% 0.22/0.45 % --inst_learning_loop_flag true
% 0.22/0.45 % --inst_learning_start 3000
% 0.22/0.45 % --inst_learning_factor 2
% 0.22/0.45 % --inst_start_prop_sim_after_learn 3
% 0.22/0.45 % --inst_sel_renew solver
% 0.22/0.45 % --inst_lit_activity_flag true
% 0.22/0.45 % --inst_out_proof true
% 0.22/0.45
% 0.22/0.45 % ------ Resolution Options
% 0.22/0.45
% 0.22/0.45 % --resolution_flag true
% 0.22/0.45 % --res_lit_sel kbo_max
% 0.22/0.45 % --res_to_prop_solver none
% 0.22/0.45 % --res_prop_simpl_new false
% 0.22/0.45 % --res_prop_simpl_given false
% 0.22/0.45 % --res_passive_queue_type priority_queues
% 0.22/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.45 % --res_passive_queues_freq [15;5]
% 0.22/0.45 % --res_forward_subs full
% 0.22/0.45 % --res_backward_subs full
% 0.22/0.45 % --res_forward_subs_resolution true
% 0.22/0.45 % --res_backward_subs_resolution true
% 0.22/0.45 % --res_orphan_elimination false
% 0.22/0.45 % --res_time_limit 1000.
% 0.22/0.45 % --res_out_proof true
% 0.22/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_2a8704.s
% 0.22/0.45 % --modulo true
% 0.22/0.45
% 0.22/0.45 % ------ Combination Options
% 0.22/0.45
% 0.22/0.45 % --comb_res_mult 1000
% 0.22/0.45 % --comb_inst_mult 300
% 0.22/0.45 % ------
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45 % ------ Proving...
% 0.22/0.45 %
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45 % Resolution empty clause
% 0.22/0.45
% 0.22/0.45 % ------ Statistics
% 0.22/0.45
% 0.22/0.45 % ------ General
% 0.22/0.45
% 0.22/0.45 % num_of_input_clauses: 9
% 0.22/0.45 % num_of_input_neg_conjectures: 9
% 0.22/0.45 % num_of_splits: 0
% 0.22/0.45 % num_of_split_atoms: 0
% 0.22/0.45 % num_of_sem_filtered_clauses: 0
% 0.22/0.45 % num_of_subtypes: 0
% 0.22/0.45 % monotx_restored_types: 0
% 0.22/0.45 % sat_num_of_epr_types: 0
% 0.22/0.45 % sat_num_of_non_cyclic_types: 0
% 0.22/0.45 % sat_guarded_non_collapsed_types: 0
% 0.22/0.45 % is_epr: 0
% 0.22/0.45 % is_horn: 0
% 0.22/0.45 % has_eq: 0
% 0.22/0.45 % num_pure_diseq_elim: 0
% 0.22/0.45 % simp_replaced_by: 0
% 0.22/0.45 % res_preprocessed: 18
% 0.22/0.45 % prep_upred: 0
% 0.22/0.45 % prep_unflattend: 0
% 0.22/0.45 % pred_elim_cands: 0
% 0.22/0.45 % pred_elim: 0
% 0.22/0.45 % pred_elim_cl: 0
% 0.22/0.45 % pred_elim_cycles: 0
% 0.22/0.45 % forced_gc_time: 0
% 0.22/0.45 % gc_basic_clause_elim: 0
% 0.22/0.45 % parsing_time: 0.
% 0.22/0.45 % sem_filter_time: 0.
% 0.22/0.45 % pred_elim_time: 0.
% 0.22/0.45 % out_proof_time: 0.003
% 0.22/0.45 % monotx_time: 0.
% 0.22/0.45 % subtype_inf_time: 0.
% 0.22/0.45 % unif_index_cands_time: 0.
% 0.22/0.45 % unif_index_add_time: 0.
% 0.22/0.45 % total_time: 0.025
% 0.22/0.45 % num_of_symbols: 34
% 0.22/0.45 % num_of_terms: 69
% 0.22/0.45
% 0.22/0.45 % ------ Propositional Solver
% 0.22/0.45
% 0.22/0.45 % prop_solver_calls: 1
% 0.22/0.45 % prop_fast_solver_calls: 60
% 0.22/0.45 % prop_num_of_clauses: 13
% 0.22/0.45 % prop_preprocess_simplified: 117
% 0.22/0.45 % prop_fo_subsumed: 0
% 0.22/0.45 % prop_solver_time: 0.
% 0.22/0.45 % prop_fast_solver_time: 0.
% 0.22/0.45 % prop_unsat_core_time: 0.
% 0.22/0.45
% 0.22/0.45 % ------ QBF
% 0.22/0.45
% 0.22/0.45 % qbf_q_res: 0
% 0.22/0.45 % qbf_num_tautologies: 0
% 0.22/0.45 % qbf_prep_cycles: 0
% 0.22/0.45
% 0.22/0.45 % ------ BMC1
% 0.22/0.45
% 0.22/0.45 % bmc1_current_bound: -1
% 0.22/0.45 % bmc1_last_solved_bound: -1
% 0.22/0.45 % bmc1_unsat_core_size: -1
% 0.22/0.45 % bmc1_unsat_core_parents_size: -1
% 0.22/0.45 % bmc1_merge_next_fun: 0
% 0.22/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.22/0.45
% 0.22/0.45 % ------ Instantiation
% 0.22/0.45
% 0.22/0.45 % inst_num_of_clauses: 9
% 0.22/0.45 % inst_num_in_passive: 0
% 0.22/0.45 % inst_num_in_active: 0
% 0.22/0.45 % inst_num_in_unprocessed: 9
% 0.22/0.45 % inst_num_of_loops: 0
% 0.22/0.46 % inst_num_of_learning_restarts: 0
% 0.22/0.46 % inst_num_moves_active_passive: 0
% 0.22/0.46 % inst_lit_activity: 0
% 0.22/0.46 % inst_lit_activity_moves: 0
% 0.22/0.46 % inst_num_tautologies: 0
% 0.22/0.46 % inst_num_prop_implied: 0
% 0.22/0.46 % inst_num_existing_simplified: 0
% 0.22/0.46 % inst_num_eq_res_simplified: 0
% 0.22/0.46 % inst_num_child_elim: 0
% 0.22/0.46 % inst_num_of_dismatching_blockings: 0
% 0.22/0.46 % inst_num_of_non_proper_insts: 0
% 0.22/0.46 % inst_num_of_duplicates: 0
% 0.22/0.46 % inst_inst_num_from_inst_to_res: 0
% 0.22/0.46 % inst_dismatching_checking_time: 0.
% 0.22/0.46
% 0.22/0.46 % ------ Resolution
% 0.22/0.46
% 0.22/0.46 % res_num_of_clauses: 13
% 0.22/0.46 % res_num_in_passive: 0
% 0.22/0.46 % res_num_in_active: 12
% 0.22/0.46 % res_num_of_loops: 14
% 0.22/0.46 % res_forward_subset_subsumed: 0
% 0.22/0.46 % res_backward_subset_subsumed: 1
% 0.22/0.46 % res_forward_subsumed: 0
% 0.22/0.46 % res_backward_subsumed: 0
% 0.22/0.46 % res_forward_subsumption_resolution: 8
% 0.22/0.46 % res_backward_subsumption_resolution: 0
% 0.22/0.46 % res_clause_to_clause_subsumption: 13
% 0.22/0.46 % res_orphan_elimination: 0
% 0.22/0.46 % res_tautology_del: 0
% 0.22/0.46 % res_num_eq_res_simplified: 0
% 0.22/0.46 % res_num_sel_changes: 0
% 0.22/0.46 % res_moves_from_active_to_pass: 0
% 0.22/0.46
% 0.22/0.46 % Status Unsatisfiable
% 0.22/0.46 % SZS status Unsatisfiable
% 0.22/0.46 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------