TSTP Solution File: GEO011-4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO011-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:07 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 12 unt; 3 nHn; 15 RR)
% Number of literals : 24 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(colinearity4,axiom,
( between(X1,X2,X3)
| between(X2,X3,X1)
| between(X3,X1,X2)
| ~ colinear(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.NziJcUf9kV/E---3.1_18514.p',colinearity4) ).
cnf(lower_dimension3,axiom,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
file('/export/starexec/sandbox2/tmp/tmp.NziJcUf9kV/E---3.1_18514.p',lower_dimension3) ).
cnf(lower_dimension2,axiom,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
file('/export/starexec/sandbox2/tmp/tmp.NziJcUf9kV/E---3.1_18514.p',lower_dimension2) ).
cnf(lower_dimension1,axiom,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file('/export/starexec/sandbox2/tmp/tmp.NziJcUf9kV/E---3.1_18514.p',lower_dimension1) ).
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.NziJcUf9kV/E---3.1_18514.p',prove_lower_dimension_points_not_colinear) ).
cnf(c_0_5,plain,
( between(X1,X2,X3)
| between(X2,X3,X1)
| between(X3,X1,X2)
| ~ colinear(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[colinearity4]) ).
cnf(c_0_6,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
inference(fof_simplification,[status(thm)],[lower_dimension3]) ).
cnf(c_0_7,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
inference(fof_simplification,[status(thm)],[lower_dimension2]) ).
cnf(c_0_8,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(fof_simplification,[status(thm)],[lower_dimension1]) ).
cnf(c_0_9,plain,
( between(X1,X2,X3)
| between(X2,X3,X1)
| between(X3,X1,X2)
| ~ colinear(X1,X2,X3) ),
c_0_5 ).
cnf(c_0_10,negated_conjecture,
colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
prove_lower_dimension_points_not_colinear ).
cnf(c_0_11,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
c_0_6 ).
cnf(c_0_12,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
c_0_7 ).
cnf(c_0_13,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO011-4 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 18:20:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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.NziJcUf9kV/E---3.1_18514.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_1 with pid 18632 completed with status 0
% 0.20/0.52 # Result found by new_bool_1
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSF-FFSF00-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 18635 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUSF-FFSF00-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 23
% 0.20/0.52 # Removed by relevancy pruning/SinE : 14
% 0.20/0.52 # Initial clauses : 9
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 9
% 0.20/0.52 # Processed clauses : 18
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 0
% 0.20/0.52 # ...remaining for further processing : 18
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 4
% 0.20/0.52 # ...of the previous two non-redundant : 0
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 4
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 0
% 0.20/0.52 # ...of those cached : 0
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 9
% 0.20/0.52 # Positive orientable unit clauses : 1
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 3
% 0.20/0.52 # Non-unit-clauses : 5
% 0.20/0.52 # Current number of unprocessed clauses: 0
% 0.20/0.52 # ...number of literals in the above : 0
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 9
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 24
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 24
% 0.20/0.52 # Non-unit clause-clause subsumptions : 0
% 0.20/0.52 # Unit Clause-clause subsumption calls : 6
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 0
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 426
% 0.20/0.52 # Search garbage collected termcells : 144
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.004 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.006 s
% 0.20/0.52 # Maximum resident set size: 1764 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.007 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.011 s
% 0.20/0.52 # Maximum resident set size: 1712 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.53 % E exiting
%------------------------------------------------------------------------------