TSTP Solution File: GEO225+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO225+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Mon May 20 19:58:45 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 2 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 43 ( 18 ~; 7 |; 10 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci1) ).
fof(con,conjecture,
! [X6,X7] :
( ( point(X6)
& point(X7)
& distinct_points(X6,X7) )
=> ? [X1] :
( line(X1)
=> ( ~ apart_point_and_line(X6,X1)
& ~ apart_point_and_line(X7,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci2) ).
fof(c_0_3,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X7] :
( ( point(X6)
& point(X7)
& distinct_points(X6,X7) )
=> ? [X1] :
( line(X1)
=> ( ~ apart_point_and_line(X6,X1)
& ~ apart_point_and_line(X7,X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_5,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_6,plain,
! [X22,X23] :
( ~ distinct_points(X22,X23)
| ~ apart_point_and_line(X22,line_connecting(X22,X23)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_7,negated_conjecture,
! [X53] :
( point(esk1_0)
& point(esk2_0)
& distinct_points(esk1_0,esk2_0)
& line(X53)
& ( apart_point_and_line(esk1_0,X53)
| apart_point_and_line(esk2_0,X53) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_8,plain,
! [X24,X25] :
( ~ distinct_points(X24,X25)
| ~ apart_point_and_line(X25,line_connecting(X24,X25)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,X1))
| ~ distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO225+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.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 : 300
% 0.13/0.34 % DateTime : Sun May 19 14:24:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4305 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # Starting sh5l with 136s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 4311 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 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (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 : 19
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 23
% 0.20/0.49 # Removed in clause preprocessing : 4
% 0.20/0.49 # Initial clauses in saturation : 19
% 0.20/0.49 # Processed clauses : 34
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 34
% 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 : 0
% 0.20/0.49 # Generated clauses : 4
% 0.20/0.49 # ...of the previous two non-redundant : 3
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 4
% 0.20/0.49 # Factorizations : 0
% 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 : 1
% 0.20/0.49 # ...of those cached : 0
% 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 : 15
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 4
% 0.20/0.49 # Non-unit-clauses : 8
% 0.20/0.49 # Current number of unprocessed clauses: 7
% 0.20/0.49 # ...number of literals in the above : 24
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 20
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 14
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 14
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 4
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1702
% 0.20/0.49 # Search garbage collected termcells : 303
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1764 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.011 s
% 0.20/0.49 # System time : 0.008 s
% 0.20/0.49 # Total time : 0.020 s
% 0.20/0.49 # Maximum resident set size: 1716 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------