TSTP Solution File: SYN393+1.003 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN393+1.003 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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.11s 0.32s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 1 unt; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 204 ( 69 ~; 88 |; 12 &)
% ( 32 <=>; 0 =>; 0 <=; 3 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 13 ( 12 usr; 13 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 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( ( p1
<=> p2 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( ( p1
<=> p2 )
<=> p3 )
<~> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f4,plain,
( pd0_0
<=> ( ( p1
<=> p2 )
<=> p3 ) ),
introduced(predicate_definition,[f3]) ).
fof(f5,plain,
( pd0_0
<~> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(formula_renaming,[status(thm)],[f3,f4]) ).
fof(f6,plain,
( pd0_1
<=> ( p2
<=> p3 ) ),
introduced(predicate_definition,[f5]) ).
fof(f7,plain,
( pd0_0
<~> ( p1
<=> pd0_1 ) ),
inference(formula_renaming,[status(thm)],[f5,f6]) ).
fof(f8,plain,
( ( pd0_0
| ( ( ~ p1
| pd0_1 )
& ( p1
| ~ pd0_1 ) ) )
& ( ~ pd0_0
| ( ( ~ p1
| ~ pd0_1 )
& ( p1
| pd0_1 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f7]) ).
fof(f9,plain,
( pd0_0
| ~ p1
| pd0_1 ),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f10,plain,
( pd0_0
| p1
| ~ pd0_1 ),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f11,plain,
( ~ pd0_0
| ~ p1
| ~ pd0_1 ),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f12,plain,
( ~ pd0_0
| p1
| pd0_1 ),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f13,plain,
( pd0_2
<=> ( p1
<=> p2 ) ),
introduced(predicate_definition,[f4]) ).
fof(f14,plain,
( pd0_0
<=> ( pd0_2
<=> p3 ) ),
inference(formula_renaming,[status(thm)],[f4,f13]) ).
fof(f15,plain,
( ( ~ pd0_0
| ( ( ~ pd0_2
| p3 )
& ( pd0_2
| ~ p3 ) ) )
& ( pd0_0
| ( ( ~ pd0_2
| ~ p3 )
& ( pd0_2
| p3 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f14]) ).
fof(f16,plain,
( ~ pd0_0
| ~ pd0_2
| p3 ),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f17,plain,
( ~ pd0_0
| pd0_2
| ~ p3 ),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f18,plain,
( pd0_0
| ~ pd0_2
| ~ p3 ),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f19,plain,
( pd0_0
| pd0_2
| p3 ),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f20,plain,
( ( ~ pd0_1
| ( ( ~ p2
| p3 )
& ( p2
| ~ p3 ) ) )
& ( pd0_1
| ( ( ~ p2
| ~ p3 )
& ( p2
| p3 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f6]) ).
fof(f21,plain,
( ~ pd0_1
| ~ p2
| p3 ),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f22,plain,
( ~ pd0_1
| p2
| ~ p3 ),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f23,plain,
( pd0_1
| ~ p2
| ~ p3 ),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f24,plain,
( pd0_1
| p2
| p3 ),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f25,plain,
( ( ~ pd0_2
| ( ( ~ p1
| p2 )
& ( p1
| ~ p2 ) ) )
& ( pd0_2
| ( ( ~ p1
| ~ p2 )
& ( p1
| p2 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f13]) ).
fof(f26,plain,
( ~ pd0_2
| ~ p1
| p2 ),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f27,plain,
( ~ pd0_2
| p1
| ~ p2 ),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f28,plain,
( pd0_2
| ~ p1
| ~ p2 ),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f29,plain,
( pd0_2
| p1
| p2 ),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f30,plain,
( spl0_0
<=> pd0_0 ),
introduced(split_symbol_definition) ).
fof(f33,plain,
( spl0_1
<=> p1 ),
introduced(split_symbol_definition) ).
fof(f36,plain,
( spl0_2
<=> pd0_1 ),
introduced(split_symbol_definition) ).
fof(f39,plain,
( spl0_0
| ~ spl0_1
| spl0_2 ),
inference(split_clause,[status(thm)],[f9,f30,f33,f36]) ).
fof(f40,plain,
( spl0_0
| spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f10,f30,f33,f36]) ).
fof(f41,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f11,f30,f33,f36]) ).
fof(f42,plain,
( ~ spl0_0
| spl0_1
| spl0_2 ),
inference(split_clause,[status(thm)],[f12,f30,f33,f36]) ).
fof(f43,plain,
( spl0_3
<=> pd0_2 ),
introduced(split_symbol_definition) ).
fof(f46,plain,
( spl0_4
<=> p3 ),
introduced(split_symbol_definition) ).
fof(f49,plain,
( ~ spl0_0
| ~ spl0_3
| spl0_4 ),
inference(split_clause,[status(thm)],[f16,f30,f43,f46]) ).
fof(f50,plain,
( ~ spl0_0
| spl0_3
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f17,f30,f43,f46]) ).
fof(f51,plain,
( spl0_0
| ~ spl0_3
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f18,f30,f43,f46]) ).
fof(f52,plain,
( spl0_0
| spl0_3
| spl0_4 ),
inference(split_clause,[status(thm)],[f19,f30,f43,f46]) ).
fof(f53,plain,
( spl0_5
<=> p2 ),
introduced(split_symbol_definition) ).
fof(f56,plain,
( ~ spl0_2
| ~ spl0_5
| spl0_4 ),
inference(split_clause,[status(thm)],[f21,f36,f53,f46]) ).
fof(f57,plain,
( ~ spl0_2
| spl0_5
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f22,f36,f53,f46]) ).
fof(f58,plain,
( spl0_2
| ~ spl0_5
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f23,f36,f53,f46]) ).
fof(f59,plain,
( spl0_2
| spl0_5
| spl0_4 ),
inference(split_clause,[status(thm)],[f24,f36,f53,f46]) ).
fof(f60,plain,
( ~ spl0_3
| ~ spl0_1
| spl0_5 ),
inference(split_clause,[status(thm)],[f26,f43,f33,f53]) ).
fof(f61,plain,
( ~ spl0_3
| spl0_1
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f27,f43,f33,f53]) ).
fof(f62,plain,
( spl0_3
| ~ spl0_1
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f28,f43,f33,f53]) ).
fof(f63,plain,
( spl0_3
| spl0_1
| spl0_5 ),
inference(split_clause,[status(thm)],[f29,f43,f33,f53]) ).
fof(f64,plain,
$false,
inference(sat_refutation,[status(thm)],[f39,f40,f41,f42,f49,f50,f51,f52,f56,f57,f58,f59,f60,f61,f62,f63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SYN393+1.003 : TPTP v8.1.2. Released v2.0.0.
% 0.05/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.32 % Computer : n018.cluster.edu
% 0.07/0.32 % Model : x86_64 x86_64
% 0.07/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.32 % Memory : 8042.1875MB
% 0.07/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.32 % CPULimit : 300
% 0.07/0.32 % WCLimit : 300
% 0.07/0.32 % DateTime : Tue May 30 10:34:10 EDT 2023
% 0.07/0.32 % CPUTime :
% 0.07/0.32 % Drodi V3.5.1
% 0.11/0.32 % Refutation found
% 0.11/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.33 % Elapsed time: 0.010841 seconds
% 0.11/0.33 % CPU time: 0.011844 seconds
% 0.11/0.33 % Memory used: 1.175 MB
%------------------------------------------------------------------------------