↑ Up

SPASS-SCL---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : PLA002-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n003.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:31:11 PM UTC 2026

% Result   : Unsatisfiable 2.23s 1.02s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : PLA002-2 : TPTP v9.2.1. Released v1.0.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.34  % Computer : n003.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Thu May  7 12:55:27 EDT 2026
% 0.18/0.35  % CPUTime  : 
% 0.18/0.35  SPASS-SCL-FOL version:
% 0.21/0.44  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.23/1.02  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/1.02  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/1.02  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/1.02  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/1.02  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/1.02  Execution lmodel_grow ended with status: unsatisfiable
% 2.23/1.02  Used heuristic: lmodel_grow
% 2.23/1.02  
% 2.23/1.02   Input Clauses:
% 2.23/1.02  
% 2.23/1.02   Predicates: warm cold situation at 
% 2.23/1.02   Fol Constants: a b c d e f s0 
% 2.23/1.02   Fol Functions: walk drive skate climb go 
% 2.23/1.02   Problem Properties:
% 2.23/1.02   This is a full first-order problem without equality.
% 2.23/1.02  
% 2.23/1.02   After reduction:  Problem Properties:
% 2.23/1.02   This is a full first-order problem without equality.
% 2.23/1.02  
% 2.23/1.02  
% 2.23/1.02   Reduced Input Clauses:
% 2.23/1.02  
% 2.23/1.02   Most General Atoms: situation(x1) warm(x0) at(a,x0) at(b,x0) cold(x0) at(c,x0) at(d,x0) at(e,x0) at(f,x0) 
% 2.23/1.02  
% 2.23/1.02  === Starting SPASS-SCL-FOL A Little Less Naive, considering 50 atoms initially, heuristics mode: lmodel_grow ===
% 2.23/1.02  
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 63
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 80
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 93
% 2.23/1.02  === Backtracking. Learning clause 24:2:1:[23.2,17.2,4.3]:Top: at(b,x0),situation(x0) -> 
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 108
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 122
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 134
% 2.23/1.02  === Conflict found: 24:2:1:[23.2,17.2,4.3]:Top: at(b,x0),situation(x0) ->  {x0 -> climb(b,go(d,s0))}
% 2.23/1.02  === Backtracking. Learning clause 25:2:2:[24.2,19.2]:TopTop: at(b,climb(x0,x1)),situation(x1) -> 
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 147
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 161
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 175
% 2.23/1.02  === Backtracking. Learning clause 26:2:2:[23.2,18.2]:TopTop: at(a,drive(x0,x1)),situation(x1) -> 
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 185
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 190
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 196
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 201
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 207
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 213
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 219
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 225
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 237
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 246
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 254
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 259
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 266
% 2.23/1.02  === Clause set with instances from active satisfied. Growing active. New size: 273
% 2.23/1.02  === Conflict found: 24:2:1:[23.2,17.2,4.3]:Top: at(b,x0),situation(x0) ->  {x0 -> skate(b,go(c,go(a,a)))}
% 2.23/1.02  === Backtracking. Learning clause 27:4:3:[24.2,20.2,7.4,1.4,21.2]:TopTopTop: at(c,go(x0,x1)),situation(x2),situation(x1) -> warm(x2)
% 2.23/1.02  === Conflict found: 27:4:3:[24.2,20.2,7.4,1.4,21.2]:TopTopTop: at(c,go(x0,x1)),situation(x2),situation(x1) -> warm(x2) {x0 -> c, x1 -> climb(b,climb(b,a)), x2 -> go(d,s0)}
% 2.23/1.02  === Backtracking. Learning clause 28:4:2:[27.1,11.3]:TopTop: situation(x0),at(d,x1),situation(x1) -> warm(x0)
% 2.23/1.02  === Conflict found: 28:4:2:[27.1,11.3]:TopTop: situation(x0),at(d,x1),situation(x1) -> warm(x0) {x0 -> go(d,s0), x1 -> go(d,s0)}
% 2.23/1.02  
% 2.23/1.02  SZS status Unsatisfiable
% 2.23/1.02  
% 2.23/1.02  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/1.02  
% 2.23/1.02  SPASS-SCL-FOL Statistics:
% 2.23/1.02  Number of learned clauses: 5
% 2.23/1.02  Number of propagations: 442
% 2.23/1.02  Number of decisions: 469
% 2.23/1.02  Number of resolutions: 15
% 2.23/1.02  Number of condensations: 0
% 2.23/1.02  Number of sub resolutions: 0
% 2.23/1.02  Number of input literals (deduplicated): 26
% 2.23/1.02  Number of grows: 23
% 2.23/1.02  Number of considered ground atoms: 273
% 2.23/1.02  
% 2.23/1.02   Needed:       0:00:00.46
% 2.23/1.02  
%------------------------------------------------------------------------------