TSTP Solution File: GEO176+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO176+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n008.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:46:42 EDT 2023
% Result : Theorem 0.21s 0.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of formulae : 43 ( 5 unt; 20 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 48 ( 17 ~; 17 |; 7 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 16 >; 14 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
distinct_points: ( $i * $i ) > $o ).
tff(decl_23,type,
distinct_lines: ( $i * $i ) > $o ).
tff(decl_24,type,
convergent_lines: ( $i * $i ) > $o ).
tff(decl_25,type,
line_connecting: ( $i * $i ) > $i ).
tff(decl_26,type,
apart_point_and_line: ( $i * $i ) > $o ).
tff(decl_27,type,
intersection_point: ( $i * $i ) > $i ).
tff(decl_28,type,
parallel_through_point: ( $i * $i ) > $i ).
tff(decl_29,type,
unorthogonal_lines: ( $i * $i ) > $o ).
tff(decl_30,type,
orthogonal_through_point: ( $i * $i ) > $i ).
tff(decl_31,type,
point: $i > $o ).
tff(decl_32,type,
line: $i > $o ).
tff(decl_33,type,
equal_points: ( $i * $i ) > $o ).
tff(decl_34,type,
equal_lines: ( $i * $i ) > $o ).
tff(decl_35,type,
parallel_lines: ( $i * $i ) > $o ).
tff(decl_36,type,
incident_point_and_line: ( $i * $i ) > $o ).
tff(decl_37,type,
orthogonal_lines: ( $i * $i ) > $o ).
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 ).
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) )
=> distinct_points(X1,intersection_point(X4,X5)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(ceq1,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_points(X1,X3)
| apart_point_and_line(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq1) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) )
=> distinct_points(X1,intersection_point(X4,X5)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,plain,
! [X35,X36,X37] :
( ~ apart_point_and_line(X35,X36)
| distinct_points(X35,X37)
| apart_point_and_line(X37,X36) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq1])]) ).
fof(c_0_6,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& ( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk1_0,esk4_0) )
& ~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
cnf(c_0_8,plain,
( distinct_points(X1,X3)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk1_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X29,X30] :
( ~ convergent_lines(X29,X30)
| ~ apart_point_and_line(intersection_point(X29,X30),X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(X1,esk4_0)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)
| apart_point_and_line(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_16,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
cnf(c_0_17,negated_conjecture,
apart_point_and_line(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
fof(c_0_18,plain,
! [X27,X28] :
( ~ convergent_lines(X27,X28)
| ~ apart_point_and_line(intersection_point(X27,X28),X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
( apart_point_and_line(X1,esk3_0)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_20,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO176+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 20:21:32 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.58 % Version : CSE_E---1.5
% 0.21/0.58 % Problem : theBenchmark.p
% 0.21/0.58 % Proof found
% 0.21/0.58 % SZS status Theorem for theBenchmark.p
% 0.21/0.58 % SZS output start Proof
% See solution above
% 0.21/0.58 % Total time : 0.013000 s
% 0.21/0.58 % SZS output end Proof
% 0.21/0.58 % Total time : 0.017000 s
%------------------------------------------------------------------------------