TSTP Solution File: GEO011-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO011-1 : TPTP v8.1.2. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:41:06 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 44 ( 22 unt; 8 nHn; 38 RR)
% Number of literals : 81 ( 17 equ; 36 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-5 aty)
% Number of variables : 82 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity_for_betweeness,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',identity_for_betweeness) ).
cnf(outer_pasch1,axiom,
( between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',outer_pasch1) ).
cnf(colinearity1,axiom,
( between(X1,X2,X3)
| between(X2,X1,X3)
| between(X1,X3,X2)
| ~ colinear(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',colinearity1) ).
cnf(lower_dimension1,axiom,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',lower_dimension1) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',identity_for_equidistance) ).
cnf(prove_lower_dimension_points_not_colinear,negated_conjecture,
colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',prove_lower_dimension_points_not_colinear) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',segment_construction2) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',segment_construction1) ).
cnf(outer_pasch2,axiom,
( between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',outer_pasch2) ).
cnf(lower_dimension2,axiom,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',lower_dimension2) ).
cnf(lower_dimension3,axiom,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
file('/export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p',lower_dimension3) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ between(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[identity_for_betweeness]) ).
cnf(c_0_12,plain,
( between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
inference(fof_simplification,[status(thm)],[outer_pasch1]) ).
cnf(c_0_13,plain,
( between(X1,X2,X3)
| between(X2,X1,X3)
| between(X1,X3,X2)
| ~ colinear(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[colinearity1]) ).
cnf(c_0_14,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(fof_simplification,[status(thm)],[lower_dimension1]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ between(X1,X2,X1) ),
c_0_11 ).
cnf(c_0_17,plain,
( between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
c_0_12 ).
cnf(c_0_18,plain,
( between(X1,X2,X3)
| between(X2,X1,X3)
| between(X1,X3,X2)
| ~ colinear(X1,X2,X3) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
prove_lower_dimension_points_not_colinear ).
cnf(c_0_20,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
c_0_14 ).
cnf(c_0_21,plain,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
c_0_15 ).
cnf(c_0_22,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_23,plain,
( outer_pasch(X1,X2,X2,X3,X4) = X2
| ~ between(X2,X4,X3)
| ~ between(X2,X1,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( between(lower_dimension_point_2,lower_dimension_point_1,lower_dimension_point_3)
| between(lower_dimension_point_1,lower_dimension_point_3,lower_dimension_point_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_26,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( outer_pasch(X1,lower_dimension_point_2,lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) = lower_dimension_point_2
| between(lower_dimension_point_1,lower_dimension_point_3,lower_dimension_point_2)
| ~ between(lower_dimension_point_2,X1,lower_dimension_point_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( outer_pasch(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) = lower_dimension_point_2
| between(lower_dimension_point_1,lower_dimension_point_3,lower_dimension_point_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
inference(fof_simplification,[status(thm)],[outer_pasch2]) ).
cnf(c_0_31,negated_conjecture,
( outer_pasch(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) = lower_dimension_point_2
| outer_pasch(X1,lower_dimension_point_1,lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) = lower_dimension_point_1
| ~ between(lower_dimension_point_1,X1,lower_dimension_point_3) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_32,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
inference(fof_simplification,[status(thm)],[lower_dimension2]) ).
cnf(c_0_33,plain,
( between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))
| ~ between(X1,X2,X3)
| ~ between(X4,X3,X5) ),
c_0_30 ).
cnf(c_0_34,negated_conjecture,
( outer_pasch(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) = lower_dimension_point_1
| outer_pasch(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) = lower_dimension_point_2 ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_35,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
c_0_32 ).
cnf(c_0_36,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
inference(fof_simplification,[status(thm)],[lower_dimension3]) ).
cnf(c_0_37,negated_conjecture,
outer_pasch(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) = lower_dimension_point_2,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28])]),c_0_35]),c_0_29]) ).
cnf(c_0_38,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
~ between(lower_dimension_point_2,lower_dimension_point_1,lower_dimension_point_3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_37]),c_0_28])]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
between(lower_dimension_point_1,lower_dimension_point_3,lower_dimension_point_2),
inference(sr,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
( outer_pasch(X1,lower_dimension_point_1,lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) = lower_dimension_point_1
| ~ between(lower_dimension_point_1,X1,lower_dimension_point_3) ),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
outer_pasch(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) = lower_dimension_point_1,
inference(spm,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_42]),c_0_40]),c_0_28])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO011-1 : TPTP v8.1.2. Bugfixed v2.5.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.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 : Fri May 3 18:51:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.RJWcaGWbpy/E---3.1_7895.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7973 completed with status 0
% 0.20/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.48 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.20/0.48 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.20/0.48 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 7977 completed with status 0
% 0.20/0.48 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 25
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 25
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 25
% 0.20/0.48 # Processed clauses : 55
% 0.20/0.48 # ...of these trivial : 1
% 0.20/0.48 # ...subsumed : 3
% 0.20/0.48 # ...remaining for further processing : 51
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 8
% 0.20/0.48 # Generated clauses : 116
% 0.20/0.48 # ...of the previous two non-redundant : 92
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 1
% 0.20/0.48 # Paramodulations : 115
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 32
% 0.20/0.48 # ...of those cached : 17
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 42
% 0.20/0.48 # Positive orientable unit clauses : 12
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 4
% 0.20/0.48 # Non-unit-clauses : 26
% 0.20/0.48 # Current number of unprocessed clauses: 53
% 0.20/0.48 # ...number of literals in the above : 257
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 9
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 271
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 148
% 0.20/0.48 # Non-unit clause-clause subsumptions : 4
% 0.20/0.48 # Unit Clause-clause subsumption calls : 46
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 118
% 0.20/0.48 # BW rewrite match successes : 2
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 2342
% 0.20/0.48 # Search garbage collected termcells : 82
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.006 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.008 s
% 0.20/0.48 # Maximum resident set size: 1668 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.030 s
% 0.20/0.48 # System time : 0.009 s
% 0.20/0.48 # Total time : 0.038 s
% 0.20/0.48 # Maximum resident set size: 1712 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------