TSTP Solution File: GEO067-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO067-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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 Aug 30 22:45:54 EDT 2023
% Result : Unsatisfiable 0.48s 0.63s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 22
% Syntax : Number of formulae : 37 ( 8 unt; 14 typ; 0 def)
% Number of atoms : 47 ( 7 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 28 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 8 >; 27 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-6 aty)
% Number of variables : 45 ( 8 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
equidistant: ( $i * $i * $i * $i ) > $o ).
tff(decl_23,type,
extension: ( $i * $i * $i * $i ) > $i ).
tff(decl_24,type,
between: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
inner_pasch: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_26,type,
lower_dimension_point_1: $i ).
tff(decl_27,type,
lower_dimension_point_2: $i ).
tff(decl_28,type,
lower_dimension_point_3: $i ).
tff(decl_29,type,
euclid1: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_30,type,
euclid2: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_31,type,
continuous: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_32,type,
colinear: ( $i * $i * $i ) > $o ).
tff(decl_33,type,
x: $i ).
tff(decl_34,type,
y: $i ).
tff(decl_35,type,
z: $i ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
cnf(part_2,negated_conjecture,
( ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x)
| ~ colinear(x,z,y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_2) ).
cnf(colinearity3,axiom,
( colinear(X2,X3,X1)
| ~ between(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-1.ax',colinearity3) ).
cnf(colinearity2,axiom,
( colinear(X3,X1,X2)
| ~ between(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-1.ax',colinearity2) ).
cnf(part_1,negated_conjecture,
( x = y
| ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_1) ).
cnf(colinearity1,axiom,
( colinear(X1,X2,X3)
| ~ between(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-1.ax',colinearity1) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).
cnf(c_0_8,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_9,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_10,negated_conjecture,
( ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x)
| ~ colinear(x,z,y) ),
part_2 ).
cnf(c_0_11,axiom,
( colinear(X2,X3,X1)
| ~ between(X1,X2,X3) ),
colinearity3 ).
cnf(c_0_12,axiom,
( colinear(X3,X1,X2)
| ~ between(X1,X2,X3) ),
colinearity2 ).
cnf(c_0_13,negated_conjecture,
( x = y
| ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x) ),
part_1 ).
cnf(c_0_14,axiom,
( colinear(X1,X2,X3)
| ~ between(X1,X2,X3) ),
colinearity1 ).
cnf(c_0_15,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_16,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ colinear(x,y,x)
| ~ colinear(x,z,y)
| ~ between(x,y,x) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( y = x
| ~ between(y,x,x) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]),c_0_11]) ).
cnf(c_0_19,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( ~ between(x,y,x)
| ~ between(z,y,x) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
y = x,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_19]),c_0_21]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO067-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n010.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 Aug 29 23:25:18 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.48/0.62 start to proof: theBenchmark
% 0.48/0.63 % Version : CSE_E---1.5
% 0.48/0.63 % Problem : theBenchmark.p
% 0.48/0.63 % Proof found
% 0.48/0.63 % SZS status Theorem for theBenchmark.p
% 0.48/0.63 % SZS output start Proof
% See solution above
% 0.48/0.63 % Total time : 0.004000 s
% 0.48/0.63 % SZS output end Proof
% 0.48/0.63 % Total time : 0.006000 s
%------------------------------------------------------------------------------