%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO263+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:45:00 EDT 2022
% Result : Theorem 7.75s 2.36s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 22 ~; 18 |; 16 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 40 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X4,X5,X8,X3,X6,X7] :
( ( between_on_line(X4,X3,X6,X7)
& convergent_lines(X4,X5)
& convergent_lines(X4,X8)
& convergent_lines(X5,X8) )
=> between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X3)),intersection_point(X5,parallel_through_point(X8,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(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(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(c_0_5,negated_conjecture,
~ ! [X4,X5,X8,X3,X6,X7] :
( ( between_on_line(X4,X3,X6,X7)
& convergent_lines(X4,X5)
& convergent_lines(X4,X8)
& convergent_lines(X5,X8) )
=> between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X3)),intersection_point(X5,parallel_through_point(X8,X6)),intersection_point(X5,parallel_through_point(X8,X7))) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,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_7,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])]) ).
fof(c_0_8,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_9,negated_conjecture,
( between_on_line(esk1_0,esk4_0,esk5_0,esk6_0)
& convergent_lines(esk1_0,esk2_0)
& convergent_lines(esk1_0,esk3_0)
& convergent_lines(esk2_0,esk3_0)
& ~ between_on_line(esk2_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk4_0)),intersection_point(esk2_0,parallel_through_point(esk3_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_5])])]) ).
cnf(c_0_10,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_6]) ).
cnf(c_0_11,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( unequally_directed_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,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])]) ).
cnf(c_0_15,plain,
( unequally_directed_opposite_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_17,negated_conjecture,
unequally_directed_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
unequally_directed_opposite_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
~ unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO263+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 : Sat Jun 18 00:41:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/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
% 7.75/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.75/2.36 # No SInE strategy applied
% 7.75/2.36 # Trying AutoSched0 for 150 seconds
% 7.75/2.36 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.75/2.36 # and selection function SelectCQPrecWNTNp.
% 7.75/2.36 #
% 7.75/2.36 # Preprocessing time : 0.016 s
% 7.75/2.36
% 7.75/2.36 # Proof found!
% 7.75/2.36 # SZS status Theorem
% 7.75/2.36 # SZS output start CNFRefutation
% See solution above
% 7.75/2.37 # Training examples: 0 positive, 0 negative
% 7.75/2.37
% 7.75/2.37 # -------------------------------------------------
% 7.75/2.37 # User time : 0.019 s
% 7.75/2.37 # System time : 0.004 s
% 7.75/2.37 # Total time : 0.022 s
% 7.75/2.37 # Maximum resident set size: 7124 pages
% 7.75/2.37
%------------------------------------------------------------------------------