TSTP Solution File: SYN407+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN407+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n017.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:46:45 EDT 2023
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 43 ( 15 ~; 14 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 14 (; 11 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X] :
( f(X)
=> ( g(X)
| h(X) ) )
=> ( ! [Y] :
( f(Y)
=> g(Y) )
| ? [Z] :
( f(Z)
& h(Z) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ! [X] :
( f(X)
=> ( g(X)
| h(X) ) )
=> ( ! [Y] :
( f(Y)
=> g(Y) )
| ? [Z] :
( f(Z)
& h(Z) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ! [X] :
( ~ f(X)
| g(X)
| h(X) )
& ? [Y] :
( f(Y)
& ~ g(Y) )
& ! [Z] :
( ~ f(Z)
| ~ h(Z) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( ! [X] :
( ~ f(X)
| g(X)
| h(X) )
& f(sk0_0)
& ~ g(sk0_0)
& ! [Z] :
( ~ f(Z)
| ~ h(Z) ) ),
inference(skolemization,[status(esa)],[f3]) ).
fof(f5,plain,
! [X0] :
( ~ f(X0)
| g(X0)
| h(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f6,plain,
f(sk0_0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f7,plain,
~ g(sk0_0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f8,plain,
! [X0] :
( ~ f(X0)
| ~ h(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f9,plain,
! [X0] :
( ~ f(X0)
| g(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[f5,f8]) ).
fof(f10,plain,
~ f(sk0_0),
inference(resolution,[status(thm)],[f9,f7]) ).
fof(f11,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f10,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN407+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue May 30 09:52:40 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.13/0.37 % Refutation found
% 0.13/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38 % Elapsed time: 0.017125 seconds
% 0.13/0.38 % CPU time: 0.024137 seconds
% 0.13/0.38 % Memory used: 1.790 MB
%------------------------------------------------------------------------------