TSTP Solution File: GEO262+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO262+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 : n023.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:34 EDT 2023
% Result : Theorem 0.45s 0.60s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 33
% Syntax : Number of formulae : 50 ( 5 unt; 28 typ; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 68 ( 22 ~; 19 |; 22 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 45 ( 22 >; 23 *; 0 +; 0 <<)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
unequally_directed_opposite_lines: ( $i * $i ) > $o ).
tff(decl_23,type,
reverse_line: $i > $i ).
tff(decl_24,type,
unequally_directed_lines: ( $i * $i ) > $o ).
tff(decl_25,type,
right_apart_point: ( $i * $i ) > $o ).
tff(decl_26,type,
left_apart_point: ( $i * $i ) > $o ).
tff(decl_27,type,
right_convergent_lines: ( $i * $i ) > $o ).
tff(decl_28,type,
left_convergent_lines: ( $i * $i ) > $o ).
tff(decl_29,type,
equally_directed_lines: ( $i * $i ) > $o ).
tff(decl_30,type,
equally_directed_opposite_lines: ( $i * $i ) > $o ).
tff(decl_31,type,
apart_point_and_line: ( $i * $i ) > $o ).
tff(decl_32,type,
convergent_lines: ( $i * $i ) > $o ).
tff(decl_33,type,
divides_points: ( $i * $i * $i ) > $o ).
tff(decl_34,type,
before_on_line: ( $i * $i * $i ) > $o ).
tff(decl_35,type,
distinct_points: ( $i * $i ) > $o ).
tff(decl_36,type,
incident_point_and_line: ( $i * $i ) > $o ).
tff(decl_37,type,
line_connecting: ( $i * $i ) > $i ).
tff(decl_38,type,
between_on_line: ( $i * $i * $i * $i ) > $o ).
tff(decl_39,type,
distinct_lines: ( $i * $i ) > $o ).
tff(decl_40,type,
point: $i > $o ).
tff(decl_41,type,
line: $i > $o ).
tff(decl_42,type,
intersection_point: ( $i * $i ) > $i ).
tff(decl_43,type,
parallel_through_point: ( $i * $i ) > $i ).
tff(decl_44,type,
esk1_0: $i ).
tff(decl_45,type,
esk2_0: $i ).
tff(decl_46,type,
esk3_0: $i ).
tff(decl_47,type,
esk4_0: $i ).
tff(decl_48,type,
esk5_0: $i ).
tff(decl_49,type,
esk6_0: $i ).
fof(a1_defns,axiom,
! [X1,X2] :
( unequally_directed_opposite_lines(X1,X2)
<=> unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a1_defns) ).
fof(a7_defns,axiom,
! [X4,X5] :
( convergent_lines(X4,X5)
<=> ( unequally_directed_lines(X4,X5)
& unequally_directed_opposite_lines(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a7_defns) ).
fof(con,conjecture,
! [X4,X5,X8,X3,X6,X7] :
( ( between_on_line(X4,X3,X6,X7)
& convergent_lines(X4,X5)
& incident_point_and_line(X6,X5)
& convergent_lines(X4,X8)
& convergent_lines(X5,X8)
& incident_point_and_line(X6,X8) )
=> between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X3)),X6,intersection_point(X5,parallel_through_point(X8,X7))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(ax9_basics,axiom,
! [X4,X5] :
( ( unequally_directed_lines(X4,X5)
& unequally_directed_lines(X4,reverse_line(X5)) )
=> ( left_convergent_lines(X4,X5)
| left_convergent_lines(X4,reverse_line(X5)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax9_basics) ).
fof(ax11_basics,axiom,
! [X4,X5] :
~ ( left_convergent_lines(X4,X5)
| left_convergent_lines(X4,reverse_line(X5)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).
fof(c_0_5,plain,
! [X9,X10] :
( ( ~ unequally_directed_opposite_lines(X9,X10)
| unequally_directed_lines(X9,reverse_line(X10)) )
& ( ~ unequally_directed_lines(X9,reverse_line(X10))
| unequally_directed_opposite_lines(X9,X10) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])]) ).
fof(c_0_6,plain,
! [X21,X22] :
( ( unequally_directed_lines(X21,X22)
| ~ convergent_lines(X21,X22) )
& ( unequally_directed_opposite_lines(X21,X22)
| ~ convergent_lines(X21,X22) )
& ( ~ unequally_directed_lines(X21,X22)
| ~ unequally_directed_opposite_lines(X21,X22)
| convergent_lines(X21,X22) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a7_defns])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X4,X5,X8,X3,X6,X7] :
( ( between_on_line(X4,X3,X6,X7)
& convergent_lines(X4,X5)
& incident_point_and_line(X6,X5)
& convergent_lines(X4,X8)
& convergent_lines(X5,X8)
& incident_point_and_line(X6,X8) )
=> between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X3)),X6,intersection_point(X5,parallel_through_point(X8,X7))) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X50,X51] :
( ~ unequally_directed_lines(X50,X51)
| ~ unequally_directed_lines(X50,reverse_line(X51))
| left_convergent_lines(X50,X51)
| left_convergent_lines(X50,reverse_line(X51)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_basics])]) ).
fof(c_0_9,plain,
! [X54,X55] :
( ~ left_convergent_lines(X54,X55)
& ~ left_convergent_lines(X54,reverse_line(X55)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11_basics])]) ).
cnf(c_0_10,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( unequally_directed_opposite_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,negated_conjecture,
( between_on_line(esk1_0,esk4_0,esk5_0,esk6_0)
& convergent_lines(esk1_0,esk2_0)
& incident_point_and_line(esk5_0,esk2_0)
& convergent_lines(esk1_0,esk3_0)
& convergent_lines(esk2_0,esk3_0)
& incident_point_and_line(esk5_0,esk3_0)
& ~ between_on_line(esk2_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk4_0)),esk5_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk6_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_13,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( unequally_directed_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
unequally_directed_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO262+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n023.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:44:09 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.45/0.58 start to proof: theBenchmark
% 0.45/0.60 % Version : CSE_E---1.5
% 0.45/0.60 % Problem : theBenchmark.p
% 0.45/0.60 % Proof found
% 0.45/0.60 % SZS status Theorem for theBenchmark.p
% 0.45/0.60 % SZS output start Proof
% See solution above
% 0.45/0.61 % Total time : 0.012000 s
% 0.45/0.61 % SZS output end Proof
% 0.45/0.61 % Total time : 0.015000 s
%------------------------------------------------------------------------------