TSTP Solution File: GEO225+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO225+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 21 ~; 20 |; 12 &)
% ( 0 <=>; 7 =>; 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 : 38 ( 0 sgn; 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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.iED9hLbT31/E---3.1_4422.p',con) ).
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/sandbox/tmp/tmp.iED9hLbT31/E---3.1_4422.p',con1) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.iED9hLbT31/E---3.1_4422.p',apart1) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.iED9hLbT31/E---3.1_4422.p',apart4) ).
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,
! [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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con1])])]) ).
fof(c_0_6,negated_conjecture,
! [X50] :
( point(esk1_0)
& point(esk2_0)
& distinct_points(esk1_0,esk2_0)
& line(X50)
& ( apart_point_and_line(esk1_0,X50)
| apart_point_and_line(esk2_0,X50) ) ),
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_7,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_8,plain,
! [X13,X14,X15] :
( ~ distinct_points(X13,X14)
| distinct_points(X13,X15)
| distinct_points(X14,X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
cnf(c_0_9,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_5]) ).
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_6]) ).
fof(c_0_11,plain,
! [X10] : ~ distinct_points(X10,X10),
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_6]) ).
cnf(c_0_14,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_5]) ).
cnf(c_0_15,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(X1,X2))
| distinct_points(esk1_0,X2)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X2)
| ~ distinct_points(X2,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO225+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n008.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 : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 06:23:43 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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.iED9hLbT31/E---3.1_4422.p
% 0.19/0.47 # Version: 3.1pre001
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4500 completed with status 0
% 0.19/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: FGUNF-FFSS22-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.47 # Starting sh5l with 136s (1) cores
% 0.19/0.47 # SAT001_MinMin_p005000_rr_RG with pid 4506 completed with status 0
% 0.19/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: FGUNF-FFSS22-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 17
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 23
% 0.19/0.47 # Removed in clause preprocessing : 4
% 0.19/0.47 # Initial clauses in saturation : 19
% 0.19/0.47 # Processed clauses : 41
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 1
% 0.19/0.47 # ...remaining for further processing : 40
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 1
% 0.19/0.47 # Backward-rewritten : 0
% 0.19/0.47 # Generated clauses : 21
% 0.19/0.47 # ...of the previous two non-redundant : 18
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 21
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Total rewrite steps : 2
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 20
% 0.19/0.47 # Positive orientable unit clauses : 4
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 3
% 0.19/0.47 # Non-unit-clauses : 13
% 0.19/0.47 # Current number of unprocessed clauses: 14
% 0.19/0.47 # ...number of literals in the above : 51
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 21
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 23
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 22
% 0.19/0.47 # Non-unit clause-clause subsumptions : 1
% 0.19/0.47 # Unit Clause-clause subsumption calls : 3
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 0
% 0.19/0.47 # BW rewrite match successes : 0
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 1702
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.006 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.008 s
% 0.19/0.47 # Maximum resident set size: 1780 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.017 s
% 0.19/0.47 # System time : 0.011 s
% 0.19/0.47 # Total time : 0.027 s
% 0.19/0.47 # Maximum resident set size: 1696 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------