TSTP Solution File: LCL076-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL076-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n005.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:08:43 EDT 2022
% Result : Unsatisfiable 0.19s 0.39s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL076-2 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n005.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.13/0.33 % DateTime : Fri Jul 22 22:31:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.39 GeoParameters:
% 0.19/0.39
% 0.19/0.39 tptp_input = 1
% 0.19/0.39 tptp_output = 0
% 0.19/0.39 nonempty = 1
% 0.19/0.39 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39
% 0.19/0.39 RuleSystem INPUT:
% 0.19/0.39
% 0.19/0.39 Initial Rules:
% 0.19/0.39 #0: input, references = 4, size of lhs = 3:
% 0.19/0.39 P_implies-{F}(V1,V0,V2), is_a_theorem-{F}(V2), is_a_theorem-{F}(V1) | is_a_theorem-{T}(V0)
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #1: input, references = 4, size of lhs = 2:
% 0.19/0.39 P_implies-{F}(V1,V0,V2), P_implies-{F}(V0,V2,V3) | is_a_theorem-{T}(V3)
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #2: input, references = 3, size of lhs = 6:
% 0.19/0.39 P_implies-{F}(V1,V2,V3), P_implies-{F}(V0,V3,V4), P_implies-{F}(V0,V1,V5), P_implies-{F}(V0,V2,V6), P_implies-{F}(V5,V6,V7), P_implies-{F}(V4,V7,V8) | is_a_theorem-{T}(V8)
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #3: input, references = 4, size of lhs = 5:
% 0.19/0.39 P_not-{F}(V0,V2), P_not-{F}(V1,V3), P_implies-{F}(V2,V3,V4), P_implies-{F}(V1,V0,V5), P_implies-{F}(V4,V5,V6) | is_a_theorem-{T}(V6)
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #4: input, references = 5, size of lhs = 3:
% 0.19/0.39 P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_implies-{F}(V2,V0,V3) | is_a_theorem-{T}(V3)
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #5: input, references = 6, size of lhs = 5:
% 0.19/0.39 P_a-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_implies-{F}(V0,V2,V3), is_a_theorem-{F}(V3) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #6: input, references = 8, size of lhs = 2:
% 0.19/0.39 #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #7: input, references = 6, size of lhs = 1:
% 0.19/0.39 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #8: input, references = 4, size of lhs = 0:
% 0.19/0.39 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 number of initial rules = 9
% 0.19/0.39
% 0.19/0.39 Simplifiers:
% 0.19/0.39 #9: unsound, references = 3, size of lhs = 3:
% 0.19/0.39 P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #10: unsound, references = 3, size of lhs = 3:
% 0.19/0.39 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #11: unsound, references = 3, size of lhs = 3:
% 0.19/0.39 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 number of simplifiers = 3
% 0.19/0.39
% 0.19/0.39 Learnt:
% 0.19/0.39 #14: exists( #6, #12 ), references = 1, size of lhs = 5:
% 0.19/0.39 P_a-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_not-{F}(V3,V0) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #17: exists( #6, #15 ), references = 1, size of lhs = 4:
% 0.19/0.39 P_a-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_implies-{F}(V3,V0,V2) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #26: exists( #6, #24 ), references = 2, size of lhs = 9:
% 0.19/0.39 is_a_theorem-{F}(V0), P_a-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_implies-{F}(V1,V3,V4), P_not-{F}(V5,V6), P_implies-{F}(V7,V5,V4), P_not-{F}(V7,V8), P_implies-{F}(V6,V8,V0) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #29: exists( #6, #27 ), references = 1, size of lhs = 9:
% 0.19/0.39 P_a-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_implies-{F}(V0,V2,V3), P_not-{F}(V4,V5), P_implies-{F}(V6,V4,V3), P_not-{F}(V6,V7), P_not-{F}(V7,V8), P_not-{F}(V8,V5) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #33: mergings( V3 == V5, V1 == V6; #30 ), references = 1, size of lhs = 4:
% 0.19/0.39 P_a-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #36: mergings( V3 == V4; #34 ), references = 1, size of lhs = 3:
% 0.19/0.39 P_a-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #38: exists( #7, #34 ), references = 1, size of lhs = 2:
% 0.19/0.39 P_a-{F}(V0), P_not-{F}(V0,V1) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #40: exists( #7, #37 ), references = 1, size of lhs = 1:
% 0.19/0.39 P_a-{F}(V0) | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 #42: exists( #8, #39 ), references = 1, size of lhs = 0:
% 0.19/0.39 FALSE | FALSE
% 0.19/0.39 (used 0 times, uses = {})
% 0.19/0.39
% 0.19/0.39 number of learnt formulas = 9
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39
% 0.19/0.39 randbase = 1
%------------------------------------------------------------------------------