TSTP Solution File: SET707+4 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SET707+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n024.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 : Tue Apr 30 20:40:14 EDT 2024
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 107 ( 6 unt; 0 def)
% Number of atoms : 289 ( 73 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 316 ( 134 ~; 144 |; 21 &)
% ( 14 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 101 ( 95 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] :
( equal_set(A,B)
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,A] :
( member(X,singleton(A))
<=> X = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X,A,B] :
( member(X,unordered_pair(A,B))
<=> ( X = A
| X = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,conjecture,
! [A,B,U,V] :
( equal_set(unordered_pair(singleton(A),unordered_pair(A,B)),unordered_pair(singleton(U),unordered_pair(U,V)))
=> ( A = U
& B = V ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
~ ! [A,B,U,V] :
( equal_set(unordered_pair(singleton(A),unordered_pair(A,B)),unordered_pair(singleton(U),unordered_pair(U,V)))
=> ( A = U
& B = V ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( ~ member(X,A)
| member(X,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f1]) ).
fof(f15,plain,
! [A,B] :
( ( ~ subset(A,B)
| ! [X] :
( ~ member(X,A)
| member(X,B) ) )
& ( subset(A,B)
| ? [X] :
( member(X,A)
& ~ member(X,B) ) ) ),
inference(NNF_transformation,[status(esa)],[f14]) ).
fof(f16,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [X] :
( ~ member(X,A)
| member(X,B) ) )
& ! [A,B] :
( subset(A,B)
| ? [X] :
( member(X,A)
& ~ member(X,B) ) ) ),
inference(miniscoping,[status(esa)],[f15]) ).
fof(f17,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [X] :
( ~ member(X,A)
| member(X,B) ) )
& ! [A,B] :
( subset(A,B)
| ( member(sk0_0(B,A),A)
& ~ member(sk0_0(B,A),B) ) ) ),
inference(skolemization,[status(esa)],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f21,plain,
! [A,B] :
( ( ~ equal_set(A,B)
| ( subset(A,B)
& subset(B,A) ) )
& ( equal_set(A,B)
| ~ subset(A,B)
| ~ subset(B,A) ) ),
inference(NNF_transformation,[status(esa)],[f2]) ).
fof(f22,plain,
( ! [A,B] :
( ~ equal_set(A,B)
| ( subset(A,B)
& subset(B,A) ) )
& ! [A,B] :
( equal_set(A,B)
| ~ subset(A,B)
| ~ subset(B,A) ) ),
inference(miniscoping,[status(esa)],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f46,plain,
! [X,A] :
( ( ~ member(X,singleton(A))
| X = A )
& ( member(X,singleton(A))
| X != A ) ),
inference(NNF_transformation,[status(esa)],[f8]) ).
fof(f47,plain,
( ! [X,A] :
( ~ member(X,singleton(A))
| X = A )
& ! [X,A] :
( member(X,singleton(A))
| X != A ) ),
inference(miniscoping,[status(esa)],[f46]) ).
fof(f48,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f49,plain,
! [X0,X1] :
( member(X0,singleton(X1))
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f50,plain,
! [X,A,B] :
( ( ~ member(X,unordered_pair(A,B))
| X = A
| X = B )
& ( member(X,unordered_pair(A,B))
| ( X != A
& X != B ) ) ),
inference(NNF_transformation,[status(esa)],[f9]) ).
fof(f51,plain,
( ! [X,A,B] :
( ~ member(X,unordered_pair(A,B))
| X = A
| X = B )
& ! [X,A,B] :
( member(X,unordered_pair(A,B))
| ( X != A
& X != B ) ) ),
inference(miniscoping,[status(esa)],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[status(esa)],[f51]) ).
fof(f53,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f51]) ).
fof(f54,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2 ),
inference(cnf_transformation,[status(esa)],[f51]) ).
fof(f68,plain,
? [A,B,U,V] :
( equal_set(unordered_pair(singleton(A),unordered_pair(A,B)),unordered_pair(singleton(U),unordered_pair(U,V)))
& ( A != U
| B != V ) ),
inference(pre_NNF_transformation,[status(esa)],[f13]) ).
fof(f69,plain,
( equal_set(unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_4)),unordered_pair(singleton(sk0_5),unordered_pair(sk0_5,sk0_6)))
& ( sk0_3 != sk0_5
| sk0_4 != sk0_6 ) ),
inference(skolemization,[status(esa)],[f68]) ).
fof(f70,plain,
equal_set(unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_4)),unordered_pair(singleton(sk0_5),unordered_pair(sk0_5,sk0_6))),
inference(cnf_transformation,[status(esa)],[f69]) ).
fof(f71,plain,
( sk0_3 != sk0_5
| sk0_4 != sk0_6 ),
inference(cnf_transformation,[status(esa)],[f69]) ).
fof(f72,plain,
( spl0_0
<=> sk0_3 = sk0_5 ),
introduced(split_symbol_definition) ).
fof(f73,plain,
( sk0_3 = sk0_5
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f72]) ).
fof(f74,plain,
( sk0_3 != sk0_5
| spl0_0 ),
inference(component_clause,[status(thm)],[f72]) ).
fof(f75,plain,
( spl0_1
<=> sk0_4 = sk0_6 ),
introduced(split_symbol_definition) ).
fof(f77,plain,
( sk0_4 != sk0_6
| spl0_1 ),
inference(component_clause,[status(thm)],[f75]) ).
fof(f78,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f71,f72,f75]) ).
fof(f79,plain,
! [X0] : member(X0,singleton(X0)),
inference(destructive_equality_resolution,[status(esa)],[f49]) ).
fof(f80,plain,
! [X0,X1] : member(X0,unordered_pair(X0,X1)),
inference(destructive_equality_resolution,[status(esa)],[f53]) ).
fof(f81,plain,
! [X0,X1] : member(X0,unordered_pair(X1,X0)),
inference(destructive_equality_resolution,[status(esa)],[f54]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ~ subset(unordered_pair(X0,X1),X2)
| member(X1,X2) ),
inference(resolution,[status(thm)],[f18,f81]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ~ subset(unordered_pair(X0,X1),X2)
| member(X0,X2) ),
inference(resolution,[status(thm)],[f18,f80]) ).
fof(f88,plain,
! [X0,X1,X2] :
( member(X0,X1)
| ~ equal_set(X1,unordered_pair(X2,X0)) ),
inference(resolution,[status(thm)],[f83,f24]) ).
fof(f89,plain,
! [X0,X1,X2] :
( member(X0,X1)
| ~ equal_set(unordered_pair(X2,X0),X1) ),
inference(resolution,[status(thm)],[f83,f23]) ).
fof(f100,plain,
! [X0,X1,X2] :
( member(X0,X1)
| ~ equal_set(X1,unordered_pair(X0,X2)) ),
inference(resolution,[status(thm)],[f84,f24]) ).
fof(f106,plain,
member(singleton(sk0_5),unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_4))),
inference(resolution,[status(thm)],[f100,f70]) ).
fof(f113,plain,
( spl0_2
<=> singleton(sk0_5) = singleton(sk0_3) ),
introduced(split_symbol_definition) ).
fof(f114,plain,
( singleton(sk0_5) = singleton(sk0_3)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f113]) ).
fof(f116,plain,
( spl0_3
<=> singleton(sk0_5) = unordered_pair(sk0_3,sk0_4) ),
introduced(split_symbol_definition) ).
fof(f117,plain,
( singleton(sk0_5) = unordered_pair(sk0_3,sk0_4)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f116]) ).
fof(f118,plain,
( singleton(sk0_5) != unordered_pair(sk0_3,sk0_4)
| spl0_3 ),
inference(component_clause,[status(thm)],[f116]) ).
fof(f119,plain,
( singleton(sk0_5) = singleton(sk0_3)
| singleton(sk0_5) = unordered_pair(sk0_3,sk0_4) ),
inference(resolution,[status(thm)],[f106,f52]) ).
fof(f120,plain,
( spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f119,f113,f116]) ).
fof(f123,plain,
( equal_set(unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_4)),unordered_pair(singleton(sk0_3),unordered_pair(sk0_5,sk0_6)))
| ~ spl0_2 ),
inference(backward_demodulation,[status(thm)],[f114,f70]) ).
fof(f128,plain,
( member(sk0_5,singleton(sk0_3))
| ~ spl0_2 ),
inference(paramodulation,[status(thm)],[f114,f79]) ).
fof(f129,plain,
( sk0_5 = sk0_3
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f128,f48]) ).
fof(f130,plain,
( $false
| spl0_0
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f129,f74]) ).
fof(f131,plain,
( spl0_0
| ~ spl0_2 ),
inference(contradiction_clause,[status(thm)],[f130]) ).
fof(f132,plain,
( singleton(sk0_3) = unordered_pair(sk0_3,sk0_4)
| ~ spl0_0
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f73,f117]) ).
fof(f140,plain,
( member(sk0_4,singleton(sk0_3))
| ~ spl0_0
| ~ spl0_3 ),
inference(paramodulation,[status(thm)],[f132,f81]) ).
fof(f142,plain,
( sk0_4 = sk0_3
| ~ spl0_0
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f140,f48]) ).
fof(f145,plain,
( singleton(sk0_3) = unordered_pair(sk0_3,sk0_3)
| ~ spl0_0
| ~ spl0_3 ),
inference(backward_demodulation,[status(thm)],[f142,f132]) ).
fof(f146,plain,
( sk0_3 != sk0_6
| ~ spl0_0
| ~ spl0_3
| spl0_1 ),
inference(backward_demodulation,[status(thm)],[f142,f77]) ).
fof(f163,plain,
( equal_set(unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_3)),unordered_pair(singleton(sk0_5),unordered_pair(sk0_5,sk0_6)))
| ~ spl0_0
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f142,f70]) ).
fof(f164,plain,
( equal_set(unordered_pair(singleton(sk0_3),singleton(sk0_3)),unordered_pair(singleton(sk0_5),unordered_pair(sk0_5,sk0_6)))
| ~ spl0_0
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f145,f163]) ).
fof(f165,plain,
( equal_set(unordered_pair(singleton(sk0_3),singleton(sk0_3)),unordered_pair(singleton(sk0_3),unordered_pair(sk0_5,sk0_6)))
| ~ spl0_0
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f73,f164]) ).
fof(f166,plain,
( equal_set(unordered_pair(singleton(sk0_3),singleton(sk0_3)),unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_6)))
| ~ spl0_0
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f73,f165]) ).
fof(f170,plain,
( member(unordered_pair(sk0_3,sk0_6),unordered_pair(singleton(sk0_3),singleton(sk0_3)))
| ~ spl0_0
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f166,f88]) ).
fof(f171,plain,
( spl0_4
<=> unordered_pair(sk0_3,sk0_6) = singleton(sk0_3) ),
introduced(split_symbol_definition) ).
fof(f172,plain,
( unordered_pair(sk0_3,sk0_6) = singleton(sk0_3)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f171]) ).
fof(f174,plain,
( unordered_pair(sk0_3,sk0_6) = singleton(sk0_3)
| unordered_pair(sk0_3,sk0_6) = singleton(sk0_3)
| ~ spl0_0
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f170,f52]) ).
fof(f175,plain,
( spl0_4
| ~ spl0_0
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f174,f171,f72,f116]) ).
fof(f184,plain,
( member(sk0_4,singleton(sk0_5))
| ~ spl0_3 ),
inference(paramodulation,[status(thm)],[f117,f81]) ).
fof(f185,plain,
( member(sk0_3,singleton(sk0_5))
| ~ spl0_3 ),
inference(paramodulation,[status(thm)],[f117,f80]) ).
fof(f186,plain,
( sk0_4 = sk0_5
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f184,f48]) ).
fof(f191,plain,
( sk0_3 != sk0_4
| ~ spl0_3
| spl0_0 ),
inference(backward_demodulation,[status(thm)],[f186,f74]) ).
fof(f192,plain,
( member(sk0_3,singleton(sk0_4))
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f186,f185]) ).
fof(f193,plain,
( sk0_3 = sk0_4
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f192,f48]) ).
fof(f194,plain,
( $false
| spl0_0
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f193,f191]) ).
fof(f195,plain,
( spl0_0
| ~ spl0_3 ),
inference(contradiction_clause,[status(thm)],[f194]) ).
fof(f198,plain,
( singleton(sk0_3) != unordered_pair(sk0_3,sk0_4)
| ~ spl0_2
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f129,f118]) ).
fof(f201,plain,
( equal_set(unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_4)),unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_6)))
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f129,f123]) ).
fof(f203,plain,
( member(unordered_pair(sk0_3,sk0_4),unordered_pair(singleton(sk0_3),unordered_pair(sk0_3,sk0_6)))
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f201,f89]) ).
fof(f206,plain,
( spl0_5
<=> unordered_pair(sk0_3,sk0_4) = singleton(sk0_3) ),
introduced(split_symbol_definition) ).
fof(f207,plain,
( unordered_pair(sk0_3,sk0_4) = singleton(sk0_3)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f206]) ).
fof(f209,plain,
( spl0_6
<=> unordered_pair(sk0_3,sk0_4) = unordered_pair(sk0_3,sk0_6) ),
introduced(split_symbol_definition) ).
fof(f210,plain,
( unordered_pair(sk0_3,sk0_4) = unordered_pair(sk0_3,sk0_6)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f209]) ).
fof(f212,plain,
( unordered_pair(sk0_3,sk0_4) = singleton(sk0_3)
| unordered_pair(sk0_3,sk0_4) = unordered_pair(sk0_3,sk0_6)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f203,f52]) ).
fof(f213,plain,
( spl0_5
| spl0_6
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f212,f206,f209,f113]) ).
fof(f215,plain,
( $false
| ~ spl0_2
| spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f207,f198]) ).
fof(f216,plain,
( ~ spl0_2
| spl0_3
| ~ spl0_5 ),
inference(contradiction_clause,[status(thm)],[f215]) ).
fof(f434,plain,
( member(sk0_6,singleton(sk0_3))
| ~ spl0_4 ),
inference(paramodulation,[status(thm)],[f172,f81]) ).
fof(f436,plain,
( sk0_6 = sk0_3
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f434,f48]) ).
fof(f437,plain,
( $false
| ~ spl0_0
| ~ spl0_3
| spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f436,f146]) ).
fof(f438,plain,
( ~ spl0_0
| ~ spl0_3
| spl0_1
| ~ spl0_4 ),
inference(contradiction_clause,[status(thm)],[f437]) ).
fof(f462,plain,
( member(sk0_6,unordered_pair(sk0_3,sk0_4))
| ~ spl0_6 ),
inference(paramodulation,[status(thm)],[f210,f81]) ).
fof(f470,plain,
( spl0_7
<=> sk0_6 = sk0_3 ),
introduced(split_symbol_definition) ).
fof(f471,plain,
( sk0_6 = sk0_3
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f470]) ).
fof(f473,plain,
( sk0_6 = sk0_3
| sk0_6 = sk0_4
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f462,f52]) ).
fof(f474,plain,
( spl0_7
| spl0_1
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f473,f470,f75,f209]) ).
fof(f478,plain,
( unordered_pair(sk0_3,sk0_4) = unordered_pair(sk0_3,sk0_3)
| ~ spl0_7
| ~ spl0_6 ),
inference(backward_demodulation,[status(thm)],[f471,f210]) ).
fof(f479,plain,
( sk0_4 != sk0_3
| ~ spl0_7
| spl0_1 ),
inference(backward_demodulation,[status(thm)],[f471,f77]) ).
fof(f503,plain,
( member(sk0_4,unordered_pair(sk0_3,sk0_3))
| ~ spl0_7
| ~ spl0_6 ),
inference(paramodulation,[status(thm)],[f478,f81]) ).
fof(f505,plain,
( spl0_8
<=> sk0_4 = sk0_3 ),
introduced(split_symbol_definition) ).
fof(f506,plain,
( sk0_4 = sk0_3
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f505]) ).
fof(f508,plain,
( sk0_4 = sk0_3
| sk0_4 = sk0_3
| ~ spl0_7
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f503,f52]) ).
fof(f509,plain,
( spl0_8
| ~ spl0_7
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f508,f505,f470,f209]) ).
fof(f512,plain,
( $false
| ~ spl0_7
| spl0_1
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f506,f479]) ).
fof(f513,plain,
( ~ spl0_7
| spl0_1
| ~ spl0_8 ),
inference(contradiction_clause,[status(thm)],[f512]) ).
fof(f514,plain,
$false,
inference(sat_refutation,[status(thm)],[f78,f120,f131,f175,f195,f213,f216,f438,f474,f509,f513]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET707+4 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 29 21:28:51 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 0.13/0.40 % Refutation found
% 0.13/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.41 % Elapsed time: 0.063061 seconds
% 0.19/0.41 % CPU time: 0.390233 seconds
% 0.19/0.41 % Total memory used: 55.639 MB
% 0.19/0.41 % Net memory used: 55.388 MB
%------------------------------------------------------------------------------