TSTP Solution File: LCL656+1.001 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% 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 : n004.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:42 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 9 unt; 0 def)
% Number of atoms : 244 ( 0 equ)
% Maximal formula atoms : 37 ( 5 avg)
% Number of connectives : 357 ( 157 ~; 133 |; 60 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 8 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(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/sandbox2/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(f11,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| p101(sk0_1(X0))
| p101(X0)
| ~ p100(X0) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f17,plain,
! [X0,X1] :
( ~ r1(sk0_0,X0)
| ~ r1(X0,X1)
| p2(X1)
| ~ p101(X1)
| ~ p2(X0)
| ~ p101(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(f24,plain,
! [X0,X1] :
( ~ r1(sk0_0,X0)
| ~ r1(X0,X1)
| p2(X1)
| ~ p101(X1)
| ~ p101(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f17,f7]) ).
fof(f29,plain,
( spl0_1
<=> p101(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f30,plain,
( p101(sk0_0)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f29]) ).
fof(f32,plain,
( spl0_2
<=> p100(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f34,plain,
( ~ p100(sk0_0)
| spl0_2 ),
inference(component_clause,[status(thm)],[f32]) ).
fof(f42,plain,
( spl0_4
<=> p101(sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f43,plain,
( p101(sk0_1(sk0_0))
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f42]) ).
fof(f45,plain,
( p101(sk0_1(sk0_0))
| p101(sk0_0)
| ~ p100(sk0_0) ),
inference(resolution,[status(thm)],[f4,f11]) ).
fof(f46,plain,
( spl0_4
| spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f45,f42,f29,f32]) ).
fof(f47,plain,
( spl0_5
<=> r1(sk0_0,sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f50,plain,
( r1(sk0_0,sk0_1(sk0_0))
| p101(sk0_0)
| ~ p100(sk0_0) ),
inference(resolution,[status(thm)],[f4,f8]) ).
fof(f51,plain,
( spl0_5
| spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f50,f47,f29,f32]) ).
fof(f53,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f34,f23]) ).
fof(f54,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f53]) ).
fof(f55,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f30,f22]) ).
fof(f56,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f55]) ).
fof(f84,plain,
( spl0_11
<=> r1(sk0_1(sk0_0),sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f86,plain,
( ~ r1(sk0_1(sk0_0),sk0_1(sk0_0))
| spl0_11 ),
inference(component_clause,[status(thm)],[f84]) ).
fof(f87,plain,
( spl0_12
<=> p2(sk0_1(sk0_0)) ),
introduced(split_symbol_definition) ).
fof(f88,plain,
( p2(sk0_1(sk0_0))
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f87]) ).
fof(f90,plain,
( ~ r1(sk0_0,sk0_1(sk0_0))
| ~ r1(sk0_1(sk0_0),sk0_1(sk0_0))
| p2(sk0_1(sk0_0))
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f43,f24]) ).
fof(f91,plain,
( ~ spl0_5
| ~ spl0_11
| spl0_12
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f90,f47,f84,f87,f42]) ).
fof(f109,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f86,f4]) ).
fof(f110,plain,
spl0_11,
inference(contradiction_clause,[status(thm)],[f109]) ).
fof(f111,plain,
( spl0_16
<=> r1(sk0_0,sk0_0) ),
introduced(split_symbol_definition) ).
fof(f113,plain,
( ~ r1(sk0_0,sk0_0)
| spl0_16 ),
inference(component_clause,[status(thm)],[f111]) ).
fof(f114,plain,
( ~ r1(sk0_0,sk0_0)
| p101(sk0_0)
| ~ p100(sk0_0)
| ~ spl0_12 ),
inference(resolution,[status(thm)],[f88,f9]) ).
fof(f115,plain,
( ~ spl0_16
| spl0_1
| ~ spl0_2
| ~ spl0_12 ),
inference(split_clause,[status(thm)],[f114,f111,f29,f32,f87]) ).
fof(f116,plain,
( $false
| spl0_16 ),
inference(forward_subsumption_resolution,[status(thm)],[f113,f4]) ).
fof(f117,plain,
spl0_16,
inference(contradiction_clause,[status(thm)],[f116]) ).
fof(f118,plain,
$false,
inference(sat_refutation,[status(thm)],[f46,f51,f54,f56,f91,f110,f115,f117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n004.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 20:13:19 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37 % Elapsed time: 0.016611 seconds
% 0.13/0.37 % CPU time: 0.038373 seconds
% 0.13/0.37 % Total memory used: 2.536 MB
% 0.13/0.37 % Net memory used: 2.514 MB
%------------------------------------------------------------------------------