TSTP Solution File: SYN040+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN040+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n031.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:45:45 EDT 2023
% Result : Theorem 0.20s 0.37s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 41 ( 17 ~; 12 |; 3 &)
% ( 4 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 5 ( 4 usr; 5 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( p
=> q )
<=> ( ~ q
=> ~ p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( p
=> q )
<=> ( ~ q
=> ~ p ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( ~ p
| q )
<~> ( q
| ~ p ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( ( ~ p
| q
| q
| ~ p )
& ( ( p
& ~ q )
| ( ~ q
& p ) ) ),
inference(NNF_transformation,[status(esa)],[f3]) ).
fof(f5,plain,
( ~ p
| q
| q
| ~ p ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f7,plain,
( p
| p ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f8,plain,
( ~ q
| ~ q ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f10,plain,
( spl0_0
<=> p ),
introduced(split_symbol_definition) ).
fof(f13,plain,
( spl0_1
<=> q ),
introduced(split_symbol_definition) ).
fof(f16,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f5,f10,f13]) ).
fof(f18,plain,
spl0_0,
inference(split_clause,[status(thm)],[f7,f10]) ).
fof(f19,plain,
~ spl0_1,
inference(split_clause,[status(thm)],[f8,f13]) ).
fof(f21,plain,
$false,
inference(sat_refutation,[status(thm)],[f16,f18,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN040+1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 30 10:47:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Drodi V3.5.1
% 0.20/0.37 % Refutation found
% 0.20/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.37 % Elapsed time: 0.014956 seconds
% 0.20/0.37 % CPU time: 0.012365 seconds
% 0.20/0.37 % Memory used: 682.595 KB
%------------------------------------------------------------------------------