TSTP Solution File: SET711+4 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET711+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n031.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 : 300s
% DateTime : Wed May 31 12:35:04 EDT 2023
% Result : Theorem 13.64s 2.11s
% Output : CNFRefutation 13.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 57 ( 8 unt; 0 def)
% Number of atoms : 308 ( 23 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 393 ( 142 ~; 153 |; 81 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 2 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-4 aty)
% Number of variables : 234 (; 208 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [F,G,A,B] :
( equal_maps(F,G,A,B)
<=> ! [X,Y1,Y2] :
( ( member(X,A)
& member(Y1,B)
& member(Y2,B) )
=> ( ( apply(F,X,Y1)
& apply(G,X,Y2) )
=> Y1 = Y2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [F,A,B] :
( injective(F,A,B)
<=> ! [X1,X2,Y] :
( ( member(X1,A)
& member(X2,A)
& member(Y,B) )
=> ( ( apply(F,X1,Y)
& apply(F,X2,Y) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [F,A,B] :
( one_to_one(F,A,B)
<=> ( injective(F,A,B)
& surjective(F,A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,axiom,
! [G,F,A,B] :
( inverse_predicate(G,F,A,B)
<=> ! [X,Y] :
( ( member(X,A)
& member(Y,B) )
=> ( apply(F,X,Y)
<=> apply(G,Y,X) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f29,conjecture,
! [F,G,H,A,B] :
( ( maps(F,A,B)
& one_to_one(F,A,B)
& inverse_predicate(G,F,A,B)
& inverse_predicate(H,F,A,B) )
=> equal_maps(G,H,B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f30,negated_conjecture,
~ ! [F,G,H,A,B] :
( ( maps(F,A,B)
& one_to_one(F,A,B)
& inverse_predicate(G,F,A,B)
& inverse_predicate(H,F,A,B) )
=> equal_maps(G,H,B,A) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f119,plain,
! [F,G,A,B] :
( equal_maps(F,G,A,B)
<=> ! [X,Y1,Y2] :
( ~ member(X,A)
| ~ member(Y1,B)
| ~ member(Y2,B)
| ~ apply(F,X,Y1)
| ~ apply(G,X,Y2)
| Y1 = Y2 ) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f120,plain,
! [F,G,A,B] :
( ( ~ equal_maps(F,G,A,B)
| ! [X,Y1,Y2] :
( ~ member(X,A)
| ~ member(Y1,B)
| ~ member(Y2,B)
| ~ apply(F,X,Y1)
| ~ apply(G,X,Y2)
| Y1 = Y2 ) )
& ( equal_maps(F,G,A,B)
| ? [X,Y1,Y2] :
( member(X,A)
& member(Y1,B)
& member(Y2,B)
& apply(F,X,Y1)
& apply(G,X,Y2)
& Y1 != Y2 ) ) ),
inference(NNF_transformation,[status(esa)],[f119]) ).
fof(f121,plain,
( ! [F,G,A,B] :
( ~ equal_maps(F,G,A,B)
| ! [X,Y1,Y2] :
( ~ member(X,A)
| ~ member(Y1,B)
| ~ member(Y2,B)
| ~ apply(F,X,Y1)
| ~ apply(G,X,Y2)
| Y1 = Y2 ) )
& ! [F,G,A,B] :
( equal_maps(F,G,A,B)
| ? [X,Y1,Y2] :
( member(X,A)
& member(Y1,B)
& member(Y2,B)
& apply(F,X,Y1)
& apply(G,X,Y2)
& Y1 != Y2 ) ) ),
inference(miniscoping,[status(esa)],[f120]) ).
fof(f122,plain,
( ! [F,G,A,B] :
( ~ equal_maps(F,G,A,B)
| ! [X,Y1,Y2] :
( ~ member(X,A)
| ~ member(Y1,B)
| ~ member(Y2,B)
| ~ apply(F,X,Y1)
| ~ apply(G,X,Y2)
| Y1 = Y2 ) )
& ! [F,G,A,B] :
( equal_maps(F,G,A,B)
| ( member(sk0_12(B,A,G,F),A)
& member(sk0_13(B,A,G,F),B)
& member(sk0_14(B,A,G,F),B)
& apply(F,sk0_12(B,A,G,F),sk0_13(B,A,G,F))
& apply(G,sk0_12(B,A,G,F),sk0_14(B,A,G,F))
& sk0_13(B,A,G,F) != sk0_14(B,A,G,F) ) ) ),
inference(skolemization,[status(esa)],[f121]) ).
fof(f124,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| member(sk0_12(X3,X2,X1,X0),X2) ),
inference(cnf_transformation,[status(esa)],[f122]) ).
fof(f125,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| member(sk0_13(X3,X2,X1,X0),X3) ),
inference(cnf_transformation,[status(esa)],[f122]) ).
fof(f126,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| member(sk0_14(X3,X2,X1,X0),X3) ),
inference(cnf_transformation,[status(esa)],[f122]) ).
fof(f127,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| apply(X0,sk0_12(X3,X2,X1,X0),sk0_13(X3,X2,X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f122]) ).
fof(f128,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| apply(X1,sk0_12(X3,X2,X1,X0),sk0_14(X3,X2,X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f122]) ).
fof(f129,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| sk0_13(X3,X2,X1,X0) != sk0_14(X3,X2,X1,X0) ),
inference(cnf_transformation,[status(esa)],[f122]) ).
fof(f137,plain,
! [F,A,B] :
( injective(F,A,B)
<=> ! [X1,X2,Y] :
( ~ member(X1,A)
| ~ member(X2,A)
| ~ member(Y,B)
| ~ apply(F,X1,Y)
| ~ apply(F,X2,Y)
| X1 = X2 ) ),
inference(pre_NNF_transformation,[status(esa)],[f17]) ).
fof(f138,plain,
! [F,A,B] :
( ( ~ injective(F,A,B)
| ! [X1,X2,Y] :
( ~ member(X1,A)
| ~ member(X2,A)
| ~ member(Y,B)
| ~ apply(F,X1,Y)
| ~ apply(F,X2,Y)
| X1 = X2 ) )
& ( injective(F,A,B)
| ? [X1,X2,Y] :
( member(X1,A)
& member(X2,A)
& member(Y,B)
& apply(F,X1,Y)
& apply(F,X2,Y)
& X1 != X2 ) ) ),
inference(NNF_transformation,[status(esa)],[f137]) ).
fof(f139,plain,
( ! [F,A,B] :
( ~ injective(F,A,B)
| ! [X1,X2,Y] :
( ~ member(X1,A)
| ~ member(X2,A)
| ~ member(Y,B)
| ~ apply(F,X1,Y)
| ~ apply(F,X2,Y)
| X1 = X2 ) )
& ! [F,A,B] :
( injective(F,A,B)
| ? [X1,X2,Y] :
( member(X1,A)
& member(X2,A)
& member(Y,B)
& apply(F,X1,Y)
& apply(F,X2,Y)
& X1 != X2 ) ) ),
inference(miniscoping,[status(esa)],[f138]) ).
fof(f140,plain,
( ! [F,A,B] :
( ~ injective(F,A,B)
| ! [X1,X2,Y] :
( ~ member(X1,A)
| ~ member(X2,A)
| ~ member(Y,B)
| ~ apply(F,X1,Y)
| ~ apply(F,X2,Y)
| X1 = X2 ) )
& ! [F,A,B] :
( injective(F,A,B)
| ( member(sk0_16(B,A,F),A)
& member(sk0_17(B,A,F),A)
& member(sk0_18(B,A,F),B)
& apply(F,sk0_16(B,A,F),sk0_18(B,A,F))
& apply(F,sk0_17(B,A,F),sk0_18(B,A,F))
& sk0_16(B,A,F) != sk0_17(B,A,F) ) ) ),
inference(skolemization,[status(esa)],[f139]) ).
fof(f141,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ injective(X0,X1,X2)
| ~ member(X3,X1)
| ~ member(X4,X1)
| ~ member(X5,X2)
| ~ apply(X0,X3,X5)
| ~ apply(X0,X4,X5)
| X3 = X4 ),
inference(cnf_transformation,[status(esa)],[f140]) ).
fof(f156,plain,
! [F,A,B] :
( ( ~ one_to_one(F,A,B)
| ( injective(F,A,B)
& surjective(F,A,B) ) )
& ( one_to_one(F,A,B)
| ~ injective(F,A,B)
| ~ surjective(F,A,B) ) ),
inference(NNF_transformation,[status(esa)],[f19]) ).
fof(f157,plain,
( ! [F,A,B] :
( ~ one_to_one(F,A,B)
| ( injective(F,A,B)
& surjective(F,A,B) ) )
& ! [F,A,B] :
( one_to_one(F,A,B)
| ~ injective(F,A,B)
| ~ surjective(F,A,B) ) ),
inference(miniscoping,[status(esa)],[f156]) ).
fof(f158,plain,
! [X0,X1,X2] :
( ~ one_to_one(X0,X1,X2)
| injective(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f157]) ).
fof(f161,plain,
! [G,F,A,B] :
( inverse_predicate(G,F,A,B)
<=> ! [X,Y] :
( ~ member(X,A)
| ~ member(Y,B)
| ( apply(F,X,Y)
<=> apply(G,Y,X) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f162,plain,
! [G,F,A,B] :
( ( ~ inverse_predicate(G,F,A,B)
| ! [X,Y] :
( ~ member(X,A)
| ~ member(Y,B)
| ( ( ~ apply(F,X,Y)
| apply(G,Y,X) )
& ( apply(F,X,Y)
| ~ apply(G,Y,X) ) ) ) )
& ( inverse_predicate(G,F,A,B)
| ? [X,Y] :
( member(X,A)
& member(Y,B)
& ( ~ apply(F,X,Y)
| ~ apply(G,Y,X) )
& ( apply(F,X,Y)
| apply(G,Y,X) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f161]) ).
fof(f163,plain,
( ! [G,F,A,B] :
( ~ inverse_predicate(G,F,A,B)
| ! [X,Y] :
( ~ member(X,A)
| ~ member(Y,B)
| ( ( ~ apply(F,X,Y)
| apply(G,Y,X) )
& ( apply(F,X,Y)
| ~ apply(G,Y,X) ) ) ) )
& ! [G,F,A,B] :
( inverse_predicate(G,F,A,B)
| ? [X,Y] :
( member(X,A)
& member(Y,B)
& ( ~ apply(F,X,Y)
| ~ apply(G,Y,X) )
& ( apply(F,X,Y)
| apply(G,Y,X) ) ) ) ),
inference(miniscoping,[status(esa)],[f162]) ).
fof(f164,plain,
( ! [G,F,A,B] :
( ~ inverse_predicate(G,F,A,B)
| ! [X,Y] :
( ~ member(X,A)
| ~ member(Y,B)
| ( ( ~ apply(F,X,Y)
| apply(G,Y,X) )
& ( apply(F,X,Y)
| ~ apply(G,Y,X) ) ) ) )
& ! [G,F,A,B] :
( inverse_predicate(G,F,A,B)
| ( member(sk0_21(B,A,F,G),A)
& member(sk0_22(B,A,F,G),B)
& ( ~ apply(F,sk0_21(B,A,F,G),sk0_22(B,A,F,G))
| ~ apply(G,sk0_22(B,A,F,G),sk0_21(B,A,F,G)) )
& ( apply(F,sk0_21(B,A,F,G),sk0_22(B,A,F,G))
| apply(G,sk0_22(B,A,F,G),sk0_21(B,A,F,G)) ) ) ) ),
inference(skolemization,[status(esa)],[f163]) ).
fof(f166,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ inverse_predicate(X0,X1,X2,X3)
| ~ member(X4,X2)
| ~ member(X5,X3)
| apply(X1,X4,X5)
| ~ apply(X0,X5,X4) ),
inference(cnf_transformation,[status(esa)],[f164]) ).
fof(f244,plain,
? [F,G,H,A,B] :
( maps(F,A,B)
& one_to_one(F,A,B)
& inverse_predicate(G,F,A,B)
& inverse_predicate(H,F,A,B)
& ~ equal_maps(G,H,B,A) ),
inference(pre_NNF_transformation,[status(esa)],[f30]) ).
fof(f245,plain,
? [G,H,A,B] :
( ? [F] :
( maps(F,A,B)
& one_to_one(F,A,B)
& inverse_predicate(G,F,A,B)
& inverse_predicate(H,F,A,B) )
& ~ equal_maps(G,H,B,A) ),
inference(miniscoping,[status(esa)],[f244]) ).
fof(f246,plain,
( maps(sk0_43,sk0_41,sk0_42)
& one_to_one(sk0_43,sk0_41,sk0_42)
& inverse_predicate(sk0_39,sk0_43,sk0_41,sk0_42)
& inverse_predicate(sk0_40,sk0_43,sk0_41,sk0_42)
& ~ equal_maps(sk0_39,sk0_40,sk0_42,sk0_41) ),
inference(skolemization,[status(esa)],[f245]) ).
fof(f248,plain,
one_to_one(sk0_43,sk0_41,sk0_42),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f249,plain,
inverse_predicate(sk0_39,sk0_43,sk0_41,sk0_42),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f250,plain,
inverse_predicate(sk0_40,sk0_43,sk0_41,sk0_42),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f251,plain,
~ equal_maps(sk0_39,sk0_40,sk0_42,sk0_41),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f270,plain,
! [X0,X1] :
( ~ member(X0,sk0_41)
| ~ member(X1,sk0_42)
| apply(sk0_43,X0,X1)
| ~ apply(sk0_40,X1,X0) ),
inference(resolution,[status(thm)],[f166,f250]) ).
fof(f271,plain,
! [X0,X1] :
( ~ member(X0,sk0_41)
| ~ member(X1,sk0_42)
| apply(sk0_43,X0,X1)
| ~ apply(sk0_39,X1,X0) ),
inference(resolution,[status(thm)],[f166,f249]) ).
fof(f280,plain,
injective(sk0_43,sk0_41,sk0_42),
inference(resolution,[status(thm)],[f158,f248]) ).
fof(f1727,plain,
! [X0,X1,X2] :
( equal_maps(sk0_39,X0,X1,X2)
| ~ member(sk0_13(X2,X1,X0,sk0_39),sk0_41)
| ~ member(sk0_12(X2,X1,X0,sk0_39),sk0_42)
| apply(sk0_43,sk0_13(X2,X1,X0,sk0_39),sk0_12(X2,X1,X0,sk0_39)) ),
inference(resolution,[status(thm)],[f127,f271]) ).
fof(f1743,plain,
! [X0,X1,X2] :
( equal_maps(X0,sk0_40,X1,X2)
| ~ member(sk0_14(X2,X1,sk0_40,X0),sk0_41)
| ~ member(sk0_12(X2,X1,sk0_40,X0),sk0_42)
| apply(sk0_43,sk0_14(X2,X1,sk0_40,X0),sk0_12(X2,X1,sk0_40,X0)) ),
inference(resolution,[status(thm)],[f128,f270]) ).
fof(f2068,plain,
! [X0,X1,X2] :
( ~ member(X0,sk0_41)
| ~ member(X1,sk0_41)
| ~ member(X2,sk0_42)
| ~ apply(sk0_43,X0,X2)
| ~ apply(sk0_43,X1,X2)
| X0 = X1 ),
inference(resolution,[status(thm)],[f141,f280]) ).
fof(f2115,plain,
! [X0,X1,X2,X3] :
( ~ member(X0,sk0_41)
| ~ member(sk0_14(X1,X2,sk0_40,X3),sk0_41)
| ~ member(sk0_12(X1,X2,sk0_40,X3),sk0_42)
| ~ apply(sk0_43,X0,sk0_12(X1,X2,sk0_40,X3))
| X0 = sk0_14(X1,X2,sk0_40,X3)
| equal_maps(X3,sk0_40,X2,X1)
| ~ member(sk0_14(X1,X2,sk0_40,X3),sk0_41)
| ~ member(sk0_12(X1,X2,sk0_40,X3),sk0_42) ),
inference(resolution,[status(thm)],[f2068,f1743]) ).
fof(f2116,plain,
! [X0,X1,X2,X3] :
( ~ member(X0,sk0_41)
| ~ member(sk0_14(X1,X2,sk0_40,X3),sk0_41)
| ~ member(sk0_12(X1,X2,sk0_40,X3),sk0_42)
| ~ apply(sk0_43,X0,sk0_12(X1,X2,sk0_40,X3))
| X0 = sk0_14(X1,X2,sk0_40,X3)
| equal_maps(X3,sk0_40,X2,X1) ),
inference(duplicate_literals_removal,[status(esa)],[f2115]) ).
fof(f3524,plain,
! [X0,X1] :
( ~ member(sk0_13(X0,X1,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_14(X0,X1,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_12(X0,X1,sk0_40,sk0_39),sk0_42)
| sk0_13(X0,X1,sk0_40,sk0_39) = sk0_14(X0,X1,sk0_40,sk0_39)
| equal_maps(sk0_39,sk0_40,X1,X0)
| equal_maps(sk0_39,sk0_40,X1,X0)
| ~ member(sk0_13(X0,X1,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_12(X0,X1,sk0_40,sk0_39),sk0_42) ),
inference(resolution,[status(thm)],[f2116,f1727]) ).
fof(f3525,plain,
! [X0,X1] :
( ~ member(sk0_13(X0,X1,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_14(X0,X1,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_12(X0,X1,sk0_40,sk0_39),sk0_42)
| sk0_13(X0,X1,sk0_40,sk0_39) = sk0_14(X0,X1,sk0_40,sk0_39)
| equal_maps(sk0_39,sk0_40,X1,X0) ),
inference(duplicate_literals_removal,[status(esa)],[f3524]) ).
fof(f3526,plain,
! [X0,X1] :
( ~ member(sk0_13(X0,X1,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_14(X0,X1,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_12(X0,X1,sk0_40,sk0_39),sk0_42)
| equal_maps(sk0_39,sk0_40,X1,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f3525,f129]) ).
fof(f3610,plain,
! [X0] :
( ~ member(sk0_13(sk0_41,X0,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_12(sk0_41,X0,sk0_40,sk0_39),sk0_42)
| equal_maps(sk0_39,sk0_40,X0,sk0_41)
| equal_maps(sk0_39,sk0_40,X0,sk0_41) ),
inference(resolution,[status(thm)],[f3526,f126]) ).
fof(f3611,plain,
! [X0] :
( ~ member(sk0_13(sk0_41,X0,sk0_40,sk0_39),sk0_41)
| ~ member(sk0_12(sk0_41,X0,sk0_40,sk0_39),sk0_42)
| equal_maps(sk0_39,sk0_40,X0,sk0_41) ),
inference(duplicate_literals_removal,[status(esa)],[f3610]) ).
fof(f3612,plain,
! [X0] :
( ~ member(sk0_12(sk0_41,X0,sk0_40,sk0_39),sk0_42)
| equal_maps(sk0_39,sk0_40,X0,sk0_41) ),
inference(forward_subsumption_resolution,[status(thm)],[f3611,f125]) ).
fof(f3613,plain,
( spl0_62
<=> equal_maps(sk0_39,sk0_40,sk0_42,sk0_41) ),
introduced(split_symbol_definition) ).
fof(f3614,plain,
( equal_maps(sk0_39,sk0_40,sk0_42,sk0_41)
| ~ spl0_62 ),
inference(component_clause,[status(thm)],[f3613]) ).
fof(f3616,plain,
( equal_maps(sk0_39,sk0_40,sk0_42,sk0_41)
| equal_maps(sk0_39,sk0_40,sk0_42,sk0_41) ),
inference(resolution,[status(thm)],[f3612,f124]) ).
fof(f3617,plain,
spl0_62,
inference(split_clause,[status(thm)],[f3616,f3613]) ).
fof(f3618,plain,
( $false
| ~ spl0_62 ),
inference(forward_subsumption_resolution,[status(thm)],[f3614,f251]) ).
fof(f3619,plain,
~ spl0_62,
inference(contradiction_clause,[status(thm)],[f3618]) ).
fof(f3620,plain,
$false,
inference(sat_refutation,[status(thm)],[f3617,f3619]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET711+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.04/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue May 30 10:40:52 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.35 % Drodi V3.5.1
% 13.64/2.11 % Refutation found
% 13.64/2.11 % SZS status Theorem for theBenchmark: Theorem is valid
% 13.64/2.11 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 13.94/2.13 % Elapsed time: 1.782823 seconds
% 13.94/2.13 % CPU time: 14.030535 seconds
% 13.94/2.13 % Memory used: 136.750 MB
%------------------------------------------------------------------------------