TSTP Solution File: GEO202+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO202+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 : 600s
% DateTime : Sat Jul 16 03:44:20 EDT 2022
% Result : Theorem 8.02s 2.48s
% Output : CNFRefutation 8.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 20 unt; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 109 ( 42 ~; 49 |; 9 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 124 ( 19 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(ooc1,axiom,
! [X9,X6] : ~ unorthogonal_lines(orthogonal_through_point(X6,X9),X6),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',ooc1) ).
fof(occu1,axiom,
! [X6,X7] :
( convergent_lines(X6,X7)
| unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',occu1) ).
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& distinct_points(X1,X3)
& convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)) )
=> equal_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(ax1,axiom,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',ax1) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',cu1) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart4) ).
fof(c_0_13,plain,
! [X48,X49] : ~ apart_point_and_line(X48,parallel_through_point(X49,X48)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp2])]) ).
fof(c_0_14,plain,
! [X38,X39,X40] :
( ~ apart_point_and_line(X38,X39)
| distinct_lines(X39,X40)
| apart_point_and_line(X38,X40) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
fof(c_0_15,plain,
! [X46,X47] : ~ convergent_lines(parallel_through_point(X47,X46),X47),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp1])]) ).
fof(c_0_16,plain,
! [X20,X21,X22] :
( ~ convergent_lines(X20,X21)
| convergent_lines(X20,X22)
| convergent_lines(X21,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).
fof(c_0_17,plain,
! [X44,X45] :
( ~ distinct_lines(X44,X45)
| convergent_lines(X44,X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).
cnf(c_0_18,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( distinct_lines(X1,parallel_through_point(X2,X3))
| ~ apart_point_and_line(X3,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
fof(c_0_25,plain,
! [X58,X59] : ~ unorthogonal_lines(orthogonal_through_point(X59,X58),X59),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ooc1])]) ).
fof(c_0_26,plain,
! [X53,X54] :
( convergent_lines(X53,X54)
| unorthogonal_lines(X53,X54) ),
inference(variable_rename,[status(thm)],[occu1]) ).
fof(c_0_27,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& distinct_points(X1,X3)
& convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)) )
=> equal_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_0_28,plain,
( convergent_lines(X1,X2)
| ~ convergent_lines(X1,parallel_through_point(X2,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
( convergent_lines(X1,parallel_through_point(X2,X3))
| ~ apart_point_and_line(X3,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_30,plain,
! [X41,X42,X43] :
( ~ convergent_lines(X41,X42)
| distinct_lines(X42,X43)
| convergent_lines(X41,X43) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
cnf(c_0_31,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_34,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& distinct_points(esk1_0,esk3_0)
& convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))
& ~ equal_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
fof(c_0_35,plain,
! [X82,X83] :
( ( ~ equal_points(X82,X83)
| ~ distinct_points(X82,X83) )
& ( distinct_points(X82,X83)
| equal_points(X82,X83) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax1])])]) ).
fof(c_0_36,plain,
! [X31,X32,X33,X34] :
( ~ distinct_points(X31,X32)
| ~ distinct_lines(X33,X34)
| apart_point_and_line(X31,X33)
| apart_point_and_line(X31,X34)
| apart_point_and_line(X32,X33)
| apart_point_and_line(X32,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_37,plain,
( convergent_lines(X1,X2)
| ~ apart_point_and_line(X3,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( convergent_lines(X1,X2)
| ~ convergent_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_40,plain,
convergent_lines(orthogonal_through_point(X1,X2),X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_41,plain,
! [X14,X15,X16] :
( ~ distinct_points(X14,X15)
| distinct_points(X14,X16)
| distinct_points(X15,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
cnf(c_0_42,negated_conjecture,
~ equal_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
( distinct_points(X1,X2)
| equal_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X2,X4)
| ~ distinct_points(X1,X2)
| ~ distinct_lines(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
~ apart_point_and_line(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_37]) ).
cnf(c_0_46,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_47,plain,
convergent_lines(X1,orthogonal_through_point(X1,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,negated_conjecture,
distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( ~ distinct_lines(X1,X2)
| ~ distinct_points(X3,X4) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_44,c_0_45]),c_0_45]),c_0_45]),c_0_45]) ).
cnf(c_0_51,plain,
distinct_lines(orthogonal_through_point(X1,X2),X1),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),X1)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
~ distinct_points(X1,X2),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_52,c_0_53]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO202+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 16:57:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.02/2.48 # ENIGMATIC: Solved by autoschedule:
% 8.02/2.48 # No SInE strategy applied
% 8.02/2.48 # Trying AutoSched0 for 150 seconds
% 8.02/2.48 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02DN
% 8.02/2.48 # and selection function PSelectAntiRROptimalLit.
% 8.02/2.48 #
% 8.02/2.48 # Preprocessing time : 0.018 s
% 8.02/2.48 # Presaturation interreduction done
% 8.02/2.48
% 8.02/2.48 # Proof found!
% 8.02/2.48 # SZS status Theorem
% 8.02/2.48 # SZS output start CNFRefutation
% See solution above
% 8.02/2.48 # Training examples: 0 positive, 0 negative
% 8.02/2.48
% 8.02/2.48 # -------------------------------------------------
% 8.02/2.48 # User time : 0.031 s
% 8.02/2.48 # System time : 0.003 s
% 8.02/2.48 # Total time : 0.034 s
% 8.02/2.48 # Maximum resident set size: 7116 pages
% 8.02/2.48
%------------------------------------------------------------------------------