TSTP Solution File: GEO247+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO247+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n032.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:27 EDT 2023
% Result : Theorem 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 24
% Syntax : Number of formulae : 30 ( 3 unt; 22 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 32 ( 6 ~; 1 |; 23 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 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 : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn; 16 !; 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 ).
tff(decl_43,type,
esk6_0: $i ).
fof(con,conjecture,
! [X1,X4,X5,X7,X2,X3] :
( ( left_apart_point(X1,X2)
& left_apart_point(X1,X3)
& left_apart_point(X4,reverse_line(X2))
& left_apart_point(X4,reverse_line(X3))
& left_apart_point(X5,X2)
& left_apart_point(X5,reverse_line(X3))
& left_apart_point(X7,reverse_line(X2))
& left_apart_point(X7,X3) )
=> convergent_lines(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag10) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X4,X5,X7,X2,X3] :
( ( left_apart_point(X1,X2)
& left_apart_point(X1,X3)
& left_apart_point(X4,reverse_line(X2))
& left_apart_point(X4,reverse_line(X3))
& left_apart_point(X5,X2)
& left_apart_point(X5,reverse_line(X3))
& left_apart_point(X7,reverse_line(X2))
& left_apart_point(X7,X3) )
=> convergent_lines(X2,X3) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_3,negated_conjecture,
( left_apart_point(esk1_0,esk5_0)
& left_apart_point(esk1_0,esk6_0)
& left_apart_point(esk2_0,reverse_line(esk5_0))
& left_apart_point(esk2_0,reverse_line(esk6_0))
& left_apart_point(esk3_0,esk5_0)
& left_apart_point(esk3_0,reverse_line(esk6_0))
& left_apart_point(esk4_0,reverse_line(esk5_0))
& left_apart_point(esk4_0,esk6_0)
& ~ convergent_lines(esk5_0,esk6_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(esk1_0,esk5_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.09/0.11 % Problem : GEO247+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Tue Aug 29 22:25:32 EDT 2023
% 0.12/0.31 % CPUTime :
% 0.17/0.50 start to proof: theBenchmark
% 0.17/0.51 % Version : CSE_E---1.5
% 0.17/0.51 % Problem : theBenchmark.p
% 0.17/0.51 % Proof found
% 0.17/0.51 % SZS status Theorem for theBenchmark.p
% 0.17/0.51 % SZS output start Proof
% See solution above
% 0.17/0.52 % Total time : 0.005000 s
% 0.17/0.52 % SZS output end Proof
% 0.17/0.52 % Total time : 0.008000 s
%------------------------------------------------------------------------------