TSTP Solution File: SYN394+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN394+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:44 EDT 2023
% Result : Theorem 0.13s 0.53s
% Output : CNFRefutation 0.13s
% 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 : 20 ( 7 ~; 3 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 (; 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X] :
( f(X)
=> g(X) )
=> ( ! [Y] : f(Y)
=> ! [Z] : g(Z) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ! [X] :
( f(X)
=> g(X) )
=> ( ! [Y] : f(Y)
=> ! [Z] : g(Z) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ! [X] :
( ~ f(X)
| g(X) )
& ! [Y] : f(Y)
& ? [Z] : ~ g(Z) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( ! [X] :
( ~ f(X)
| g(X) )
& ! [Y] : f(Y)
& ~ g(sk0_0) ),
inference(skolemization,[status(esa)],[f3]) ).
fof(f5,plain,
! [X0] :
( ~ f(X0)
| g(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f6,plain,
! [X0] : f(X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f7,plain,
~ g(sk0_0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f8,plain,
! [X0] : g(X0),
inference(backward_subsumption_resolution,[status(thm)],[f5,f6]) ).
fof(f9,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f7,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10 % Problem : SYN394+1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.30 % Computer : n015.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 300
% 0.08/0.30 % WCLimit : 300
% 0.08/0.30 % DateTime : Tue May 30 10:44:04 EDT 2023
% 0.08/0.30 % CPUTime :
% 0.08/0.31 % Drodi V3.5.1
% 0.13/0.53 % Refutation found
% 0.13/0.53 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.53 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.53 % Elapsed time: 0.010659 seconds
% 0.13/0.53 % CPU time: 0.009958 seconds
% 0.13/0.53 % Memory used: 1.760 MB
%------------------------------------------------------------------------------