TSTP Solution File: SYN391+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN391+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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:43 EDT 2023
% Result : Theorem 0.21s 0.37s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 1 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 54 ( 23 ~; 20 |; 7 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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,
( ( ( p1
| p2 )
& ( ~ p1
| p2 )
& ( p1
| ~ p2 ) )
=> ~ ( ~ p1
| ~ p2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( ( p1
| p2 )
& ( ~ p1
| p2 )
& ( p1
| ~ p2 ) )
=> ~ ( ~ p1
| ~ p2 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( p1
| p2 )
& ( ~ p1
| p2 )
& ( p1
| ~ p2 )
& ( ~ p1
| ~ p2 ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( p1
| p2 ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f5,plain,
( ~ p1
| p2 ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f6,plain,
( p1
| ~ p2 ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f7,plain,
( ~ p1
| ~ p2 ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
( spl0_0
<=> p1 ),
introduced(split_symbol_definition) ).
fof(f11,plain,
( spl0_1
<=> p2 ),
introduced(split_symbol_definition) ).
fof(f14,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f4,f8,f11]) ).
fof(f15,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f5,f8,f11]) ).
fof(f16,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f6,f8,f11]) ).
fof(f17,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f7,f8,f11]) ).
fof(f18,plain,
$false,
inference(sat_refutation,[status(thm)],[f14,f15,f16,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN391+1 : TPTP v8.1.2. Released v2.0.0.
% 0.14/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n004.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:20:22 EDT 2023
% 0.21/0.35 % CPUTime :
% 0.21/0.35 % Drodi V3.5.1
% 0.21/0.37 % Refutation found
% 0.21/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.37 % Elapsed time: 0.015341 seconds
% 0.21/0.37 % CPU time: 0.012652 seconds
% 0.21/0.37 % Memory used: 680.817 KB
%------------------------------------------------------------------------------