TSTP Solution File: LCL666+1.001 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL666+1.001 : TPTP v8.1.0. Released v4.0.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 : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat Jul 23 06:09:46 EDT 2022
% Result : Theorem 0.20s 0.33s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.20/0.33 % DateTime : Fri Jul 22 22:37:42 EDT 2022
% 0.20/0.33 % CPUTime :
% 0.20/0.33 GeoParameters:
% 0.20/0.33
% 0.20/0.33 tptp_input = 1
% 0.20/0.33 tptp_output = 0
% 0.20/0.33 nonempty = 1
% 0.20/0.33 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.33 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.20/0.33
% 0.20/0.33
% 0.20/0.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.33 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.33
% 0.20/0.33 RuleSystem INPUT:
% 0.20/0.33
% 0.20/0.33 Initial Rules:
% 0.20/0.33 #0: input, references = 4, size of lhs = 1:
% 0.20/0.33 #-{F} V0 | r1-{T}(V0,V0)
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 #1: input, references = 4, size of lhs = 0:
% 0.20/0.33 FALSE | EXISTS V0: pppp0-{T}(V0)
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 #2: input, references = 4, size of lhs = 1:
% 0.20/0.33 pppp0-{F}(V0) | p101-{T}(V0)
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 #3: input, references = 4, size of lhs = 1:
% 0.20/0.33 pppp0-{F}(V0) | p201-{T}(V0)
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 #4: input, references = 4, size of lhs = 4:
% 0.20/0.33 pppp0-{F}(V0), r1-{F}(V0,V1), p201-{F}(V1), p101-{F}(V1) | FALSE
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 number of initial rules = 5
% 0.20/0.33
% 0.20/0.33 Simplifiers:
% 0.20/0.33 #5: unsound, references = 3, size of lhs = 2:
% 0.20/0.33 r1-{F}(V0,V1), V1 == V0 | FALSE
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 #6: unsound, references = 3, size of lhs = 3:
% 0.20/0.33 p201-{F}(V0), p201-{F}(V1), V0 == V1 | FALSE
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 #7: unsound, references = 3, size of lhs = 3:
% 0.20/0.33 p101-{F}(V0), p101-{F}(V1), V0 == V1 | FALSE
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 #8: unsound, references = 3, size of lhs = 3:
% 0.20/0.33 pppp0-{F}(V0), pppp0-{F}(V1), V0 == V1 | FALSE
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 number of simplifiers = 4
% 0.20/0.33
% 0.20/0.33 Learnt:
% 0.20/0.33 #13: exists( #1, #11 ), references = 1, size of lhs = 0:
% 0.20/0.33 FALSE | FALSE
% 0.20/0.33 (used 0 times, uses = {})
% 0.20/0.33
% 0.20/0.33 number of learnt formulas = 1
% 0.20/0.33
% 0.20/0.33
% 0.20/0.33 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.33
% 0.20/0.33 randbase = 1
%------------------------------------------------------------------------------