↑ Up

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

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

% Computer : n028.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:44 PM UTC 2026

% Result   : Unsatisfiable 0.09s 0.43s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL134-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.09/0.36  % Computer : n028.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 : Fri Sep  4 18:18:43 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.43  GeoParameters:
% 0.09/0.43  
% 0.09/0.43  tptp_input =     1
% 0.09/0.43  tptp_output =    0
% 0.09/0.43  nonempty =       1
% 0.09/0.43  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.43  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.09/0.43  
% 0.09/0.43  
% 0.09/0.43  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.43  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.43  
% 0.09/0.43  RuleSystem INPUT:
% 0.09/0.43  
% 0.09/0.43  Initial Rules:
% 0.09/0.43  #0: input, references = 5, size of lhs = 3:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V0,V1,V2), V2 == V1 | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #1: input, references = 6, size of lhs = 7:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V1,V2,V4), P_implies-{F}(V2,V3,V5), P_implies-{F}(V1,V3,V6), P_implies-{F}(V5,V6,V7), P_implies-{F}(V4,V7,V8), V8 == V0 | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #2: input, references = 5, size of lhs = 6:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V1,V2,V3), P_implies-{F}(V3,V2,V4), P_implies-{F}(V2,V1,V5), P_implies-{F}(V5,V1,V6), V4 == V6 | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #3: input, references = 4, size of lhs = 7:
% 0.09/0.43     P_truth-{F}(V0), P_not-{F}(V1,V3), P_not-{F}(V2,V4), P_implies-{F}(V3,V4,V5), P_implies-{F}(V2,V1,V6), P_implies-{F}(V5,V6,V7), V7 == V0 | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #4: input, references = 4, size of lhs = 3:
% 0.09/0.43     P_truth-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V0,V0) | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #5: input, references = 9, size of lhs = 2:
% 0.09/0.43     #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #6: input, references = 4, size of lhs = 0:
% 0.09/0.43     FALSE | EXISTS V0: P_truth-{T}(V0)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #7: input, references = 3, size of lhs = 1:
% 0.09/0.43     #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #8: input, references = 4, size of lhs = 0:
% 0.09/0.43     FALSE | EXISTS V0: P_x-{T}(V0)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  number of initial rules = 9
% 0.09/0.43  
% 0.09/0.43  Simplifiers:
% 0.09/0.43  #9: unsound, references = 3, size of lhs = 3:
% 0.09/0.43     P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #10: unsound, references = 3, size of lhs = 3:
% 0.09/0.43     P_truth-{F}(V0), P_truth-{F}(V1), V0 == V1 | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #11: unsound, references = 3, size of lhs = 3:
% 0.09/0.43     P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #12: unsound, references = 3, size of lhs = 3:
% 0.09/0.43     P_x-{F}(V0), P_x-{F}(V1), V0 == V1 | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  number of simplifiers = 4
% 0.09/0.43  
% 0.09/0.43  Learnt:
% 0.09/0.43  #15: exists( #5, #0 ), references = 4, size of lhs = 2:
% 0.09/0.43     P_truth-{F}(V0), #-{F} V1 | P_implies-{T}(V0,V1,V1)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #16: exists( #5, #1 ), references = 3, size of lhs = 5:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V1,V2,V3), P_implies-{F}(V2,V4,V5), P_implies-{F}(V1,V4,V6), P_implies-{F}(V5,V6,V7) | P_implies-{T}(V3,V7,V0)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #18: exists( #5, #3 ), references = 2, size of lhs = 5:
% 0.09/0.43     P_truth-{F}(V0), P_not-{F}(V1,V2), P_not-{F}(V3,V4), P_implies-{F}(V2,V4,V5), P_implies-{F}(V3,V1,V6) | P_implies-{T}(V5,V6,V0)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #25: mergings( V3 == V4, V4 == V5; #22 ), references = 1, size of lhs = 8:
% 0.09/0.43     P_truth-{F}(V0), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_implies-{F}(V4,V1,V5), P_implies-{F}(V0,V5,V6), P_not-{F}(V4,V7), P_not-{F}(V7,V8), P_implies-{F}(V8,V3,V5) | P_implies-{T}(V2,V7,V6)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #30: exists( #5, #2 ), references = 1, size of lhs = 4:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V1,V2,V3), P_implies-{F}(V3,V2,V4), P_implies-{F}(V2,V1,V5) | P_implies-{T}(V5,V1,V4)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #34: mergings( V3 == V4; #32 ), references = 2, size of lhs = 5:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V1,V2,V2), P_implies-{F}(V1,V3,V3), P_implies-{F}(V3,V2,V4), P_implies-{F}(V4,V2,V3) | P_implies-{T}(V2,V3,V0)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #46: mergings( V3 == V4; #42 ), references = 2, size of lhs = 4:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V1,V2,V0), P_implies-{F}(V2,V3,V4), P_implies-{F}(V1,V3,V5) | P_implies-{T}(V4,V5,V0)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #48: mergings( V3 == V4; #43 ), references = 1, size of lhs = 5:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V0,V1,V0), P_implies-{F}(V2,V3,V1), P_implies-{F}(V3,V4,V5), P_implies-{F}(V2,V4,V6) | P_implies-{T}(V5,V6,V0)
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #53: exists( #8, #51 ), references = 1, size of lhs = 2:
% 0.09/0.43     P_truth-{F}(V0), P_implies-{F}(V0,V0,V0) | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  #56: exists( #6, #54 ), references = 1, size of lhs = 0:
% 0.09/0.43     FALSE | FALSE
% 0.09/0.43        (used 0 times, uses = {})
% 0.09/0.43  
% 0.09/0.43  number of learnt formulas = 10
% 0.09/0.43  
% 0.09/0.43  
% 0.09/0.43  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.43  
% 0.09/0.43  randbase = 1
%------------------------------------------------------------------------------