TSTP Solution File: GEO063-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO063-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:27 EDT 2024
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 12 unt; 4 nHn; 10 RR)
% Number of literals : 23 ( 17 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-4 aty)
% Number of variables : 34 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_equality_of_insertions,negated_conjecture,
insertion(u,v,w,x) != insertion(u,v,y,z),
file('/export/starexec/sandbox2/tmp/tmp.M4l6SmZMXT/E---3.1_17478.p',prove_equality_of_insertions) ).
cnf(d10_2,axiom,
( extension(X5,X6,X1,X2) = extension(X5,X6,X3,X4)
| X5 = X6
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.M4l6SmZMXT/E---3.1_17478.p',d10_2) ).
cnf(insertion,axiom,
insertion(X1,X2,X3,X4) = extension(extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),X1,X3,X4),
file('/export/starexec/sandbox2/tmp/tmp.M4l6SmZMXT/E---3.1_17478.p',insertion) ).
cnf(w_to_x_equals_y_to_z,hypothesis,
equidistant(w,x,y,z),
file('/export/starexec/sandbox2/tmp/tmp.M4l6SmZMXT/E---3.1_17478.p',w_to_x_equals_y_to_z) ).
cnf(e3_1,axiom,
X1 != extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),
file('/export/starexec/sandbox2/tmp/tmp.M4l6SmZMXT/E---3.1_17478.p',e3_1) ).
cnf(c_0_5,negated_conjecture,
insertion(u,v,w,x) != insertion(u,v,y,z),
inference(fof_simplification,[status(thm)],[prove_equality_of_insertions]) ).
cnf(c_0_6,plain,
( extension(X5,X6,X1,X2) = extension(X5,X6,X3,X4)
| X5 = X6
| ~ equidistant(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[d10_2]) ).
cnf(c_0_7,negated_conjecture,
insertion(u,v,w,x) != insertion(u,v,y,z),
c_0_5 ).
cnf(c_0_8,axiom,
insertion(X1,X2,X3,X4) = extension(extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),X1,X3,X4),
insertion ).
cnf(c_0_9,plain,
( extension(X5,X6,X1,X2) = extension(X5,X6,X3,X4)
| X5 = X6
| ~ equidistant(X1,X2,X3,X4) ),
c_0_6 ).
cnf(c_0_10,hypothesis,
equidistant(w,x,y,z),
w_to_x_equals_y_to_z ).
cnf(c_0_11,plain,
X1 != extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),
inference(fof_simplification,[status(thm)],[e3_1]) ).
cnf(c_0_12,negated_conjecture,
extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,y,z) != extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,w,x),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_13,hypothesis,
( extension(X1,X2,y,z) = extension(X1,X2,w,x)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
X1 != extension(X2,X1,lower_dimension_point_1,lower_dimension_point_2),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GEO063-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n018.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 18:43:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.M4l6SmZMXT/E---3.1_17478.p
% 0.16/0.47 # Version: 3.1.0
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17556 completed with status 0
% 0.16/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # No SInE strategy applied
% 0.16/0.47 # Search class: FGUSM-FFMF33-SFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 811s (1) cores
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.47 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 136s (1) cores
% 0.16/0.47 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 17567 completed with status 0
% 0.16/0.47 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # No SInE strategy applied
% 0.16/0.47 # Search class: FGUSM-FFMF33-SFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 811s (1) cores
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.47 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 136s (1) cores
% 0.16/0.47 # Preprocessing time : 0.001 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Unsatisfiable
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 76
% 0.16/0.47 # Removed by relevancy pruning/SinE : 0
% 0.16/0.47 # Initial clauses : 76
% 0.16/0.47 # Removed in clause preprocessing : 3
% 0.16/0.47 # Initial clauses in saturation : 73
% 0.16/0.47 # Processed clauses : 249
% 0.16/0.47 # ...of these trivial : 31
% 0.16/0.47 # ...subsumed : 15
% 0.16/0.47 # ...remaining for further processing : 203
% 0.16/0.47 # Other redundant clauses eliminated : 4
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 0
% 0.16/0.47 # Backward-rewritten : 3
% 0.16/0.47 # Generated clauses : 994
% 0.16/0.47 # ...of the previous two non-redundant : 686
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 990
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 4
% 0.16/0.47 # Disequality decompositions : 0
% 0.16/0.47 # Total rewrite steps : 323
% 0.16/0.47 # ...of those cached : 225
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 133
% 0.16/0.47 # Positive orientable unit clauses : 40
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 13
% 0.16/0.47 # Non-unit-clauses : 80
% 0.16/0.47 # Current number of unprocessed clauses: 572
% 0.16/0.47 # ...number of literals in the above : 1609
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 69
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 3041
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 2274
% 0.16/0.47 # Non-unit clause-clause subsumptions : 12
% 0.16/0.47 # Unit Clause-clause subsumption calls : 109
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 244
% 0.16/0.47 # BW rewrite match successes : 3
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 16868
% 0.16/0.47 # Search garbage collected termcells : 186
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.024 s
% 0.16/0.47 # System time : 0.002 s
% 0.16/0.47 # Total time : 0.026 s
% 0.16/0.47 # Maximum resident set size: 1792 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.119 s
% 0.16/0.47 # System time : 0.008 s
% 0.16/0.47 # Total time : 0.126 s
% 0.16/0.47 # Maximum resident set size: 1752 pages
% 0.16/0.47 % E---3.1 exiting
% 0.16/0.47 % E exiting
%------------------------------------------------------------------------------