TSTP Solution File: GEO196+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO196+3 : TPTP v8.1.0. Released v4.0.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:15 EDT 2022
% Result : Theorem 8.28s 2.40s
% Output : CNFRefutation 8.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 71 ( 29 ~; 23 |; 13 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 9 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( convergent_lines(X1,X2)
& convergent_lines(X4,X5)
& incident_point_and_line(intersection_point(X1,X2),X4)
& incident_point_and_line(intersection_point(X1,X2),X5) )
=> ( incident_point_and_line(intersection_point(X4,X5),X1)
& incident_point_and_line(intersection_point(X4,X5),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a4) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_8,plain,
! [X48,X49] : ~ apart_point_and_line(X48,parallel_through_point(X49,X48)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp2])]) ).
fof(c_0_9,plain,
! [X38,X39,X40] :
( ~ apart_point_and_line(X38,X39)
| distinct_lines(X39,X40)
| apart_point_and_line(X38,X40) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( convergent_lines(X1,X2)
& convergent_lines(X4,X5)
& incident_point_and_line(intersection_point(X1,X2),X4)
& incident_point_and_line(intersection_point(X1,X2),X5) )
=> ( incident_point_and_line(intersection_point(X4,X5),X1)
& incident_point_and_line(intersection_point(X4,X5),X2) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_11,plain,
! [X46,X47] : ~ convergent_lines(parallel_through_point(X47,X46),X47),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[cp1])]) ).
fof(c_0_12,plain,
! [X20,X21,X22] :
( ~ convergent_lines(X20,X21)
| convergent_lines(X20,X22)
| convergent_lines(X21,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).
fof(c_0_13,plain,
! [X44,X45] :
( ~ distinct_lines(X44,X45)
| convergent_lines(X44,X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).
cnf(c_0_14,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& incident_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
& incident_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)
& ( ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
| ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_17,plain,
! [X88,X89] :
( ( ~ incident_point_and_line(X88,X89)
| ~ apart_point_and_line(X88,X89) )
& ( apart_point_and_line(X88,X89)
| incident_point_and_line(X88,X89) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a4])])]) ).
cnf(c_0_18,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( distinct_lines(X1,parallel_through_point(X2,X3))
| ~ apart_point_and_line(X3,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
| ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( apart_point_and_line(X1,X2)
| incident_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).
cnf(c_0_25,plain,
( convergent_lines(X1,X2)
| ~ convergent_lines(X1,parallel_through_point(X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( convergent_lines(X1,parallel_through_point(X2,X3))
| ~ apart_point_and_line(X3,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
| ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( convergent_lines(X1,X2)
| ~ apart_point_and_line(X3,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_31,plain,
~ apart_point_and_line(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_30,c_0_31]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO196+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 18 10:17:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.28/2.40 # ENIGMATIC: Solved by autoschedule:
% 8.28/2.40 # No SInE strategy applied
% 8.28/2.40 # Trying AutoSched0 for 150 seconds
% 8.28/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02DN
% 8.28/2.40 # and selection function PSelectAntiRROptimalLit.
% 8.28/2.40 #
% 8.28/2.40 # Preprocessing time : 0.014 s
% 8.28/2.40 # Presaturation interreduction done
% 8.28/2.40
% 8.28/2.40 # Proof found!
% 8.28/2.40 # SZS status Theorem
% 8.28/2.40 # SZS output start CNFRefutation
% See solution above
% 8.28/2.40 # Training examples: 0 positive, 0 negative
% 8.28/2.40
% 8.28/2.40 # -------------------------------------------------
% 8.28/2.40 # User time : 0.028 s
% 8.28/2.40 # System time : 0.004 s
% 8.28/2.40 # Total time : 0.032 s
% 8.28/2.40 # Maximum resident set size: 7120 pages
% 8.28/2.40
%------------------------------------------------------------------------------