TSTP Solution File: LCL686+1.001 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LCL686+1.001 : TPTP v8.1.0. Released v4.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 : Sun Jul 17 11:38:31 EDT 2022
% Result : Theorem 0.21s 0.44s
% Output : CNFRefutation 0.21s
% 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
fof(transitivity,axiom,
! [X,Y,Z] :
( ( r1(X,Y)
& r1(Y,Z) )
=> r1(X,Z) ),
input ).
fof(transitivity_0,plain,
! [X,Y,Z] :
( r1(X,Z)
| ~ ( r1(X,Y)
& r1(Y,Z) ) ),
inference(orientation,[status(thm)],[transitivity]) ).
fof(reflexivity,axiom,
! [X] : r1(X,X),
input ).
fof(reflexivity_0,plain,
! [X] :
( r1(X,X)
| $false ),
inference(orientation,[status(thm)],[reflexivity]) ).
fof(def_lhs_atom1,axiom,
! [X] :
( lhs_atom1(X)
<=> r1(X,X) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [X] :
( lhs_atom1(X)
| $false ),
inference(fold_definition,[status(thm)],[reflexivity_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Z,X] :
( lhs_atom2(Z,X)
<=> r1(X,Z) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [X,Y,Z] :
( lhs_atom2(Z,X)
| ~ ( r1(X,Y)
& r1(Y,Z) ) ),
inference(fold_definition,[status(thm)],[transitivity_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( r1(X1,X3)
& r1(X3,X2) ) ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
! [X1] :
( lhs_atom1(X1)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_2,axiom,
! [X2,X3,X1] :
( lhs_atom2(X2,X1)
| ~ ( r1(X1,X3)
& r1(X3,X2) ) ),
c_0_0 ).
fof(c_0_3,plain,
! [X1] : lhs_atom1(X1),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( lhs_atom2(X4,X6)
| ~ r1(X6,X5)
| ~ r1(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_5,plain,
! [X2] : lhs_atom1(X2),
inference(variable_rename,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( lhs_atom2(X2,X3)
| ~ r1(X1,X2)
| ~ r1(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
lhs_atom1(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( lhs_atom2(X2,X3)
| ~ r1(X1,X2)
| ~ r1(X3,X1) ),
c_0_6,
[final] ).
cnf(c_0_9,plain,
lhs_atom1(X1),
c_0_7,
[final] ).
% End CNF derivation
cnf(c_0_8_0,axiom,
( r1(X3,X2)
| ~ r1(X1,X2)
| ~ r1(X3,X1) ),
inference(unfold_definition,[status(thm)],[c_0_8,def_lhs_atom2]) ).
cnf(c_0_9_0,axiom,
r1(X1,X1),
inference(unfold_definition,[status(thm)],[c_0_9,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ $true )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
file('<stdin>',main) ).
fof(c_0_1_002,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] : ~ r1(X1,X2)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c_0_0])]) ).
fof(c_0_2_003,negated_conjecture,
! [X7,X9] :
( r1(esk1_0,esk2_0)
& p3(esk2_0)
& r1(esk2_0,esk3_0)
& p1(esk3_0)
& r1(esk1_0,esk4_0)
& ( r1(X7,esk5_1(X7))
| ~ r1(esk4_0,X7) )
& ( ~ p2(X9)
| p1(X9)
| ~ r1(X7,X9)
| ~ r1(esk4_0,X7) )
& ( p2(X9)
| ~ p1(X9)
| ~ r1(X7,X9)
| ~ r1(esk4_0,X7) )
& ( r1(X7,esk6_1(X7))
| ~ r1(esk4_0,X7) )
& ( ~ p3(esk6_1(X7))
| ~ r1(esk4_0,X7) )
& ( r1(X7,esk7_1(X7))
| ~ r1(esk4_0,X7) )
& ( p1(esk7_1(X7))
| p2(esk7_1(X7))
| ~ r1(esk4_0,X7) )
& ( ~ p2(esk7_1(X7))
| ~ p1(esk7_1(X7))
| ~ r1(esk4_0,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3_004,negated_conjecture,
( p1(X2)
| ~ r1(esk4_0,X1)
| ~ r1(X1,X2)
| ~ p2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( p2(X2)
| ~ r1(esk4_0,X1)
| ~ r1(X1,X2)
| ~ p1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
( ~ r1(esk4_0,X1)
| ~ p1(esk7_1(X1))
| ~ p2(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
( p2(esk7_1(X1))
| p1(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
( r1(X1,esk5_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8_009,negated_conjecture,
( r1(X1,esk6_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9_010,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( ~ r1(esk4_0,X1)
| ~ p3(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
r1(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
r1(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
r1(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
p3(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
p1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( p1(X2)
| ~ r1(esk4_0,X1)
| ~ r1(X1,X2)
| ~ p2(X2) ),
c_0_3,
[final] ).
cnf(c_0_17,negated_conjecture,
( p2(X2)
| ~ r1(esk4_0,X1)
| ~ r1(X1,X2)
| ~ p1(X2) ),
c_0_4,
[final] ).
cnf(c_0_18,negated_conjecture,
( ~ r1(esk4_0,X1)
| ~ p1(esk7_1(X1))
| ~ p2(esk7_1(X1)) ),
c_0_5,
[final] ).
cnf(c_0_19,negated_conjecture,
( p2(esk7_1(X1))
| p1(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
c_0_6,
[final] ).
cnf(c_0_20,negated_conjecture,
( r1(X1,esk5_1(X1))
| ~ r1(esk4_0,X1) ),
c_0_7,
[final] ).
cnf(c_0_21,negated_conjecture,
( r1(X1,esk6_1(X1))
| ~ r1(esk4_0,X1) ),
c_0_8,
[final] ).
cnf(c_0_22,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
c_0_9,
[final] ).
cnf(c_0_23,negated_conjecture,
( ~ r1(esk4_0,X1)
| ~ p3(esk6_1(X1)) ),
c_0_10,
[final] ).
cnf(c_0_24,negated_conjecture,
r1(esk1_0,esk2_0),
c_0_11,
[final] ).
cnf(c_0_25,negated_conjecture,
r1(esk2_0,esk3_0),
c_0_12,
[final] ).
cnf(c_0_26,negated_conjecture,
r1(esk1_0,esk4_0),
c_0_13,
[final] ).
cnf(c_0_27,negated_conjecture,
p3(esk2_0),
c_0_14,
[final] ).
cnf(c_0_28,negated_conjecture,
p1(esk3_0),
c_0_15,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| ~ p1(X1)
| p2(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a40253.p',c_0_17) ).
cnf(c_26,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| ~ p1(X1)
| p2(X1) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_77,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| ~ p1(X1)
| p2(X1) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_100,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| ~ p1(X1)
| p2(X1) ),
inference(copy,[status(esa)],[c_77]) ).
cnf(c_103,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| ~ p1(X1)
| p2(X1) ),
inference(copy,[status(esa)],[c_100]) ).
cnf(c_136,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| ~ p1(X1)
| p2(X1) ),
inference(copy,[status(esa)],[c_103]) ).
cnf(c_8,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a40253.p',c_0_22) ).
cnf(c_36,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_82,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_95,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_82]) ).
cnf(c_108,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_95]) ).
cnf(c_146,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| r1(X0,sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_108]) ).
cnf(c_240,plain,
( ~ r1(sk3_esk4_0,X0)
| ~ p1(sk3_esk7_1(X0))
| p2(sk3_esk7_1(X0)) ),
inference(resolution,[status(thm)],[c_136,c_146]) ).
cnf(c_241,plain,
( ~ r1(sk3_esk4_0,X0)
| ~ p1(sk3_esk7_1(X0))
| p2(sk3_esk7_1(X0)) ),
inference(rewriting,[status(thm)],[c_240]) ).
cnf(c_2,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| p1(X1)
| ~ p2(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a40253.p',c_0_16) ).
cnf(c_24,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| p1(X1)
| ~ p2(X1) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_76,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| p1(X1)
| ~ p2(X1) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_101,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| p1(X1)
| ~ p2(X1) ),
inference(copy,[status(esa)],[c_76]) ).
cnf(c_102,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| p1(X1)
| ~ p2(X1) ),
inference(copy,[status(esa)],[c_101]) ).
cnf(c_134,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ r1(X0,X1)
| p1(X1)
| ~ p2(X1) ),
inference(copy,[status(esa)],[c_102]) ).
cnf(c_216,plain,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0))
| ~ p2(sk3_esk7_1(X0)) ),
inference(resolution,[status(thm)],[c_134,c_146]) ).
cnf(c_217,plain,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0))
| ~ p2(sk3_esk7_1(X0)) ),
inference(rewriting,[status(thm)],[c_216]) ).
cnf(c_4,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ p1(sk3_esk7_1(X0))
| ~ p2(sk3_esk7_1(X0)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a40253.p',c_0_18) ).
cnf(c_28,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ p1(sk3_esk7_1(X0))
| ~ p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_78,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ p1(sk3_esk7_1(X0))
| ~ p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_28]) ).
cnf(c_99,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ p1(sk3_esk7_1(X0))
| ~ p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_78]) ).
cnf(c_104,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ p1(sk3_esk7_1(X0))
| ~ p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_99]) ).
cnf(c_138,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ p1(sk3_esk7_1(X0))
| ~ p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_104]) ).
cnf(c_336,plain,
( ~ r1(sk3_esk4_0,X0)
| ~ p2(sk3_esk7_1(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_217,c_138]) ).
cnf(c_337,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| ~ p2(sk3_esk7_1(X0)) ),
inference(rewriting,[status(thm)],[c_336]) ).
cnf(c_5,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0))
| p2(sk3_esk7_1(X0)) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_a40253.p',c_0_19) ).
cnf(c_30,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0))
| p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_79,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0))
| p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_30]) ).
cnf(c_98,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0))
| p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_79]) ).
cnf(c_105,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0))
| p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_98]) ).
cnf(c_140,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0))
| p2(sk3_esk7_1(X0)) ),
inference(copy,[status(esa)],[c_105]) ).
cnf(c_340,negated_conjecture,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_337,c_140]) ).
cnf(c_341,plain,
( ~ r1(sk3_esk4_0,X0)
| p1(sk3_esk7_1(X0)) ),
inference(rewriting,[status(thm)],[c_340]) ).
cnf(c_365,plain,
~ r1(sk3_esk4_0,X0),
inference(forward_subsumption_resolution,[status(thm)],[c_241,c_337,c_341]) ).
cnf(c_366,plain,
~ r1(sk3_esk4_0,X0),
inference(rewriting,[status(thm)],[c_365]) ).
cnf(c_0,plain,
r1(X0,X0),
file('/export/starexec/sandbox/tmp/iprover_modulo_a40253.p',c_0_9_0) ).
cnf(c_130,plain,
r1(X0,X0),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_368,plain,
$false,
inference(resolution,[status(thm)],[c_366,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL686+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 00:11:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % FOF problem with conjecture
% 0.21/0.41 % 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_3771d0.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a40253.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_075281 | grep -v "SZS"
% 0.21/0.43
% 0.21/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ iProver source info
% 0.21/0.43
% 0.21/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.43 % git: non_committed_changes: true
% 0.21/0.43 % git: last_make_outside_of_git: true
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --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_3771d0.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 false
% 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.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_3771d0.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
% 0.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 %
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % Resolution empty clause
% 0.21/0.44
% 0.21/0.44 % ------ Statistics
% 0.21/0.44
% 0.21/0.44 % ------ General
% 0.21/0.44
% 0.21/0.44 % num_of_input_clauses: 15
% 0.21/0.44 % num_of_input_neg_conjectures: 13
% 0.21/0.44 % num_of_splits: 0
% 0.21/0.44 % num_of_split_atoms: 0
% 0.21/0.44 % num_of_sem_filtered_clauses: 0
% 0.21/0.44 % num_of_subtypes: 0
% 0.21/0.44 % monotx_restored_types: 0
% 0.21/0.44 % sat_num_of_epr_types: 0
% 0.21/0.44 % sat_num_of_non_cyclic_types: 0
% 0.21/0.44 % sat_guarded_non_collapsed_types: 0
% 0.21/0.44 % is_epr: 0
% 0.21/0.44 % is_horn: 0
% 0.21/0.44 % has_eq: 0
% 0.21/0.44 % num_pure_diseq_elim: 0
% 0.21/0.44 % simp_replaced_by: 0
% 0.21/0.44 % res_preprocessed: 26
% 0.21/0.44 % prep_upred: 0
% 0.21/0.44 % prep_unflattend: 0
% 0.21/0.44 % pred_elim_cands: 0
% 0.21/0.44 % pred_elim: 0
% 0.21/0.44 % pred_elim_cl: 0
% 0.21/0.44 % pred_elim_cycles: 0
% 0.21/0.44 % forced_gc_time: 0
% 0.21/0.44 % gc_basic_clause_elim: 0
% 0.21/0.44 % parsing_time: 0.
% 0.21/0.44 % sem_filter_time: 0.
% 0.21/0.44 % pred_elim_time: 0.
% 0.21/0.44 % out_proof_time: 0.001
% 0.21/0.44 % monotx_time: 0.
% 0.21/0.44 % subtype_inf_time: 0.
% 0.21/0.44 % unif_index_cands_time: 0.
% 0.21/0.44 % unif_index_add_time: 0.
% 0.21/0.44 % total_time: 0.026
% 0.21/0.44 % num_of_symbols: 36
% 0.21/0.44 % num_of_terms: 112
% 0.21/0.44
% 0.21/0.44 % ------ Propositional Solver
% 0.21/0.44
% 0.21/0.44 % prop_solver_calls: 1
% 0.21/0.44 % prop_fast_solver_calls: 81
% 0.21/0.44 % prop_num_of_clauses: 24
% 0.21/0.44 % prop_preprocess_simplified: 194
% 0.21/0.44 % prop_fo_subsumed: 0
% 0.21/0.44 % prop_solver_time: 0.
% 0.21/0.44 % prop_fast_solver_time: 0.
% 0.21/0.44 % prop_unsat_core_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ QBF
% 0.21/0.44
% 0.21/0.44 % qbf_q_res: 0
% 0.21/0.44 % qbf_num_tautologies: 0
% 0.21/0.44 % qbf_prep_cycles: 0
% 0.21/0.44
% 0.21/0.44 % ------ BMC1
% 0.21/0.44
% 0.21/0.44 % bmc1_current_bound: -1
% 0.21/0.44 % bmc1_last_solved_bound: -1
% 0.21/0.44 % bmc1_unsat_core_size: -1
% 0.21/0.44 % bmc1_unsat_core_parents_size: -1
% 0.21/0.44 % bmc1_merge_next_fun: 0
% 0.21/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation
% 0.21/0.44
% 0.21/0.44 % inst_num_of_clauses: 15
% 0.21/0.44 % inst_num_in_passive: 0
% 0.21/0.44 % inst_num_in_active: 0
% 0.21/0.44 % inst_num_in_unprocessed: 15
% 0.21/0.44 % inst_num_of_loops: 0
% 0.21/0.44 % inst_num_of_learning_restarts: 0
% 0.21/0.44 % inst_num_moves_active_passive: 0
% 0.21/0.44 % inst_lit_activity: 0
% 0.21/0.44 % inst_lit_activity_moves: 0
% 0.21/0.44 % inst_num_tautologies: 0
% 0.21/0.44 % inst_num_prop_implied: 0
% 0.21/0.44 % inst_num_existing_simplified: 0
% 0.21/0.44 % inst_num_eq_res_simplified: 0
% 0.21/0.44 % inst_num_child_elim: 0
% 0.21/0.44 % inst_num_of_dismatching_blockings: 0
% 0.21/0.44 % inst_num_of_non_proper_insts: 0
% 0.21/0.44 % inst_num_of_duplicates: 0
% 0.21/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.44 % inst_dismatching_checking_time: 0.
% 0.21/0.44
% 0.21/0.44 % ------ Resolution
% 0.21/0.44
% 0.21/0.44 % res_num_of_clauses: 16
% 0.21/0.44 % res_num_in_passive: 13
% 0.21/0.44 % res_num_in_active: 7
% 0.21/0.44 % res_num_of_loops: 27
% 0.21/0.44 % res_forward_subset_subsumed: 5
% 0.21/0.44 % res_backward_subset_subsumed: 19
% 0.21/0.44 % res_forward_subsumed: 0
% 0.21/0.44 % res_backward_subsumed: 6
% 0.21/0.44 % res_forward_subsumption_resolution: 4
% 0.21/0.44 % res_backward_subsumption_resolution: 1
% 0.21/0.44 % res_clause_to_clause_subsumption: 66
% 0.21/0.44 % res_orphan_elimination: 0
% 0.21/0.44 % res_tautology_del: 3
% 0.21/0.44 % res_num_eq_res_simplified: 0
% 0.21/0.44 % res_num_sel_changes: 0
% 0.21/0.44 % res_moves_from_active_to_pass: 0
% 0.21/0.44
% 0.21/0.44 % Status Unsatisfiable
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------