TSTP Solution File: GEO227+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO227+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:41 EDT 2022
% Result : Theorem 5.30s 2.05s
% Output : CNFRefutation 5.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 40 ( 17 ~; 14 |; 6 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(ax8_basics,axiom,
! [X4,X5] :
( unequally_directed_lines(X4,X5)
| unequally_directed_lines(X4,reverse_line(X5)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax8_basics) ).
fof(a5_defns,axiom,
! [X1,X2] :
( equally_directed_opposite_lines(X1,X2)
<=> ~ unequally_directed_opposite_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a5_defns) ).
fof(con,conjecture,
! [X4,X5] :
~ ( equally_directed_lines(X4,X5)
& equally_directed_opposite_lines(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(a4_defns,axiom,
! [X1,X2] :
( equally_directed_lines(X1,X2)
<=> ~ unequally_directed_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a4_defns) ).
fof(c_0_5,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])]) ).
fof(c_0_6,plain,
! [X48,X49] :
( unequally_directed_lines(X48,X49)
| unequally_directed_lines(X48,reverse_line(X49)) ),
inference(variable_rename,[status(thm)],[ax8_basics]) ).
fof(c_0_7,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])])]) ).
cnf(c_0_8,plain,
( unequally_directed_opposite_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
~ ! [X4,X5] :
~ ( equally_directed_lines(X4,X5)
& equally_directed_opposite_lines(X4,X5) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_0_11,plain,
( ~ equally_directed_opposite_lines(X1,X2)
| ~ unequally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_opposite_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_13,negated_conjecture,
( equally_directed_lines(esk1_0,esk2_0)
& equally_directed_opposite_lines(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,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])])]) ).
cnf(c_0_15,plain,
( unequally_directed_lines(X1,X2)
| ~ equally_directed_opposite_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
equally_directed_opposite_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ equally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
unequally_directed_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
equally_directed_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GEO227+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Sat Jun 18 14:39:34 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.16/0.42 # ENIGMATIC: Selected SinE mode:
% 0.16/0.43 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.30/2.05 # ENIGMATIC: Solved by autoschedule:
% 5.30/2.05 # No SInE strategy applied
% 5.30/2.05 # Trying AutoSched0 for 150 seconds
% 5.30/2.05 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 5.30/2.05 # and selection function SelectCQPrecWNTNp.
% 5.30/2.05 #
% 5.30/2.05 # Preprocessing time : 0.014 s
% 5.30/2.05
% 5.30/2.05 # Proof found!
% 5.30/2.05 # SZS status Theorem
% 5.30/2.05 # SZS output start CNFRefutation
% See solution above
% 5.30/2.05 # Training examples: 0 positive, 0 negative
% 5.30/2.05
% 5.30/2.05 # -------------------------------------------------
% 5.30/2.05 # User time : 0.015 s
% 5.30/2.05 # System time : 0.004 s
% 5.30/2.05 # Total time : 0.019 s
% 5.30/2.05 # Maximum resident set size: 7120 pages
% 5.30/2.05
%------------------------------------------------------------------------------