TSTP Solution File: GEO201+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO201+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:32:04 EDT 2023
% Result : Theorem 2.37s 0.76s
% Output : CNFRefutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 21 unt; 0 def)
% Number of atoms : 128 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 111 ( 42 ~; 54 |; 3 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 96 ( 3 sgn; 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2] :
( convergent_lines(X1,X2)
=> equal_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',con) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',apart3) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',cp1) ).
fof(ax1,axiom,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',ax1) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',ceq3) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',apart1) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',apart4) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',cu1) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',ci3) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p',ci4) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2] :
( convergent_lines(X1,X2)
=> equal_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_12,plain,
! [X22,X23,X24] :
( ~ convergent_lines(X22,X23)
| convergent_lines(X22,X24)
| convergent_lines(X23,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).
fof(c_0_13,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& ~ equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_14,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_15,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X21] : ~ convergent_lines(X21,X21),
inference(variable_rename,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
fof(c_0_21,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
cnf(c_0_22,negated_conjecture,
( convergent_lines(X1,esk1_0)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X84,X85] : ~ convergent_lines(parallel_through_point(X85,X84),X85),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( convergent_lines(X1,esk1_0)
| convergent_lines(esk2_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
fof(c_0_25,plain,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_26,plain,
! [X25,X26,X27] :
( ~ convergent_lines(X25,X26)
| distinct_lines(X26,X27)
| convergent_lines(X25,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
cnf(c_0_27,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
fof(c_0_29,plain,
! [X13,X14] :
( ( ~ equal_points(X13,X14)
| ~ distinct_points(X13,X14) )
& ( distinct_points(X13,X14)
| equal_points(X13,X14) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])]) ).
cnf(c_0_30,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
convergent_lines(parallel_through_point(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_33,plain,
! [X47,X48,X49] :
( ~ distinct_points(X47,X48)
| distinct_points(X47,X49)
| distinct_points(X48,X49) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
cnf(c_0_34,negated_conjecture,
~ equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,plain,
( distinct_points(X1,X2)
| equal_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_36,plain,
! [X54,X55,X56,X57] :
( ~ distinct_points(X54,X55)
| ~ distinct_lines(X56,X57)
| apart_point_and_line(X54,X56)
| apart_point_and_line(X54,X57)
| apart_point_and_line(X55,X56)
| apart_point_and_line(X55,X57) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_37,negated_conjecture,
( convergent_lines(parallel_through_point(esk1_0,X1),X2)
| distinct_lines(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_38,plain,
! [X46] : ~ distinct_points(X46,X46),
inference(variable_rename,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_41,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
cnf(c_0_42,plain,
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X2,X4)
| ~ distinct_points(X1,X2)
| ~ distinct_lines(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
distinct_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_44,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),X1)
| distinct_points(intersection_point(esk2_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_46,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
fof(c_0_47,plain,
! [X15,X16] :
( ~ convergent_lines(X15,X16)
| ~ apart_point_and_line(intersection_point(X15,X16),X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])]) ).
cnf(c_0_48,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X2,esk1_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
distinct_points(intersection_point(esk2_0,esk1_0),intersection_point(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_50,plain,
! [X17,X18] :
( ~ convergent_lines(X17,X18)
| ~ apart_point_and_line(intersection_point(X17,X18),X18) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])]) ).
cnf(c_0_51,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_16])]) ).
cnf(c_0_55,negated_conjecture,
( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_16])]) ).
cnf(c_0_56,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_57,negated_conjecture,
apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_55]),c_0_56])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_57]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO201+3 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 06:19:25 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.LKFF7vQFay/E---3.1_21089.p
% 2.37/0.76 # Version: 3.1pre001
% 2.37/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.37/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.37/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.37/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.37/0.76 # Starting sh5l with 300s (1) cores
% 2.37/0.76 # sh5l with pid 21206 completed with status 0
% 2.37/0.76 # Result found by sh5l
% 2.37/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.37/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.37/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.37/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.37/0.76 # Starting sh5l with 300s (1) cores
% 2.37/0.76 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.37/0.76 # Search class: FGHNF-FFMF22-SFFFFFNN
% 2.37/0.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.37/0.76 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 2.37/0.76 # SAT001_CO_MinMin_p005000_rr with pid 21215 completed with status 0
% 2.37/0.76 # Result found by SAT001_CO_MinMin_p005000_rr
% 2.37/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.37/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.37/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.37/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.37/0.76 # Starting sh5l with 300s (1) cores
% 2.37/0.76 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.37/0.76 # Search class: FGHNF-FFMF22-SFFFFFNN
% 2.37/0.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.37/0.76 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 2.37/0.76 # Preprocessing time : 0.002 s
% 2.37/0.76 # Presaturation interreduction done
% 2.37/0.76
% 2.37/0.76 # Proof found!
% 2.37/0.76 # SZS status Theorem
% 2.37/0.76 # SZS output start CNFRefutation
% See solution above
% 2.37/0.76 # Parsed axioms : 36
% 2.37/0.76 # Removed by relevancy pruning/SinE : 4
% 2.37/0.76 # Initial clauses : 40
% 2.37/0.76 # Removed in clause preprocessing : 0
% 2.37/0.76 # Initial clauses in saturation : 40
% 2.37/0.76 # Processed clauses : 1501
% 2.37/0.76 # ...of these trivial : 31
% 2.37/0.76 # ...subsumed : 858
% 2.37/0.76 # ...remaining for further processing : 612
% 2.37/0.76 # Other redundant clauses eliminated : 0
% 2.37/0.76 # Clauses deleted for lack of memory : 0
% 2.37/0.76 # Backward-subsumed : 16
% 2.37/0.76 # Backward-rewritten : 109
% 2.37/0.76 # Generated clauses : 18259
% 2.37/0.76 # ...of the previous two non-redundant : 15171
% 2.37/0.76 # ...aggressively subsumed : 0
% 2.37/0.76 # Contextual simplify-reflections : 28
% 2.37/0.76 # Paramodulations : 17931
% 2.37/0.76 # Factorizations : 328
% 2.37/0.76 # NegExts : 0
% 2.37/0.76 # Equation resolutions : 0
% 2.37/0.76 # Total rewrite steps : 3442
% 2.37/0.76 # Propositional unsat checks : 0
% 2.37/0.76 # Propositional check models : 0
% 2.37/0.76 # Propositional check unsatisfiable : 0
% 2.37/0.76 # Propositional clauses : 0
% 2.37/0.76 # Propositional clauses after purity: 0
% 2.37/0.76 # Propositional unsat core size : 0
% 2.37/0.76 # Propositional preprocessing time : 0.000
% 2.37/0.76 # Propositional encoding time : 0.000
% 2.37/0.76 # Propositional solver time : 0.000
% 2.37/0.76 # Success case prop preproc time : 0.000
% 2.37/0.76 # Success case prop encoding time : 0.000
% 2.37/0.76 # Success case prop solver time : 0.000
% 2.37/0.76 # Current number of processed clauses : 451
% 2.37/0.76 # Positive orientable unit clauses : 41
% 2.37/0.76 # Positive unorientable unit clauses: 0
% 2.37/0.76 # Negative unit clauses : 8
% 2.37/0.76 # Non-unit-clauses : 402
% 2.37/0.76 # Current number of unprocessed clauses: 13589
% 2.37/0.76 # ...number of literals in the above : 72930
% 2.37/0.76 # Current number of archived formulas : 0
% 2.37/0.76 # Current number of archived clauses : 161
% 2.37/0.76 # Clause-clause subsumption calls (NU) : 94954
% 2.37/0.76 # Rec. Clause-clause subsumption calls : 18165
% 2.37/0.76 # Non-unit clause-clause subsumptions : 865
% 2.37/0.76 # Unit Clause-clause subsumption calls : 2952
% 2.37/0.76 # Rewrite failures with RHS unbound : 0
% 2.37/0.76 # BW rewrite match attempts : 94
% 2.37/0.76 # BW rewrite match successes : 6
% 2.37/0.76 # Condensation attempts : 1501
% 2.37/0.76 # Condensation successes : 56
% 2.37/0.76 # Termbank termtop insertions : 281550
% 2.37/0.76
% 2.37/0.76 # -------------------------------------------------
% 2.37/0.76 # User time : 0.242 s
% 2.37/0.76 # System time : 0.012 s
% 2.37/0.76 # Total time : 0.254 s
% 2.37/0.76 # Maximum resident set size: 1892 pages
% 2.37/0.76
% 2.37/0.76 # -------------------------------------------------
% 2.37/0.76 # User time : 0.244 s
% 2.37/0.76 # System time : 0.014 s
% 2.37/0.76 # Total time : 0.258 s
% 2.37/0.76 # Maximum resident set size: 1732 pages
% 2.37/0.76 % E---3.1 exiting
% 2.37/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------