%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : NLP128+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n031.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:29:17 PM UTC 2026
% Result : CounterSatisfiable 0.80s 0.66s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NLP128+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.33 % Computer : n031.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Thu May 7 12:47:26 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.33 SPASS-SCL-FOL version:
% 0.18/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.80/0.66 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/0.66 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/0.66 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/0.66 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/0.66 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/0.66 Execution resolution_3 ended with status: satisfiable
% 0.80/0.66 Used heuristic: resolution_3
% 0.80/0.66
% 0.80/0.66 Input Clauses:
% 0.80/0.66
% 0.80/0.66 Predicates: instrumentality artifact transport vehicle car chevy location object city hollywood_placename placename abstraction unisex general nonhuman thing relation relname impartial nonliving entity existent specific way street eventuality nonexistent singleton event barrel of = actual_world white dirty old lonely agent present down in
% 0.80/0.66 Fol Constants: skc1 skc2 skc3 skc4 skc5
% 0.80/0.66 Fol Functions:
% 0.80/0.66 Problem Properties:
% 0.80/0.66 This is a Bernays Schoenfinkel Ramsey problem.
% 0.80/0.66
% 0.80/0.66
% 0.80/0.66 Reduced Input Clauses:
% 0.80/0.66
% 0.80/0.66 Most General Atoms: instrumentality(x0,x1) artifact(x0,x1) transport(x0,x1) vehicle(x0,x1) car(x0,x1) chevy(x0,x1) location(x0,x1) object(x0,x1) city(x0,x1) hollywood_placename(x0,x1) abstraction(x0,x1) unisex(x0,x1) general(x0,x1) nonhuman(x0,x1) thing(x0,x1) relation(x0,x1) relname(x0,x1) impartial(x0,x1) nonliving(x0,x1) entity(x0,x1) existent(x0,x1) specific(x0,x1) way(x0,x1) street(x0,x1) eventuality(x0,x1) nonexistent(x0,x1) singleton(x0,x1) event(x0,x1) barrel(x0,x1) placename(x0,x3) of(x0,x3,x1) =(x3,x2) actual_world(skc1) white(skc1,skc3) dirty(skc1,skc3) old(skc1,skc3) lonely(skc1,skc4) agent(skc1,skc5,skc3) present(skc1,skc5) down(skc1,skc5,skc4) in(skc1,skc5,skc3)
% 0.80/0.66
% 0.80/0.66 === Starting SPASS-SCL-FOL A Little Less Naive, considering 26 atoms initially, heuristics mode: resolution_3 ===
% 0.80/0.66
% 0.80/0.66 === Backtracking. Learning clause 53:1:0:[5.1,41.1]:: -> car(skc1,skc3)
% 0.80/0.66 === Backtracking. Learning clause 54:1:0:[7.1,38.1]:: -> location(skc1,skc3)
% 0.80/0.66 === Backtracking. Learning clause 55:2:2:[14.1,15.2]:TopTop: placename(x0,x1) -> relation(x0,x1)
% 0.80/0.66 === Backtracking. Learning clause 56:2:2:[21.1,22.2]:TopTop: object(x0,x1) -> thing(x0,x1)
% 0.80/0.66 === Backtracking. Learning clause 57:2:2:[20.2,34.1,22.2]:TopTop: general(x0,x1),object(x0,x1) ->
% 0.80/0.66 === Backtracking. Learning clause 58:1:0:[25.1,45.1]:: -> way(skc1,skc4)
% 0.80/0.66 === Backtracking. Learning clause 59:2:2:[27.2,33.2]:TopTop: eventuality(x0,x1),existent(x0,x1) ->
% 0.80/0.66 === Backtracking. Learning clause 60:1:0:[31.1,47.1]:: -> eventuality(skc1,skc5)
% 0.80/0.66 === Backtracking. Learning clause 62:4:1:[40.0,61.3,35.5,37.1]:Top: entity(skc1,skc3),placename(skc1,x0),of(skc1,x0,skc3) -> =(skc2,x0)
% 0.80/0.66 === CC model inconsistency. New clause to be learned: 63:1:0:TAUT:: -> =(skc1,skc1)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC model inconsistency. New clause to be learned: 64:1:0:TAUT:: -> =(skc2,skc2)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 35
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Backtracking. Learning clause 65:1:0:[4.1,53.1]:: -> vehicle(skc1,skc3)
% 0.80/0.66 === Backtracking. Learning clause 66:2:2:[13.1,55.2]:TopTop: placename(x0,x1) -> abstraction(x0,x1)
% 0.80/0.66 === Backtracking. Learning clause 67:2:2:[10.2,57.1,66.2]:TopTop: object(x0,x1),placename(x0,x1) ->
% 0.80/0.66 === Backtracking. Learning clause 68:1:0:[24.1,58.1]:: -> artifact(skc1,skc4)
% 0.80/0.66 === Backtracking. Learning clause 69:1:0:[26.1,60.1]:: -> unisex(skc1,skc5)
% 0.80/0.66 === Backtracking. Learning clause 70:1:0:[28.1,60.1]:: -> specific(skc1,skc5)
% 0.80/0.66 === Backtracking. Learning clause 71:1:0:[30.1,60.1]:: -> thing(skc1,skc5)
% 0.80/0.66 === Conflict found: 59:2:2:[27.2,33.2]:TopTop: eventuality(x0,x1),existent(x0,x1) -> {x0 -> skc1, x1 -> skc5}
% 0.80/0.66 === Backtracking. Learning clause 72:1:0:[59.1,60.1]:: existent(skc1,skc5) ->
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 40
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Backtracking. Learning clause 73:1:0:[3.1,65.1]:: -> transport(skc1,skc3)
% 0.80/0.66 === Backtracking. Learning clause 74:2:2:[8.2,67.2]:TopTop: hollywood_placename(x0,x1),object(x0,x1) ->
% 0.80/0.66 === Conflict found: 67:2:2:[10.2,57.1,66.2]:TopTop: object(x0,x1),placename(x0,x1) -> {x0 -> skc1, x1 -> skc2}
% 0.80/0.66 === Backtracking. Learning clause 75:1:0:[67.2,40.1]:: object(skc1,skc2) ->
% 0.80/0.66 === Backtracking. Learning clause 76:1:0:[19.2,72.1]:: entity(skc1,skc5) ->
% 0.80/0.66 === Backtracking. Learning clause 77:1:0:[34.1,70.1]:: general(skc1,skc5) ->
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 46
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Backtracking. Learning clause 78:1:0:[2.1,73.1]:: -> instrumentality(skc1,skc3)
% 0.80/0.66 === Backtracking. Learning clause 79:1:0:[6.2,75.1]:: location(skc1,skc2) ->
% 0.80/0.66 === Backtracking. Learning clause 80:1:0:[23.2,75.1]:: artifact(skc1,skc2) ->
% 0.80/0.66 === Backtracking. Learning clause 81:1:0:[10.2,77.1]:: abstraction(skc1,skc5) ->
% 0.80/0.66 === Backtracking. Learning clause 82:1:0:[22.2,76.1]:: object(skc1,skc5) ->
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 50
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Backtracking. Learning clause 83:1:0:[1.2,80.1]:: instrumentality(skc1,skc2) ->
% 0.80/0.66 === Backtracking. Learning clause 84:1:0:[6.2,82.1]:: location(skc1,skc5) ->
% 0.80/0.66 === Backtracking. Learning clause 85:1:0:[23.2,82.1]:: artifact(skc1,skc5) ->
% 0.80/0.66 === Conflict found: 66:2:2:[13.1,55.2]:TopTop: placename(x0,x1) -> abstraction(x0,x1) {x0 -> skc1, x1 -> skc5}
% 0.80/0.66 === Backtracking. Learning clause 86:1:0:[66.2,81.1]:: placename(skc1,skc5) ->
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 52
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Backtracking. Learning clause 87:1:0:[1.2,85.1]:: instrumentality(skc1,skc5) ->
% 0.80/0.66 === Backtracking. Learning clause 88:1:0:[8.2,86.1]:: hollywood_placename(skc1,skc5) ->
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 116
% 0.80/0.66 === CC is in false state. New clause to be learned: 90:2:0:[53.0,89.1]:: =(skc1,skc3) -> car(skc1,skc1)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 92:2:0:[75.0,91.2]:: =(skc2,skc1),object(skc2,skc1) ->
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 93:3:0:TAUT:: =(skc2,skc1),existent(skc1,skc2) -> existent(skc1,skc1)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 94:3:0:TAUT:: =(skc1,skc2),impartial(skc1,skc1) -> impartial(skc1,skc2)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 95:3:0:TAUT:: =(skc2,skc1),nonliving(skc1,skc1) -> nonliving(skc1,skc2)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 179
% 0.80/0.66 === Backtracking. Learning clause 96:2:2:[10.2,57.1]:TopTop: abstraction(x0,x1),object(x0,x1) ->
% 0.80/0.66 === CC is in false state. New clause to be learned: 97:3:0:TAUT:: =(skc1,skc2),thing(skc1,skc2) -> thing(skc2,skc1)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 98:3:0:TAUT:: =(skc1,skc2),unisex(skc1,skc2) -> unisex(skc2,skc1)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 100:3:0:[58.0,99.2]:: =(skc1,skc4),=(skc1,skc2) -> way(skc1,skc2)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 101:3:0:TAUT:: =(skc2,skc1),of(skc1,skc1,skc2) -> of(skc1,skc1,skc1)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 103:2:0:[75.0,102.2]:: =(skc2,skc1),object(skc2,skc2) ->
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 104:3:0:TAUT:: =(skc2,skc1),nonliving(skc2,skc1) -> nonliving(skc1,skc2)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 105:3:0:TAUT:: =(skc1,skc2),nonexistent(skc1,skc1) -> nonexistent(skc1,skc2)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 106:3:0:TAUT:: =(skc2,skc1),entity(skc2,skc2) -> entity(skc1,skc2)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Backtracking. Learning clause 107:2:2:[22.2,19.1,6.2,33.1]:TopTop: location(x0,x1),nonexistent(x0,x1) ->
% 0.80/0.66 === CC is in false state. New clause to be learned: 109:2:0:[58.0,108.1]:: =(skc1,skc4) -> way(skc1,skc1)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === CC is in false state. New clause to be learned: 110:3:0:TAUT:: =(skc2,skc1),impartial(skc2,skc1) -> impartial(skc1,skc2)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 230
% 0.80/0.66 === Backtracking. Learning clause 111:2:2:[20.2,34.1]:TopTop: entity(x0,x1),general(x0,x1) ->
% 0.80/0.66 === CC is in false state. New clause to be learned: 112:3:0:TAUT:: =(skc1,skc2),existent(skc2,skc2) -> existent(skc1,skc1)
% 0.80/0.66 === Restarting.
% 0.80/0.66 === Clause set with instances from active satisfied. Growing active. New size: 294
% 0.80/0.66
% 0.80/0.66 Linear Model Building succeeded.
% 0.80/0.66 SZS status Satisfiable
% 0.80/0.66
% 0.80/0.66 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/0.66
% 0.80/0.66 SPASS-SCL-FOL Statistics:
% 0.80/0.66 Number of learned clauses: 36
% 0.80/0.66 Number of propagations: 3186
% 0.80/0.66 Number of decisions: 441
% 0.80/0.66 Number of resolutions: 40
% 0.80/0.66 Number of condensations: 0
% 0.80/0.66 Number of sub resolutions: 6
% 0.80/0.66 Number of input literals (deduplicated): 49
% 0.80/0.66 Number of grows: 9
% 0.80/0.66 Number of considered ground atoms: 294
% 0.80/0.66
% 0.80/0.66 Needed: 0:00:00.10
% 0.80/0.66
%------------------------------------------------------------------------------