%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU268+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n007.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:56:25 PM UTC 2026
% Result : Theorem 2.61s 1.19s
% Output : CNFRefutation 2.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 63 ( 26 unt; 1 def)
% Number of atoms : 232 ( 36 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 286 ( 120 ~; 116 |; 35 &)
% ( 10 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 121 ( 1 sgn 112 !; 9 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(X2,X1)
=> in(ordered_pair(X2,X2),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_2) ).
fof(f10,axiom,
! [X0,X1] :
( relation(X1)
=> ( X1 = inclusion_relation(X0)
<=> ( ! [X2,X3] :
( ( in(X3,X0)
& in(X2,X0) )
=> ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) ) )
& relation_field(X1) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_wellord2) ).
fof(f11,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f13,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_relat_2) ).
fof(f16,axiom,
! [X0] : relation(inclusion_relation(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_wellord2) ).
fof(f41,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f45,conjecture,
! [X0] : reflexive(inclusion_relation(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_wellord2) ).
fof(f46,negated_conjecture,
~ ! [X0] : reflexive(inclusion_relation(X0)),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f54,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f41]) ).
fof(f69,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( ~ in(X2,X1)
| in(ordered_pair(X2,X2),X0) ) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f70,plain,
! [X0,X1] :
( ~ relation(X1)
| ( X1 = inclusion_relation(X0)
<=> ( ! [X2,X3] :
( ~ in(X3,X0)
| ~ in(X2,X0)
| ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) ) )
& relation_field(X1) = X0 ) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f71,plain,
! [X0,X1] :
( ~ relation(X1)
| ( X1 = inclusion_relation(X0)
<=> ( ! [X2,X3] :
( ~ in(X3,X0)
| ~ in(X2,X0)
| ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) ) )
& relation_field(X1) = X0 ) ) ),
inference(flattening,[],[f70]) ).
fof(f73,plain,
! [X0] :
( ~ relation(X0)
| ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f79,plain,
? [X0] : ~ reflexive(inclusion_relation(X0)),
inference(ennf_transformation,[],[f46]) ).
fof(f86,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( ~ is_reflexive_in(X0,X1)
| ! [X2] :
( ~ in(X2,X1)
| in(ordered_pair(X2,X2),X0) ) )
& ( ? [X2] :
( in(X2,X1)
& ~ in(ordered_pair(X2,X2),X0) )
| is_reflexive_in(X0,X1) ) ) ),
inference(nnf_transformation,[],[f69]) ).
fof(f87,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( ~ is_reflexive_in(X0,X1)
| ! [X3] :
( ~ in(X3,X1)
| in(ordered_pair(X3,X3),X0) ) )
& ( ? [X2] :
( in(X2,X1)
& ~ in(ordered_pair(X2,X2),X0) )
| is_reflexive_in(X0,X1) ) ) ),
inference(rectify,[],[f86]) ).
fof(f88,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( ~ is_reflexive_in(X0,X1)
| ! [X3] :
( ~ in(X3,X1)
| in(ordered_pair(X3,X3),X0) ) )
& ( ( in(sK0(X0,X1),X1)
& ~ in(ordered_pair(sK0(X0,X1),sK0(X0,X1)),X0) )
| is_reflexive_in(X0,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f87]) ).
fof(f89,plain,
! [X0,X1] :
( ~ relation(X1)
| ( ( inclusion_relation(X0) != X1
| ( ! [X2,X3] :
( ~ in(X3,X0)
| ~ in(X2,X0)
| ( ( ~ in(ordered_pair(X2,X3),X1)
| subset(X2,X3) )
& ( ~ subset(X2,X3)
| in(ordered_pair(X2,X3),X1) ) ) )
& relation_field(X1) = X0 ) )
& ( ? [X2,X3] :
( in(X3,X0)
& in(X2,X0)
& ( in(ordered_pair(X2,X3),X1)
| subset(X2,X3) )
& ( ~ in(ordered_pair(X2,X3),X1)
| ~ subset(X2,X3) ) )
| relation_field(X1) != X0
| X1 = inclusion_relation(X0) ) ) ),
inference(nnf_transformation,[],[f71]) ).
fof(f90,plain,
! [X0,X1] :
( ~ relation(X1)
| ( ( inclusion_relation(X0) != X1
| ( ! [X2,X3] :
( ~ in(X3,X0)
| ~ in(X2,X0)
| ( ( ~ in(ordered_pair(X2,X3),X1)
| subset(X2,X3) )
& ( ~ subset(X2,X3)
| in(ordered_pair(X2,X3),X1) ) ) )
& relation_field(X1) = X0 ) )
& ( ? [X2,X3] :
( in(X3,X0)
& in(X2,X0)
& ( in(ordered_pair(X2,X3),X1)
| subset(X2,X3) )
& ( ~ in(ordered_pair(X2,X3),X1)
| ~ subset(X2,X3) ) )
| relation_field(X1) != X0
| X1 = inclusion_relation(X0) ) ) ),
inference(flattening,[],[f89]) ).
fof(f91,plain,
! [X0,X1] :
( ~ relation(X1)
| ( ( inclusion_relation(X0) != X1
| ( ! [X4,X5] :
( ~ in(X5,X0)
| ~ in(X4,X0)
| ( ( ~ in(ordered_pair(X4,X5),X1)
| subset(X4,X5) )
& ( ~ subset(X4,X5)
| in(ordered_pair(X4,X5),X1) ) ) )
& relation_field(X1) = X0 ) )
& ( ? [X2,X3] :
( in(X3,X0)
& in(X2,X0)
& ( in(ordered_pair(X2,X3),X1)
| subset(X2,X3) )
& ( ~ in(ordered_pair(X2,X3),X1)
| ~ subset(X2,X3) ) )
| relation_field(X1) != X0
| X1 = inclusion_relation(X0) ) ) ),
inference(rectify,[],[f90]) ).
fof(f92,plain,
! [X0,X1] :
( ~ relation(X1)
| ( ( inclusion_relation(X0) != X1
| ( ! [X4,X5] :
( ~ in(X5,X0)
| ~ in(X4,X0)
| ( ( ~ in(ordered_pair(X4,X5),X1)
| subset(X4,X5) )
& ( ~ subset(X4,X5)
| in(ordered_pair(X4,X5),X1) ) ) )
& relation_field(X1) = X0 ) )
& ( ( in(sK2(X0,X1),X0)
& in(sK1(X0,X1),X0)
& ( in(ordered_pair(sK1(X0,X1),sK2(X0,X1)),X1)
| subset(sK1(X0,X1),sK2(X0,X1)) )
& ( ~ in(ordered_pair(sK1(X0,X1),sK2(X0,X1)),X1)
| ~ subset(sK1(X0,X1),sK2(X0,X1)) ) )
| relation_field(X1) != X0
| X1 = inclusion_relation(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1))],[f91]) ).
fof(f93,plain,
! [X0] :
( ~ relation(X0)
| ( ( ~ reflexive(X0)
| is_reflexive_in(X0,relation_field(X0)) )
& ( ~ is_reflexive_in(X0,relation_field(X0))
| reflexive(X0) ) ) ),
inference(nnf_transformation,[],[f73]) ).
fof(f104,plain,
~ reflexive(inclusion_relation(sK13)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X0,sK13)],[f79]) ).
fof(f116,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f7]) ).
fof(f119,plain,
! [X0,X1] :
( ~ relation(X0)
| in(sK0(X0,X1),X1)
| is_reflexive_in(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f120,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ in(ordered_pair(sK0(X0,X1),sK0(X0,X1)),X0)
| is_reflexive_in(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f122,plain,
! [X0,X1,X4,X5] :
( ~ relation(X1)
| inclusion_relation(X0) != X1
| ~ in(X5,X0)
| ~ in(X4,X0)
| ~ subset(X4,X5)
| in(ordered_pair(X4,X5),X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f123,plain,
! [X0,X1] :
( ~ relation(X1)
| inclusion_relation(X0) != X1
| relation_field(X1) = X0 ),
inference(cnf_transformation,[],[f92]) ).
fof(f128,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f131,plain,
! [X0] :
( ~ relation(X0)
| ~ is_reflexive_in(X0,relation_field(X0))
| reflexive(X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f132,plain,
! [X0] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[],[f16]) ).
fof(f169,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f54]) ).
fof(f173,plain,
~ reflexive(inclusion_relation(sK13)),
inference(cnf_transformation,[],[f104]) ).
fof(f181,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(sK0(X0,X1),sK0(X0,X1)),singleton(sK0(X0,X1))),X0)
| is_reflexive_in(X0,X1) ),
inference(definition_unfolding,[],[f120,f128]) ).
fof(f185,plain,
! [X0,X1,X4,X5] :
( ~ relation(X1)
| inclusion_relation(X0) != X1
| ~ in(X5,X0)
| ~ in(X4,X0)
| ~ subset(X4,X5)
| in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X1) ),
inference(definition_unfolding,[],[f122,f128]) ).
fof(f192,plain,
! [X0] :
( ~ relation(inclusion_relation(X0))
| relation_field(inclusion_relation(X0)) = X0 ),
inference(equality_resolution,[],[f123]) ).
fof(f193,plain,
! [X0,X4,X5] :
( ~ relation(inclusion_relation(X0))
| ~ in(X5,X0)
| ~ in(X4,X0)
| ~ subset(X4,X5)
| in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),inclusion_relation(X0)) ),
inference(equality_resolution,[],[f185]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f116]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(X0,X1)
| ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(sK0(X0,X1),sK0(X0,X1)),singleton(sK0(X0,X1))),X0) ),
inference(cnf_transformation,[],[f181]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(X0,X1)
| in(sK0(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_66,plain,
! [X0: $i] :
( ( relation_field(inclusion_relation(X0)) = X0 )
| ~ relation(inclusion_relation(X0)) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),inclusion_relation(X1))
| ~ relation(inclusion_relation(X1))
| ~ subset(X0,X2)
| ~ in(X2,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_70,plain,
! [X0: $i] :
( reflexive(X0)
| ~ relation(X0)
| ~ is_reflexive_in(X0,relation_field(X0)) ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_72,plain,
! [X0: $i] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[],[f132]) ).
tcf(c_109,plain,
! [X0: $i] : subset(X0,X0),
inference(cnf_transformation,[],[f169]) ).
tcf(c_113,negated_conjecture,
~ reflexive(inclusion_relation(sK13)),
inference(cnf_transformation,[],[f173]) ).
tcf(c_143,plain,
! [X0: $i] : relation_field(inclusion_relation(X0)) = X0,
inference(global_subsumption_just,[status(thm)],[c_66,c_72,c_66]) ).
tcf(c_357,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),inclusion_relation(X1))
| ~ subset(X0,X2)
| ~ in(X2,X1)
| ~ in(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_67,c_72]) ).
tcf(c_678,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X2)),inclusion_relation(X1))
| ~ subset(X0,X2)
| ~ in(X2,X1)
| ~ in(X0,X1) ),
inference(demodulation,[status(thm)],[c_357,c_57]) ).
tcf(c_704,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(X0,X1)
| ~ relation(X0)
| ~ in(unordered_pair(singleton(sK0(X0,X1)),unordered_pair(sK0(X0,X1),sK0(X0,X1))),X0) ),
inference(demodulation,[status(thm)],[c_59,c_57]) ).
tcf(c_767,plain,
! [X0: $i] :
( ~ relation(X0)
| ~ is_reflexive_in(X0,relation_field(X0))
| ( inclusion_relation(sK13) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_70,c_113]) ).
tcf(c_768,plain,
( ~ relation(inclusion_relation(sK13))
| ~ is_reflexive_in(inclusion_relation(sK13),relation_field(inclusion_relation(sK13))) ),
inference(unflattening,[status(thm)],[c_767]) ).
tcf(c_773,plain,
~ is_reflexive_in(inclusion_relation(sK13),relation_field(inclusion_relation(sK13))),
inference(forward_subsumption_resolution,[status(thm)],[c_768,c_72]) ).
tcf(c_2164,plain,
~ is_reflexive_in(inclusion_relation(sK13),sK13),
inference(demodulation,[status(thm)],[c_773,c_143]) ).
tcf(c_3398,definition,
iPr_def_10 = inclusion_relation(sK13),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_3399,plain,
~ is_reflexive_in(iPr_def_10,sK13),
inference(demodulation,[status(thm)],[c_2164,c_3398]) ).
tcf(c_4571,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(inclusion_relation(X0),X1)
| ~ relation(inclusion_relation(X0))
| ~ in(sK0(inclusion_relation(X0),X1),X0)
| ~ subset(sK0(inclusion_relation(X0),X1),sK0(inclusion_relation(X0),X1)) ),
inference(superposition,[status(thm)],[c_678,c_704]) ).
tcf(c_4572,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(inclusion_relation(X0),X1)
| ~ in(sK0(inclusion_relation(X0),X1),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4571,c_72,c_109]) ).
tcf(c_5036,plain,
! [X0: $i] :
( is_reflexive_in(inclusion_relation(X0),X0)
| ~ relation(inclusion_relation(X0)) ),
inference(superposition,[status(thm)],[c_60,c_4572]) ).
tcf(c_5039,plain,
! [X0: $i] : is_reflexive_in(inclusion_relation(X0),X0),
inference(forward_subsumption_resolution,[status(thm)],[c_5036,c_72]) ).
tcf(c_5049,plain,
is_reflexive_in(iPr_def_10,sK13),
inference(superposition,[status(thm)],[c_3398,c_5039]) ).
tcf(c_5050,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5049,c_3399]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU268+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 13:25:53 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 2.61/1.19 % SZS status Started for theBenchmark.p
% 2.61/1.19 % SZS status Theorem for theBenchmark.p
% 2.61/1.19
% 2.61/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.61/1.19
% 2.61/1.19 % ------ iProver source info
% 2.61/1.19
% 2.61/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 2.61/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.61/1.19 % git: non_committed_changes: false
% 2.61/1.19
% 2.61/1.19 % ------ Parsing...
% 2.61/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.61/1.19
% 2.61/1.19 % ------ Preprocessing... sup_sim: 7 sf_s rm: 30 0s sf_e pe_s pe:1:0s pe_e sup_sim: 1 sf_s rm: 6 0s sf_e pe_s pe_e %
% 2.61/1.19
% 2.61/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.61/1.19
% 2.61/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.61/1.19 % ------ Proving...
% 2.61/1.19 % ------ Problem Properties
% 2.61/1.19
% 2.61/1.19 %
% 2.61/1.19 % clauses 45
% 2.61/1.19 % conjectures 0
% 2.61/1.19 % EPR 22
% 2.61/1.19 % Horn 40
% 2.61/1.19 % unary 23
% 2.61/1.19 % binary 9
% 2.61/1.19 % lits 85
% 2.61/1.19 % lits eq 13
% 2.61/1.19 % fd_pure 0
% 2.61/1.19 % fd_pseudo 0
% 2.61/1.19 % fd_cond 1
% 2.61/1.19 % fd_pseudo_cond 1
% 2.61/1.19 % AC symbols 0
% 2.61/1.19
% 2.61/1.19 % ------ Schedule dynamic 5 is on
% 2.61/1.19
% 2.61/1.19 % ------ no conjectures: strip conj schedule
% 2.61/1.19
% 2.61/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.61/1.19
% 2.61/1.19
% 2.61/1.19 % ------
% 2.61/1.19 % Current options:
% 2.61/1.19 % ------
% 2.61/1.19
% 2.61/1.19
% 2.61/1.19 %
% 2.61/1.19
% 2.61/1.19 % ------ Proving...
% 2.61/1.19 %
% 2.61/1.19
% 2.61/1.19 % SZS status Theorem for theBenchmark.p
% 2.61/1.19
% 2.61/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.61/1.19
% 2.61/1.19
%------------------------------------------------------------------------------