TSTP Solution File: SYN962+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN962+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n016.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:48:30 EDT 2023
% Result : Theorem 0.06s 0.26s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 27 ( 11 ~; 8 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 11 (; 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X] : p(X)
=> ( ! [X] : p(X)
& ! [Y] : p(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ! [X] : p(X)
=> ( ! [X] : p(X)
& ! [Y] : p(Y) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ! [X] : p(X)
& ( ? [X] : ~ p(X)
| ? [Y] : ~ p(Y) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( ! [X] : p(X)
& ( ~ p(sk0_0)
| ~ p(sk0_1) ) ),
inference(skolemization,[status(esa)],[f3]) ).
fof(f5,plain,
! [X0] : p(X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f6,plain,
( ~ p(sk0_0)
| ~ p(sk0_1) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f7,plain,
( spl0_0
<=> p(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f9,plain,
( ~ p(sk0_0)
| spl0_0 ),
inference(component_clause,[status(thm)],[f7]) ).
fof(f10,plain,
( spl0_1
<=> p(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f12,plain,
( ~ p(sk0_1)
| spl0_1 ),
inference(component_clause,[status(thm)],[f10]) ).
fof(f13,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f6,f7,f10]) ).
fof(f14,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f9,f5]) ).
fof(f15,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f14]) ).
fof(f16,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f12,f5]) ).
fof(f17,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f16]) ).
fof(f18,plain,
$false,
inference(sat_refutation,[status(thm)],[f13,f15,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SYN962+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25 % Computer : n016.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:53:44 EDT 2023
% 0.06/0.25 % CPUTime :
% 0.06/0.25 % Drodi V3.5.1
% 0.06/0.26 % Refutation found
% 0.06/0.26 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.06/0.26 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.47 % Elapsed time: 0.006914 seconds
% 0.09/0.47 % CPU time: 0.015749 seconds
% 0.09/0.47 % Memory used: 6.968 MB
%------------------------------------------------------------------------------