TSTP Solution File: GEO201+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO201+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Sat Jul 16 03:44:20 EDT 2022
% Result : Theorem 8.44s 2.66s
% Output : CNFRefutation 8.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 17 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 35 ~; 42 |; 3 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 73 ( 3 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2] :
( convergent_lines(X1,X2)
=> equal_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(ax1,axiom,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax1) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq3) ).
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/sandbox/benchmark/Axioms/GEO006+0.ax',cu1) ).
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_9,negated_conjecture,
~ ! [X1,X2] :
( convergent_lines(X1,X2)
=> equal_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,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_11,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& ~ equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_12,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
cnf(c_0_15,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( convergent_lines(X1,esk1_0)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_19,plain,
! [X46,X47] : ~ convergent_lines(parallel_through_point(X47,X46),X47),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp1])]) ).
cnf(c_0_20,negated_conjecture,
( convergent_lines(X1,esk1_0)
| convergent_lines(esk2_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
fof(c_0_21,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_22,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_23,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
fof(c_0_25,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_26,negated_conjecture,
~ equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( distinct_points(X1,X2)
| equal_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
convergent_lines(parallel_through_point(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_30,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)],[inference(fof_simplification,[status(thm)],[ci4])])]) ).
fof(c_0_31,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)],[inference(fof_simplification,[status(thm)],[ci3])])]) ).
cnf(c_0_32,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_25]) ).
cnf(c_0_33,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( convergent_lines(parallel_through_point(esk1_0,X1),X2)
| distinct_lines(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_37,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),X1)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),X2)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X2)
| ~ distinct_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
distinct_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_23,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_37,c_0_13]) ).
cnf(c_0_43,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO201+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 01:11:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.44/2.66 # ENIGMATIC: Solved by autoschedule:
% 8.44/2.66 # No SInE strategy applied
% 8.44/2.66 # Trying AutoSched0 for 150 seconds
% 8.44/2.66 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 8.44/2.66 # and selection function SelectCQIPrecWNTNp.
% 8.44/2.66 #
% 8.44/2.66 # Preprocessing time : 0.025 s
% 8.44/2.66
% 8.44/2.66 # Proof found!
% 8.44/2.66 # SZS status Theorem
% 8.44/2.66 # SZS output start CNFRefutation
% See solution above
% 8.44/2.66 # Training examples: 0 positive, 0 negative
% 8.44/2.66
% 8.44/2.66 # -------------------------------------------------
% 8.44/2.66 # User time : 0.039 s
% 8.44/2.66 # System time : 0.009 s
% 8.44/2.66 # Total time : 0.048 s
% 8.44/2.66 # Maximum resident set size: 7120 pages
% 8.44/2.66
%------------------------------------------------------------------------------