TSTP Solution File: GEO225+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO225+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:15 EDT 2023
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% 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(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.KB972PZFXq/E---3.1_22201.p',ci2) ).
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/tmp/tmp.KB972PZFXq/E---3.1_22201.p',con) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.KB972PZFXq/E---3.1_22201.p',ci1) ).
fof(c_0_3,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_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(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
fof(c_0_6,plain,
! [X15,X16] :
( ~ distinct_points(X15,X16)
| ~ apart_point_and_line(X16,line_connecting(X15,X16)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_7,negated_conjecture,
! [X12] :
( point(esk1_0)
& point(esk2_0)
& distinct_points(esk1_0,esk2_0)
& line(X12)
& ( apart_point_and_line(esk1_0,X12)
| apart_point_and_line(esk2_0,X12) ) ),
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,
! [X13,X14] :
( ~ distinct_points(X13,X14)
| ~ apart_point_and_line(X13,line_connecting(X13,X14)) ),
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(X2,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(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( apart_point_and_line(esk1_0,line_connecting(X1,esk2_0))
| ~ distinct_points(X1,esk2_0) ),
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.00/0.11 % Problem : GEO225+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n005.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Oct 3 06:36:01 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/tmp/tmp.KB972PZFXq/E---3.1_22201.p
% 0.17/0.44 # Version: 3.1pre001
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # sh5l with pid 22283 completed with status 0
% 0.17/0.44 # Result found by sh5l
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.44 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # SAT001_MinMin_p005000_rr_RG with pid 22290 completed with status 0
% 0.17/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.44 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 19
% 0.17/0.44 # Removed by relevancy pruning/SinE : 0
% 0.17/0.44 # Initial clauses : 23
% 0.17/0.44 # Removed in clause preprocessing : 0
% 0.17/0.44 # Initial clauses in saturation : 23
% 0.17/0.44 # Processed clauses : 34
% 0.17/0.44 # ...of these trivial : 3
% 0.17/0.44 # ...subsumed : 0
% 0.17/0.44 # ...remaining for further processing : 31
% 0.17/0.44 # Other redundant clauses eliminated : 0
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 0
% 0.17/0.44 # Backward-rewritten : 0
% 0.17/0.44 # Generated clauses : 3
% 0.17/0.44 # ...of the previous two non-redundant : 2
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 0
% 0.17/0.44 # Paramodulations : 3
% 0.17/0.44 # Factorizations : 0
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 0
% 0.17/0.44 # Total rewrite steps : 8
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 11
% 0.17/0.44 # Positive orientable unit clauses : 4
% 0.17/0.44 # Positive unorientable unit clauses: 0
% 0.17/0.44 # Negative unit clauses : 3
% 0.17/0.44 # Non-unit-clauses : 4
% 0.17/0.44 # Current number of unprocessed clauses: 11
% 0.17/0.44 # ...number of literals in the above : 32
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 20
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 18
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 10
% 0.17/0.44 # Non-unit clause-clause subsumptions : 0
% 0.17/0.44 # Unit Clause-clause subsumption calls : 2
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 0
% 0.17/0.44 # BW rewrite match successes : 0
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 1482
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.003 s
% 0.17/0.44 # System time : 0.002 s
% 0.17/0.44 # Total time : 0.005 s
% 0.17/0.44 # Maximum resident set size: 1696 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.004 s
% 0.17/0.44 # System time : 0.004 s
% 0.17/0.44 # Total time : 0.008 s
% 0.17/0.44 # Maximum resident set size: 1696 pages
% 0.17/0.44 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------