TSTP Solution File: GEO257+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO257+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n014.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:47:31 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 23
% Syntax : Number of formulae : 29 ( 3 unt; 21 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 29 ( 9 ~; 1 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 16 >; 17 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 2 sgn; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
apart_point_and_line: ( $i * $i ) > $o ).
tff(decl_23,type,
left_apart_point: ( $i * $i ) > $o ).
tff(decl_24,type,
reverse_line: $i > $i ).
tff(decl_25,type,
convergent_lines: ( $i * $i ) > $o ).
tff(decl_26,type,
unequally_directed_lines: ( $i * $i ) > $o ).
tff(decl_27,type,
divides_points: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
before_on_line: ( $i * $i * $i ) > $o ).
tff(decl_29,type,
distinct_points: ( $i * $i ) > $o ).
tff(decl_30,type,
line_connecting: ( $i * $i ) > $i ).
tff(decl_31,type,
between_on_line: ( $i * $i * $i * $i ) > $o ).
tff(decl_32,type,
distinct_lines: ( $i * $i ) > $o ).
tff(decl_33,type,
line: $i > $o ).
tff(decl_34,type,
left_convergent_lines: ( $i * $i ) > $o ).
tff(decl_35,type,
point: $i > $o ).
tff(decl_36,type,
intersection_point: ( $i * $i ) > $i ).
tff(decl_37,type,
parallel_through_point: ( $i * $i ) > $i ).
tff(decl_38,type,
esk1_0: $i ).
tff(decl_39,type,
esk2_0: $i ).
tff(decl_40,type,
esk3_0: $i ).
tff(decl_41,type,
esk4_0: $i ).
tff(decl_42,type,
esk5_0: $i ).
fof(con,conjecture,
! [X2,X1,X4,X5,X7] :
( ( distinct_points(X1,X5)
& distinct_points(X4,X5)
& ~ apart_point_and_line(X5,X2)
& left_apart_point(X7,X2) )
=> ( ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X5) )
=> before_on_line(X2,X1,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag10) ).
fof(c_0_2,negated_conjecture,
~ ! [X2,X1,X4,X5,X7] :
( ( distinct_points(X1,X5)
& distinct_points(X4,X5)
& ~ apart_point_and_line(X5,X2)
& left_apart_point(X7,X2) )
=> ( ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X5) )
=> before_on_line(X2,X1,X5) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_3,negated_conjecture,
( distinct_points(esk2_0,esk4_0)
& distinct_points(esk3_0,esk4_0)
& ~ apart_point_and_line(esk4_0,esk1_0)
& left_apart_point(esk5_0,esk1_0)
& before_on_line(esk1_0,esk2_0,esk3_0)
& before_on_line(esk1_0,esk3_0,esk4_0)
& ~ before_on_line(esk1_0,esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X41,X42] :
( ~ left_apart_point(X41,X42)
& ~ left_apart_point(X41,reverse_line(X42)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])]) ).
cnf(c_0_5,negated_conjecture,
left_apart_point(esk5_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO257+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 19:52:45 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.60 % Total time : 0.006000 s
% 0.21/0.60 % SZS output end Proof
% 0.21/0.60 % Total time : 0.010000 s
%------------------------------------------------------------------------------