%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SWB032+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 : n002.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:49 PM UTC 2026
% Result : Theorem 0.40s 0.61s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWB032+2 : TPTP v9.2.1. Released v5.2.0.
% 0.11/0.14 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.35 % Computer : n002.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu May 7 13:21:02 EDT 2026
% 0.17/0.35 % CPUTime :
% 0.17/0.35 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Execution resolution_1 ended with status: unsatisfiable
% 0.40/0.61 Used heuristic: resolution_1
% 0.40/0.61
% 0.40/0.61 Input Clauses:
% 0.40/0.61
% 0.40/0.61 Predicates: idc icext ic iext ren1 ren2
% 0.40/0.61 Fol Constants: uri_xsd_string uri_xsd_decimal uri_xsd_integer uri_rdf_PlainLiteral uri_owl_real uri_owl_rational uri_rdfs_subClassOf uri_owl_disjointWith
% 0.40/0.61 Fol Functions: skf1 skf2
% 0.40/0.61 Problem Properties:
% 0.40/0.61 This is a full first-order problem without equality.
% 0.40/0.61
% 0.40/0.61 After reduction: Problem Properties:
% 0.40/0.61 This is a full first-order problem without equality.
% 0.40/0.61
% 0.40/0.61
% 0.40/0.61 Reduced Input Clauses:
% 0.40/0.61
% 0.40/0.61 Most General Atoms: idc(x0) icext(x2,x1) iext(uri_rdfs_subClassOf,x0,x1) ic(x1) ren1(x0,x2,x1) iext(uri_owl_disjointWith,x0,x1) ren2(x0,x2,x1)
% 0.40/0.61
% 0.40/0.61 === Starting SPASS-SCL-FOL A Little Less Naive, considering 13 atoms initially, heuristics mode: resolution_1 ===
% 0.40/0.61
% 0.40/0.61 === Backtracking. Learning clause 25:2:1:[6.1,7.2]:Top: icext(uri_xsd_decimal,x0) -> icext(uri_owl_real,x0)
% 0.40/0.61 === Backtracking. Learning clause 26:3:3:[22.2,19.3]:TopTopTop: iext(uri_owl_disjointWith,x0,x1),icext(x0,x2),icext(x1,x2) ->
% 0.40/0.61 === Backtracking. Learning clause 27:4:2:[18.1,23.3]:TopTop: ic(x0),ic(x1) -> icext(x1,skf2(x0,x1)),iext(uri_owl_disjointWith,x0,x1)
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 26
% 0.40/0.61 === Restarting.
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 89
% 0.40/0.61 === Backtracking. Learning clause 28:1:0:[9.1,1.1]:: -> ic(uri_xsd_string)
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 153
% 0.40/0.61 === Backtracking. Learning clause 30:3:2:[20.1,29.1,17.2,26.2,23.3]:TopTop: iext(uri_owl_disjointWith,x0,x0),ic(x1) -> iext(uri_owl_disjointWith,x0,x1)
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 217
% 0.40/0.61 === Conflict found: 27:4:2:[18.1,23.3]:TopTop: ic(x0),ic(x1) -> icext(x1,skf2(x0,x1)),iext(uri_owl_disjointWith,x0,x1) {x0 -> uri_xsd_decimal, x1 -> uri_xsd_string}
% 0.40/0.61 === Backtracking. Learning clause 33:2:0:[14.1,31.0,20.1,32.1,27.3,26.2,24.1]:: iext(uri_owl_disjointWith,uri_xsd_string,uri_xsd_string),iext(uri_rdfs_subClassOf,uri_xsd_integer,uri_xsd_decimal) ->
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 281
% 0.40/0.61 === Backtracking. Learning clause 34:2:1:[8.2,26.2]:Top: icext(uri_xsd_integer,x0),iext(uri_owl_disjointWith,uri_xsd_decimal,uri_xsd_decimal) ->
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 345
% 0.40/0.61 === Backtracking. Learning clause 35:2:2:[17.2,34.1]:TopTop: ren2(uri_xsd_integer,x0,x1),iext(uri_owl_disjointWith,uri_xsd_decimal,uri_xsd_decimal) ->
% 0.40/0.61 === Backtracking. Learning clause 36:4:2:[11.2,16.3,26.2,23.4]:TopTop: ic(x1),ic(x0) -> iext(uri_rdfs_subClassOf,x0,x1),ren2(x0,skf2(x0,x0),x0)
% 0.40/0.61 === Backtracking. Learning clause 38:3:0:[28.0,37.2,8.1,11.1,12.1,16.3,33.2,27.4]:: ic(uri_xsd_integer),ic(uri_xsd_decimal) -> icext(uri_xsd_string,skf2(uri_xsd_string,uri_xsd_string))
% 0.40/0.61 === Backtracking. Learning clause 41:1:0:[14.1,39.0,28.0,40.1,6.2,4.2,7.2,17.2,23.3,5.2,27.3,24.1]:: iext(uri_rdfs_subClassOf,uri_xsd_integer,uri_xsd_decimal) ->
% 0.40/0.61 === Conflict found: 38:3:0:[28.0,37.2,8.1,11.1,12.1,16.3,33.2,27.4]:: ic(uri_xsd_integer),ic(uri_xsd_decimal) -> icext(uri_xsd_string,skf2(uri_xsd_string,uri_xsd_string)) {}
% 0.40/0.61 === Backtracking. Learning clause 42:2:1:[38.1,9.2,20.2,3.1]:Top: iext(uri_owl_disjointWith,uri_xsd_decimal,x0) -> icext(uri_xsd_string,skf2(uri_xsd_string,uri_xsd_string))
% 0.40/0.61 === Backtracking. Learning clause 44:1:1:[41.0,43.1,8.1,11.1,12.1,16.3,9.2,20.2,3.1]:Top: iext(uri_owl_disjointWith,uri_xsd_decimal,x0) ->
% 0.40/0.61 === Backtracking. Learning clause 45:2:0:[9.1,2.1,38.2]:: ic(uri_xsd_integer) -> icext(uri_xsd_string,skf2(uri_xsd_string,uri_xsd_string))
% 0.40/0.61 === Backtracking. Learning clause 46:1:0:[9.1,2.1]:: -> ic(uri_xsd_decimal)
% 0.40/0.61
% 0.40/0.61 SZS status Unsatisfiable
% 0.40/0.61
% 0.40/0.61 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61
% 0.40/0.61 SPASS-SCL-FOL Statistics:
% 0.40/0.61 Number of learned clauses: 15
% 0.40/0.61 Number of propagations: 728
% 0.40/0.61 Number of decisions: 193
% 0.40/0.61 Number of resolutions: 44
% 0.40/0.61 Number of condensations: 0
% 0.40/0.61 Number of sub resolutions: 7
% 0.40/0.61 Number of input literals (deduplicated): 20
% 0.40/0.61 Number of grows: 6
% 0.40/0.61 Number of considered ground atoms: 345
% 0.40/0.61
% 0.40/0.61 Needed: 0:00:00.04
% 0.40/0.61
%------------------------------------------------------------------------------