↑ Up

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

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

% Computer : n031.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:05:48 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.39s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL170-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.09/0.36  % Computer : n031.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep  6 00:31:55 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.13/0.39  GeoParameters:
% 0.13/0.39  
% 0.13/0.39  tptp_input =     1
% 0.13/0.39  tptp_output =    0
% 0.13/0.39  nonempty =       1
% 0.13/0.39  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39  
% 0.13/0.39  RuleSystem INPUT:
% 0.13/0.39  
% 0.13/0.39  Initial Rules:
% 0.13/0.39  #0: input, references = 3, size of lhs = 3:
% 0.13/0.39     P_or-{F}(V0,V0,V1), P_not-{F}(V1,V2), P_or-{F}(V2,V0,V3) | axiom-{T}(V3)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #1: input, references = 4, size of lhs = 3:
% 0.13/0.39     P_not-{F}(V0,V2), P_or-{F}(V1,V0,V3), P_or-{F}(V2,V3,V4) | axiom-{T}(V4)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #2: input, references = 3, size of lhs = 4:
% 0.13/0.39     P_or-{F}(V0,V1,V2), P_not-{F}(V2,V3), P_or-{F}(V1,V0,V4), P_or-{F}(V3,V4,V5) | axiom-{T}(V5)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #3: input, references = 3, size of lhs = 6:
% 0.13/0.39     P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_not-{F}(V4,V5), P_or-{F}(V0,V2,V6), P_or-{F}(V1,V6,V7), P_or-{F}(V5,V7,V8) | axiom-{T}(V8)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #4: input, references = 3, size of lhs = 8:
% 0.13/0.39     P_not-{F}(V0,V3), P_or-{F}(V3,V1,V4), P_not-{F}(V4,V5), P_or-{F}(V2,V0,V6), P_not-{F}(V6,V7), P_or-{F}(V2,V1,V8), P_or-{F}(V7,V8,V9), P_or-{F}(V5,V9,V10) | axiom-{T}(V10)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #5: input, references = 4, size of lhs = 1:
% 0.13/0.39     axiom-{F}(V0) | theorem-{T}(V0)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #6: input, references = 3, size of lhs = 4:
% 0.13/0.39     P_not-{F}(V0,V1), theorem-{F}(V0), P_or-{F}(V1,V2,V3), axiom-{F}(V3) | theorem-{T}(V2)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #7: input, references = 3, size of lhs = 7:
% 0.13/0.39     P_not-{F}(V0,V2), P_or-{F}(V2,V1,V3), theorem-{F}(V3), P_not-{F}(V4,V5), P_or-{F}(V5,V1,V6), P_or-{F}(V5,V0,V7), axiom-{F}(V7) | theorem-{T}(V6)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #8: input, references = 4, size of lhs = 7:
% 0.13/0.39     P_q-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V3,V0,V4), P_or-{F}(V1,V4,V5), theorem-{F}(V5) | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #9: input, references = 5, size of lhs = 2:
% 0.13/0.39     #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #10: input, references = 6, size of lhs = 1:
% 0.13/0.39     #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #11: input, references = 4, size of lhs = 0:
% 0.13/0.39     FALSE | EXISTS V0: P_q-{T}(V0)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #12: input, references = 4, size of lhs = 0:
% 0.13/0.39     FALSE | EXISTS V0: P_p-{T}(V0)
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  number of initial rules = 13
% 0.13/0.39  
% 0.13/0.39  Simplifiers:
% 0.13/0.39  #13: unsound, references = 3, size of lhs = 3:
% 0.13/0.39     P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #14: unsound, references = 3, size of lhs = 3:
% 0.13/0.39     P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #15: unsound, references = 3, size of lhs = 3:
% 0.13/0.39     P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #16: unsound, references = 3, size of lhs = 3:
% 0.13/0.39     P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  number of simplifiers = 4
% 0.13/0.39  
% 0.13/0.39  Learnt:
% 0.13/0.39  #20: exists( #9, #18 ), references = 1, size of lhs = 7:
% 0.13/0.39     P_q-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V3,V0,V4), P_not-{F}(V5,V1), P_or-{F}(V6,V5,V4) | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #22: exists( #9, #19 ), references = 2, size of lhs = 4:
% 0.13/0.39     P_q-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V0,V3) | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #24: exists( #10, #21 ), references = 1, size of lhs = 2:
% 0.13/0.39     P_q-{F}(V0), P_p-{F}(V0) | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #26: exists( #10, #22 ), references = 1, size of lhs = 3:
% 0.13/0.39     P_q-{F}(V0), P_p-{F}(V1), P_not-{F}(V0,V2) | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #28: exists( #10, #25 ), references = 1, size of lhs = 2:
% 0.13/0.39     P_q-{F}(V0), P_p-{F}(V1) | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #30: exists( #12, #27 ), references = 1, size of lhs = 1:
% 0.13/0.39     P_q-{F}(V0) | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  #32: exists( #11, #29 ), references = 1, size of lhs = 0:
% 0.13/0.39     FALSE | FALSE
% 0.13/0.39        (used 0 times, uses = {})
% 0.13/0.39  
% 0.13/0.39  number of learnt formulas = 7
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39  
% 0.13/0.39  randbase = 1
%------------------------------------------------------------------------------