%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : NLP124+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n026.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:16 PM UTC 2026
% Result : CounterSatisfiable 0.64s 0.63s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP124+1 : TPTP v9.2.1. Released v2.4.0.
% 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n026.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 12:45:09 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.16/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.64/0.63 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.63 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.63 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.63 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.63 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.63 Execution resolution_1 ended with status: satisfiable
% 0.64/0.63 Used heuristic: resolution_1
% 0.64/0.63
% 0.64/0.63 Input Clauses:
% 0.64/0.63
% 0.64/0.63 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 lonely white dirty old agent present down in
% 0.64/0.63 Fol Constants: skc1 skc2 skc3 skc4 skc5 skc6
% 0.64/0.63 Fol Functions:
% 0.64/0.63 Problem Properties:
% 0.64/0.63 This is a Bernays Schoenfinkel Ramsey problem.
% 0.64/0.63
% 0.64/0.63
% 0.64/0.63 Reduced Input Clauses:
% 0.64/0.63
% 0.64/0.63 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) lonely(skc1,skc4) white(skc1,skc5) dirty(skc1,skc5) old(skc1,skc5) agent(skc1,skc6,skc5) present(skc1,skc6) down(skc1,skc6,skc4) in(skc1,skc6,skc2)
% 0.64/0.63
% 0.64/0.63 === Starting SPASS-SCL-FOL A Little Less Naive, considering 26 atoms initially, heuristics mode: resolution_1 ===
% 0.64/0.63
% 0.64/0.63 === Backtracking. Learning clause 53:1:0:[5.1,43.1]:: -> car(skc1,skc5)
% 0.64/0.63 === Backtracking. Learning clause 54:1:0:[7.1,38.1]:: -> location(skc1,skc2)
% 0.64/0.63 === Backtracking. Learning clause 55:2:2:[14.1,15.2]:TopTop: placename(x0,x1) -> relation(x0,x1)
% 0.64/0.63 === Backtracking. Learning clause 56:2:2:[21.1,22.2]:TopTop: object(x0,x1) -> thing(x0,x1)
% 0.64/0.63 === Backtracking. Learning clause 57:2:2:[20.2,34.1,22.2]:TopTop: general(x0,x1),object(x0,x1) ->
% 0.64/0.63 === Backtracking. Learning clause 58:1:0:[25.1,41.1]:: -> way(skc1,skc4)
% 0.64/0.63 === Backtracking. Learning clause 59:2:2:[27.2,33.2]:TopTop: eventuality(x0,x1),existent(x0,x1) ->
% 0.64/0.63 === Backtracking. Learning clause 60:1:0:[31.1,47.1]:: -> eventuality(skc1,skc6)
% 0.64/0.63 === Backtracking. Learning clause 62:4:1:[40.0,61.3,35.5,37.1]:Top: entity(skc1,skc2),placename(skc1,x0),of(skc1,x0,skc2) -> =(skc3,x0)
% 0.64/0.63 === CC model inconsistency. New clause to be learned: 63:1:0:TAUT:: -> =(skc1,skc1)
% 0.64/0.63 === Restarting.
% 0.64/0.63 === CC is in false state. New clause to be learned: 65:2:0:[40.0,64.1]:: =(skc1,skc3) -> placename(skc1,skc1)
% 0.64/0.63 === Restarting.
% 0.64/0.63 === CC is in false state. New clause to be learned: 66:2:0:TAUT:: =(skc3,skc1) -> =(skc1,skc3)
% 0.64/0.63 === Restarting.
% 0.64/0.63 === CC model inconsistency. New clause to be learned: 67:1:0:TAUT:: -> =(skc3,skc3)
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 68:2:2:[20.2,34.1]:TopTop: entity(x0,x1),general(x0,x1) ->
% 0.64/0.63 === CC is in false state. New clause to be learned: 69:2:0:TAUT:: =(skc1,skc3) -> =(skc3,skc1)
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 35
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 70:1:0:[4.1,53.1]:: -> vehicle(skc1,skc5)
% 0.64/0.63 === Backtracking. Learning clause 71:2:2:[10.2,57.1]:TopTop: abstraction(x0,x1),object(x0,x1) ->
% 0.64/0.63 === Backtracking. Learning clause 72:2:2:[13.1,55.2,71.1]:TopTop: placename(x0,x1),object(x0,x1) ->
% 0.64/0.63 === Backtracking. Learning clause 73:1:0:[24.1,58.1]:: -> artifact(skc1,skc4)
% 0.64/0.63 === Backtracking. Learning clause 74:1:0:[28.1,60.1]:: -> specific(skc1,skc6)
% 0.64/0.63 === Backtracking. Learning clause 75:1:0:[30.1,60.1]:: -> thing(skc1,skc6)
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 39
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 76:2:2:[8.2,72.1]:TopTop: hollywood_placename(x0,x1),object(x0,x1) ->
% 0.64/0.63 === Conflict found: 72:2:2:[13.1,55.2,71.1]:TopTop: placename(x0,x1),object(x0,x1) -> {x0 -> skc1, x1 -> skc3}
% 0.64/0.63 === Backtracking. Learning clause 77:1:0:[72.1,40.1]:: object(skc1,skc3) ->
% 0.64/0.63 === Backtracking. Learning clause 78:1:0:[34.1,74.1]:: general(skc1,skc6) ->
% 0.64/0.63 === Backtracking. Learning clause 79:1:0:[26.1,60.1]:: -> unisex(skc1,skc6)
% 0.64/0.63 === Conflict found: 59:2:2:[27.2,33.2]:TopTop: eventuality(x0,x1),existent(x0,x1) -> {x0 -> skc1, x1 -> skc6}
% 0.64/0.63 === Backtracking. Learning clause 80:1:0:[59.1,60.1]:: existent(skc1,skc6) ->
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 44
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 81:1:0:[3.1,70.1]:: -> transport(skc1,skc5)
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 45
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 82:1:0:[19.2,80.1]:: entity(skc1,skc6) ->
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 46
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 83:2:2:[13.1,55.2]:TopTop: placename(x0,x1) -> abstraction(x0,x1)
% 0.64/0.63 === Backtracking. Learning clause 84:1:0:[22.2,82.1]:: object(skc1,skc6) ->
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 48
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 85:1:0:[23.2,77.1]:: artifact(skc1,skc3) ->
% 0.64/0.63 === Backtracking. Learning clause 86:1:0:[6.2,84.1]:: location(skc1,skc6) ->
% 0.64/0.63 === Backtracking. Learning clause 87:1:0:[23.2,84.1]:: artifact(skc1,skc6) ->
% 0.64/0.63 === Backtracking. Learning clause 88:1:0:[10.2,78.1]:: abstraction(skc1,skc6) ->
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 51
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 89:1:0:[1.2,85.1]:: instrumentality(skc1,skc3) ->
% 0.64/0.63 === Backtracking. Learning clause 90:1:0:[1.2,87.1]:: instrumentality(skc1,skc6) ->
% 0.64/0.63 === Backtracking. Learning clause 91:1:0:[2.1,81.1]:: -> instrumentality(skc1,skc5)
% 0.64/0.63 === Conflict found: 83:2:2:[13.1,55.2]:TopTop: placename(x0,x1) -> abstraction(x0,x1) {x0 -> skc1, x1 -> skc6}
% 0.64/0.63 === Backtracking. Learning clause 92:1:0:[83.2,88.1]:: placename(skc1,skc6) ->
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 52
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Backtracking. Learning clause 93:1:0:[6.2,77.1]:: location(skc1,skc3) ->
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 116
% 0.64/0.63 === CC is in false state. New clause to be learned: 95:2:0:[54.0,94.1]:: =(skc1,skc2) -> location(skc1,skc1)
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 179
% 0.64/0.63 === CC is in false state. New clause to be learned: 97:2:0:[58.0,96.1]:: =(skc1,skc4) -> way(skc1,skc1)
% 0.64/0.63 === Restarting.
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 243
% 0.64/0.63 === Clause set with instances from active satisfied. Growing active. New size: 307
% 0.64/0.63 === CC is in false state. New clause to be learned: 99:2:0:[60.0,98.1]:: =(skc1,skc6) -> eventuality(skc1,skc1)
% 0.64/0.63 === Restarting.
% 0.64/0.63 === CC is in false state. New clause to be learned: 101:2:0:[37.0,100.1]:: =(skc3,skc1) -> of(skc1,skc1,skc2)
% 0.64/0.63 === Restarting.
% 0.64/0.63
% 0.64/0.63 Linear Model Building succeeded.
% 0.64/0.63 SZS status Satisfiable
% 0.64/0.63
% 0.64/0.63 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.63
% 0.64/0.63 SPASS-SCL-FOL Statistics:
% 0.64/0.63 Number of learned clauses: 34
% 0.64/0.63 Number of propagations: 1657
% 0.64/0.63 Number of decisions: 377
% 0.64/0.63 Number of resolutions: 36
% 0.64/0.63 Number of condensations: 0
% 0.64/0.63 Number of sub resolutions: 6
% 0.64/0.63 Number of input literals (deduplicated): 49
% 0.64/0.63 Number of grows: 12
% 0.64/0.63 Number of considered ground atoms: 307
% 0.64/0.63
% 0.64/0.63 Needed: 0:00:00.07
% 0.64/0.63
%------------------------------------------------------------------------------