TSTP Solution File: SYN009-4 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SYN009-4 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n017.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 : Tue Apr 30 20:51:01 EDT 2024
% Result : Unsatisfiable 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 50 ~; 47 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 39 ( 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X,Y,Z] :
( ~ p(X,Y,Z)
| ~ m(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
! [X,Y,Z] :
( ~ q(X,Y,Z)
| ~ m(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
! [X,Y,Z] :
( ~ r(X,Y,Z)
| ~ m(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
s(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
~ n(c,c,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
! [X,Y,Z] :
( ~ s(X)
| ~ s(Y)
| ~ s(Z)
| p(X,Y,Z)
| q(X,Y,Z)
| r(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
! [X,Y,Z] :
( ~ s(X)
| ~ s(Y)
| ~ s(Z)
| m(X,Y,Z)
| n(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X0,X1,X2] :
( ~ p(X0,X1,X2)
| ~ m(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ~ q(X0,X1,X2)
| ~ m(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ~ r(X0,X1,X2)
| ~ m(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f15,plain,
s(c),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f16,plain,
~ n(c,c,c),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ~ s(X0)
| ~ s(X1)
| ~ s(X2)
| p(X0,X1,X2)
| q(X0,X1,X2)
| r(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ s(X0)
| ~ s(X1)
| ~ s(X2)
| m(X0,X1,X2)
| n(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f19,plain,
( spl0_0
<=> s(c) ),
introduced(split_symbol_definition) ).
fof(f21,plain,
( ~ s(c)
| spl0_0 ),
inference(component_clause,[status(thm)],[f19]) ).
fof(f22,plain,
( spl0_1
<=> m(c,c,c) ),
introduced(split_symbol_definition) ).
fof(f23,plain,
( m(c,c,c)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,plain,
( ~ s(c)
| ~ s(c)
| ~ s(c)
| m(c,c,c) ),
inference(resolution,[status(thm)],[f18,f16]) ).
fof(f26,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f25,f19,f22]) ).
fof(f27,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f21,f15]) ).
fof(f28,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f27]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ~ s(X0)
| ~ s(X1)
| ~ s(X2)
| p(X0,X1,X2)
| r(X0,X1,X2)
| ~ m(X0,X1,X2) ),
inference(resolution,[status(thm)],[f17,f11]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ~ s(X0)
| ~ s(X1)
| ~ s(X2)
| r(X0,X1,X2)
| ~ m(X0,X1,X2) ),
inference(forward_subsumption_resolution,[status(thm)],[f30,f10]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ s(X0)
| ~ s(X1)
| ~ s(X2)
| ~ m(X0,X1,X2) ),
inference(forward_subsumption_resolution,[status(thm)],[f31,f12]) ).
fof(f36,plain,
( ~ s(c)
| ~ s(c)
| ~ s(c)
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f34,f23]) ).
fof(f37,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f36,f19,f22]) ).
fof(f38,plain,
$false,
inference(sat_refutation,[status(thm)],[f26,f28,f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN009-4 : TPTP v8.1.2. Released v2.5.0.
% 0.10/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 29 21:40:18 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Drodi V3.6.0
% 0.12/0.35 % Refutation found
% 0.12/0.35 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.35 % Elapsed time: 0.012406 seconds
% 0.12/0.35 % CPU time: 0.022977 seconds
% 0.12/0.35 % Total memory used: 1.913 MB
% 0.12/0.35 % Net memory used: 1.830 MB
%------------------------------------------------------------------------------