TSTP Solution File: SYN405+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN405+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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.06s 0.27s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 21 ( 8 ~; 3 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 14 (; 9 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X] : f(X)
& ? [Y] : g(Y) )
=> ? [Z] :
( f(Z)
& g(Z) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( ! [X] : f(X)
& ? [Y] : g(Y) )
=> ? [Z] :
( f(Z)
& g(Z) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ! [X] : f(X)
& ? [Y] : g(Y)
& ! [Z] :
( ~ f(Z)
| ~ g(Z) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( ! [X] : f(X)
& g(sk0_0)
& ! [Z] :
( ~ f(Z)
| ~ g(Z) ) ),
inference(skolemization,[status(esa)],[f3]) ).
fof(f5,plain,
! [X0] : f(X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f6,plain,
g(sk0_0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f7,plain,
! [X0] :
( ~ f(X0)
| ~ g(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f8,plain,
! [X0] : ~ g(X0),
inference(forward_subsumption_resolution,[status(thm)],[f7,f5]) ).
fof(f9,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f6,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : SYN405+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25 % Computer : n003.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue May 30 10:33:08 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.06/0.26 % Drodi V3.5.1
% 0.06/0.27 % Refutation found
% 0.06/0.27 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.06/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.48 % Elapsed time: 0.009686 seconds
% 0.10/0.48 % CPU time: 0.015842 seconds
% 0.10/0.48 % Memory used: 6.100 MB
%------------------------------------------------------------------------------