TSTP Solution File: GEO261+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO261+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:59 EDT 2022
% Result : Theorem 8.50s 2.50s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 52 ( 21 ~; 15 |; 12 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 32 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2,X3,X1,X4,X5] :
( ( between_on_line(X2,X1,X4,X5)
& convergent_lines(X2,X3)
& ~ apart_point_and_line(X4,X3) )
=> divides_points(X3,X1,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(oag9,axiom,
! [X2,X3] :
( ( unequally_directed_lines(X2,X3)
& unequally_directed_lines(X2,reverse_line(X3)) )
=> ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(con_def,axiom,
! [X2,X3] :
( convergent_lines(X2,X3)
<=> ( unequally_directed_lines(X2,X3)
& unequally_directed_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',con_def) ).
fof(c_0_4,negated_conjecture,
~ ! [X2,X3,X1,X4,X5] :
( ( between_on_line(X2,X1,X4,X5)
& convergent_lines(X2,X3)
& ~ apart_point_and_line(X4,X3) )
=> divides_points(X3,X1,X5) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,plain,
! [X38,X39] :
( ~ unequally_directed_lines(X38,X39)
| ~ unequally_directed_lines(X38,reverse_line(X39))
| left_convergent_lines(X38,X39)
| left_convergent_lines(X38,reverse_line(X39)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])]) ).
fof(c_0_6,plain,
! [X42,X43] :
( ~ left_convergent_lines(X42,X43)
& ~ left_convergent_lines(X42,reverse_line(X43)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])]) ).
fof(c_0_7,plain,
! [X9,X10] :
( ( unequally_directed_lines(X9,X10)
| ~ convergent_lines(X9,X10) )
& ( unequally_directed_lines(X9,reverse_line(X10))
| ~ convergent_lines(X9,X10) )
& ( ~ unequally_directed_lines(X9,X10)
| ~ unequally_directed_lines(X9,reverse_line(X10))
| convergent_lines(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con_def])])]) ).
fof(c_0_8,negated_conjecture,
( between_on_line(esk1_0,esk3_0,esk4_0,esk5_0)
& convergent_lines(esk1_0,esk2_0)
& ~ apart_point_and_line(esk4_0,esk2_0)
& ~ divides_points(esk2_0,esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_9,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_5]) ).
cnf(c_0_10,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( unequally_directed_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
unequally_directed_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GEO261+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 07:58:50 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.48 # ENIGMATIC: Selected SinE mode:
% 0.21/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.50/2.50 # ENIGMATIC: Solved by autoschedule:
% 8.50/2.50 # No SInE strategy applied
% 8.50/2.50 # Trying AutoSched0 for 150 seconds
% 8.50/2.50 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 8.50/2.50 # and selection function SelectNewComplexAHP.
% 8.50/2.50 #
% 8.50/2.50 # Preprocessing time : 0.015 s
% 8.50/2.50 # Presaturation interreduction done
% 8.50/2.50
% 8.50/2.50 # Proof found!
% 8.50/2.50 # SZS status Theorem
% 8.50/2.50 # SZS output start CNFRefutation
% See solution above
% 8.50/2.50 # Training examples: 0 positive, 0 negative
% 8.50/2.50
% 8.50/2.50 # -------------------------------------------------
% 8.50/2.50 # User time : 0.017 s
% 8.50/2.50 # System time : 0.004 s
% 8.50/2.50 # Total time : 0.022 s
% 8.50/2.50 # Maximum resident set size: 7116 pages
% 8.50/2.50
%------------------------------------------------------------------------------