TSTP Solution File: GEO205+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO205+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:22 EDT 2022
% Result : Theorem 8.28s 2.41s
% Output : CNFRefutation 8.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 104 ( 36 ~; 53 |; 7 &)
% ( 0 <=>; 8 =>; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& ~ distinct_lines(X2,X3) )
=> ( convergent_lines(X1,X3)
& ~ distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)) ) ),
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(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(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(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(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
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(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart5) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart2) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& ~ distinct_lines(X2,X3) )
=> ( convergent_lines(X1,X3)
& ~ distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,plain,
! [X36,X37,X38] :
( ~ convergent_lines(X36,X37)
| distinct_lines(X37,X38)
| convergent_lines(X36,X38) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
fof(c_0_11,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& ~ distinct_lines(esk2_0,esk3_0)
& ( ~ convergent_lines(esk1_0,esk3_0)
| distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_12,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,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]) ).
cnf(c_0_14,negated_conjecture,
~ distinct_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( convergent_lines(esk1_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,plain,
! [X26,X27,X28,X29] :
( ~ distinct_points(X26,X27)
| ~ distinct_lines(X28,X29)
| apart_point_and_line(X26,X28)
| apart_point_and_line(X26,X29)
| apart_point_and_line(X27,X28)
| apart_point_and_line(X27,X29) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_17,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,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_16]) ).
cnf(c_0_19,negated_conjecture,
( convergent_lines(esk1_0,X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
| ~ convergent_lines(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X24,X25] :
( ~ convergent_lines(X24,X25)
| ~ apart_point_and_line(intersection_point(X24,X25),X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci4])])]) ).
cnf(c_0_22,negated_conjecture,
( apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X2,esk3_0)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| convergent_lines(esk1_0,X3)
| ~ distinct_points(X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_17])]) ).
fof(c_0_24,plain,
! [X22,X23] :
( ~ convergent_lines(X22,X23)
| ~ apart_point_and_line(intersection_point(X22,X23),X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci3])])]) ).
cnf(c_0_25,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,plain,
! [X8] : ~ convergent_lines(X8,X8),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
fof(c_0_28,plain,
! [X33,X34,X35] :
( ~ apart_point_and_line(X33,X34)
| distinct_lines(X34,X35)
| apart_point_and_line(X33,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
cnf(c_0_29,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| convergent_lines(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17])]) ).
cnf(c_0_31,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17])]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_35,plain,
! [X12,X13,X14] :
( ~ distinct_lines(X12,X13)
| distinct_lines(X12,X14)
| distinct_lines(X13,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).
cnf(c_0_36,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| distinct_lines(esk3_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_34]),c_0_13])]) ).
fof(c_0_37,plain,
! [X7] : ~ distinct_lines(X7,X7),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart2])]) ).
cnf(c_0_38,plain,
( distinct_lines(X1,X3)
| distinct_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
distinct_lines(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_36]),c_0_13])]) ).
cnf(c_0_40,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( distinct_lines(esk2_0,X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO205+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n011.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 16:17:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox2/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.28/2.41 # ENIGMATIC: Solved by autoschedule:
% 8.28/2.41 # No SInE strategy applied
% 8.28/2.41 # Trying AutoSched0 for 150 seconds
% 8.28/2.41 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 8.28/2.41 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.28/2.41 #
% 8.28/2.41 # Preprocessing time : 0.015 s
% 8.28/2.41
% 8.28/2.41 # Proof found!
% 8.28/2.41 # SZS status Theorem
% 8.28/2.41 # SZS output start CNFRefutation
% See solution above
% 8.28/2.41 # Training examples: 0 positive, 0 negative
% 8.28/2.41
% 8.28/2.41 # -------------------------------------------------
% 8.28/2.41 # User time : 0.029 s
% 8.28/2.41 # System time : 0.005 s
% 8.28/2.41 # Total time : 0.034 s
% 8.28/2.41 # Maximum resident set size: 7116 pages
% 8.28/2.41
%------------------------------------------------------------------------------