TSTP Solution File: SYN011-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN011-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n022.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:42 EDT 2023
% Result : Unsatisfiable 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 34 ( 4 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 61 ( 25 ~; 29 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 15 ( 14 usr; 15 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
( ~ n
| ~ t ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
( m
| q
| n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
( l
| ~ m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
( l
| ~ q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
( ~ l
| ~ p ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
( r
| p
| n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
( ~ r
| ~ l ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
t,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,plain,
( ~ n
| ~ t ),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f10,plain,
( m
| q
| n ),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f11,plain,
( l
| ~ m ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f12,plain,
( l
| ~ q ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f13,plain,
( ~ l
| ~ p ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f14,plain,
( r
| p
| n ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f15,plain,
( ~ r
| ~ l ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f16,plain,
t,
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f17,plain,
( spl0_0
<=> n ),
introduced(split_symbol_definition) ).
fof(f20,plain,
( spl0_1
<=> t ),
introduced(split_symbol_definition) ).
fof(f22,plain,
( ~ t
| spl0_1 ),
inference(component_clause,[status(thm)],[f20]) ).
fof(f23,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f9,f17,f20]) ).
fof(f24,plain,
( spl0_2
<=> m ),
introduced(split_symbol_definition) ).
fof(f27,plain,
( spl0_3
<=> q ),
introduced(split_symbol_definition) ).
fof(f30,plain,
( spl0_2
| spl0_3
| spl0_0 ),
inference(split_clause,[status(thm)],[f10,f24,f27,f17]) ).
fof(f31,plain,
( spl0_4
<=> l ),
introduced(split_symbol_definition) ).
fof(f34,plain,
( spl0_4
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f11,f31,f24]) ).
fof(f35,plain,
( spl0_4
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f12,f31,f27]) ).
fof(f36,plain,
( spl0_5
<=> p ),
introduced(split_symbol_definition) ).
fof(f39,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f13,f31,f36]) ).
fof(f40,plain,
( spl0_6
<=> r ),
introduced(split_symbol_definition) ).
fof(f43,plain,
( spl0_6
| spl0_5
| spl0_0 ),
inference(split_clause,[status(thm)],[f14,f40,f36,f17]) ).
fof(f44,plain,
( ~ spl0_6
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f15,f40,f31]) ).
fof(f45,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f22,f16]) ).
fof(f46,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f45]) ).
fof(f47,plain,
$false,
inference(sat_refutation,[status(thm)],[f23,f30,f34,f35,f39,f43,f44,f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN011-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue May 30 10:26:12 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.58 % Elapsed time: 0.012822 seconds
% 0.20/0.58 % CPU time: 0.025168 seconds
% 0.20/0.58 % Memory used: 1.835 MB
%------------------------------------------------------------------------------