↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL259-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:06:12 PM UTC 2026

% Result   : Unsatisfiable 10.38s 2.25s
% Output   : CNFRefutation 10.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   85 (  51 unt;   5 def)
%            Number of atoms       :  198 (   6 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   88 (  49   ~;  39   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   6 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  119 (   0 sgn 119   !;   0   ?;  90   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( ~ theorem(X1)
      | ~ theorem(implies(X1,X0))
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).

fof(f9,negated_conjecture,
    ~ theorem(implies(implies(p,implies(p,q)),implies(p,q))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f10,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f11,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f12,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f13,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ theorem(X1)
      | ~ theorem(or(not(X1),X0))
      | theorem(X0) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f16,plain,
    ~ theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))),
    inference(definition_unfolding,[],[f9,f6,f6,f6,f6]) ).

tcf(c_58,plain,
    ! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_59,plain,
    ! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_63,plain,
    ! [X0: $i] :
      ( theorem(X0)
      | ~ axiom(X0) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(X1)
      | ~ theorem(X0)
      | ~ theorem(or(not(X0),X1)) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_65,negated_conjecture,
    ~ theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_94,plain,
    ! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[status(thm)],[c_63,c_58]) ).

tcf(c_99,plain,
    ! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[status(thm)],[c_63,c_59]) ).

tcf(c_104,plain,
    ! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[status(thm)],[c_63,c_60]) ).

tcf(c_109,plain,
    ! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[status(thm)],[c_63,c_61]) ).

tcf(c_114,plain,
    ! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[status(thm)],[c_63,c_62]) ).

tcf(c_142,definition,
    iPr_def_10 = not(p),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_143,definition,
    iPr_def_11 = or(iPr_def_10,q),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_144,definition,
    iPr_def_12 = or(iPr_def_10,iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_145,definition,
    iPr_def_13 = not(iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_146,definition,
    iPr_def_14 = or(iPr_def_13,iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_147,negated_conjecture,
    ~ theorem(iPr_def_14),
    inference(demodulation,[status(thm)],[c_65,c_143,c_142,c_144,c_145,c_146]) ).

tcf(c_264,plain,
    ! [X0: $i] : theorem(or(iPr_def_10,or(X0,p))),
    inference(superposition,[status(thm)],[c_142,c_99]) ).

tcf(c_274,plain,
    theorem(or(not(or(q,iPr_def_10)),iPr_def_11)),
    inference(superposition,[status(thm)],[c_143,c_104]) ).

tcf(c_281,plain,
    ! [X0: $i] :
      ( theorem(X0)
      | ~ theorem(or(X0,X0)) ),
    inference(superposition,[status(thm)],[c_94,c_64]) ).

tcf(c_282,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X1,X0))
      | ~ theorem(X0) ),
    inference(superposition,[status(thm)],[c_99,c_64]) ).

tcf(c_283,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(X1,X0))
      | ~ theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_104,c_64]) ).

tcf(c_328,plain,
    ! [X0: $i] : theorem(or(not(or(X0,iPr_def_14)),or(iPr_def_13,or(X0,iPr_def_11)))),
    inference(superposition,[status(thm)],[c_146,c_109]) ).

tcf(c_331,plain,
    ! [X0: $i] : theorem(or(not(or(iPr_def_13,or(X0,iPr_def_11))),or(X0,iPr_def_14))),
    inference(superposition,[status(thm)],[c_146,c_109]) ).

tcf(c_332,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X1,or(X0,X2)))
      | ~ theorem(or(X0,or(X1,X2))) ),
    inference(superposition,[status(thm)],[c_109,c_64]) ).

tcf(c_468,plain,
    ! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_11)),or(not(or(iPr_def_13,X0)),iPr_def_14))),
    inference(superposition,[status(thm)],[c_146,c_114]) ).

tcf(c_469,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(not(or(X2,X0)),or(X2,X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_114,c_64]) ).

tcf(c_678,plain,
    ! [X0: $i] :
      ( theorem(or(iPr_def_13,or(X0,iPr_def_11)))
      | ~ theorem(or(X0,iPr_def_14)) ),
    inference(superposition,[status(thm)],[c_328,c_64]) ).

tcf(c_760,plain,
    ! [X0: $i] :
      ( theorem(or(X0,iPr_def_14))
      | ~ theorem(or(iPr_def_13,or(X0,iPr_def_11))) ),
    inference(superposition,[status(thm)],[c_331,c_64]) ).

tcf(c_836,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X1))),
    inference(superposition,[status(thm)],[c_94,c_332]) ).

tcf(c_837,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))),
    inference(superposition,[status(thm)],[c_99,c_332]) ).

tcf(c_838,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(X1,X0)),X1))),
    inference(superposition,[status(thm)],[c_104,c_332]) ).

tcf(c_840,plain,
    ! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(superposition,[status(thm)],[c_114,c_332]) ).

