↑ Up

SPASS-SCL---0.1.SAT-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : NLP135-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 : 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:29:18 PM UTC 2026

% Result   : Satisfiable 3.80s 1.25s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NLP135-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.14/0.33  % Computer : n002.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 300
% 0.14/0.33  % DateTime : Thu May  7 12:45:32 EDT 2026
% 0.14/0.33  % CPUTime  : 
% 0.14/0.33  SPASS-SCL-FOL version:
% 0.17/0.42  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.80/1.25  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.80/1.25  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.80/1.25  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.80/1.25  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.80/1.25  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.80/1.25  Execution lmodel_grow ended with status: satisfiable
% 3.80/1.25  Used heuristic: lmodel_grow
% 3.80/1.25  
% 3.80/1.25   Input Clauses:
% 3.80/1.25  
% 3.80/1.25   Predicates: actual_world ssSkC0 city chevy white dirty old placename hollywood_placename event present barrel lonely street group two ssSkP1 ssSkP0 agent in of down frontseat member fellow young state be 
% 3.80/1.25   Fol Constants: skc42 skc12 skc46 skc47 skc44 skc45 skc43 skc16 skc17 skc14 skc15 skc13 
% 3.80/1.25   Fol Functions: skf14 skf19 skf16 skf15 skf11 skf10 skf21 skf9 
% 3.80/1.25   Problem Properties:
% 3.80/1.25   This is a full first-order problem without equality.
% 3.80/1.25  
% 3.80/1.25   After reduction:  Problem Properties:
% 3.80/1.25   This is a full first-order problem without equality.
% 3.80/1.25  
% 3.80/1.25  
% 3.80/1.25   Reduced Input Clauses:
% 3.80/1.25  
% 3.80/1.25   Most General Atoms: ssSkC0 fellow(skc42,x0) young(skc42,x0) fellow(skc12,x0) young(skc12,x0) member(x0,x1,x2) frontseat(x0,x1) be(x0,skf16(x0,x1),x1,skf15(x0,x1)) be(x0,skf11(x0,x1),x1,skf10(x1,x0)) be(x0,x3,skf14(x0,x2),x1) be(x0,x2,skf19(x0,x3),x1) state(x0,x2) city(x0,x1) chevy(x0,x1) white(x0,x1) dirty(x0,x1) old(x0,x1) agent(x0,x2,x1) in(x0,x2,x1) placename(x0,x3) hollywood_placename(x0,x3) of(x0,x3,x1) event(x0,x2) present(x0,x2) barrel(x0,x2) down(x0,x2,x4) lonely(x0,x4) street(x0,x4) actual_world(x0) young(x0,skf21(x0,x5)) fellow(x0,skf21(x0,x5)) group(x0,x6) two(x0,x6) ssSkP0(x6,x0) young(x0,skf9(x0,x5)) fellow(x0,skf9(x0,x5)) ssSkP1(x6,x0) 
% 3.80/1.25  
% 3.80/1.25  === Starting SPASS-SCL-FOL A Little Less Naive, considering 91 atoms initially, heuristics mode: lmodel_grow ===
% 3.80/1.25  
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 103
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 107
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 115
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 128
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 137
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 152
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 158
% 3.80/1.25  === Backtracking. Learning clause 61:3:3:[42.2,50.1]:TopTopTop: ssSkP1(x0,x1) -> ssSkP0(x0,x1),in(x1,skf15(x1,x2),skf15(x1,x2))
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 170
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 180
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 190
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 200
% 3.80/1.25  === Backtracking. Learning clause 62:24:8:[42.2,49.1,59.21]:TopTopTopTopTopTopTopTop: ssSkP1(x0,x1),city(x1,x2),chevy(x1,x2),white(x1,x2),dirty(x1,x2),old(x1,x2),agent(x1,x3,x2),in(x1,x3,x2),placename(x1,x4),hollywood_placename(x1,x4),of(x1,x4,x2),event(x1,x3),present(x1,x3),barrel(x1,x3),down(x1,x3,x5),lonely(x1,x5),street(x1,x5),young(x1,skf21(x1,x6)),fellow(x1,skf21(x1,x6)),group(x1,x0),two(x1,x0),actual_world(x1) -> frontseat(x1,skf15(x1,x7)),ssSkC0
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 211
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 223
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 229
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 239
% 3.80/1.25  === Backtracking. Learning clause 63:3:3:[49.1,42.2]:TopTopTop: ssSkP1(x0,x1) -> frontseat(x1,skf15(x1,x2)),ssSkP0(x0,x1)
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 244
% 3.80/1.25  === Backtracking. Learning clause 64:3:3:[48.1,42.2]:TopTopTop: ssSkP1(x0,x1) -> state(x1,skf16(x1,x2)),ssSkP0(x0,x1)
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 247
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 248
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 250
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 251
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 253
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 256
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 260
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 262
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 264
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 266
% 3.80/1.25  === Clause set with instances from active satisfied. Growing active. New size: 267
% 3.80/1.25  
% 3.80/1.25  Linear Model Building succeeded.
% 3.80/1.25  SZS status Satisfiable
% 3.80/1.25  
% 3.80/1.25  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.80/1.25  
% 3.80/1.25  SPASS-SCL-FOL Statistics:
% 3.80/1.25  Number of learned clauses: 4
% 3.80/1.25  Number of propagations: 194
% 3.80/1.25  Number of decisions: 673
% 3.80/1.25  Number of resolutions: 5
% 3.80/1.25  Number of condensations: 0
% 3.80/1.25  Number of sub resolutions: 0
% 3.80/1.25  Number of input literals (deduplicated): 91
% 3.80/1.25  Number of grows: 27
% 3.80/1.25  Number of considered ground atoms: 267
% 3.80/1.25  
% 3.80/1.25   Needed:       0:00:00.75
% 3.80/1.25  
%------------------------------------------------------------------------------