TSTP Solution File: GEO197+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO197+3 : TPTP v8.1.0. Released v4.0.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:16 EDT 2022
% Result : Theorem 7.79s 2.42s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 13 unt; 8 nHn; 12 RR)
% Number of literals : 37 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
~ incident_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2ikalqn/lgb.p',i_0_26) ).
cnf(i_0_3,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2ikalqn/lgb.p',i_0_3) ).
cnf(i_0_18,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2ikalqn/lgb.p',i_0_18) ).
cnf(i_0_37,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2ikalqn/lgb.p',i_0_37) ).
cnf(i_0_50,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2ikalqn/lgb.p',i_0_50) ).
cnf(i_0_16,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2ikalqn/lgb.p',i_0_16) ).
cnf(i_0_36,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2ikalqn/lgb.p',i_0_36) ).
cnf(i_0_9,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2ikalqn/lgb.p',i_0_9) ).
cnf(c_0_59,negated_conjecture,
~ incident_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
i_0_26 ).
cnf(c_0_60,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
i_0_3 ).
cnf(c_0_61,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
i_0_18 ).
cnf(c_0_62,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
i_0_37 ).
cnf(c_0_64,plain,
( distinct_lines(esk1_0,X1)
| apart_point_and_line(intersection_point(esk3_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
i_0_50 ).
cnf(c_0_66,plain,
distinct_lines(esk1_0,parallel_through_point(X1,intersection_point(esk3_0,esk2_0))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_16 ).
cnf(c_0_68,plain,
convergent_lines(esk1_0,parallel_through_point(X1,intersection_point(esk3_0,esk2_0))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
i_0_36 ).
cnf(c_0_70,plain,
( convergent_lines(parallel_through_point(X1,intersection_point(esk3_0,esk2_0)),X2)
| convergent_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,plain,
~ convergent_lines(X1,X1),
i_0_9 ).
cnf(c_0_72,plain,
convergent_lines(esk1_0,X1),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
$false,
inference(spm,[status(thm)],[c_0_71,c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO197+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n020.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 17:19:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected SinE mode:
% 0.21/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.79/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.79/2.42 # No SInE strategy applied
% 7.79/2.42 # Trying AutoSched0 for 150 seconds
% 7.79/2.42 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_S5PRR_SE_Q4_CS_SP_S4S
% 7.79/2.42 # and selection function SelectNewComplexAHPNS.
% 7.79/2.42 #
% 7.79/2.42 # Preprocessing time : 0.023 s
% 7.79/2.42
% 7.79/2.42 # Proof found!
% 7.79/2.42 # SZS status Theorem
% 7.79/2.42 # SZS output start CNFRefutation
% See solution above
% 7.79/2.42 # Training examples: 0 positive, 0 negative
% 7.79/2.42
% 7.79/2.42 # -------------------------------------------------
% 7.79/2.42 # User time : 0.029 s
% 7.79/2.42 # System time : 0.006 s
% 7.79/2.42 # Total time : 0.035 s
% 7.79/2.42 # Maximum resident set size: 7124 pages
% 7.79/2.42
%------------------------------------------------------------------------------