TSTP Solution File: LCL674+1.001 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL674+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:50 EDT 2024
% Result : Theorem 0.11s 0.34s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 8 unt; 0 def)
% Number of atoms : 233 ( 0 equ)
% Maximal formula atoms : 37 ( 5 avg)
% Number of connectives : 347 ( 153 ~; 128 |; 60 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 7 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 43 ( 38 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : r1(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,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/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,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)],[f3]) ).
fof(f5,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f9,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)],[f4]) ).
fof(f10,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)],[f9]) ).
fof(f11,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| p2(X0) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f12,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| r1(X0,sk0_1(X0))
| p101(X0)
| ~ p100(X0) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f13,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| ~ p2(sk0_1(X0))
| p101(X0)
| ~ p100(X0) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f15,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| p101(sk0_1(X0))
| p101(X0)
| ~ p100(X0) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f21,plain,
! [X0,X1] :
( ~ r1(sk0_0,X0)
| ~ r1(X0,X1)
| p2(X1)
| ~ p101(X1)
| ~ p2(X0)
| ~ p101(X0) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f26,plain,
~ p101(sk0_0),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f27,plain,
p100(sk0_0),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f28,plain,
! [X0,X1] :
( ~ r1(sk0_0,X0)
| ~ r1(X0,X1)
| p2(X1)
| ~ p101(X1)
| ~ p101(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f21,f11]) ).
fof(f37,plain,
( spl0_1
<=> p100(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f39,plain,
( ~ p100(sk0_0)
| spl0_1 ),
inference(component_clause,[status(thm)],[f37]) ).
fof(f56,plain,
( spl0_6
<=> p101(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f57,plain,
( p101(sk0_0)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f56]) ).
fof(f66,plain,
( spl0_8
<=> p101(sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f67,plain,
( p101(sk0_1(sk0_0))
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f66]) ).
fof(f69,plain,
( p101(sk0_1(sk0_0))
| p101(sk0_0)
| ~ p100(sk0_0) ),
inference(resolution,[status(thm)],[f5,f15]) ).
fof(f70,plain,
( spl0_8
| spl0_6
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f69,f66,f56,f37]) ).
fof(f71,plain,
( spl0_9
<=> p2(sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f74,plain,
( ~ p2(sk0_1(sk0_0))
| p101(sk0_0)
| ~ p100(sk0_0) ),
inference(resolution,[status(thm)],[f5,f13]) ).
fof(f75,plain,
( ~ spl0_9
| spl0_6
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f74,f71,f56,f37]) ).
fof(f76,plain,
( spl0_10
<=> r1(sk0_0,sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f79,plain,
( r1(sk0_0,sk0_1(sk0_0))
| p101(sk0_0)
| ~ p100(sk0_0) ),
inference(resolution,[status(thm)],[f5,f12]) ).
fof(f80,plain,
( spl0_10
| spl0_6
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f79,f76,f56,f37]) ).
fof(f81,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f39,f27]) ).
fof(f82,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f81]) ).
fof(f83,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f57,f26]) ).
fof(f84,plain,
~ spl0_6,
inference(contradiction_clause,[status(thm)],[f83]) ).
fof(f123,plain,
( spl0_18
<=> r1(sk0_1(sk0_0),sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f125,plain,
( ~ r1(sk0_1(sk0_0),sk0_1(sk0_0))
| spl0_18 ),
inference(component_clause,[status(thm)],[f123]) ).
fof(f126,plain,
( ~ r1(sk0_0,sk0_1(sk0_0))
| ~ r1(sk0_1(sk0_0),sk0_1(sk0_0))
| p2(sk0_1(sk0_0))
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f67,f28]) ).
fof(f127,plain,
( ~ spl0_10
| ~ spl0_18
| spl0_9
| ~ spl0_8 ),
inference(split_clause,[status(thm)],[f126,f76,f123,f71,f66]) ).
fof(f142,plain,
( $false
| spl0_18 ),
inference(forward_subsumption_resolution,[status(thm)],[f125,f5]) ).
fof(f143,plain,
spl0_18,
inference(contradiction_clause,[status(thm)],[f142]) ).
fof(f144,plain,
$false,
inference(sat_refutation,[status(thm)],[f70,f75,f80,f82,f84,f127,f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL674+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.33 % Computer : n015.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Apr 29 20:53:47 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.34 % Drodi V3.6.0
% 0.11/0.34 % Refutation found
% 0.11/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.35 % Elapsed time: 0.018602 seconds
% 0.11/0.35 % CPU time: 0.035265 seconds
% 0.11/0.35 % Total memory used: 2.538 MB
% 0.11/0.35 % Net memory used: 2.515 MB
%------------------------------------------------------------------------------