%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SWB024+2 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:47 PM UTC 2026
% Result : Theorem 0.42s 0.98s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : SWB024+2 : TPTP v9.2.1. Released v5.2.0.
% 0.09/0.16 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.37 % Computer : n017.cluster.edu
% 0.19/0.37 % Model : x86_64 x86_64
% 0.19/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37 % Memory : 8042.1875MB
% 0.19/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37 % CPULimit : 300
% 0.19/0.37 % WCLimit : 300
% 0.19/0.37 % DateTime : Thu May 7 13:19:13 EDT 2026
% 0.19/0.38 % CPUTime :
% 0.19/0.38 SPASS-SCL-FOL version:
% 0.28/0.48 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.42/0.98 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.98 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.98 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.98 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.98 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.98 Execution resolution_3 ended with status: unsatisfiable
% 0.42/0.98 Used heuristic: resolution_3
% 0.42/0.98
% 0.42/0.98 Input Clauses:
% 0.42/0.98
% 0.42/0.98 Predicates: iext icext ic ip ren1 ren2 ren3 ren4
% 0.42/0.98 Fol Constants: uri_rdf_type uri_owl_minCardinality dat_str_1 uri_xsd_nonNegativeInteger uri_owl_onProperty uri_rdfs_subClassOf uri_owl_TransitiveProperty uri_ex_hasAncestor uri_ex_bob uri_ex_alice uri_ex_Person uri_owl_Restriction skc7
% 0.42/0.98 Fol Functions: literal_typed skf1 skf2 skf3 skf4 skf5 skf6
% 0.42/0.98 Problem Properties:
% 0.42/0.98 This is a full first-order problem without equality.
% 0.42/0.98
% 0.42/0.98 After reduction: Problem Properties:
% 0.42/0.98 This is a full first-order problem without equality.
% 0.42/0.98
% 0.42/0.98
% 0.42/0.98 Reduced Input Clauses:
% 0.42/0.98
% 0.42/0.98 Most General Atoms: ren1(x0,x2,x1) icext(x2,x1) ic(x1) ren2(x0,x2,x1) ren3(x0,x1,x2,x3) iext(x0,x1,x3) ren4(x0,x1,x3,x2) ip(x0)
% 0.42/0.98
% 0.42/0.98 === Starting SPASS-SCL-FOL A Little Less Naive, considering 48 atoms initially, heuristics mode: resolution_3 ===
% 0.42/0.98
% 0.42/0.98 === Backtracking. Learning clause 33:1:0:[1.1,25.1]:: -> icext(uri_owl_TransitiveProperty,uri_ex_hasAncestor)
% 0.42/0.98 === Backtracking. Learning clause 34:1:0:[1.1,31.1]:: -> icext(uri_ex_Person,uri_ex_bob)
% 0.42/0.98 === Backtracking. Learning clause 35:1:0:[1.1,30.1]:: -> icext(uri_ex_Person,uri_ex_alice)
% 0.42/0.98 === Backtracking. Learning clause 36:1:0:[1.1,27.1]:: -> icext(uri_owl_Restriction,skc7)
% 0.42/0.98 === Backtracking. Learning clause 37:1:0:[12.1,26.1]:: -> ic(skc7)
% 0.42/0.98 === Backtracking. Learning clause 38:1:0:[11.1,26.1]:: -> ic(uri_ex_Person)
% 0.42/0.98 === Backtracking. Learning clause 39:1:0:[24.2,32.1]:: iext(uri_ex_hasAncestor,uri_ex_bob,uri_ex_bob) ->
% 0.42/0.98 === Backtracking. Learning clause 40:2:1:[4.2,29.1]:Top: ren1(x0,skc7,uri_owl_minCardinality) -> icext(x0,skc7)
% 0.42/0.98 === Backtracking. Learning clause 41:2:2:[7.1,29.1]:TopTop: iext(uri_owl_onProperty,skc7,x0) -> ren1(skc7,x1,x0)
% 0.42/0.98 === Backtracking. Learning clause 42:3:1:[24.2,3.3]:Top: iext(uri_ex_hasAncestor,uri_ex_bob,skf1(uri_ex_alice,uri_ex_hasAncestor)),ren1(x0,uri_ex_alice,uri_ex_hasAncestor),icext(x0,uri_ex_alice) ->
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 54
% 0.42/0.98 === Restarting.
% 0.42/0.98 === Backtracking. Learning clause 43:1:0:[21.1,33.1]:: -> ip(uri_ex_hasAncestor)
% 0.42/0.98 === Conflict found: 41:2:2:[7.1,29.1]:TopTop: iext(uri_owl_onProperty,skc7,x0) -> ren1(skc7,x1,x0) {x0 -> uri_owl_minCardinality, x1 -> skc7}
% 0.42/0.98 === Backtracking. Learning clause 44:2:0:[41.2,40.1]:: iext(uri_owl_onProperty,skc7,uri_owl_minCardinality) -> icext(skc7,skc7)
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 118
% 0.42/0.98 === Conflict found: 41:2:2:[7.1,29.1]:TopTop: iext(uri_owl_onProperty,skc7,x0) -> ren1(skc7,x1,x0) {x0 -> uri_rdf_type, x1 -> skc7}
% 0.42/0.98 === Backtracking. Learning clause 45:3:3:[41.2,4.1]:TopTopTop: iext(uri_owl_onProperty,skc7,x0),iext(x0,x1,x2) -> icext(skc7,x1)
% 0.42/0.98 === Backtracking. Learning clause 46:2:2:[3.3,1.1,5.3,5.1,2.2]:TopTop: icext(x0,x1) -> ren1(skf1(x1,uri_rdf_type),x1,uri_rdf_type)
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 182
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 246
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 310
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 374
% 0.42/0.98 === Backtracking. Learning clause 47:5:4:[18.1,22.2,17.3,2.2,45.3]:TopTopTopTop: icext(uri_owl_TransitiveProperty,uri_rdf_type),iext(uri_rdf_type,skc7,x0),iext(uri_owl_onProperty,skc7,x1),iext(x1,x2,x3) -> iext(uri_rdf_type,x2,x0)
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 438
% 0.42/0.98 === Conflict found: 47:5:4:[18.1,22.2,17.3,2.2,45.3]:TopTopTopTop: icext(uri_owl_TransitiveProperty,uri_rdf_type),iext(uri_rdf_type,skc7,x0),iext(uri_owl_onProperty,skc7,x1),iext(x1,x2,x3) -> iext(uri_rdf_type,x2,x0) {x0 -> skc7, x1 -> uri_owl_minCardinality, x2 -> uri_owl_minCardinality, x3 -> literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)}
% 0.42/0.98 === Backtracking. Learning clause 48:6:5:[47.5,4.2]:TopTopTopTopTop: icext(uri_owl_TransitiveProperty,uri_rdf_type),iext(uri_rdf_type,skc7,x0),iext(uri_owl_onProperty,skc7,x1),iext(x1,x2,x3),ren1(x4,x2,uri_rdf_type) -> icext(x4,x2)
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 502
% 0.42/0.98 === Backtracking. Learning clause 49:4:4:[3.3,5.2]:TopTopTopTop: ren1(x0,x1,x2),icext(x0,x1),icext(x3,x1) -> ren1(x3,x1,x2)
% 0.42/0.98 === Backtracking. Learning clause 50:2:4:[19.1,15.1]:TopTopTopTop: -> ren4(x0,x1,x2,x3),iext(x0,x1,x2)
% 0.42/0.98 === Backtracking. Learning clause 51:3:4:[3.1,5.3,1.2]:TopTopTopTop: iext(x0,x1,x2),iext(uri_rdf_type,x1,x3) -> iext(x0,x1,skf1(x1,x0))
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 566
% 0.42/0.98 === Backtracking. Learning clause 52:3:2:[6.3,4.1,24.2]:TopTop: iext(uri_ex_hasAncestor,uri_ex_alice,x0),iext(uri_ex_hasAncestor,uri_ex_bob,skf2(uri_ex_alice,uri_ex_hasAncestor)) -> icext(x1,uri_ex_alice)
% 0.42/0.98 === Backtracking. Learning clause 54:1:0:[33.0,53.0,18.2,17.3,22.2,24.2,3.3,41.2,28.1,45.3,31.1,32.1]:: iext(uri_owl_onProperty,skc7,uri_rdf_type) ->
% 0.42/0.98 === Backtracking. Learning clause 55:2:5:[16.2,20.1,19.1]:TopTopTopTopTop: -> ren4(x0,x1,x2,x3),ren4(x0,x4,x1,x3)
% 0.42/0.98 === Backtracking. Learning clause 56:4:2:[18.3,24.2,17.3]:TopTop: ren4(uri_ex_hasAncestor,uri_ex_alice,x0,x1),iext(uri_ex_hasAncestor,uri_ex_bob,x1),iext(uri_ex_hasAncestor,uri_ex_alice,x0),iext(uri_ex_hasAncestor,x0,x1) ->
% 0.42/0.98 === Backtracking. Learning clause 57:4:4:[6.2,1.1,4.1,49.2]:TopTopTopTop: iext(uri_rdf_type,x0,x1),ren1(skf2(x0,uri_rdf_type),x0,x2),icext(x3,x0) -> ren1(x3,x0,x2)
% 0.42/0.98 === Clause set with instances from active satisfied. Growing active. New size: 630
% 0.42/0.98
% 0.42/0.98 SZS status Unsatisfiable
% 0.42/0.98
% 0.42/0.98 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.98
% 0.42/0.98 SPASS-SCL-FOL Statistics:
% 0.42/0.98 Number of learned clauses: 24
% 0.42/0.98 Number of propagations: 2406
% 0.42/0.98 Number of decisions: 818
% 0.42/0.98 Number of resolutions: 54
% 0.42/0.98 Number of condensations: 1
% 0.42/0.98 Number of sub resolutions: 1
% 0.42/0.98 Number of input literals (deduplicated): 27
% 0.42/0.98 Number of grows: 10
% 0.42/0.98 Number of considered ground atoms: 630
% 0.42/0.98
% 0.42/0.98 Needed: 0:00:00.39
% 0.42/0.98
%------------------------------------------------------------------------------