TSTP Solution File: GEO112+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO112+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:43:27 EDT 2022
% Result : Theorem 8.72s 2.60s
% Output : CNFRefutation 8.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 11 unt; 3 nHn; 24 RR)
% Number of literals : 48 ( 6 equ; 26 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 56 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( inner_point(X1,esk1_4(X2,X3,X1,X4))
| ~ between_c(X2,X3,X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iiouqszs/lgb.p',i_0_2) ).
cnf(i_0_51,negated_conjecture,
between_c(esk15_0,esk16_0,esk17_0,esk18_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iiouqszs/lgb.p',i_0_51) ).
cnf(i_0_1,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ part_of(X5,X3)
| ~ end_point(X2,X5)
| ~ end_point(X1,X5)
| ~ inner_point(X4,X5) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iiouqszs/lgb.p',i_0_1) ).
cnf(i_0_4,plain,
( end_point(X1,esk1_4(X2,X1,X3,X4))
| ~ between_c(X2,X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iiouqszs/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
( end_point(X1,esk1_4(X2,X3,X4,X1))
| ~ between_c(X2,X3,X4,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iiouqszs/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
( part_of(esk1_4(X1,X2,X3,X4),X1)
| ~ between_c(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iiouqszs/lgb.p',i_0_5) ).
cnf(i_0_50,negated_conjecture,
~ between_c(esk15_0,esk18_0,esk17_0,esk16_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iiouqszs/lgb.p',i_0_50) ).
cnf(i_0_6,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iiouqszs/lgb.p',i_0_6) ).
cnf(c_0_60,plain,
( inner_point(X1,esk1_4(X2,X3,X1,X4))
| ~ between_c(X2,X3,X1,X4) ),
i_0_2 ).
cnf(c_0_61,negated_conjecture,
between_c(esk15_0,esk16_0,esk17_0,esk18_0),
i_0_51 ).
cnf(c_0_62,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ part_of(X5,X3)
| ~ end_point(X2,X5)
| ~ end_point(X1,X5)
| ~ inner_point(X4,X5) ),
i_0_1 ).
cnf(c_0_63,negated_conjecture,
inner_point(esk17_0,esk1_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( end_point(X1,esk1_4(X2,X1,X3,X4))
| ~ between_c(X2,X1,X3,X4) ),
i_0_4 ).
cnf(c_0_65,plain,
( end_point(X1,esk1_4(X2,X3,X4,X1))
| ~ between_c(X2,X3,X4,X1) ),
i_0_3 ).
cnf(c_0_66,plain,
( part_of(esk1_4(X1,X2,X3,X4),X1)
| ~ between_c(X1,X2,X3,X4) ),
i_0_5 ).
cnf(c_0_67,negated_conjecture,
~ between_c(esk15_0,esk18_0,esk17_0,esk16_0),
i_0_50 ).
cnf(c_0_68,plain,
( X1 = X2
| between_c(X3,X1,esk17_0,X2)
| ~ end_point(X2,esk1_4(esk15_0,esk16_0,esk17_0,esk18_0))
| ~ end_point(X1,esk1_4(esk15_0,esk16_0,esk17_0,esk18_0))
| ~ part_of(esk1_4(esk15_0,esk16_0,esk17_0,esk18_0),X3) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
end_point(esk16_0,esk1_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_64,c_0_61]) ).
cnf(c_0_70,negated_conjecture,
end_point(esk18_0,esk1_4(esk15_0,esk16_0,esk17_0,esk18_0)),
inference(spm,[status(thm)],[c_0_65,c_0_61]) ).
cnf(c_0_71,negated_conjecture,
part_of(esk1_4(esk15_0,esk16_0,esk17_0,esk18_0),esk15_0),
inference(spm,[status(thm)],[c_0_66,c_0_61]) ).
cnf(c_0_72,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
i_0_6 ).
cnf(c_0_73,negated_conjecture,
esk18_0 = esk16_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_71])]) ).
cnf(c_0_74,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_73]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO112+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 23:31:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.72/2.60 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.72/2.60 # No SInE strategy applied
% 8.72/2.60 # Trying AutoSched0 for 150 seconds
% 8.72/2.60 # AutoSched0-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 8.72/2.60 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.72/2.60 #
% 8.72/2.60 # Preprocessing time : 0.023 s
% 8.72/2.60 # Presaturation interreduction done
% 8.72/2.60
% 8.72/2.60 # Proof found!
% 8.72/2.60 # SZS status Theorem
% 8.72/2.60 # SZS output start CNFRefutation
% See solution above
% 8.72/2.60 # Training examples: 0 positive, 0 negative
% 8.72/2.60
% 8.72/2.60 # -------------------------------------------------
% 8.72/2.60 # User time : 0.044 s
% 8.72/2.60 # System time : 0.002 s
% 8.72/2.60 # Total time : 0.046 s
% 8.72/2.60 # Maximum resident set size: 7124 pages
% 8.72/2.60
%------------------------------------------------------------------------------