TSTP Solution File: GEO112+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GEO112+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n019.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:49 EDT 2023
% Result : Theorem 0.17s 0.35s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 123 ( 19 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 147 ( 60 ~; 61 |; 21 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 107 (; 100 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [C,P,Q,R] :
( between_c(C,P,Q,R)
<=> ( P != R
& ? [Cpp] :
( part_of(Cpp,C)
& end_point(P,Cpp)
& end_point(R,Cpp)
& inner_point(Q,Cpp) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,conjecture,
! [C,P,Q,R] :
( between_c(C,P,Q,R)
=> between_c(C,R,Q,P) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,negated_conjecture,
~ ! [C,P,Q,R] :
( between_c(C,P,Q,R)
=> between_c(C,R,Q,P) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f105,plain,
! [C,P,Q,R] :
( ( ~ between_c(C,P,Q,R)
| ( P != R
& ? [Cpp] :
( part_of(Cpp,C)
& end_point(P,Cpp)
& end_point(R,Cpp)
& inner_point(Q,Cpp) ) ) )
& ( between_c(C,P,Q,R)
| P = R
| ! [Cpp] :
( ~ part_of(Cpp,C)
| ~ end_point(P,Cpp)
| ~ end_point(R,Cpp)
| ~ inner_point(Q,Cpp) ) ) ),
inference(NNF_transformation,[status(esa)],[f17]) ).
fof(f106,plain,
( ! [C,P,Q,R] :
( ~ between_c(C,P,Q,R)
| ( P != R
& ? [Cpp] :
( part_of(Cpp,C)
& end_point(P,Cpp)
& end_point(R,Cpp)
& inner_point(Q,Cpp) ) ) )
& ! [C,P,Q,R] :
( between_c(C,P,Q,R)
| P = R
| ! [Cpp] :
( ~ part_of(Cpp,C)
| ~ end_point(P,Cpp)
| ~ end_point(R,Cpp)
| ~ inner_point(Q,Cpp) ) ) ),
inference(miniscoping,[status(esa)],[f105]) ).
fof(f107,plain,
( ! [C,P,Q,R] :
( ~ between_c(C,P,Q,R)
| ( P != R
& part_of(sk0_13(R,Q,P,C),C)
& end_point(P,sk0_13(R,Q,P,C))
& end_point(R,sk0_13(R,Q,P,C))
& inner_point(Q,sk0_13(R,Q,P,C)) ) )
& ! [C,P,Q,R] :
( between_c(C,P,Q,R)
| P = R
| ! [Cpp] :
( ~ part_of(Cpp,C)
| ~ end_point(P,Cpp)
| ~ end_point(R,Cpp)
| ~ inner_point(Q,Cpp) ) ) ),
inference(skolemization,[status(esa)],[f106]) ).
fof(f108,plain,
! [X0,X1,X2,X3] :
( ~ between_c(X0,X1,X2,X3)
| X1 != X3 ),
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f109,plain,
! [X0,X1,X2,X3] :
( ~ between_c(X0,X1,X2,X3)
| part_of(sk0_13(X3,X2,X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f110,plain,
! [X0,X1,X2,X3] :
( ~ between_c(X0,X1,X2,X3)
| end_point(X1,sk0_13(X3,X2,X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f111,plain,
! [X0,X1,X2,X3] :
( ~ between_c(X0,X1,X2,X3)
| end_point(X3,sk0_13(X3,X2,X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f112,plain,
! [X0,X1,X2,X3] :
( ~ between_c(X0,X1,X2,X3)
| inner_point(X2,sk0_13(X3,X2,X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f113,plain,
! [X0,X1,X2,X3,X4] :
( between_c(X0,X1,X2,X3)
| X1 = X3
| ~ part_of(X4,X0)
| ~ end_point(X1,X4)
| ~ end_point(X3,X4)
| ~ inner_point(X2,X4) ),
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f114,plain,
? [C,P,Q,R] :
( between_c(C,P,Q,R)
& ~ between_c(C,R,Q,P) ),
inference(pre_NNF_transformation,[status(esa)],[f19]) ).
fof(f115,plain,
( between_c(sk0_14,sk0_15,sk0_16,sk0_17)
& ~ between_c(sk0_14,sk0_17,sk0_16,sk0_15) ),
inference(skolemization,[status(esa)],[f114]) ).
fof(f116,plain,
between_c(sk0_14,sk0_15,sk0_16,sk0_17),
inference(cnf_transformation,[status(esa)],[f115]) ).
fof(f117,plain,
~ between_c(sk0_14,sk0_17,sk0_16,sk0_15),
inference(cnf_transformation,[status(esa)],[f115]) ).
fof(f122,plain,
! [X0,X1,X2] : ~ between_c(X0,X1,X2,X1),
inference(destructive_equality_resolution,[status(esa)],[f108]) ).
fof(f318,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ between_c(X0,X1,X2,X3)
| between_c(X4,X5,X6,X1)
| X5 = X1
| ~ part_of(sk0_13(X3,X2,X1,X0),X4)
| ~ end_point(X5,sk0_13(X3,X2,X1,X0))
| ~ inner_point(X6,sk0_13(X3,X2,X1,X0)) ),
inference(resolution,[status(thm)],[f110,f113]) ).
fof(f345,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ between_c(X0,X1,X2,X3)
| between_c(X4,X5,X2,X1)
| X5 = X1
| ~ part_of(sk0_13(X3,X2,X1,X0),X4)
| ~ end_point(X5,sk0_13(X3,X2,X1,X0))
| ~ between_c(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f318,f112]) ).
fof(f346,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ between_c(X0,X1,X2,X3)
| between_c(X4,X5,X2,X1)
| X5 = X1
| ~ part_of(sk0_13(X3,X2,X1,X0),X4)
| ~ end_point(X5,sk0_13(X3,X2,X1,X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f345]) ).
fof(f347,plain,
! [X0,X1,X2,X3,X4] :
( ~ between_c(X0,X1,X2,X3)
| between_c(X0,X4,X2,X1)
| X4 = X1
| ~ end_point(X4,sk0_13(X3,X2,X1,X0))
| ~ between_c(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f346,f109]) ).
fof(f348,plain,
! [X0,X1,X2,X3,X4] :
( ~ between_c(X0,X1,X2,X3)
| between_c(X0,X4,X2,X1)
| X4 = X1
| ~ end_point(X4,sk0_13(X3,X2,X1,X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f347]) ).
fof(f354,plain,
! [X0,X1,X2,X3] :
( ~ between_c(X0,X1,X2,X3)
| between_c(X0,X3,X2,X1)
| X3 = X1
| ~ between_c(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f348,f111]) ).
fof(f355,plain,
! [X0,X1,X2,X3] :
( ~ between_c(X0,X1,X2,X3)
| between_c(X0,X3,X2,X1)
| X3 = X1 ),
inference(duplicate_literals_removal,[status(esa)],[f354]) ).
fof(f356,plain,
( spl0_0
<=> between_c(sk0_14,sk0_15,sk0_16,sk0_17) ),
introduced(split_symbol_definition) ).
fof(f358,plain,
( ~ between_c(sk0_14,sk0_15,sk0_16,sk0_17)
| spl0_0 ),
inference(component_clause,[status(thm)],[f356]) ).
fof(f359,plain,
( spl0_1
<=> sk0_17 = sk0_15 ),
introduced(split_symbol_definition) ).
fof(f360,plain,
( sk0_17 = sk0_15
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f359]) ).
fof(f362,plain,
( ~ between_c(sk0_14,sk0_15,sk0_16,sk0_17)
| sk0_17 = sk0_15 ),
inference(resolution,[status(thm)],[f355,f117]) ).
fof(f363,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f362,f356,f359]) ).
fof(f364,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f358,f116]) ).
fof(f365,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f364]) ).
fof(f367,plain,
( between_c(sk0_14,sk0_15,sk0_16,sk0_15)
| ~ spl0_1 ),
inference(backward_demodulation,[status(thm)],[f360,f116]) ).
fof(f368,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f367,f122]) ).
fof(f369,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f368]) ).
fof(f370,plain,
$false,
inference(sat_refutation,[status(thm)],[f363,f365,f369]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO112+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue May 30 12:01:10 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.33 % Drodi V3.5.1
% 0.17/0.35 % Refutation found
% 0.17/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.58 % Elapsed time: 0.027516 seconds
% 0.17/0.58 % CPU time: 0.058997 seconds
% 0.17/0.58 % Memory used: 7.892 MB
%------------------------------------------------------------------------------