%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SWB009+2 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Thu May 7 07:35:43 PM UTC 2026
% Result : Theorem 1.48s 0.81s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB009+2 : TPTP v9.2.1. Released v5.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n007.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 13:18:54 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 1.48/0.81 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.48/0.81 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.48/0.81 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.48/0.81 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.48/0.81 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.48/0.81 Execution resolution_2 ended with status: unsatisfiable
% 1.48/0.81 Used heuristic: resolution_2
% 1.48/0.81
% 1.48/0.81 Input Clauses:
% 1.48/0.81
% 1.48/0.81 Predicates: iext icext ren1 ren2
% 1.48/0.81 Fol Constants: uri_rdf_type uri_owl_someValuesFrom uri_owl_onProperty uri_ex_p uri_ex_s uri_ex_c uri_owl_ObjectProperty uri_owl_Class uri_owl_Restriction skc3
% 1.48/0.81 Fol Functions: skf1 skf2
% 1.48/0.81 Problem Properties:
% 1.48/0.81 This is a full first-order problem without equality.
% 1.48/0.81
% 1.48/0.81 After reduction: Problem Properties:
% 1.48/0.81 This is a full first-order problem without equality.
% 1.48/0.81
% 1.48/0.81
% 1.48/0.81 Reduced Input Clauses:
% 1.48/0.81
% 1.48/0.81 Most General Atoms: iext(x0,x1,x2) icext(x3,x2) ren1(x2,x1,x3,x4) ren2(x0,x3,x2,x1)
% 1.48/0.81
% 1.48/0.81 === Starting SPASS-SCL-FOL A Little Less Naive, considering 39 atoms initially, heuristics mode: resolution_2 ===
% 1.48/0.81
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 42
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 18:2:1:[5.1,12.1]:Top: icext(x0,uri_owl_ObjectProperty) -> ren1(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty,x0)
% 1.48/0.81 === Backtracking. Learning clause 19:1:0:[1.1,12.1]:: -> icext(uri_owl_ObjectProperty,uri_ex_p)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 45
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 20:2:1:[5.1,13.1]:Top: icext(x0,uri_owl_Class) -> ren1(uri_rdf_type,uri_ex_c,uri_owl_Class,x0)
% 1.48/0.81 === Backtracking. Learning clause 21:1:0:[1.1,13.1]:: -> icext(uri_owl_Class,uri_ex_c)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 48
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 22:2:1:[5.1,14.1]:Top: icext(x0,skc3) -> ren1(uri_rdf_type,uri_ex_s,skc3,x0)
% 1.48/0.81 === Backtracking. Learning clause 23:1:0:[1.1,14.1]:: -> icext(skc3,uri_ex_s)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 51
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 24:2:1:[5.1,15.1]:Top: icext(x0,uri_owl_Restriction) -> ren1(uri_rdf_type,skc3,uri_owl_Restriction,x0)
% 1.48/0.81 === Backtracking. Learning clause 25:1:0:[1.1,15.1]:: -> icext(uri_owl_Restriction,skc3)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 115
% 1.48/0.81 === Backtracking. Learning clause 26:4:5:[5.3,7.2]:TopTopTopTopTop: iext(x0,x1,x2),icext(x3,x2),ren2(x4,x1,x0,x3) -> icext(x4,x1)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 119
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Conflict found: 26:4:5:[5.3,7.2]:TopTopTopTopTop: iext(x0,x1,x2),icext(x3,x2),ren2(x4,x1,x0,x3) -> icext(x4,x1) {x0 -> uri_owl_onProperty, x1 -> skc3, x2 -> uri_ex_p, x3 -> uri_rdf_type, x4 -> uri_rdf_type}
% 1.48/0.81 === Backtracking. Learning clause 27:3:2:[26.1,16.1]:TopTop: icext(x0,uri_ex_p),ren2(x1,skc3,uri_owl_onProperty,x0) -> icext(x1,skc3)
% 1.48/0.81 === Backtracking. Learning clause 28:2:2:[10.2,16.1]:TopTop: iext(uri_owl_someValuesFrom,skc3,x0) -> ren2(skc3,x1,uri_ex_p,x0)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 123
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Conflict found: 26:4:5:[5.3,7.2]:TopTopTopTopTop: iext(x0,x1,x2),icext(x3,x2),ren2(x4,x1,x0,x3) -> icext(x4,x1) {x0 -> uri_owl_someValuesFrom, x1 -> skc3, x2 -> uri_ex_c, x3 -> uri_rdf_type, x4 -> uri_rdf_type}
% 1.48/0.81 === Backtracking. Learning clause 29:3:2:[26.1,17.1]:TopTop: icext(x0,uri_ex_c),ren2(x1,skc3,uri_owl_someValuesFrom,x0) -> icext(x1,skc3)
% 1.48/0.81 === Backtracking. Learning clause 30:2:2:[10.1,17.1]:TopTop: iext(uri_owl_onProperty,skc3,x0) -> ren2(skc3,x1,x0,uri_ex_c)
% 1.48/0.81 === Conflict found: 28:2:2:[10.2,16.1]:TopTop: iext(uri_owl_someValuesFrom,skc3,x0) -> ren2(skc3,x1,uri_ex_p,x0) {x0 -> uri_ex_c, x1 -> uri_rdf_type}
% 1.48/0.81 === Backtracking. Learning clause 31:1:1:[28.1,17.1]:Top: -> ren2(skc3,x0,uri_ex_p,uri_ex_c)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 128
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 32:2:2:[6.2,19.1]:TopTop: ren2(uri_owl_ObjectProperty,uri_ex_p,x0,x1) -> ren1(x0,uri_ex_p,skf1(uri_ex_p,x0,x1),x1)
% 1.48/0.81 === Backtracking. Learning clause 33:2:2:[5.2,19.1]:TopTop: iext(x0,x1,uri_ex_p) -> ren1(x0,x1,uri_ex_p,uri_owl_ObjectProperty)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 134
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 34:2:2:[5.2,21.1]:TopTop: iext(x0,x1,uri_ex_c) -> ren1(x0,x1,uri_ex_c,uri_owl_Class)
% 1.48/0.81 === Backtracking. Learning clause 35:2:3:[8.1,21.1]:TopTopTop: ren1(x0,uri_ex_c,x1,x2) -> ren2(uri_owl_Class,uri_ex_c,x0,x2)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 198
% 1.48/0.81 === Backtracking. Learning clause 36:3:5:[9.3,7.1]:TopTopTopTopTop: ren1(x0,x1,x2,x3) -> ren1(x0,x1,skf2(x1,x0,x3),x3),icext(x4,x1)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 200
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 37:2:2:[6.2,23.1]:TopTop: ren2(skc3,uri_ex_s,x0,x1) -> ren1(x0,uri_ex_s,skf1(uri_ex_s,x0,x1),x1)
% 1.48/0.81 === Conflict found: 26:4:5:[5.3,7.2]:TopTopTopTopTop: iext(x0,x1,x2),icext(x3,x2),ren2(x4,x1,x0,x3) -> icext(x4,x1) {x0 -> uri_rdf_type, x1 -> uri_rdf_type, x2 -> uri_ex_s, x3 -> skc3, x4 -> uri_rdf_type}
% 1.48/0.81 === Backtracking. Learning clause 38:3:3:[26.2,23.1]:TopTopTop: iext(x0,x1,uri_ex_s),ren2(x2,x1,x0,skc3) -> icext(x2,x1)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 204
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 39:2:2:[5.2,25.1]:TopTop: iext(x0,x1,skc3) -> ren1(x0,x1,skc3,uri_owl_Restriction)
% 1.48/0.81 === Conflict found: 22:2:1:[5.1,14.1]:Top: icext(x0,skc3) -> ren1(uri_rdf_type,uri_ex_s,skc3,x0) {x0 -> uri_owl_Restriction}
% 1.48/0.81 === Backtracking. Learning clause 40:1:0:[22.1,25.1]:: -> ren1(uri_rdf_type,uri_ex_s,skc3,uri_owl_Restriction)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 207
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 41:1:0:[6.1,31.1,23.1]:: -> ren1(uri_ex_p,uri_ex_s,skf1(uri_ex_s,uri_ex_p,uri_ex_c),uri_ex_c)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 209
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 42:2:1:[8.2,40.1]:Top: icext(x0,uri_ex_s) -> ren2(x0,uri_ex_s,uri_rdf_type,uri_owl_Restriction)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 273
% 1.48/0.81 === Backtracking. Learning clause 43:3:5:[6.1,8.3]:TopTopTopTopTop: icext(x0,x1),ren1(x2,x1,x3,x4) -> ren1(x2,x1,skf1(x1,x2,x4),x4)
% 1.48/0.81 === Backtracking. Learning clause 44:3:6:[1.1,3.2,43.1]:TopTopTopTopTopTop: ren1(uri_rdf_type,x0,x1,x2),ren1(x3,x0,x4,x5) -> ren1(x3,x0,skf1(x0,x3,x5),x5)
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 274
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Backtracking. Learning clause 45:2:1:[7.2,41.1,9.3]:Top: -> icext(x0,uri_ex_s),ren1(uri_ex_p,uri_ex_s,skf2(uri_ex_s,uri_ex_p,uri_ex_c),uri_ex_c)
% 1.48/0.81 === Backtracking. Learning clause 46:1:0:[3.1,41.1]:: -> iext(uri_ex_p,uri_ex_s,skf1(uri_ex_s,uri_ex_p,uri_ex_c))
% 1.48/0.81 === Clause set with instances from active satisfied. Growing active. New size: 278
% 1.48/0.81 === Restarting.
% 1.48/0.81 === Conflict found: 26:4:5:[5.3,7.2]:TopTopTopTopTop: iext(x0,x1,x2),icext(x3,x2),ren2(x4,x1,x0,x3) -> icext(x4,x1) {x0 -> uri_ex_p, x1 -> uri_ex_s, x2 -> skf1(uri_ex_s,uri_ex_p,uri_ex_c), x3 -> uri_rdf_type, x4 -> uri_rdf_type}
% 1.48/0.81 === Backtracking. Learning clause 47:3:2:[26.1,46.1]:TopTop: icext(x0,skf1(uri_ex_s,uri_ex_p,uri_ex_c)),ren2(x1,uri_ex_s,uri_ex_p,x0) -> icext(x1,uri_ex_s)
% 1.48/0.81 === Backtracking. Learning clause 48:1:0:[11.1,46.1]:: iext(uri_rdf_type,skf1(uri_ex_s,uri_ex_p,uri_ex_c),uri_ex_c) ->
% 1.48/0.81
% 1.48/0.81 SZS status Unsatisfiable
% 1.48/0.81
% 1.48/0.81 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.48/0.81
% 1.48/0.81 SPASS-SCL-FOL Statistics:
% 1.48/0.81 Number of learned clauses: 31
% 1.48/0.81 Number of propagations: 1628
% 1.48/0.81 Number of decisions: 1020
% 1.48/0.81 Number of resolutions: 37
% 1.48/0.81 Number of condensations: 0
% 1.48/0.81 Number of sub resolutions: 0
% 1.48/0.81 Number of input literals (deduplicated): 17
% 1.48/0.81 Number of grows: 17
% 1.48/0.81 Number of considered ground atoms: 278
% 1.48/0.81
% 1.48/0.81 Needed: 0:00:00.26
% 1.48/0.81
%------------------------------------------------------------------------------