TSTP Solution File: SYN365+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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:52:01 EDT 2024
% Result : Theorem 0.18s 0.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 3 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 85 ( 29 ~; 23 |; 23 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X] :
? [Y] :
( big_p(X)
=> ( big_r(X,g(h(Y)))
& big_p(Y) ) )
& ! [W] :
( big_p(W)
=> ( big_p(g(W))
& big_p(h(W)) ) ) )
=> ! [X] :
( big_p(X)
=> ? [Y] :
( big_r(X,Y)
& big_p(Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( ! [X] :
? [Y] :
( big_p(X)
=> ( big_r(X,g(h(Y)))
& big_p(Y) ) )
& ! [W] :
( big_p(W)
=> ( big_p(g(W))
& big_p(h(W)) ) ) )
=> ! [X] :
( big_p(X)
=> ? [Y] :
( big_r(X,Y)
& big_p(Y) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ! [X] :
? [Y] :
( ~ big_p(X)
| ( big_r(X,g(h(Y)))
& big_p(Y) ) )
& ! [W] :
( ~ big_p(W)
| ( big_p(g(W))
& big_p(h(W)) ) )
& ? [X] :
( big_p(X)
& ! [Y] :
( ~ big_r(X,Y)
| ~ big_p(Y) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( ! [X] :
( ~ big_p(X)
| ? [Y] :
( big_r(X,g(h(Y)))
& big_p(Y) ) )
& ! [W] :
( ~ big_p(W)
| ( big_p(g(W))
& big_p(h(W)) ) )
& ? [X] :
( big_p(X)
& ! [Y] :
( ~ big_r(X,Y)
| ~ big_p(Y) ) ) ),
inference(miniscoping,[status(esa)],[f3]) ).
fof(f5,plain,
( ! [X] :
( ~ big_p(X)
| ( big_r(X,g(h(sk0_0(X))))
& big_p(sk0_0(X)) ) )
& ! [W] :
( ~ big_p(W)
| ( big_p(g(W))
& big_p(h(W)) ) )
& big_p(sk0_1)
& ! [Y] :
( ~ big_r(sk0_1,Y)
| ~ big_p(Y) ) ),
inference(skolemization,[status(esa)],[f4]) ).
fof(f6,plain,
! [X0] :
( ~ big_p(X0)
| big_r(X0,g(h(sk0_0(X0)))) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f7,plain,
! [X0] :
( ~ big_p(X0)
| big_p(sk0_0(X0)) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f8,plain,
! [X0] :
( ~ big_p(X0)
| big_p(g(X0)) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f9,plain,
! [X0] :
( ~ big_p(X0)
| big_p(h(X0)) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f10,plain,
big_p(sk0_1),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f11,plain,
! [X0] :
( ~ big_r(sk0_1,X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f12,plain,
( spl0_0
<=> big_p(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f14,plain,
( ~ big_p(sk0_1)
| spl0_0 ),
inference(component_clause,[status(thm)],[f12]) ).
fof(f15,plain,
( spl0_1
<=> big_p(g(h(sk0_0(sk0_1)))) ),
introduced(split_symbol_definition) ).
fof(f17,plain,
( ~ big_p(g(h(sk0_0(sk0_1))))
| spl0_1 ),
inference(component_clause,[status(thm)],[f15]) ).
fof(f18,plain,
( ~ big_p(sk0_1)
| ~ big_p(g(h(sk0_0(sk0_1)))) ),
inference(resolution,[status(thm)],[f6,f11]) ).
fof(f19,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f18,f12,f15]) ).
fof(f20,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f14,f10]) ).
fof(f21,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f20]) ).
fof(f22,plain,
( ~ big_p(h(sk0_0(sk0_1)))
| spl0_1 ),
inference(resolution,[status(thm)],[f17,f8]) ).
fof(f23,plain,
( ~ big_p(sk0_0(sk0_1))
| spl0_1 ),
inference(resolution,[status(thm)],[f22,f9]) ).
fof(f24,plain,
( ~ big_p(sk0_1)
| spl0_1 ),
inference(resolution,[status(thm)],[f23,f7]) ).
fof(f25,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f24,f12,f15]) ).
fof(f26,plain,
$false,
inference(sat_refutation,[status(thm)],[f19,f21,f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.35 % Computer : n018.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8042.1875MB
% 0.11/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Apr 29 22:08:28 EDT 2024
% 0.11/0.35 % CPUTime :
% 0.18/0.36 % Drodi V3.6.0
% 0.18/0.36 % Refutation found
% 0.18/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.37 % Elapsed time: 0.020083 seconds
% 0.18/0.37 % CPU time: 0.015485 seconds
% 0.18/0.37 % Total memory used: 2.818 MB
% 0.18/0.37 % Net memory used: 2.792 MB
%------------------------------------------------------------------------------