TSTP Solution File: GEO006-3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GEO006-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n007.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:07:23 EDT 2023
% Result : Unsatisfiable 0.22s 0.58s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 57 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 26 ~; 23 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 (; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f48,axiom,
! [U,V,W] :
( ~ between(U,V,W)
| ~ between(V,U,W)
| U = V ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f49,axiom,
! [U,V,W] :
( ~ between(U,V,W)
| ~ between(U,W,V)
| V = W ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f50,hypothesis,
a != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f52,hypothesis,
c != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,hypothesis,
between(a,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
( between(c,a,d)
| between(a,d,c) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f112,plain,
! [U,V] :
( ! [W] :
( ~ between(U,V,W)
| ~ between(V,U,W) )
| U = V ),
inference(miniscoping,[status(esa)],[f48]) ).
fof(f113,plain,
! [X0,X1,X2] :
( ~ between(X0,X1,X2)
| ~ between(X1,X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f112]) ).
fof(f114,plain,
! [V,W] :
( ! [U] :
( ~ between(U,V,W)
| ~ between(U,W,V) )
| V = W ),
inference(miniscoping,[status(esa)],[f49]) ).
fof(f115,plain,
! [X0,X1,X2] :
( ~ between(X0,X1,X2)
| ~ between(X0,X2,X1)
| X1 = X2 ),
inference(cnf_transformation,[status(esa)],[f114]) ).
fof(f116,plain,
a != c,
inference(cnf_transformation,[status(esa)],[f50]) ).
fof(f118,plain,
c != d,
inference(cnf_transformation,[status(esa)],[f52]) ).
fof(f119,plain,
between(a,c,d),
inference(cnf_transformation,[status(esa)],[f53]) ).
fof(f120,plain,
( between(c,a,d)
| between(a,d,c) ),
inference(cnf_transformation,[status(esa)],[f54]) ).
fof(f121,plain,
( spl0_0
<=> between(c,a,d) ),
introduced(split_symbol_definition) ).
fof(f124,plain,
( spl0_1
<=> between(a,d,c) ),
introduced(split_symbol_definition) ).
fof(f127,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f120,f121,f124]) ).
fof(f140,plain,
( spl0_3
<=> c = d ),
introduced(split_symbol_definition) ).
fof(f141,plain,
( c = d
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f140]) ).
fof(f145,plain,
( spl0_4
<=> c = a ),
introduced(split_symbol_definition) ).
fof(f146,plain,
( c = a
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f145]) ).
fof(f148,plain,
( ~ between(c,a,d)
| c = a ),
inference(resolution,[status(thm)],[f113,f119]) ).
fof(f149,plain,
( ~ spl0_0
| spl0_4 ),
inference(split_clause,[status(thm)],[f148,f121,f145]) ).
fof(f151,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f146,f116]) ).
fof(f152,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f151]) ).
fof(f158,plain,
( ~ between(a,d,c)
| d = c ),
inference(resolution,[status(thm)],[f115,f119]) ).
fof(f159,plain,
( ~ spl0_1
| spl0_3 ),
inference(split_clause,[status(thm)],[f158,f124,f140]) ).
fof(f161,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f141,f118]) ).
fof(f162,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f161]) ).
fof(f163,plain,
$false,
inference(sat_refutation,[status(thm)],[f127,f149,f152,f159,f162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO006-3 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:51:02 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.22/0.58 % Refutation found
% 0.22/0.58 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.22/0.58 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.22/0.58 % Elapsed time: 0.015074 seconds
% 0.22/0.58 % CPU time: 0.031604 seconds
% 0.22/0.58 % Memory used: 14.597 MB
%------------------------------------------------------------------------------