TSTP Solution File: GEO170+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO170+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : 300s
% DateTime : Sat May 4 07:44:41 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 78 ( 30 ~; 32 |; 10 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 46 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& ~ apart_point_and_line(X1,X3)
& ~ apart_point_and_line(X2,X3) )
=> ~ distinct_lines(X3,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.TlA7tXHCOd/E---3.1_18119.p',con) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.TlA7tXHCOd/E---3.1_18119.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.TlA7tXHCOd/E---3.1_18119.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.TlA7tXHCOd/E---3.1_18119.p',cu1) ).
fof(con1,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( apart_point_and_line(X3,line_connecting(X1,X2))
=> ( distinct_points(X3,X1)
& distinct_points(X3,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TlA7tXHCOd/E---3.1_18119.p',con1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& ~ apart_point_and_line(X1,X3)
& ~ apart_point_and_line(X2,X3) )
=> ~ distinct_lines(X3,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_6,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_7,plain,
! [X29,X30,X31] :
( ~ distinct_points(X29,X30)
| distinct_points(X29,X31)
| distinct_points(X30,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])])]) ).
fof(c_0_8,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& ~ apart_point_and_line(esk1_0,esk3_0)
& ~ apart_point_and_line(esk2_0,esk3_0)
& distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X13,X14,X15,X16] :
( ~ distinct_points(X13,X14)
| ~ distinct_lines(X15,X16)
| apart_point_and_line(X13,X15)
| apart_point_and_line(X13,X16)
| apart_point_and_line(X14,X15)
| apart_point_and_line(X14,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
fof(c_0_10,plain,
! [X28] : ~ distinct_points(X28,X28),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
cnf(c_0_11,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,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_9]) ).
cnf(c_0_14,negated_conjecture,
distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_17,plain,
! [X22,X23,X24] :
( ( distinct_points(X24,X22)
| ~ apart_point_and_line(X24,line_connecting(X22,X23))
| ~ distinct_points(X22,X23) )
& ( distinct_points(X24,X23)
| ~ apart_point_and_line(X24,line_connecting(X22,X23))
| ~ distinct_points(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con1])])])]) ).
cnf(c_0_18,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_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ apart_point_and_line(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X2,X3))
| ~ distinct_points(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,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_18,c_0_19]),c_0_20]),c_0_21]) ).
cnf(c_0_24,plain,
( distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2))
| ~ distinct_points(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12])]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_12])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO170+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 18:26:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.TlA7tXHCOd/E---3.1_18119.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 18200 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 18207 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 13
% 0.20/0.49 # Removed by relevancy pruning/SinE : 1
% 0.20/0.49 # Initial clauses : 16
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 16
% 0.20/0.49 # Processed clauses : 96
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 44
% 0.20/0.49 # ...remaining for further processing : 52
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 185
% 0.20/0.49 # ...of the previous two non-redundant : 147
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 131
% 0.20/0.49 # Factorizations : 54
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 40
% 0.20/0.49 # ...of those cached : 36
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 35
% 0.20/0.49 # Positive orientable unit clauses : 4
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 5
% 0.20/0.49 # Non-unit-clauses : 26
% 0.20/0.49 # Current number of unprocessed clauses: 81
% 0.20/0.49 # ...number of literals in the above : 403
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 17
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 389
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 211
% 0.20/0.49 # Non-unit clause-clause subsumptions : 44
% 0.20/0.49 # Unit Clause-clause subsumption calls : 5
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3172
% 0.20/0.49 # Search garbage collected termcells : 200
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1756 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.008 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.012 s
% 0.20/0.49 # Maximum resident set size: 1708 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------