TSTP Solution File: LCL636+1.001 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL636+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n002.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:27:32 EDT 2024
% Result : Theorem 0.11s 0.33s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 322 ( 0 equ)
% Maximal formula atoms : 69 ( 11 avg)
% Number of connectives : 521 ( 226 ~; 177 |; 114 &)
% ( 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 : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 56 ( 49 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,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) ) ) )
& ( ( ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( ~ p2(Y)
& ~ p102(Y)
& p101(Y) ) )
& ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( p2(Y)
& ~ p102(Y)
& p101(Y) ) ) )
| ~ ( ~ p101(X)
& p100(X) ) )
& ( ( ( ! [Y] :
( ~ r1(X,Y)
| ~ p2(Y)
| ~ p101(Y) )
| p2(X) )
& ( ! [Y] :
( ~ r1(X,Y)
| p2(Y)
| ~ p101(Y) )
| ~ p2(X) ) )
| ~ p101(X) )
& ( ( ( ! [Y] :
( ~ r1(X,Y)
| ~ p1(Y)
| ~ p100(Y) )
| p1(X) )
& ( ! [Y] :
( ~ r1(X,Y)
| p1(Y)
| ~ p100(Y) )
| ~ p1(X) ) )
| ~ p100(X) )
& ( p101(X)
| ~ p102(X) )
& ( p100(X)
| ~ p101(X) )
& ~ p101(X)
& p100(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,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) ) ) )
& ( ( ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( ~ p2(Y)
& ~ p102(Y)
& p101(Y) ) )
& ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( p2(Y)
& ~ p102(Y)
& p101(Y) ) ) )
| ~ ( ~ p101(X)
& p100(X) ) )
& ( ( ( ! [Y] :
( ~ r1(X,Y)
| ~ p2(Y)
| ~ p101(Y) )
| p2(X) )
& ( ! [Y] :
( ~ r1(X,Y)
| p2(Y)
| ~ p101(Y) )
| ~ p2(X) ) )
| ~ p101(X) )
& ( ( ( ! [Y] :
( ~ r1(X,Y)
| ~ p1(Y)
| ~ p100(Y) )
| p1(X) )
& ( ! [Y] :
( ~ r1(X,Y)
| p1(Y)
| ~ p100(Y) )
| ~ p1(X) ) )
| ~ p100(X) )
& ( p101(X)
| ~ p102(X) )
& ( p100(X)
| ~ p101(X) )
& ~ p101(X)
& p100(X) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,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) ) ) )
& ( ( ? [Y] :
( r1(X,Y)
& ~ p2(Y)
& ~ p102(Y)
& p101(Y) )
& ? [Y] :
( r1(X,Y)
& p2(Y)
& ~ p102(Y)
& p101(Y) ) )
| p101(X)
| ~ p100(X) )
& ( ( ( ! [Y] :
( ~ r1(X,Y)
| ~ p2(Y)
| ~ p101(Y) )
| p2(X) )
& ( ! [Y] :
( ~ r1(X,Y)
| p2(Y)
| ~ p101(Y) )
| ~ p2(X) ) )
| ~ p101(X) )
& ( ( ( ! [Y] :
( ~ r1(X,Y)
| ~ p1(Y)
| ~ p100(Y) )
| p1(X) )
& ( ! [Y] :
( ~ r1(X,Y)
| p1(Y)
| ~ p100(Y) )
| ~ p1(X) ) )
| ~ p100(X) )
& ( p101(X)
| ~ p102(X) )
& ( p100(X)
| ~ p101(X) )
& ~ p101(X)
& p100(X) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,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) ) ) )
& ( ( r1(sk0_0,sk0_3)
& ~ p2(sk0_3)
& ~ p102(sk0_3)
& p101(sk0_3)
& r1(sk0_0,sk0_4)
& p2(sk0_4)
& ~ p102(sk0_4)
& p101(sk0_4) )
| p101(sk0_0)
| ~ p100(sk0_0) )
& ( ( ( ! [Y] :
( ~ r1(sk0_0,Y)
| ~ p2(Y)
| ~ p101(Y) )
| p2(sk0_0) )
& ( ! [Y] :
( ~ r1(sk0_0,Y)
| p2(Y)
| ~ p101(Y) )
| ~ p2(sk0_0) ) )
| ~ p101(sk0_0) )
& ( ( ( ! [Y] :
( ~ r1(sk0_0,Y)
| ~ p1(Y)
| ~ p100(Y) )
| p1(sk0_0) )
& ( ! [Y] :
( ~ r1(sk0_0,Y)
| p1(Y)
| ~ p100(Y) )
| ~ p1(sk0_0) ) )
| ~ p100(sk0_0) )
& ( p101(sk0_0)
| ~ p102(sk0_0) )
& ( p100(sk0_0)
| ~ p101(sk0_0) )
& ~ p101(sk0_0)
& p100(sk0_0) ),
inference(skolemization,[status(esa)],[f3]) ).
fof(f5,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| p2(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f20,plain,
( r1(sk0_0,sk0_3)
| p101(sk0_0)
| ~ p100(sk0_0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f21,plain,
( ~ p2(sk0_3)
| p101(sk0_0)
| ~ p100(sk0_0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f34,plain,
~ p101(sk0_0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f35,plain,
p100(sk0_0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f36,plain,
( spl0_0
<=> r1(sk0_0,sk0_3) ),
introduced(split_symbol_definition) ).
fof(f37,plain,
( r1(sk0_0,sk0_3)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f39,plain,
( spl0_1
<=> p101(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f40,plain,
( p101(sk0_0)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( spl0_2
<=> p100(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f44,plain,
( ~ p100(sk0_0)
| spl0_2 ),
inference(component_clause,[status(thm)],[f42]) ).
fof(f45,plain,
( spl0_0
| spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f20,f36,f39,f42]) ).
fof(f46,plain,
( spl0_3
<=> p2(sk0_3) ),
introduced(split_symbol_definition) ).
fof(f48,plain,
( ~ p2(sk0_3)
| spl0_3 ),
inference(component_clause,[status(thm)],[f46]) ).
fof(f49,plain,
( ~ spl0_3
| spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f21,f46,f39,f42]) ).
fof(f101,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f40,f34]) ).
fof(f102,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f101]) ).
fof(f103,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f44,f35]) ).
fof(f104,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f103]) ).
fof(f105,plain,
( ~ r1(sk0_0,sk0_3)
| spl0_3 ),
inference(resolution,[status(thm)],[f48,f5]) ).
fof(f106,plain,
( $false
| ~ spl0_0
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f105,f37]) ).
fof(f107,plain,
( ~ spl0_0
| spl0_3 ),
inference(contradiction_clause,[status(thm)],[f106]) ).
fof(f108,plain,
$false,
inference(sat_refutation,[status(thm)],[f45,f49,f102,f104,f107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL636+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Apr 29 20:52:24 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.6.0
% 0.11/0.33 % Refutation found
% 0.11/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.35 % Elapsed time: 0.016952 seconds
% 0.11/0.35 % CPU time: 0.036728 seconds
% 0.11/0.35 % Total memory used: 2.542 MB
% 0.11/0.35 % Net memory used: 2.526 MB
%------------------------------------------------------------------------------