%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN550+1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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 03:40:46 PM UTC 2026
% Result : Theorem 3.13s 1.43s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 73 ( 10 unt; 1 def)
% Number of atoms : 333 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 331 ( 137 ~; 138 |; 40 &)
% ( 4 <=>; 10 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 129 ( 0 sgn 102 !; 27 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : reachable(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_reachable) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( reachable(X1,X2)
& reachable(X0,X1) )
=> reachable(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_reachable) ).
fof(f3,conjecture,
( ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> p(X1) )
& reachable(initial_world,X0) )
<=> ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ? [X2] :
( ! [X3] :
( reachable(X2,X3)
=> p(X3) )
& reachable(X1,X2) ) )
& reachable(initial_world,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f4,negated_conjecture,
~ ( ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> p(X1) )
& reachable(initial_world,X0) )
<=> ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ? [X2] :
( ! [X3] :
( reachable(X2,X3)
=> p(X3) )
& reachable(X1,X2) ) )
& reachable(initial_world,X0) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
~ ( ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> p(X1) )
& reachable(initial_world,X0) )
<=> ? [X2] :
( ! [X3] :
( reachable(X2,X3)
=> ? [X4] :
( ! [X5] :
( reachable(X4,X5)
=> p(X5) )
& reachable(X3,X4) ) )
& reachable(initial_world,X2) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
! [X0,X1,X2] :
( ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| reachable(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| reachable(X0,X2) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
( ? [X0] :
( ! [X1] :
( ~ reachable(X0,X1)
| p(X1) )
& reachable(initial_world,X0) )
<~> ? [X2] :
( ! [X3] :
( ~ reachable(X2,X3)
| ? [X4] :
( ! [X5] :
( ~ reachable(X4,X5)
| p(X5) )
& reachable(X3,X4) ) )
& reachable(initial_world,X2) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f14,plain,
( ( ? [X0] :
( ! [X1] :
( ~ reachable(X0,X1)
| p(X1) )
& reachable(initial_world,X0) )
| sP0 )
& ( ! [X0] :
( ? [X1] :
( reachable(X0,X1)
& ~ p(X1) )
| ~ reachable(initial_world,X0) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f15,plain,
( ( ? [X2] :
( ! [X3] :
( ~ reachable(X2,X3)
| p(X3) )
& reachable(initial_world,X2) )
| sP0 )
& ( ! [X0] :
( ? [X1] :
( reachable(X0,X1)
& ~ p(X1) )
| ~ reachable(initial_world,X0) )
| ~ sP0 ) ),
inference(rectify,[],[f14]) ).
fof(f16,plain,
( ( ( ! [X3] :
( ~ reachable(sK6,X3)
| p(X3) )
& reachable(initial_world,sK6) )
| sP0 )
& ( ! [X0] :
( ( reachable(X0,sK5(X0))
& ~ p(sK5(X0)) )
| ~ reachable(initial_world,X0) )
| ~ sP0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X1,sK5(X0)),skolemize(X2,sK6)],[f15]) ).
fof(f17,plain,
! [X0] : reachable(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| reachable(X0,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f25,plain,
! [X3] :
( ~ reachable(sK6,X3)
| p(X3)
| sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
( reachable(initial_world,sK6)
| sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
! [X0] :
( reachable(X0,sK5(X0))
| ~ reachable(initial_world,X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
! [X0] :
( ~ p(sK5(X0))
| ~ reachable(initial_world,X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_49,plain,
! [X0: $i] : reachable(X0,X0),
inference(cnf_transformation,[],[f17]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( reachable(X0,X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_57,negated_conjecture,
! [X0: $i] :
( ~ sP0
| ~ p(sK5(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_58,negated_conjecture,
! [X0: $i] :
( reachable(X0,sK5(X0))
| ~ sP0
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_59,negated_conjecture,
( sP0
| reachable(initial_world,sK6) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] :
( sP0
| p(X0)
| ~ reachable(sK6,X0) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_829,negated_conjecture,
( sP0
| reachable(initial_world,sK6) ),
inference(demodulation,[status(thm)],[c_59]) ).
tcf(c_830,negated_conjecture,
! [X0: $i] :
( reachable(X0,sK5(X0))
| ~ sP0
| ~ reachable(initial_world,X0) ),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_832,plain,
! [X0: $i] : reachable(sK1(X0),sK1(X0)),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_872,plain,
reachable(sK3,sK3),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_1163,plain,
( reachable(sK4(sK3),sK5(sK4(sK3)))
| ~ sP0
| ~ reachable(initial_world,sK4(sK3)) ),
inference(instantiation,[status(thm)],[c_830]) ).
fof(f9,definition,
( sP0
<=> ? [X2] :
( ! [X3] :
( ~ reachable(X2,X3)
| ? [X4] :
( ! [X5] :
( ~ reachable(X4,X5)
| p(X5) )
& reachable(X3,X4) ) )
& reachable(initial_world,X2) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f10,plain,
( ? [X0] :
( ! [X1] :
( ~ reachable(X0,X1)
| p(X1) )
& reachable(initial_world,X0) )
<~> sP0 ),
inference(definition_folding,[],[f8,f9]) ).
fof(f11,plain,
( ( ~ sP0
| ? [X2] :
( ! [X3] :
( ~ reachable(X2,X3)
| ? [X4] :
( ! [X5] :
( ~ reachable(X4,X5)
| p(X5) )
& reachable(X3,X4) ) )
& reachable(initial_world,X2) ) )
& ( ! [X2] :
( ? [X3] :
( reachable(X2,X3)
& ! [X4] :
( ? [X5] :
( reachable(X4,X5)
& ~ p(X5) )
| ~ reachable(X3,X4) ) )
| ~ reachable(initial_world,X2) )
| sP0 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f12,plain,
( ( ~ sP0
| ? [X4] :
( ! [X5] :
( ~ reachable(X4,X5)
| ? [X6] :
( ! [X7] :
( ~ reachable(X6,X7)
| p(X7) )
& reachable(X5,X6) ) )
& reachable(initial_world,X4) ) )
& ( ! [X0] :
( ? [X1] :
( reachable(X0,X1)
& ! [X2] :
( ? [X3] :
( reachable(X2,X3)
& ~ p(X3) )
| ~ reachable(X1,X2) ) )
| ~ reachable(initial_world,X0) )
| sP0 ) ),
inference(rectify,[],[f11]) ).
fof(f13,plain,
( ( ~ sP0
| ( ! [X5] :
( ~ reachable(sK3,X5)
| ( ! [X7] :
( ~ reachable(sK4(X5),X7)
| p(X7) )
& reachable(X5,sK4(X5)) ) )
& reachable(initial_world,sK3) ) )
& ( ! [X0] :
( ( reachable(X0,sK1(X0))
& ! [X2] :
( ( reachable(X2,sK2(X2))
& ~ p(sK2(X2)) )
| ~ reachable(sK1(X0),X2) ) )
| ~ reachable(initial_world,X0) )
| sP0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X1,sK1(X0)),skolemize(X3,sK2(X2)),skolemize(X4,sK3),skolemize(X6,sK4(X5))],[f12]) ).
fof(f19,plain,
! [X7,X5] :
( ~ sP0
| ~ reachable(sK3,X5)
| ~ reachable(sK4(X5),X7)
| p(X7) ),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
! [X5] :
( ~ sP0
| ~ reachable(sK3,X5)
| reachable(X5,sK4(X5)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
( ~ sP0
| reachable(initial_world,sK3) ),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
! [X0] :
( reachable(X0,sK1(X0))
| ~ reachable(initial_world,X0)
| sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
! [X2,X0] :
( reachable(X2,sK2(X2))
| ~ reachable(sK1(X0),X2)
| ~ reachable(initial_world,X0)
| sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
! [X2,X0] :
( ~ p(sK2(X2))
| ~ reachable(sK1(X0),X2)
| ~ reachable(initial_world,X0)
| sP0 ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( sP0
| ~ p(sK2(X1))
| ~ reachable(initial_world,X0)
| ~ reachable(sK1(X0),X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( sP0
| reachable(X1,sK2(X1))
| ~ reachable(initial_world,X0)
| ~ reachable(sK1(X0),X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_53,plain,
! [X0: $i] :
( sP0
| reachable(X0,sK1(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_54,plain,
( reachable(initial_world,sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_55,plain,
! [X0: $i] :
( reachable(X0,sK4(X0))
| ~ sP0
| ~ reachable(sK3,X0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( p(X1)
| ~ sP0
| ~ reachable(sK3,X0)
| ~ reachable(sK4(X0),X1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i] :
( sP0
| ~ reachable(initial_world,X0)
| ~ reachable(sK6,sK2(X1))
| ~ reachable(sK1(X0),X1) ),
inference(resolution,[status(thm)],[c_51,c_60]) ).
tcf(c_155,plain,
! [X0: $i,X1: $i] :
( ~ sP0
| ~ reachable(sK3,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sK4(X0),sK5(X1)) ),
inference(resolution,[status(thm)],[c_56,c_57]) ).
tcf(c_827,plain,
! [X0: $i,X1: $i] :
( ~ sP0
| ~ reachable(sK3,X0)
| ~ reachable(initial_world,X1)
| ~ reachable(sK4(X0),sK5(X1)) ),
inference(demodulation,[status(thm)],[c_155]) ).
tcf(c_828,plain,
! [X0: $i,X1: $i] :
( sP0
| ~ reachable(initial_world,X0)
| ~ reachable(sK6,sK2(X1))
| ~ reachable(sK1(X0),X1) ),
inference(demodulation,[status(thm)],[c_141]) ).
tcf(c_831,plain,
! [X0: $i] :
( sP0
| reachable(sK1(X0),sK2(sK1(X0)))
| ~ reachable(initial_world,X0)
| ~ reachable(sK1(X0),sK1(X0)) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_871,plain,
! [X0: $i] :
( ~ sP0
| ~ reachable(sK3,sK3)
| ~ reachable(initial_world,X0)
| ~ reachable(sK4(sK3),sK5(X0)) ),
inference(instantiation,[status(thm)],[c_827]) ).
tcf(c_1034,plain,
! [X0: $i] :
( sP0
| ~ reachable(initial_world,X0)
| ~ reachable(sK6,sK2(sK1(X0))) ),
inference(superposition,[status(thm)],[c_49,c_828]) ).
tcf(c_1110,plain,
! [X0: $i] :
( reachable(initial_world,X0)
| ~ sP0
| ~ reachable(sK3,X0) ),
inference(superposition,[status(thm)],[c_54,c_50]) ).
tcf(c_1130,plain,
! [X0: $i] :
( reachable(initial_world,X0)
| ~ sP0
| ~ reachable(sK3,X0) ),
inference(superposition,[status(thm)],[c_54,c_50]) ).
tcf(c_1162,plain,
( ~ sP0
| ~ reachable(sK3,sK3)
| ~ reachable(initial_world,sK4(sK3))
| ~ reachable(sK4(sK3),sK5(sK4(sK3))) ),
inference(instantiation,[status(thm)],[c_871]) ).
tcf(c_1176,plain,
! [X0: $i,X1: $i] :
( sP0
| reachable(X0,X1)
| ~ reachable(initial_world,X0)
| ~ reachable(sK1(X0),X1) ),
inference(superposition,[status(thm)],[c_53,c_50]) ).
tcf(c_1283,plain,
! [X0: $i] :
( sP0
| reachable(sK1(X0),sK2(sK1(X0)))
| ~ reachable(initial_world,X0) ),
inference(superposition,[status(thm)],[c_49,c_52]) ).
tcf(c_1304,plain,
! [X0: $i] :
( sP0
| reachable(sK1(X0),sK2(sK1(X0)))
| ~ reachable(initial_world,X0) ),
inference(superposition,[status(thm)],[c_49,c_52]) ).
tcf(c_1406,plain,
( reachable(initial_world,sK4(sK3))
| ~ sP0
| ~ reachable(sK3,sK3) ),
inference(superposition,[status(thm)],[c_55,c_1110]) ).
tcf(c_1411,plain,
( reachable(initial_world,sK4(sK3))
| ~ sP0 ),
inference(forward_subsumption_resolution,[status(thm)],[c_1406,c_49]) ).
tcf(c_1414,plain,
~ sP0,
inference(global_subsumption_just,[status(thm)],[c_1130,c_872,c_1162,c_1163,c_1411]) ).
tcf(c_1498,plain,
! [X0: $i] :
( ~ reachable(initial_world,X0)
| reachable(sK1(X0),sK2(sK1(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_1304,c_831,c_832,c_1414]) ).
tcf(c_1499,plain,
! [X0: $i] :
( reachable(sK1(X0),sK2(sK1(X0)))
| ~ reachable(initial_world,X0) ),
inference(renaming,[status(thm)],[c_1498]) ).
tcf(c_1544,plain,
~ sP0,
inference(global_subsumption_just,[status(thm)],[c_1411,c_872,c_1162,c_1163,c_1411]) ).
tcf(c_1547,plain,
! [X0: $i] :
( ~ reachable(initial_world,X0)
| ~ reachable(sK6,sK2(sK1(X0))) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1034,c_1544]) ).
tcf(c_1549,plain,
reachable(initial_world,sK6),
inference(backward_subsumption_resolution,[status(thm)],[c_829,c_1544]) ).
tcf(c_1604,plain,
! [X0: $i,X1: $i] :
( ~ reachable(sK1(X0),X1)
| ~ reachable(initial_world,X0)
| reachable(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_1176,c_872,c_1162,c_1163,c_1176,c_1411]) ).
tcf(c_1605,plain,
! [X0: $i,X1: $i] :
( reachable(X0,X1)
| ~ reachable(initial_world,X0)
| ~ reachable(sK1(X0),X1) ),
inference(renaming,[status(thm)],[c_1604]) ).
tcf(c_1627,plain,
! [X0: $i] :
( ~ reachable(initial_world,X0)
| reachable(sK1(X0),sK2(sK1(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_1283,c_1499]) ).
tcf(c_1628,plain,
! [X0: $i] :
( reachable(sK1(X0),sK2(sK1(X0)))
| ~ reachable(initial_world,X0) ),
inference(renaming,[status(thm)],[c_1627]) ).
tcf(c_1634,plain,
! [X0: $i] :
( reachable(X0,sK2(sK1(X0)))
| ~ reachable(initial_world,X0) ),
inference(superposition,[status(thm)],[c_1628,c_1605]) ).
tcf(c_1720,plain,
~ reachable(initial_world,sK6),
inference(superposition,[status(thm)],[c_1634,c_1547]) ).
tcf(c_1721,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1720,c_1549]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN550+1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n004.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Fri Sep 25 01:43:05 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.14/0.43
% 0.14/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.43
% 0.14/0.44 % Detected problem language: tptp
% 0.14/0.45 % Proving...
% 3.13/1.43 % SZS status Started for theBenchmark.p
% 3.13/1.43 % SZS status Theorem for theBenchmark.p
% 3.13/1.43
% 3.13/1.43 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.13/1.43
% 3.13/1.43 % ------ iProver source info
% 3.13/1.43
% 3.13/1.43 % git: date: 2026-07-19 20:42:38 +0200
% 3.13/1.43 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.13/1.43 % git: non_committed_changes: false
% 3.13/1.43
% 3.13/1.43 % ------ Parsing...
% 3.13/1.43 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.13/1.43
% 3.13/1.43 % ------ 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 %
% 3.13/1.43
% 3.13/1.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.13/1.43 % ------ Proving...
% 3.13/1.43 % ------ Problem Properties
% 3.13/1.43
% 3.13/1.43 %
% 3.13/1.43 % clauses 10
% 3.13/1.43 % conjectures 2
% 3.13/1.43 % EPR 4
% 3.13/1.43 % Horn 7
% 3.13/1.43 % unary 1
% 3.13/1.43 % binary 2
% 3.13/1.43 % lits 29
% 3.13/1.43 % lits eq 0
% 3.13/1.43 % fd_pure 0
% 3.13/1.43 % fd_pseudo 0
% 3.13/1.43 % fd_cond 0
% 3.13/1.43 % fd_pseudo_cond 0
% 3.13/1.43 % AC symbols 0
% 3.13/1.43
% 3.13/1.43 % ------ Schedule dynamic 5 is on
% 3.13/1.43
% 3.13/1.43 % ------ no equalities: superposition off
% 3.13/1.43
% 3.13/1.43 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.13/1.43
% 3.13/1.43
% 3.13/1.43 % ------
% 3.13/1.43 % Current options:
% 3.13/1.43 % ------
% 3.13/1.43
% 3.13/1.43
% 3.13/1.43 %
% 3.13/1.43
% 3.13/1.43 % ------ Proving...
% 3.13/1.43 %
% 3.13/1.43
% 3.13/1.43 % SZS status Theorem for theBenchmark.p
% 3.13/1.43
% 3.13/1.43 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.13/1.44
% 3.13/1.44
%------------------------------------------------------------------------------