TSTP Solution File: GEO191+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO191+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:09 EDT 2022
% Result : Theorem 8.12s 2.49s
% Output : CNFRefutation 8.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 87 ( 27 ~; 44 |; 10 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( convergent_lines(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(intersection_point(X1,X2),X4)
| apart_point_and_line(intersection_point(X1,X2),X5) ) )
=> ( apart_point_and_line(intersection_point(X4,X5),X1)
| apart_point_and_line(intersection_point(X4,X5),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(ceq3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',ceq3) ).
fof(con2,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( ( apart_point_and_line(X3,X1)
| apart_point_and_line(X3,X2) )
=> distinct_points(X3,intersection_point(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',con2) ).
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/GEO008+0.ax',cu1) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( convergent_lines(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(intersection_point(X1,X2),X4)
| apart_point_and_line(intersection_point(X1,X2),X5) ) )
=> ( apart_point_and_line(intersection_point(X4,X5),X1)
| apart_point_and_line(intersection_point(X4,X5),X2) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,plain,
! [X34,X35] :
( ~ convergent_lines(X34,X35)
| distinct_lines(X34,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
fof(c_0_7,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0) )
& ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
& ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X21,X22,X23] :
( ( ~ apart_point_and_line(X23,X21)
| distinct_points(X23,intersection_point(X21,X22))
| ~ convergent_lines(X21,X22) )
& ( ~ apart_point_and_line(X23,X22)
| distinct_points(X23,intersection_point(X21,X22))
| ~ convergent_lines(X21,X22) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])]) ).
fof(c_0_9,plain,
! [X24,X25,X26,X27] :
( ~ distinct_points(X24,X25)
| ~ distinct_lines(X26,X27)
| apart_point_and_line(X24,X26)
| apart_point_and_line(X24,X27)
| apart_point_and_line(X25,X26)
| apart_point_and_line(X25,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_10,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( distinct_points(X1,intersection_point(X3,X2))
| ~ apart_point_and_line(X1,X2)
| ~ convergent_lines(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,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_9]) ).
cnf(c_0_15,negated_conjecture,
distinct_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( distinct_points(X1,intersection_point(esk3_0,esk4_0))
| ~ apart_point_and_line(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ apart_point_and_line(X1,X2)
| ~ convergent_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X2,esk1_0)
| ~ distinct_points(X2,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk3_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_23,plain,
! [X6] : ~ distinct_points(X6,X6),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart1])]) ).
cnf(c_0_24,negated_conjecture,
( distinct_points(X1,intersection_point(esk1_0,esk2_0))
| ~ apart_point_and_line(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_26,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( distinct_points(X1,intersection_point(esk3_0,esk4_0))
| ~ apart_point_and_line(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_28,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk3_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_29]),c_0_21]),c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( distinct_points(X1,intersection_point(esk1_0,esk2_0))
| ~ apart_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_32,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_30]),c_0_26]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO191+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n015.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 : 600
% 0.14/0.34 % DateTime : Sat Jun 18 01:46:14 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.12/2.49 # ENIGMATIC: Solved by autoschedule:
% 8.12/2.49 # No SInE strategy applied
% 8.12/2.49 # Trying AutoSched0 for 150 seconds
% 8.12/2.49 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 8.12/2.49 # and selection function SelectCQIPrecWNTNp.
% 8.12/2.49 #
% 8.12/2.49 # Preprocessing time : 0.024 s
% 8.12/2.49
% 8.12/2.49 # Proof found!
% 8.12/2.49 # SZS status Theorem
% 8.12/2.49 # SZS output start CNFRefutation
% See solution above
% 8.12/2.49 # Training examples: 0 positive, 0 negative
% 8.12/2.49
% 8.12/2.49 # -------------------------------------------------
% 8.12/2.49 # User time : 0.029 s
% 8.12/2.49 # System time : 0.007 s
% 8.12/2.49 # Total time : 0.036 s
% 8.12/2.49 # Maximum resident set size: 7116 pages
% 8.12/2.49
%------------------------------------------------------------------------------