TSTP Solution File: GEO221+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO221+1 : 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:35 EDT 2022
% Result : Theorem 8.46s 2.52s
% Output : CNFRefutation 8.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 9 unt; 4 nHn; 9 RR)
% Number of literals : 25 ( 0 equ; 8 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_27,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| unorthogonal_lines(X2,X4)
| unorthogonal_lines(X3,X4)
| ~ distinct_lines(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mx6ooq37/lgb.p',i_0_27) ).
cnf(i_0_14,negated_conjecture,
distinct_lines(orthogonal_through_point(esk3_0,esk1_0),orthogonal_through_point(esk3_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mx6ooq37/lgb.p',i_0_14) ).
cnf(i_0_25,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mx6ooq37/lgb.p',i_0_25) ).
cnf(i_0_26,plain,
~ apart_point_and_line(X1,orthogonal_through_point(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mx6ooq37/lgb.p',i_0_26) ).
cnf(i_0_15,negated_conjecture,
~ apart_point_and_line(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mx6ooq37/lgb.p',i_0_15) ).
cnf(c_0_33,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| unorthogonal_lines(X2,X4)
| unorthogonal_lines(X3,X4)
| ~ distinct_lines(X3,X2) ),
i_0_27 ).
cnf(c_0_34,negated_conjecture,
distinct_lines(orthogonal_through_point(esk3_0,esk1_0),orthogonal_through_point(esk3_0,esk2_0)),
i_0_14 ).
cnf(c_0_35,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
i_0_25 ).
cnf(c_0_36,negated_conjecture,
( unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1)
| unorthogonal_lines(orthogonal_through_point(esk3_0,esk2_0),X1)
| apart_point_and_line(X2,orthogonal_through_point(esk3_0,esk1_0))
| apart_point_and_line(X2,orthogonal_through_point(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
~ apart_point_and_line(X1,orthogonal_through_point(X2,X1)),
i_0_26 ).
cnf(c_0_38,plain,
( apart_point_and_line(X1,orthogonal_through_point(esk3_0,esk2_0))
| apart_point_and_line(X1,orthogonal_through_point(esk3_0,esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ apart_point_and_line(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
i_0_15 ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO221+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 16:24:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.46/2.52 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.46/2.52 # No SInE strategy applied
% 8.46/2.52 # Trying AutoSched0 for 150 seconds
% 8.46/2.52 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 8.46/2.52 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.46/2.52 #
% 8.46/2.52 # Preprocessing time : 0.014 s
% 8.46/2.52
% 8.46/2.52 # Proof found!
% 8.46/2.52 # SZS status Theorem
% 8.46/2.52 # SZS output start CNFRefutation
% See solution above
% 8.46/2.52 # Training examples: 0 positive, 0 negative
% 8.46/2.52
% 8.46/2.52 # -------------------------------------------------
% 8.46/2.52 # User time : 0.014 s
% 8.46/2.52 # System time : 0.005 s
% 8.46/2.52 # Total time : 0.020 s
% 8.46/2.52 # Maximum resident set size: 7124 pages
% 8.46/2.52
%------------------------------------------------------------------------------