TSTP Solution File: LCL646+1.001 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL646+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 : Wed May 31 12:19:50 EDT 2023
% Result : Theorem 0.11s 0.33s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 109 ( 48 ~; 39 |; 22 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 (; 25 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| p6(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p4(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p5(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p3(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p1(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| p6(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p4(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p5(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p3(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p1(Y) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X] :
( ! [Y] :
( ~ r1(X,Y)
| p6(Y) )
& ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
& ! [Y] :
( ~ r1(X,Y)
| p4(Y) )
& ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
& ? [Y] :
( r1(X,Y)
& ~ p5(Y) )
& ? [Y] :
( r1(X,Y)
& ~ p3(Y) )
& ? [Y] :
( r1(X,Y)
& ~ p2(Y) )
& ? [Y] :
( r1(X,Y)
& ~ p1(Y) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( ! [Y] :
( ~ r1(sk0_0,Y)
| p6(Y) )
& ! [Y] :
( ~ r1(sk0_0,Y)
| p2(Y) )
& ! [Y] :
( ~ r1(sk0_0,Y)
| p4(Y) )
& ! [Y] :
( ~ r1(sk0_0,Y)
| p2(Y) )
& r1(sk0_0,sk0_1)
& ~ p5(sk0_1)
& r1(sk0_0,sk0_2)
& ~ p3(sk0_2)
& r1(sk0_0,sk0_3)
& ~ p2(sk0_3)
& r1(sk0_0,sk0_4)
& ~ p1(sk0_4) ),
inference(skolemization,[status(esa)],[f3]) ).
fof(f6,plain,
! [X0] :
( ~ r1(sk0_0,X0)
| p2(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f13,plain,
r1(sk0_0,sk0_3),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f14,plain,
~ p2(sk0_3),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f17,plain,
~ r1(sk0_0,sk0_3),
inference(resolution,[status(thm)],[f6,f14]) ).
fof(f18,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f17,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : LCL646+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % 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 : Tue May 30 09:58:28 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.5.1
% 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.17/0.55 % Elapsed time: 0.014154 seconds
% 0.17/0.55 % CPU time: 0.011838 seconds
% 0.17/0.55 % Memory used: 1.781 MB
%------------------------------------------------------------------------------