TSTP Solution File: GEO217+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO217+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:32 EDT 2022
% Result : Theorem 6.75s 2.28s
% Output : CNFRefutation 6.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 16 ~; 10 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7,X8] :
( ( ~ convergent_lines(X6,X7)
& ~ convergent_lines(X6,X8) )
=> ~ convergent_lines(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(apart6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart3) ).
fof(c_0_3,negated_conjecture,
~ ! [X6,X7,X8] :
( ( ~ convergent_lines(X6,X7)
& ~ convergent_lines(X6,X8) )
=> ~ convergent_lines(X7,X8) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_4,plain,
! [X18,X19,X20] :
( ~ convergent_lines(X18,X19)
| convergent_lines(X18,X20)
| convergent_lines(X19,X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])]) ).
fof(c_0_5,negated_conjecture,
( ~ convergent_lines(esk1_0,esk2_0)
& ~ convergent_lines(esk1_0,esk3_0)
& convergent_lines(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X11] : ~ convergent_lines(X11,X11),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
cnf(c_0_9,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(esk2_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
convergent_lines(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO217+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.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 11:56:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.75/2.28 # ENIGMATIC: Solved by autoschedule:
% 6.75/2.28 # No SInE strategy applied
% 6.75/2.28 # Trying AutoSched0 for 150 seconds
% 6.75/2.28 # AutoSched0-Mode selected heuristic G_E___042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 6.75/2.28 # and selection function SelectNewComplexAHPNS.
% 6.75/2.28 #
% 6.75/2.28 # Preprocessing time : 0.014 s
% 6.75/2.28 # Presaturation interreduction done
% 6.75/2.28
% 6.75/2.28 # Proof found!
% 6.75/2.28 # SZS status Theorem
% 6.75/2.28 # SZS output start CNFRefutation
% See solution above
% 6.75/2.28 # Training examples: 0 positive, 0 negative
% 6.75/2.28
% 6.75/2.28 # -------------------------------------------------
% 6.75/2.28 # User time : 0.017 s
% 6.75/2.28 # System time : 0.004 s
% 6.75/2.28 # Total time : 0.022 s
% 6.75/2.28 # Maximum resident set size: 7116 pages
% 6.75/2.28
%------------------------------------------------------------------------------