tcf(c_841,plain,
    ! [X0: $i] : theorem(or(X0,or(iPr_def_10,p))),
    inference(superposition,[status(thm)],[c_264,c_332]) ).

tcf(c_846,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X0,or(X2,X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_282,c_332]) ).

tcf(c_986,plain,
    ! [X0: $i] :
      ( theorem(or(X0,iPr_def_14))
      | ~ theorem(or(X0,iPr_def_11)) ),
    inference(superposition,[status(thm)],[c_282,c_760]) ).

tcf(c_1031,plain,
    theorem(or(iPr_def_10,p)),
    inference(superposition,[status(thm)],[c_841,c_281]) ).

tcf(c_1036,plain,
    theorem(or(p,iPr_def_10)),
    inference(superposition,[status(thm)],[c_1031,c_283]) ).

tcf(c_1066,plain,
    ! [X0: $i] : theorem(or(not(X0),X0)),
    inference(superposition,[status(thm)],[c_837,c_281]) ).

tcf(c_1079,plain,
    ! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(X0,X1)),X1))),
    inference(superposition,[status(thm)],[c_1066,c_332]) ).

tcf(c_1375,plain,
    ! [X0: $i,X1: $i] : theorem(or(or(not(or(X0,X1)),X0),X1)),
    inference(superposition,[status(thm)],[c_838,c_283]) ).

tcf(c_1723,plain,
    ! [X0: $i] :
      ( theorem(or(not(or(iPr_def_13,X0)),iPr_def_14))
      | ~ theorem(or(not(X0),iPr_def_11)) ),
    inference(superposition,[status(thm)],[c_468,c_64]) ).

tcf(c_1956,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(X2,X1))
      | ~ theorem(or(X2,X0))
      | ~ theorem(or(not(X0),X1)) ),
    inference(superposition,[status(thm)],[c_469,c_64]) ).

tcf(c_2004,plain,
    ! [X0: $i] :
      ( theorem(iPr_def_14)
      | ~ theorem(or(iPr_def_13,X0))
      | ~ theorem(or(not(X0),iPr_def_11)) ),
    inference(superposition,[status(thm)],[c_1723,c_64]) ).

tcf(c_2008,plain,
    ! [X0: $i] :
      ( ~ theorem(or(iPr_def_13,X0))
      | ~ theorem(or(not(X0),iPr_def_11)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_2004,c_147]) ).

tcf(c_2705,plain,
    ! [X0: $i] :
      ( theorem(or(X0,iPr_def_11))
      | ~ theorem(or(X0,or(q,iPr_def_10))) ),
    inference(superposition,[status(thm)],[c_274,c_1956]) ).

tcf(c_3328,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(or(not(X0),X1)),X1))
      | ~ theorem(X0) ),
    inference(superposition,[status(thm)],[c_1079,c_64]) ).

tcf(c_3412,plain,
    ! [X0: $i] :
      ( ~ theorem(X0)
      | ~ theorem(or(iPr_def_13,or(not(X0),iPr_def_11))) ),
    inference(superposition,[status(thm)],[c_3328,c_2008]) ).

tcf(c_3502,plain,
    ! [X0: $i] :
      ( ~ theorem(X0)
      | ~ theorem(or(not(X0),iPr_def_14)) ),
    inference(superposition,[status(thm)],[c_678,c_3412]) ).

tcf(c_3866,plain,
    ! [X0: $i] : theorem(or(or(not(or(X0,iPr_def_11)),X0),iPr_def_14)),
    inference(superposition,[status(thm)],[c_1375,c_986]) ).

tcf(c_4073,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(or(or(not(X0),X1),or(not(X0),X1))),X1))
      | ~ theorem(X0) ),
    inference(superposition,[status(thm)],[c_836,c_64]) ).

tcf(c_4148,plain,
    ! [X0: $i] :
      ( ~ theorem(X0)
      | ~ theorem(or(or(not(X0),iPr_def_14),or(not(X0),iPr_def_14))) ),
    inference(superposition,[status(thm)],[c_4073,c_3502]) ).

