TSTP Solution File: GEO226+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO226+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n029.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:17 EDT 2023
% Result : Theorem 0.51s 0.58s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 22
% Syntax : Number of formulae : 39 ( 2 unt; 18 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 56 ( 23 ~; 12 |; 11 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn; 23 !; 2 ?; 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 ).
fof(con,conjecture,
! [X6,X7] :
( ( line(X6)
& line(X7)
& convergent_lines(X6,X7) )
=> ? [X1] :
( point(X1)
=> ( incident_point_and_line(X1,X6)
& incident_point_and_line(X1,X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a4) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X7] :
( ( line(X6)
& line(X7)
& convergent_lines(X6,X7) )
=> ? [X1] :
( point(X1)
=> ( incident_point_and_line(X1,X6)
& incident_point_and_line(X1,X7) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,plain,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4]) ).
fof(c_0_6,negated_conjecture,
! [X94] :
( line(esk1_0)
& line(esk2_0)
& convergent_lines(esk1_0,esk2_0)
& point(X94)
& ( ~ incident_point_and_line(X94,esk1_0)
| ~ incident_point_and_line(X94,esk2_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X88,X89] :
( ( ~ incident_point_and_line(X88,X89)
| ~ apart_point_and_line(X88,X89) )
& ( apart_point_and_line(X88,X89)
| incident_point_and_line(X88,X89) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_8,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_9,negated_conjecture,
( ~ incident_point_and_line(X1,esk1_0)
| ~ incident_point_and_line(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( apart_point_and_line(X1,X2)
| incident_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
fof(c_0_12,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_8])]) ).
cnf(c_0_13,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| ~ incident_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_14,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_11])]) ).
cnf(c_0_15,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,X1),esk2_0)
| ~ convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO226+3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n029.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 21:22:57 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.51/0.58 % Version : CSE_E---1.5
% 0.51/0.58 % Problem : theBenchmark.p
% 0.51/0.58 % Proof found
% 0.51/0.58 % SZS status Theorem for theBenchmark.p
% 0.51/0.58 % SZS output start Proof
% See solution above
% 0.51/0.59 % Total time : 0.010000 s
% 0.51/0.59 % SZS output end Proof
% 0.51/0.59 % Total time : 0.014000 s
%------------------------------------------------------------------------------