TSTP Solution File: LCL656+1.001 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n016.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:19:56 EDT 2023
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 206 ( 0 equ)
% Maximal formula atoms : 37 ( 6 avg)
% Number of connectives : 314 ( 139 ~; 111 |; 60 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 39 (; 34 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : r1(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,conjecture,
~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ( ( ( ~ ! [X] :
( ~ r1(Y,X)
| ~ ( ~ p2(X)
& ~ p102(X)
& p101(X) ) )
& ~ ! [X] :
( ~ r1(Y,X)
| ~ ( p2(X)
& ~ p102(X)
& p101(X) ) ) )
| ~ ( ~ p101(Y)
& p100(Y) ) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p2(X)
| ~ p101(X) )
| p2(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p2(X)
| ~ p101(X) )
| ~ p2(Y) ) )
| ~ p101(Y) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p1(X)
| ~ p100(X) )
| p1(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p1(X)
| ~ p100(X) )
| ~ p1(Y) ) )
| ~ p100(Y) )
& ( p101(Y)
| ~ p102(Y) )
& ( p100(Y)
| ~ p101(Y) ) ) )
& ~ p101(X)
& p100(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ( ( ( ~ ! [X] :
( ~ r1(Y,X)
| ~ ( ~ p2(X)
& ~ p102(X)
& p101(X) ) )
& ~ ! [X] :
( ~ r1(Y,X)
| ~ ( p2(X)
& ~ p102(X)
& p101(X) ) ) )
| ~ ( ~ p101(Y)
& p100(Y) ) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p2(X)
| ~ p101(X) )
| p2(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p2(X)
| ~ p101(X) )
| ~ p2(Y) ) )
| ~ p101(Y) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p1(X)
| ~ p100(X) )
| p1(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p1(X)
| ~ p100(X) )
| ~ p1(Y) ) )
| ~ p100(Y) )
& ( p101(Y)
| ~ p102(Y) )
& ( p100(Y)
| ~ p101(Y) ) ) )
& ~ p101(X)
& p100(X) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f5,plain,
? [X] :
( ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
& ! [Y] :
( ~ r1(X,Y)
| ( ( ( ? [X] :
( r1(Y,X)
& ~ p2(X)
& ~ p102(X)
& p101(X) )
& ? [X] :
( r1(Y,X)
& p2(X)
& ~ p102(X)
& p101(X) ) )
| p101(Y)
| ~ p100(Y) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p2(X)
| ~ p101(X) )
| p2(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p2(X)
| ~ p101(X) )
| ~ p2(Y) ) )
| ~ p101(Y) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p1(X)
| ~ p100(X) )
| p1(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p1(X)
| ~ p100(X) )
| ~ p1(Y) ) )
| ~ p100(Y) )
& ( p101(Y)
| ~ p102(Y) )
& ( p100(Y)
| ~ p101(Y) ) ) )
& ~ p101(X)
& p100(X) ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f6,plain,
( ! [Y] :
( ~ r1(sk0_0,Y)
| p2(Y) )
& ! [Y] :
( ~ r1(sk0_0,Y)
| ( ( ( r1(Y,sk0_1(Y))
& ~ p2(sk0_1(Y))
& ~ p102(sk0_1(Y))
& p101(sk0_1(Y))
& r1(Y,sk0_2(Y))
& p2(sk0_2(Y))
& ~ p102(sk0_2(Y))
& p101(sk0_2(Y)) )
| p101(Y)
| ~ p100(Y) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p2(X)
| ~ p101(X) )
| p2(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p2(X)
| ~ p101(X) )
| ~ p2(Y) ) )
| ~ p101(Y) )
& ( ( ( ! [X] :
( ~ r1(Y,X)
| ~ p1(X)
| ~ p100(X) )
| p1(Y) )
& ( ! [X] :
( ~ r1(Y,X)
| p1(X)
| ~ p100(X) )
| ~ p1(Y) ) )
| ~ p100(Y) )
& ( p101(Y)
| ~ p102(Y) )
& ( p100(Y)
| ~ p101(Y) ) ) )
& ~ p101(sk0_0)
& p100(sk0_0) ),
inference(skolemization,[status(esa)],[f5]) ).
fof(f7,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| p2(X0) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f8,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| r1(X0,sk0_1(X0))
| p101(X0)
| ~ p100(X0) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f9,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| ~ p2(sk0_1(X0))
| p101(X0)
| ~ p100(X0) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f22,plain,
~ p101(sk0_0),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f23,plain,
p100(sk0_0),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f25,plain,
( spl0_0
<=> r1(sk0_0,sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f26,plain,
( r1(sk0_0,sk0_1(sk0_0))
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f25]) ).
fof(f28,plain,
( spl0_1
<=> p101(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f29,plain,
( p101(sk0_0)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f28]) ).
fof(f31,plain,
( spl0_2
<=> p100(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f33,plain,
( ~ p100(sk0_0)
| spl0_2 ),
inference(component_clause,[status(thm)],[f31]) ).
fof(f34,plain,
( r1(sk0_0,sk0_1(sk0_0))
| p101(sk0_0)
| ~ p100(sk0_0) ),
inference(resolution,[status(thm)],[f4,f8]) ).
fof(f35,plain,
( spl0_0
| spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f34,f25,f28,f31]) ).
fof(f36,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f33,f23]) ).
fof(f37,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f36]) ).
fof(f38,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| p101(X0)
| ~ p100(X0)
| ~ r1(sk0_0,sk0_1(X0)) ),
inference(resolution,[status(thm)],[f9,f7]) ).
fof(f46,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f29,f22]) ).
fof(f47,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f46]) ).
fof(f55,plain,
( spl0_5
<=> r1(sk0_0,sk0_0) ),
introduced(split_symbol_definition) ).
fof(f57,plain,
( ~ r1(sk0_0,sk0_0)
| spl0_5 ),
inference(component_clause,[status(thm)],[f55]) ).
fof(f58,plain,
( ~ r1(sk0_0,sk0_0)
| p101(sk0_0)
| ~ p100(sk0_0)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f26,f38]) ).
fof(f59,plain,
( ~ spl0_5
| spl0_1
| ~ spl0_2
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f58,f55,f28,f31,f25]) ).
fof(f81,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f57,f4]) ).
fof(f82,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f81]) ).
fof(f83,plain,
$false,
inference(sat_refutation,[status(thm)],[f35,f37,f47,f59,f82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.17 % Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.17 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.38 % Computer : n016.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Tue May 30 10:09:44 EDT 2023
% 0.13/0.39 % CPUTime :
% 0.13/0.39 % Drodi V3.5.1
% 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.13/0.41 % Elapsed time: 0.018266 seconds
% 0.13/0.41 % CPU time: 0.030655 seconds
% 0.13/0.41 % Memory used: 1.938 MB
%------------------------------------------------------------------------------