%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU193+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 : n018.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:55:50 PM UTC 2026
% Result : Theorem 3.31s 1.31s
% Output : CNFRefutation 3.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 54 ( 14 unt; 1 def)
% Number of atoms : 232 ( 18 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 274 ( 113 ~; 117 |; 30 &)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 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 : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 134 ( 0 sgn 122 !; 12 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0] :
( relation(X0)
=> ! [X1,X2] :
( relation(X2)
=> ( X2 = relation_dom_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_relat_1) ).
fof(f5,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation(X1)
=> ( subset(X0,X1)
<=> ! [X2,X3] :
( in(ordered_pair(X2,X3),X0)
=> in(ordered_pair(X2,X3),X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_relat_1) ).
fof(f6,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(f12,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f35,conjecture,
! [X0,X1] :
( relation(X1)
=> subset(relation_dom_restriction(X1,X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t88_relat_1) ).
fof(f36,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> subset(relation_dom_restriction(X1,X0),X1) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f41,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ~ relation(X2)
| ( X2 = relation_dom_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f42,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ~ relation(X1)
| ( subset(X0,X1)
<=> ! [X2,X3] :
( ~ in(ordered_pair(X2,X3),X0)
| in(ordered_pair(X2,X3),X1) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f43,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(ennf_transformation,[],[f12]) ).
fof(f53,plain,
? [X0,X1] :
( relation(X1)
& ~ subset(relation_dom_restriction(X1,X0),X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f55,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ~ relation(X2)
| ( ( relation_dom_restriction(X0,X1) != X2
| ! [X3,X4] :
( ( ~ in(ordered_pair(X3,X4),X2)
| ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) )
& ( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1)
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ? [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) )
& ( ~ in(ordered_pair(X3,X4),X2)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1) ) )
| X2 = relation_dom_restriction(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f41]) ).
fof(f56,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ~ relation(X2)
| ( ( relation_dom_restriction(X0,X1) != X2
| ! [X3,X4] :
( ( ~ in(ordered_pair(X3,X4),X2)
| ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) )
& ( ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1)
| in(ordered_pair(X3,X4),X2) ) ) )
& ( ? [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) )
& ( ~ in(ordered_pair(X3,X4),X2)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1) ) )
| X2 = relation_dom_restriction(X0,X1) ) ) ) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ~ relation(X2)
| ( ( relation_dom_restriction(X0,X1) != X2
| ! [X5,X6] :
( ( ~ in(ordered_pair(X5,X6),X2)
| ( in(ordered_pair(X5,X6),X0)
& in(X5,X1) ) )
& ( ~ in(ordered_pair(X5,X6),X0)
| ~ in(X5,X1)
| in(ordered_pair(X5,X6),X2) ) ) )
& ( ? [X3,X4] :
( ( in(ordered_pair(X3,X4),X2)
| ( in(ordered_pair(X3,X4),X0)
& in(X3,X1) ) )
& ( ~ in(ordered_pair(X3,X4),X2)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(X3,X1) ) )
| X2 = relation_dom_restriction(X0,X1) ) ) ) ),
inference(rectify,[],[f56]) ).
fof(f58,plain,
! [X0] :
( ~ relation(X0)
| ! [X1,X2] :
( ~ relation(X2)
| ( ( relation_dom_restriction(X0,X1) != X2
| ! [X5,X6] :
( ( ~ in(ordered_pair(X5,X6),X2)
| ( in(ordered_pair(X5,X6),X0)
& in(X5,X1) ) )
& ( ~ in(ordered_pair(X5,X6),X0)
| ~ in(X5,X1)
| in(ordered_pair(X5,X6),X2) ) ) )
& ( ( ( in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X2)
| ( in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X0)
& in(sK0(X0,X1,X2),X1) ) )
& ( ~ in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X2)
| ~ in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X0)
| ~ in(sK0(X0,X1,X2),X1) ) )
| X2 = relation_dom_restriction(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X3,sK0(X0,X1,X2)),skolemize(X4,sK1(X0,X1,X2))],[f57]) ).
fof(f59,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ~ relation(X1)
| ( ( ~ subset(X0,X1)
| ! [X2,X3] :
( ~ in(ordered_pair(X2,X3),X0)
| in(ordered_pair(X2,X3),X1) ) )
& ( ? [X2,X3] :
( in(ordered_pair(X2,X3),X0)
& ~ in(ordered_pair(X2,X3),X1) )
| subset(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f60,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ~ relation(X1)
| ( ( ~ subset(X0,X1)
| ! [X4,X5] :
( ~ in(ordered_pair(X4,X5),X0)
| in(ordered_pair(X4,X5),X1) ) )
& ( ? [X2,X3] :
( in(ordered_pair(X2,X3),X0)
& ~ in(ordered_pair(X2,X3),X1) )
| subset(X0,X1) ) ) ) ),
inference(rectify,[],[f59]) ).
fof(f61,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ~ relation(X1)
| ( ( ~ subset(X0,X1)
| ! [X4,X5] :
( ~ in(ordered_pair(X4,X5),X0)
| in(ordered_pair(X4,X5),X1) ) )
& ( ( in(ordered_pair(sK2(X0,X1),sK3(X0,X1)),X0)
& ~ in(ordered_pair(sK2(X0,X1),sK3(X0,X1)),X1) )
| subset(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X2,sK2(X0,X1)),skolemize(X3,sK3(X0,X1))],[f60]) ).
fof(f70,plain,
( relation(sK12)
& ~ subset(relation_dom_restriction(sK12,sK11),sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X0,sK11),skolemize(X1,sK12)],[f53]) ).
fof(f73,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f74,plain,
! [X2,X0,X1,X6,X5] :
( ~ relation(X0)
| ~ relation(X2)
| relation_dom_restriction(X0,X1) != X2
| ~ in(ordered_pair(X5,X6),X2)
| in(ordered_pair(X5,X6),X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f81,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ relation(X1)
| in(ordered_pair(sK2(X0,X1),sK3(X0,X1)),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f82,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ relation(X1)
| ~ in(ordered_pair(sK2(X0,X1),sK3(X0,X1)),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f83,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f84,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f43]) ).
fof(f112,plain,
relation(sK12),
inference(cnf_transformation,[],[f70]) ).
fof(f113,plain,
~ subset(relation_dom_restriction(sK12,sK11),sK12),
inference(cnf_transformation,[],[f70]) ).
fof(f120,plain,
! [X2,X0,X1,X6,X5] :
( ~ relation(X0)
| ~ relation(X2)
| relation_dom_restriction(X0,X1) != X2
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X2)
| in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0) ),
inference(definition_unfolding,[],[f74,f83,f83]) ).
fof(f121,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(sK2(X0,X1),sK3(X0,X1)),singleton(sK2(X0,X1))),X1)
| subset(X0,X1) ),
inference(definition_unfolding,[],[f82,f83]) ).
fof(f122,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ relation(X1)
| in(unordered_pair(unordered_pair(sK2(X0,X1),sK3(X0,X1)),singleton(sK2(X0,X1))),X0)
| subset(X0,X1) ),
inference(definition_unfolding,[],[f81,f83]) ).
fof(f127,plain,
! [X0,X1,X6,X5] :
( ~ relation(X0)
| ~ relation(relation_dom_restriction(X0,X1))
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),relation_dom_restriction(X0,X1))
| in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0) ),
inference(equality_resolution,[],[f120]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f73]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2)
| ~ relation(X2)
| ~ relation(relation_dom_restriction(X2,X3))
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),relation_dom_restriction(X2,X3)) ),
inference(cnf_transformation,[],[f127]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ relation(X1)
| ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(sK2(X0,X1),sK3(X0,X1)),singleton(sK2(X0,X1))),X1) ),
inference(cnf_transformation,[],[f121]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( subset(X1,X0)
| in(unordered_pair(unordered_pair(sK2(X1,X0),sK3(X1,X0)),singleton(sK2(X1,X0))),X1)
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_89,negated_conjecture,
~ subset(relation_dom_restriction(sK12,sK11),sK12),
inference(cnf_transformation,[],[f113]) ).
tcf(c_90,negated_conjecture,
relation(sK12),
inference(cnf_transformation,[],[f112]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
tcf(c_281,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2)
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),relation_dom_restriction(X2,X3)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_57,c_134]) ).
tcf(c_471,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2)
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),relation_dom_restriction(X2,X3)) ),
inference(demodulation,[status(thm)],[c_281,c_51]) ).
tcf(c_481,plain,
! [X0: $i,X1: $i] :
( subset(X1,X0)
| in(unordered_pair(singleton(sK2(X1,X0)),unordered_pair(sK2(X1,X0),sK3(X1,X0))),X1)
| ~ relation(X1)
| ~ relation(X0) ),
inference(demodulation,[status(thm)],[c_59,c_51]) ).
tcf(c_494,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ relation(X1)
| ~ relation(X0)
| ~ in(unordered_pair(singleton(sK2(X0,X1)),unordered_pair(sK2(X0,X1),sK3(X0,X1))),X1) ),
inference(demodulation,[status(thm)],[c_58,c_51]) ).
tcf(c_1752,definition,
iPr_def_10 = relation_dom_restriction(sK12,sK11),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1753,negated_conjecture,
relation(sK12),
inference(demodulation,[status(thm)],[c_90]) ).
tcf(c_1754,negated_conjecture,
~ subset(iPr_def_10,sK12),
inference(demodulation,[status(thm)],[c_89,c_1752]) ).
tcf(c_2492,plain,
( relation(iPr_def_10)
| ~ relation(sK12) ),
inference(superposition,[status(thm)],[c_1752,c_61]) ).
tcf(c_2493,plain,
relation(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_2492,c_1753]) ).
tcf(c_2611,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK12)
| ~ relation(sK12)
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),iPr_def_10) ),
inference(superposition,[status(thm)],[c_1752,c_471]) ).
tcf(c_2612,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK12)
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2611,c_1753]) ).
tcf(c_2723,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| in(unordered_pair(singleton(sK2(iPr_def_10,X0)),unordered_pair(sK2(iPr_def_10,X0),sK3(iPr_def_10,X0))),sK12)
| ~ relation(iPr_def_10)
| ~ relation(X0) ),
inference(superposition,[status(thm)],[c_481,c_2612]) ).
tcf(c_2728,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| in(unordered_pair(singleton(sK2(iPr_def_10,X0)),unordered_pair(sK2(iPr_def_10,X0),sK3(iPr_def_10,X0))),sK12)
| ~ relation(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2723,c_2493]) ).
tcf(c_2855,plain,
( subset(iPr_def_10,sK12)
| ~ relation(iPr_def_10)
| ~ relation(sK12) ),
inference(superposition,[status(thm)],[c_2728,c_494]) ).
tcf(c_2856,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2855,c_1754,c_2493,c_1753]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU193+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.10/0.39 % Computer : n018.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Thu Sep 24 13:09:50 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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.10/0.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 3.31/1.31 % SZS status Started for theBenchmark.p
% 3.31/1.31 % SZS status Theorem for theBenchmark.p
% 3.31/1.31
% 3.31/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.31/1.31
% 3.31/1.31 % ------ iProver source info
% 3.31/1.31
% 3.31/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.31/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.31/1.31 % git: non_committed_changes: false
% 3.31/1.31
% 3.31/1.31 % ------ Parsing...
% 3.31/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.31/1.31
% 3.31/1.31 % ------ Preprocessing... sup_sim: 9 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.31/1.31
% 3.31/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.31/1.31
% 3.31/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.31/1.31 % ------ Proving...
% 3.31/1.31 % ------ Problem Properties
% 3.31/1.31
% 3.31/1.31 %
% 3.31/1.31 % clauses 42
% 3.31/1.31 % conjectures 2
% 3.31/1.31 % EPR 21
% 3.31/1.31 % Horn 37
% 3.31/1.31 % unary 19
% 3.31/1.31 % binary 10
% 3.31/1.31 % lits 88
% 3.31/1.31 % lits eq 7
% 3.31/1.31 % fd_pure 0
% 3.31/1.31 % fd_pseudo 0
% 3.31/1.31 % fd_cond 1
% 3.31/1.31 % fd_pseudo_cond 4
% 3.31/1.31 % AC symbols 0
% 3.31/1.31
% 3.31/1.31 % ------ Schedule dynamic 5 is on
% 3.31/1.31
% 3.31/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.31/1.31
% 3.31/1.31
% 3.31/1.31 % ------
% 3.31/1.31 % Current options:
% 3.31/1.31 % ------
% 3.31/1.31
% 3.31/1.31
% 3.31/1.31 %
% 3.31/1.31
% 3.31/1.31 % ------ Proving...
% 3.31/1.31 %
% 3.31/1.31
% 3.31/1.31 % SZS status Theorem for theBenchmark.p
% 3.31/1.31
% 3.31/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.31/1.31
% 3.31/1.31
%------------------------------------------------------------------------------