TSTP Solution File: GEO173+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO173+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:31:51 EDT 2023
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 28 ~; 30 |; 9 &)
% ( 0 <=>; 8 =>; 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn; 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& distinct_lines(X4,line_connecting(X1,X2)) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CeVotiF2G3/E---3.1_2482.p',con) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.CeVotiF2G3/E---3.1_2482.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.CeVotiF2G3/E---3.1_2482.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.CeVotiF2G3/E---3.1_2482.p',cu1) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.CeVotiF2G3/E---3.1_2482.p',ci1) ).
fof(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.CeVotiF2G3/E---3.1_2482.p',ci2) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& distinct_lines(X4,line_connecting(X1,X2)) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X4) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_7,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_8,plain,
! [X14,X15,X16] :
( ~ distinct_points(X14,X15)
| distinct_points(X14,X16)
| distinct_points(X15,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
fof(c_0_9,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))
& ~ apart_point_and_line(esk1_0,esk3_0)
& ~ apart_point_and_line(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X31,X32,X33,X34] :
( ~ distinct_points(X31,X32)
| ~ distinct_lines(X33,X34)
| apart_point_and_line(X31,X33)
| apart_point_and_line(X31,X34)
| apart_point_and_line(X32,X33)
| apart_point_and_line(X32,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
fof(c_0_11,plain,
! [X11] : ~ distinct_points(X11,X11),
inference(variable_rename,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
cnf(c_0_15,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_10]) ).
cnf(c_0_16,negated_conjecture,
distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci2]) ).
fof(c_0_20,plain,
! [X23,X24] :
( ~ distinct_points(X23,X24)
| ~ apart_point_and_line(X23,line_connecting(X23,X24)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X2,esk3_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ apart_point_and_line(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_25,plain,
! [X25,X26] :
( ~ distinct_points(X25,X26)
| ~ apart_point_and_line(X26,line_connecting(X25,X26)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_26,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO173+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 07:03:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.CeVotiF2G3/E---3.1_2482.p
% 0.22/0.55 # Version: 3.1pre001
% 0.22/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2560 completed with status 0
% 0.22/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 # No SInE strategy applied
% 0.22/0.55 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.22/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.55 # Starting sh5l with 136s (1) cores
% 0.22/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2568 completed with status 0
% 0.22/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 # No SInE strategy applied
% 0.22/0.55 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.22/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.55 # Preprocessing time : 0.001 s
% 0.22/0.55 # Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Theorem
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 36
% 0.22/0.55 # Removed by relevancy pruning/SinE : 0
% 0.22/0.55 # Initial clauses : 51
% 0.22/0.55 # Removed in clause preprocessing : 0
% 0.22/0.55 # Initial clauses in saturation : 51
% 0.22/0.55 # Processed clauses : 294
% 0.22/0.55 # ...of these trivial : 0
% 0.22/0.55 # ...subsumed : 77
% 0.22/0.55 # ...remaining for further processing : 217
% 0.22/0.55 # Other redundant clauses eliminated : 0
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 2
% 0.22/0.55 # Backward-rewritten : 1
% 0.22/0.55 # Generated clauses : 1043
% 0.22/0.55 # ...of the previous two non-redundant : 897
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 0
% 0.22/0.55 # Paramodulations : 997
% 0.22/0.55 # Factorizations : 46
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 0
% 0.22/0.55 # Total rewrite steps : 144
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 167
% 0.22/0.55 # Positive orientable unit clauses : 16
% 0.22/0.55 # Positive unorientable unit clauses: 0
% 0.22/0.55 # Negative unit clauses : 9
% 0.22/0.55 # Non-unit-clauses : 142
% 0.22/0.55 # Current number of unprocessed clauses: 698
% 0.22/0.55 # ...number of literals in the above : 3276
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 50
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 6414
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 2054
% 0.22/0.55 # Non-unit clause-clause subsumptions : 61
% 0.22/0.55 # Unit Clause-clause subsumption calls : 93
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 1
% 0.22/0.55 # BW rewrite match successes : 1
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 17087
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.027 s
% 0.22/0.55 # System time : 0.005 s
% 0.22/0.55 # Total time : 0.032 s
% 0.22/0.55 # Maximum resident set size: 1852 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.121 s
% 0.22/0.55 # System time : 0.009 s
% 0.22/0.55 # Total time : 0.130 s
% 0.22/0.55 # Maximum resident set size: 1728 pages
% 0.22/0.55 % E---3.1 exiting
% 0.22/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------