TSTP Solution File: PUZ009-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n004.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:14:16 EDT 2022
% Result : Unsatisfiable 0.13s 0.34s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n004.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 07:01:18 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 GeoParameters:
% 0.13/0.34
% 0.13/0.34 tptp_input = 1
% 0.13/0.34 tptp_output = 0
% 0.13/0.34 nonempty = 1
% 0.13/0.34 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.34 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.13/0.34
% 0.13/0.34
% 0.13/0.34 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.34 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.34
% 0.13/0.34 RuleSystem INPUT:
% 0.13/0.34
% 0.13/0.34 Initial Rules:
% 0.13/0.34 #0: input, references = 5, size of lhs = 2:
% 0.13/0.34 a_is_a_knight-{F}(), b_is_a_knight-{F}() | FALSE
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #1: input, references = 4, size of lhs = 2:
% 0.13/0.34 a_is_a_knight-{F}(), d_is_a_knight-{F}() | FALSE
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #2: input, references = 3, size of lhs = 2:
% 0.13/0.34 b_is_a_knight-{F}(), a_is_a_knight-{F}() | FALSE
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #3: input, references = 3, size of lhs = 0:
% 0.13/0.34 FALSE | b_is_a_knight-{T}(), a_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #4: input, references = 3, size of lhs = 1:
% 0.13/0.34 b_is_a_knight-{F}() | c_is_a_knight-{T}(), d_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #5: input, references = 4, size of lhs = 2:
% 0.13/0.34 c_is_a_knight-{F}(), d_is_a_knight-{F}() | FALSE
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #6: input, references = 3, size of lhs = 2:
% 0.13/0.34 d_is_a_knight-{F}(), a_is_a_knight-{F}() | FALSE
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #7: input, references = 3, size of lhs = 1:
% 0.13/0.34 d_is_a_knight-{F}() | b_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #8: input, references = 3, size of lhs = 2:
% 0.13/0.34 d_is_a_knight-{F}(), c_is_a_knight-{F}() | FALSE
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #9: input, references = 4, size of lhs = 2:
% 0.13/0.34 e_is_a_knight-{F}(), d_is_a_knight-{F}() | c_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #10: input, references = 4, size of lhs = 0:
% 0.13/0.34 FALSE | e_is_a_knight-{T}(), d_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #11: input, references = 3, size of lhs = 1:
% 0.13/0.34 c_is_a_knight-{F}() | e_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #12: input, references = 4, size of lhs = 0:
% 0.13/0.34 FALSE | d_is_a_knight-{T}(), a_is_a_knight-{T}(), c_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #13: input, references = 3, size of lhs = 1:
% 0.13/0.34 b_is_a_knight-{F}() | d_is_a_knight-{T}(), c_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #14: input, references = 3, size of lhs = 2:
% 0.13/0.34 a_is_a_knight-{F}(), e_is_a_knight-{F}() | c_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #15: input, references = 4, size of lhs = 0:
% 0.13/0.34 FALSE | a_is_a_knight-{T}(), e_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #16: input, references = 4, size of lhs = 1:
% 0.13/0.34 c_is_a_knight-{F}() | a_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #17: input, references = 4, size of lhs = 0:
% 0.13/0.34 FALSE | b_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 number of initial rules = 18
% 0.13/0.34
% 0.13/0.34 Simplifiers:
% 0.13/0.34 number of simplifiers = 0
% 0.13/0.34
% 0.13/0.34 Learnt:
% 0.13/0.34 #22: disj( #15, #9+#5 ), references = 2, size of lhs = 1:
% 0.13/0.34 d_is_a_knight-{F}() | a_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #29: disj( #10, #20+#1 ), references = 1, size of lhs = 0:
% 0.13/0.34 FALSE | e_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #36: disj( #12, input, #16+#0 ), references = 1, size of lhs = 1:
% 0.13/0.34 b_is_a_knight-{F}() | d_is_a_knight-{T}()
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 #46: #17+#32+#22+#0, references = 1, size of lhs = 0:
% 0.13/0.34 FALSE | FALSE
% 0.13/0.34 (used 0 times, uses = {})
% 0.13/0.34
% 0.13/0.34 number of learnt formulas = 4
% 0.13/0.34
% 0.13/0.34
% 0.13/0.34 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.34
% 0.13/0.34 randbase = 1
%------------------------------------------------------------------------------