tcf(c_5186,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( theorem(or(not(or(not(X1),X2)),or(X0,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(superposition,[status(thm)],[c_840,c_64]) ).

tcf(c_5438,plain,
    ! [X0: $i] :
      ( ~ theorem(X0)
      | ~ theorem(or(or(not(X0),iPr_def_14),iPr_def_14)) ),
    inference(superposition,[status(thm)],[c_846,c_4148]) ).

tcf(c_5933,plain,
    ! [X0: $i,X1: $i] :
      ( theorem(or(not(or(iPr_def_10,X1)),or(X0,X1)))
      | ~ theorem(or(X0,p)) ),
    inference(superposition,[status(thm)],[c_142,c_5186]) ).

tcf(c_6077,plain,
    ! [X0: $i] : theorem(or(iPr_def_14,or(not(or(X0,iPr_def_11)),X0))),
    inference(superposition,[status(thm)],[c_3866,c_283]) ).

tcf(c_6461,plain,
    ! [X0: $i] :
      ( theorem(or(not(iPr_def_12),or(X0,iPr_def_11)))
      | ~ theorem(or(X0,p)) ),
    inference(superposition,[status(thm)],[c_144,c_5933]) ).

tcf(c_6471,plain,
    ! [X0: $i] :
      ( theorem(or(iPr_def_13,or(X0,iPr_def_11)))
      | ~ theorem(or(X0,p)) ),
    inference(light_normalisation,[status(thm)],[c_6461,c_145]) ).

tcf(c_6497,plain,
    ! [X0: $i] :
      ( theorem(or(X0,iPr_def_14))
      | ~ theorem(or(X0,p)) ),
    inference(superposition,[status(thm)],[c_6471,c_760]) ).

tcf(c_7489,plain,
    ! [X0: $i] : theorem(or(not(or(X0,iPr_def_11)),or(iPr_def_14,X0))),
    inference(superposition,[status(thm)],[c_6077,c_332]) ).

tcf(c_7565,plain,
    ! [X0: $i] : theorem(or(or(not(or(X0,p)),X0),iPr_def_14)),
    inference(superposition,[status(thm)],[c_1375,c_6497]) ).

tcf(c_7918,plain,
    ! [X0: $i] :
      ( theorem(or(iPr_def_14,X0))
      | ~ theorem(or(X0,iPr_def_11)) ),
    inference(superposition,[status(thm)],[c_7489,c_64]) ).

tcf(c_7929,plain,
    ( theorem(or(iPr_def_14,p))
    | ~ theorem(or(p,iPr_def_11)) ),
    inference(instantiation,[status(thm)],[c_7918]) ).

tcf(c_8067,plain,
    ~ theorem(or(iPr_def_14,p)),
    inference(superposition,[status(thm)],[c_7565,c_5438]) ).

tcf(c_12931,plain,
    ! [X0: $i] :
      ( theorem(or(X0,iPr_def_11))
      | ~ theorem(or(X0,iPr_def_10)) ),
    inference(superposition,[status(thm)],[c_846,c_2705]) ).

tcf(c_12983,plain,
    ( theorem(or(p,iPr_def_11))
    | ~ theorem(or(p,iPr_def_10)) ),
    inference(instantiation,[status(thm)],[c_12931]) ).

tcf(c_12984,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_12983,c_8067,c_7929,c_1036]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL259-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 22:38:28 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.41  
% 0.09/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41  
% 0.09/0.41  % Detected problem language: tptp
% 0.09/0.43  % Proving...
% 10.38/2.25  % SZS status Started for theBenchmark.p
% 10.38/2.25  % SZS status Unsatisfiable for theBenchmark.p
% 10.38/2.25  
% 10.38/2.25  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.38/2.25  
% 10.38/2.25  % ------  iProver source info
% 10.38/2.25  
% 10.38/2.25  % git: date: 2026-07-19 20:42:38 +0200
% 10.38/2.25  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.38/2.25  % git: non_committed_changes: false
% 10.38/2.25  
% 10.38/2.25  % ------ Parsing...% successful
% 10.38/2.25  
% 10.38/2.25  
% 10.38/2.25  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 10.38/2.25  
% 10.38/2.25  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 10.38/2.25  
% 10.38/2.25  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 10.38/2.25  
% 10.38/2.25  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 10.38/2.25  % ------ Proving...
% 10.38/2.25  % ------ Problem Properties 
% 10.38/2.25  
% 10.38/2.25  % 
% 10.38/2.25  % clauses                               12
% 10.38/2.25  % conjectures                           1
% 10.38/2.25  % EPR                                   1
% 10.38/2.25  % Horn                                  12
% 10.38/2.25  % unary                                 11
% 10.38/2.25  % binary                                0
% 10.38/2.25  % lits                                  14
% 10.38/2.25  % lits eq                               5
% 10.38/2.25  % fd_pure                               0
% 10.38/2.25  % fd_pseudo                             0
% 10.38/2.25  % fd_cond                               0
% 10.38/2.25  % fd_pseudo_cond                        0
% 10.38/2.25  % AC symbols                            0
% 10.38/2.25  
% 10.38/2.25  % ------ Schedule dynamic 5 is on 
% 10.38/2.25  
% 10.38/2.25  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.38/2.25  
% 10.38/2.25  
% 10.38/2.25  % ------ 
% 10.38/2.25  % Current options:
% 10.38/2.25  % ------ 
% 10.38/2.25  
% 10.38/2.25  
% 10.38/2.25  % 
% 10.38/2.25  
% 10.38/2.25  % ------ Proving...
% 10.38/2.25  % 
% 10.38/2.25  
% 10.38/2.25  % SZS status Unsatisfiable for theBenchmark.p
% 10.38/2.25  
% 10.38/2.25  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.38/2.25  
% 10.38/2.25  
%------------------------------------------------------------------------------