↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : NLP127-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 : n024.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   : Satisfiable 0.48s 0.47s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem  : NLP127-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.06  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.24  % Computer : n024.cluster.edu
% 0.08/0.24  % Model    : x86_64 x86_64
% 0.08/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.24  % Memory   : 8042.1875MB
% 0.08/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.24  % CPULimit : 300
% 0.08/0.24  % WCLimit  : 300
% 0.08/0.24  % DateTime : Thu May  7 07:45:12 EDT 2026
% 0.08/0.24  % CPUTime  : 
% 0.08/0.24  SPASS-SCL-FOL version:
% 0.08/0.30  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.48/0.47  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.47  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.47  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.47  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.47  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.47  Execution lmodel_grow ended with status: satisfiable
% 0.48/0.47  Used heuristic: lmodel_grow
% 0.48/0.47  
% 0.48/0.47   Input Clauses:
% 0.48/0.47  
% 0.48/0.47   Predicates: barrel event eventuality thing singleton specific nonexistent unisex street way artifact object entity existent nonliving impartial placename relname relation abstraction nonhuman general hollywood_placename city location chevy car vehicle transport instrumentality of = actual_world lonely present white dirty old in down agent 
% 0.48/0.47   Fol Constants: skc6 skc11 skc10 skc8 skc9 skc7 
% 0.48/0.47   Fol Functions: 
% 0.48/0.47   Problem Properties:
% 0.48/0.47   This is a Bernays Schoenfinkel Ramsey problem.
% 0.48/0.47  
% 0.48/0.47  
% 0.48/0.47   Reduced Input Clauses:
% 0.48/0.47  
% 0.48/0.47   Most General Atoms: barrel(x0,x1) event(x0,x1) eventuality(x0,x1) thing(x0,x1) singleton(x0,x1) specific(x0,x1) nonexistent(x0,x1) unisex(x0,x1) street(x0,x1) way(x0,x1) artifact(x0,x1) object(x0,x1) existent(x0,x1) nonliving(x0,x1) impartial(x0,x1) relname(x0,x1) relation(x0,x1) abstraction(x0,x1) nonhuman(x0,x1) general(x0,x1) hollywood_placename(x0,x1) city(x0,x1) location(x0,x1) chevy(x0,x1) car(x0,x1) vehicle(x0,x1) transport(x0,x1) instrumentality(x0,x1) placename(x0,x2) of(x0,x1,x3) entity(x0,x3) =(x2,x1) actual_world(skc6) lonely(skc6,skc8) present(skc6,skc7) white(skc6,skc11) dirty(skc6,skc11) old(skc6,skc11) in(skc6,skc7,skc10) down(skc6,skc7,skc8) agent(skc6,skc7,skc11) 
% 0.48/0.47  
% 0.48/0.47  === Starting SPASS-SCL-FOL A Little Less Naive, considering 81 atoms initially, heuristics mode: lmodel_grow ===
% 0.48/0.47  
% 0.48/0.47  === CC is in false state. New clause to be learned: 54:2:0:[37.0,53.1]:: =(skc6,skc11) -> chevy(skc6,skc6)
% 0.48/0.47  === Restarting.
% 0.48/0.47  === CC model inconsistency. New clause to be learned: 55:4:0:TAUT:: =(skc7,skc6),=(skc11,skc6),barrel(skc11,skc7) -> barrel(skc6,skc11)
% 0.48/0.47  === Restarting.
% 0.48/0.47  === CC is in false state. New clause to be learned: 56:2:0:TAUT:: =(skc11,skc6) -> =(skc6,skc11)
% 0.48/0.47  === Restarting.
% 0.48/0.47  === CC is in false state. New clause to be learned: 57:1:0:TAUT::  -> =(skc6,skc6)
% 0.48/0.47  === Restarting.
% 0.48/0.47  === CC model inconsistency. New clause to be learned: 58:1:0:TAUT::  -> =(skc7,skc7)
% 0.48/0.47  === Restarting.
% 0.48/0.47  === CC is in false state. New clause to be learned: 60:2:0:[45.0,59.1]:: =(skc7,skc6) -> barrel(skc6,skc6)
% 0.48/0.47  === Restarting.
% 0.48/0.47  === CC model inconsistency. New clause to be learned: 61:1:0:TAUT::  -> =(skc11,skc11)
% 0.48/0.47  === Restarting.
% 0.48/0.47  === Backtracking. Learning clause 62:2:2:[30.1,29.2,31.1,32.1]:TopTop: car(x0,x1) -> artifact(x0,x1)
% 0.48/0.47  === CC is in false state. New clause to be learned: 63:3:0:TAUT:: =(skc6,skc11),way(skc6,skc11) -> way(skc6,skc6)
% 0.48/0.47  === Restarting.
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 93
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 96
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 99
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 104
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 108
% 0.48/0.47  === Backtracking. Learning clause 64:2:2:[2.1,1.2,6.1]:TopTop: barrel(x0,x1) -> nonexistent(x0,x1)
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 113
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 115
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 122
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 135
% 0.48/0.47  === Backtracking. Learning clause 65:2:2:[9.1,8.2,10.1,11.1,14.1,34.2]:TopTop: street(x0,x1),nonexistent(x0,x1) -> 
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 148
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 162
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 171
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 180
% 0.48/0.47  === Backtracking. Learning clause 66:2:2:[11.2,14.1]:TopTop: object(x0,x1) -> existent(x0,x1)
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 184
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 188
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 191
% 0.48/0.47  === Backtracking. Learning clause 67:2:2:[13.1,11.2,33.2,27.2]:TopTop: general(x0,x1),location(x0,x1) -> 
% 0.48/0.47  === Clause set with instances from active satisfied. Growing active. New size: 194
% 0.48/0.47  
% 0.48/0.47  Linear Model Building succeeded.
% 0.48/0.47  SZS status Satisfiable
% 0.48/0.47  
% 0.48/0.47  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.47  
% 0.48/0.47  SPASS-SCL-FOL Statistics:
% 0.48/0.47  Number of learned clauses: 5
% 0.48/0.47  Number of propagations: 1048
% 0.48/0.47  Number of decisions: 318
% 0.48/0.47  Number of resolutions: 14
% 0.48/0.47  Number of condensations: 0
% 0.48/0.47  Number of sub resolutions: 2
% 0.48/0.47  Number of input literals (deduplicated): 49
% 0.48/0.47  Number of grows: 17
% 0.48/0.47  Number of considered ground atoms: 194
% 0.48/0.47  
% 0.48/0.47   Needed:       0:00:00.06
% 0.48/0.47  
%------------------------------------------------------------------------------