%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : NLP116+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 : n004.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:15 PM UTC 2026
% Result : CounterSatisfiable 0.38s 0.64s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP116+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.34 % Computer : n004.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu May 7 12:44:48 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.38/0.64 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.64 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.64 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.64 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.64 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.64 Execution resolution_3 ended with status: satisfiable
% 0.38/0.64 Used heuristic: resolution_3
% 0.38/0.64
% 0.38/0.64 Input Clauses:
% 0.38/0.64
% 0.38/0.64 Predicates: actual_world street lonely of city hollywood_placename placename chevy white dirty old event agent present barrel down in ren1 ren2
% 0.38/0.64 Fol Constants: skc1 skc2 skc3 skc4 skc5 skc6 skc7 skc8 skc9 skc10
% 0.38/0.64 Fol Functions:
% 0.38/0.64 Problem Properties:
% 0.38/0.64 This is a Bernays Schoenfinkel problem.
% 0.38/0.64
% 0.38/0.64 After reduction: Problem Properties:
% 0.38/0.64 This is a Bernays Schoenfinkel problem.
% 0.38/0.64
% 0.38/0.64
% 0.38/0.64 Reduced Input Clauses:
% 0.38/0.64
% 0.38/0.64 Most General Atoms: ren1 actual_world(x0) chevy(x0,x3) white(x0,x3) dirty(x0,x3) old(x0,x3) event(x0,x4) agent(x0,x4,x3) present(x0,x4) barrel(x0,x4) ren2 street(x0,x1) lonely(x0,x1) of(x0,x2,x3) city(x0,x3) hollywood_placename(x0,x2) placename(x0,x2) down(x0,x4,x1) in(x0,x4,x3)
% 0.38/0.64
% 0.38/0.64 === Starting SPASS-SCL-FOL A Little Less Naive, considering 52 atoms initially, heuristics mode: resolution_3 ===
% 0.38/0.64
% 0.38/0.64 === Backtracking. Learning clause 48:8:2:[1.0,38.0,5.0,39.4,8.0,40.7,9.0,41.8,10.0,42.9,11.0,43.10,12.0,44.11,13.0,45.12,14.0,46.13,15.0,47.14,36.17,17.1]:TopTop: street(skc1,x0),lonely(skc1,x0),of(skc1,x1,skc4),hollywood_placename(skc1,x1),placename(skc1,x1),down(skc1,skc5,x0) -> ren2,ren1
% 0.38/0.64 === Backtracking. Learning clause 54:12:2:[19.0,49.0,21.0,50.4,30.0,51.11,32.0,52.13,33.0,53.14,36.17,35.1]:TopTop: street(skc6,x0),lonely(skc6,x0),of(skc6,x1,skc8),hollywood_placename(skc6,x1),placename(skc6,x1),chevy(skc6,skc8),white(skc6,skc8),dirty(skc6,skc8),old(skc6,skc8),agent(skc6,skc10,skc8),down(skc6,skc10,x0) -> ren2
% 0.38/0.64 === Conflict found: 54:12:2:[19.0,49.0,21.0,50.4,30.0,51.11,32.0,52.13,33.0,53.14,36.17,35.1]:TopTop: street(skc6,x0),lonely(skc6,x0),of(skc6,x1,skc8),hollywood_placename(skc6,x1),placename(skc6,x1),chevy(skc6,skc8),white(skc6,skc8),dirty(skc6,skc8),old(skc6,skc8),agent(skc6,skc10,skc8),down(skc6,skc10,x0) -> ren2 {x0 -> skc8, x1 -> skc1}
% 0.38/0.64 === Backtracking. Learning clause 57:9:1:[24.0,55.0,25.0,56.1,54.11,34.1]:Top: of(skc6,x0,skc8),hollywood_placename(skc6,x0),placename(skc6,x0),chevy(skc6,skc8),white(skc6,skc8),dirty(skc6,skc8),old(skc6,skc8),agent(skc6,skc10,skc8) -> ren2
% 0.38/0.64 === Backtracking. Learning clause 65:10:2:[19.0,58.0,21.0,59.2,24.0,60.5,25.0,61.6,30.0,62.11,32.0,63.13,33.0,64.14,18.17,35.1,34.1]:TopTop: of(skc6,x0,skc8),hollywood_placename(skc6,x0),placename(skc6,x0),chevy(skc6,x1),white(skc6,x1),dirty(skc6,x1),old(skc6,x1),agent(skc6,skc10,x1) -> ren1,ren2
% 0.38/0.64 === Clause set with instances from active satisfied. Growing active. New size: 60
% 0.38/0.64 === Restarting.
% 0.38/0.64 === Conflict found: 65:10:2:[19.0,58.0,21.0,59.2,24.0,60.5,25.0,61.6,30.0,62.11,32.0,63.13,33.0,64.14,18.17,35.1,34.1]:TopTop: of(skc6,x0,skc8),hollywood_placename(skc6,x0),placename(skc6,x0),chevy(skc6,x1),white(skc6,x1),dirty(skc6,x1),old(skc6,x1),agent(skc6,skc10,x1) -> ren1,ren2 {x0 -> skc1, x1 -> skc9}
% 0.38/0.64 === Backtracking. Learning clause 70:5:1:[26.0,66.3,27.0,67.4,28.0,68.5,29.0,69.6,65.8,31.1]:Top: of(skc6,x0,skc8),hollywood_placename(skc6,x0),placename(skc6,x0) -> ren1,ren2
% 0.38/0.64 === Conflict found: 48:8:2:[1.0,38.0,5.0,39.4,8.0,40.7,9.0,41.8,10.0,42.9,11.0,43.10,12.0,44.11,13.0,45.12,14.0,46.13,15.0,47.14,36.17,17.1]:TopTop: street(skc1,x0),lonely(skc1,x0),of(skc1,x1,skc4),hollywood_placename(skc1,x1),placename(skc1,x1),down(skc1,skc5,x0) -> ren2,ren1 {x0 -> skc2, x1 -> skc1}
% 0.38/0.64 === Backtracking. Learning clause 73:5:1:[2.0,71.0,3.0,72.1,48.6,16.1]:Top: of(skc1,x0,skc4),hollywood_placename(skc1,x0),placename(skc1,x0) -> ren2,ren1
% 0.38/0.64 === Clause set with instances from active satisfied. Growing active. New size: 66
% 0.38/0.64 === Restarting.
% 0.38/0.64 === Conflict found: 73:5:1:[2.0,71.0,3.0,72.1,48.6,16.1]:Top: of(skc1,x0,skc4),hollywood_placename(skc1,x0),placename(skc1,x0) -> ren2,ren1 {x0 -> skc3}
% 0.38/0.64 === Backtracking. Learning clause 74:2:0:[73.1,4.1,7.1,6.1]:: -> ren2,ren1
% 0.38/0.64 === Backtracking. Learning clause 80:12:2:[1.0,75.0,5.0,76.2,12.0,77.11,14.0,78.13,15.0,79.14,18.17,17.1]:TopTop: of(skc1,x0,skc4),hollywood_placename(skc1,x0),placename(skc1,x0),street(skc1,skc4),lonely(skc1,skc4),chevy(skc1,x1),white(skc1,x1),dirty(skc1,x1),old(skc1,x1),agent(skc1,skc5,x1),down(skc1,skc5,skc4) -> ren1
% 0.38/0.64 === Clause set with instances from active satisfied. Growing active. New size: 100
% 0.38/0.64 === Clause set with instances from active satisfied. Growing active. New size: 164
% 0.38/0.64
% 0.38/0.64 Linear Model Building succeeded.
% 0.38/0.64 SZS status Satisfiable
% 0.38/0.64
% 0.38/0.64 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.64
% 0.38/0.64 SPASS-SCL-FOL Statistics:
% 0.38/0.64 Number of learned clauses: 8
% 0.38/0.64 Number of propagations: 163
% 0.38/0.64 Number of decisions: 277
% 0.38/0.64 Number of resolutions: 11
% 0.38/0.64 Number of condensations: 0
% 0.38/0.64 Number of sub resolutions: 35
% 0.38/0.64 Number of input literals (deduplicated): 53
% 0.38/0.64 Number of grows: 4
% 0.38/0.64 Number of considered ground atoms: 164
% 0.38/0.64
% 0.38/0.64 Needed: 0:00:00.05
% 0.38/0.64
%------------------------------------------------------------------------------