TSTP Solution File: GEO269+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO269+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:02 EDT 2022
% Result : Theorem 7.02s 2.29s
% Output : CNFRefutation 7.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 67 ( 28 ~; 29 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 57 ( 2 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X4] : equally_directed_opposite_lines(X4,reverse_line(X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(a5_defns,axiom,
! [X1,X2] :
( equally_directed_opposite_lines(X1,X2)
<=> ~ unequally_directed_opposite_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a5_defns) ).
fof(a1_defns,axiom,
! [X1,X2] :
( unequally_directed_opposite_lines(X1,X2)
<=> unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a1_defns) ).
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/sandbox2/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/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).
fof(ax6_basics,axiom,
! [X4,X5,X8] :
( unequally_directed_lines(X4,X5)
=> ( unequally_directed_lines(X4,X8)
| unequally_directed_lines(X5,X8) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax6_basics) ).
fof(a4_defns,axiom,
! [X1,X2] :
( equally_directed_lines(X1,X2)
<=> ~ unequally_directed_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a4_defns) ).
fof(ax8_basics,axiom,
! [X4,X5] :
( unequally_directed_lines(X4,X5)
| unequally_directed_lines(X4,reverse_line(X5)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax8_basics) ).
fof(ax5_basics,axiom,
! [X4] : equally_directed_lines(X4,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax5_basics) ).
fof(c_0_9,negated_conjecture,
~ ! [X4] : equally_directed_opposite_lines(X4,reverse_line(X4)),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,negated_conjecture,
~ equally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_11,plain,
! [X17,X18] :
( ( ~ equally_directed_opposite_lines(X17,X18)
| ~ unequally_directed_opposite_lines(X17,X18) )
& ( unequally_directed_opposite_lines(X17,X18)
| equally_directed_opposite_lines(X17,X18) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a5_defns])])]) ).
fof(c_0_12,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_13,negated_conjecture,
~ equally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( unequally_directed_opposite_lines(X1,X2)
| equally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,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_16,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_17,plain,
! [X42,X43,X44] :
( ~ unequally_directed_lines(X42,X43)
| unequally_directed_lines(X42,X44)
| unequally_directed_lines(X43,X44) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6_basics])]) ).
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_12]) ).
cnf(c_0_19,negated_conjecture,
unequally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_20,plain,
! [X15,X16] :
( ( ~ equally_directed_lines(X15,X16)
| ~ unequally_directed_lines(X15,X16) )
& ( unequally_directed_lines(X15,X16)
| equally_directed_lines(X15,X16) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a4_defns])])]) ).
fof(c_0_21,plain,
! [X48,X49] :
( unequally_directed_lines(X48,X49)
| unequally_directed_lines(X48,reverse_line(X49)) ),
inference(variable_rename,[status(thm)],[ax8_basics]) ).
cnf(c_0_22,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_15]) ).
cnf(c_0_23,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( unequally_directed_lines(X1,X3)
| unequally_directed_lines(X2,X3)
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk1_0))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ equally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X41] : equally_directed_lines(X41,X41),
inference(variable_rename,[status(thm)],[ax5_basics]) ).
cnf(c_0_29,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X1)
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,reverse_line(X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
equally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( unequally_directed_lines(esk1_0,X1)
| ~ unequally_directed_lines(reverse_line(reverse_line(esk1_0)),reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
unequally_directed_lines(reverse_line(X1),X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
unequally_directed_lines(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_35]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO269+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 : Fri Jun 17 20:15:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected SinE mode:
% 0.19/0.43 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.02/2.29 # ENIGMATIC: Solved by autoschedule:
% 7.02/2.29 # No SInE strategy applied
% 7.02/2.29 # Trying AutoSched0 for 150 seconds
% 7.02/2.29 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.02/2.29 # and selection function SelectCQPrecWNTNp.
% 7.02/2.29 #
% 7.02/2.29 # Preprocessing time : 0.015 s
% 7.02/2.29
% 7.02/2.29 # Proof found!
% 7.02/2.29 # SZS status Theorem
% 7.02/2.29 # SZS output start CNFRefutation
% See solution above
% 7.02/2.29 # Training examples: 0 positive, 0 negative
% 7.02/2.29
% 7.02/2.29 # -------------------------------------------------
% 7.02/2.29 # User time : 0.015 s
% 7.02/2.29 # System time : 0.007 s
% 7.02/2.29 # Total time : 0.023 s
% 7.02/2.29 # Maximum resident set size: 7120 pages
% 7.02/2.29
%------------------------------------------------------------------------------