↑ Up

Geo-III---2018C.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : LCL899+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %s

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 12:07:17 PM UTC 2026

% Result   : Theorem 0.21s 0.50s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL899+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.03  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.08/0.35  % Computer : n007.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sun Sep  6 00:59:39 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.21/0.50  GeoParameters:
% 0.21/0.50  
% 0.21/0.50  tptp_input =     1
% 0.21/0.50  tptp_output =    0
% 0.21/0.50  nonempty =       1
% 0.21/0.50  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.21/0.50  
% 0.21/0.50  
% 0.21/0.50  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50  
% 0.21/0.50  RuleSystem INPUT:
% 0.21/0.50  
% 0.21/0.50  Initial Rules:
% 0.21/0.50  #0: input, references = 4, size of lhs = 5:
% 0.21/0.50     P_+-{F}(V0,V1,V3), P_+-{F}(V3,V2,V4), P_+-{F}(V1,V2,V5), P_+-{F}(V0,V5,V6), V4 == V6 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #1: input, references = 4, size of lhs = 3:
% 0.21/0.50     P_+-{F}(V0,V1,V2), P_+-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #2: input, references = 4, size of lhs = 3:
% 0.21/0.50     P_0-{F}(V0), P_+-{F}(V1,V0,V2), V2 == V1 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #3: input, references = 5, size of lhs = 2:
% 0.21/0.50     P_0-{F}(V0), #-{F} V1 | >=-{T}(V1,V1)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #4: input, references = 3, size of lhs = 3:
% 0.21/0.50     P_0-{F}(V0), >=-{F}(V1,V2), >=-{F}(V3,V1) | >=-{T}(V3,V2)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #5: input, references = 6, size of lhs = 4:
% 0.21/0.50     P_0-{F}(V0), >=-{F}(V1,V2), >=-{F}(V2,V1), V1 == V2 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #6: input, references = 5, size of lhs = 4:
% 0.21/0.50     P_0-{F}(V0), P_+-{F}(V1,V2,V4), P_==>-{F}(V1,V3,V5), >=-{F}(V4,V3) | >=-{T}(V2,V5)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #7: input, references = 6, size of lhs = 4:
% 0.21/0.50     P_0-{F}(V0), P_+-{F}(V1,V2,V4), P_==>-{F}(V1,V3,V5), >=-{F}(V2,V5) | >=-{T}(V4,V3)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #8: input, references = 5, size of lhs = 2:
% 0.21/0.50     P_0-{F}(V0), #-{F} V1 | >=-{T}(V1,V0)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #9: input, references = 4, size of lhs = 4:
% 0.21/0.50     P_0-{F}(V0), >=-{F}(V1,V2), P_+-{F}(V1,V3,V4), P_+-{F}(V2,V3,V5) | >=-{T}(V4,V5)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #10: input, references = 3, size of lhs = 4:
% 0.21/0.50     P_0-{F}(V0), >=-{F}(V1,V2), P_==>-{F}(V2,V3,V4), P_==>-{F}(V1,V3,V5) | >=-{T}(V4,V5)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #11: input, references = 3, size of lhs = 4:
% 0.21/0.50     P_0-{F}(V0), >=-{F}(V1,V2), P_==>-{F}(V3,V1,V4), P_==>-{F}(V3,V2,V5) | >=-{T}(V4,V5)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #12: input, references = 4, size of lhs = 4:
% 0.21/0.50     P_0-{F}(V0), P_1-{F}(V1), P_+-{F}(V2,V1,V3), V3 == V1 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #13: input, references = 4, size of lhs = 7:
% 0.21/0.50     P_0-{F}(V0), P_1-{F}(V1), P_==>-{F}(V2,V3,V4), P_==>-{F}(V4,V3,V5), P_==>-{F}(V3,V2,V6), P_==>-{F}(V6,V2,V7), V5 == V7 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #14: input, references = 4, size of lhs = 2:
% 0.21/0.50     P_0-{F}(V0), P_1-{F}(V1) | EXISTS V2: pppp0-{T}(V1,V2)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #15: input, references = 4, size of lhs = 3:
% 0.21/0.50     pppp0-{F}(V0,V1), P_==>-{F}(V1,V0,V2), P_==>-{F}(V2,V0,V1) | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #16: input, references = 7, size of lhs = 2:
% 0.21/0.50     #-{F} V0, #-{F} V1 | EXISTS V2: P_+-{T}(V0,V1,V2)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #17: input, references = 4, size of lhs = 0:
% 0.21/0.50     FALSE | EXISTS V0: P_0-{T}(V0)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #18: input, references = 7, size of lhs = 2:
% 0.21/0.50     #-{F} V0, #-{F} V1 | EXISTS V2: P_==>-{T}(V0,V1,V2)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #19: input, references = 4, size of lhs = 0:
% 0.21/0.50     FALSE | EXISTS V0: P_1-{T}(V0)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  number of initial rules = 20
% 0.21/0.50  
% 0.21/0.50  Simplifiers:
% 0.21/0.50  #20: unsound, references = 3, size of lhs = 3:
% 0.21/0.50     P_+-{F}(V0,V1,V2), P_+-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #21: unsound, references = 3, size of lhs = 3:
% 0.21/0.50     P_0-{F}(V0), P_0-{F}(V1), V0 == V1 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #22: unsound, references = 3, size of lhs = 3:
% 0.21/0.50     P_==>-{F}(V0,V1,V2), P_==>-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #23: unsound, references = 3, size of lhs = 3:
% 0.21/0.50     P_1-{F}(V0), P_1-{F}(V1), V0 == V1 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #24: unsound, references = 3, size of lhs = 3:
% 0.21/0.50     pppp0-{F}(V0,V1), pppp0-{F}(V0,V3), V1 == V3 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #25: unsound, references = 3, size of lhs = 3:
% 0.21/0.50     pppp0-{F}(V0,V1), pppp0-{F}(V2,V3), V0 == V2 | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  number of simplifiers = 6
% 0.21/0.50  
% 0.21/0.50  Learnt:
% 0.21/0.50  #27: exists( #16, #12 ), references = 3, size of lhs = 3:
% 0.21/0.50     P_0-{F}(V0), P_1-{F}(V1), #-{F} V2 | P_+-{T}(V2,V1,V1)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #30: exists( #16, #2 ), references = 5, size of lhs = 2:
% 0.21/0.50     P_0-{F}(V0), #-{F} V1 | P_+-{T}(V1,V0,V1)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #37: mergings( V3 == V4, V4 == V5; #34 ), references = 3, size of lhs = 3:
% 0.21/0.50     P_0-{F}(V0), P_+-{F}(V1,V0,V2), >=-{F}(V2,V3) | P_==>-{T}(V1,V3,V0)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #41: exists( #16, #1 ), references = 5, size of lhs = 1:
% 0.21/0.50     P_+-{F}(V0,V1,V2) | P_+-{T}(V1,V0,V2)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #42: exists( #16, #0 ), references = 1, size of lhs = 3:
% 0.21/0.50     P_+-{F}(V0,V1,V2), P_+-{F}(V1,V3,V4), P_+-{F}(V0,V4,V5) | P_+-{T}(V2,V3,V5)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #54: mergings( V3 == V0, V0 == V4, V4 == V5, V5 == V6; #49 ), references = 2, size of lhs = 3:
% 0.21/0.50     P_0-{F}(V0), P_+-{F}(V0,V1,V2), >=-{F}(V2,V1) | P_==>-{T}(V0,V1,V1)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #69: mergings( V3 == V4, V4 == V6, V6 == V7, V7 == V8; #64 ), references = 1, size of lhs = 5:
% 0.21/0.50     P_1-{F}(V0), >=-{F}(V0,V1), P_0-{F}(V1), >=-{F}(V2,V3), P_==>-{F}(V4,V0,V3) | P_+-{T}(V4,V2,V0)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #71: exists( #18, #13 ), references = 1, size of lhs = 5:
% 0.21/0.50     P_0-{F}(V0), P_1-{F}(V1), P_==>-{F}(V2,V3,V4), P_==>-{F}(V3,V2,V5), P_==>-{F}(V5,V2,V6) | P_==>-{T}(V4,V3,V6)
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #74: exists( #18, #72 ), references = 1, size of lhs = 5:
% 0.21/0.50     P_0-{F}(V0), P_1-{F}(V1), pppp0-{F}(V2,V3), P_==>-{F}(V2,V3,V4), P_==>-{F}(V4,V3,V3) | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #91: mergings( V0 == V3, V3 == V4, V4 == V6, V6 == V7, V7 == V8, V1 == V5, V5 == V9; #83 ), references = 2, size of lhs = 4:
% 0.21/0.50     P_0-{F}(V0), P_1-{F}(V1), >=-{F}(V1,V0), P_+-{F}(V1,V0,V1) | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #95: exists( #19, #93 ), references = 1, size of lhs = 1:
% 0.21/0.50     P_0-{F}(V0) | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  #97: exists( #17, #94 ), references = 1, size of lhs = 0:
% 0.21/0.50     FALSE | FALSE
% 0.21/0.50        (used 0 times, uses = {})
% 0.21/0.50  
% 0.21/0.50  number of learnt formulas = 12
% 0.21/0.50  
% 0.21/0.50  
% 0.21/0.50  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50  
% 0.21/0.50  randbase = 1
%------------------------------------------------------------------------------