↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : LCL079-1 : 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 : n018.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:27:21 PM UTC 2026

% Result   : Unsatisfiable 2.93s 1.10s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL079-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.33  % Computer : n018.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit : 300
% 0.15/0.33  % WCLimit  : 300
% 0.15/0.33  % DateTime : Thu May  7 12:27:02 EDT 2026
% 0.15/0.33  % CPUTime  : 
% 0.15/0.34  SPASS-SCL-FOL version:
% 0.20/0.41  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.93/1.10  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.10  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.10  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.10  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.10  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.10  Execution resolution_3 ended with status: unsatisfiable
% 2.93/1.10  Used heuristic: resolution_3
% 2.93/1.10  
% 2.93/1.10   Input Clauses:
% 2.93/1.10  
% 2.93/1.10   Predicates: is_a_theorem 
% 2.93/1.10   Fol Constants: a b c 
% 2.93/1.10   Fol Functions: implies not 
% 2.93/1.10   Problem Properties:
% 2.93/1.10   This is a full first-order problem without equality.
% 2.93/1.10  
% 2.93/1.10   After reduction:  Problem Properties:
% 2.93/1.10   This is a full first-order problem without equality.
% 2.93/1.10  
% 2.93/1.10  
% 2.93/1.10   Reduced Input Clauses:
% 2.93/1.10  
% 2.93/1.10   Most General Atoms: is_a_theorem(x1) 
% 2.93/1.10  
% 2.93/1.10  === Starting SPASS-SCL-FOL A Little Less Naive, considering 11 atoms initially, heuristics mode: resolution_3 ===
% 2.93/1.10  
% 2.93/1.10  === Backtracking. Learning clause 8:2:0:[1.1,5.1]:: is_a_theorem(a) -> is_a_theorem(b)
% 2.93/1.10  === Backtracking. Learning clause 9:2:0:[1.1,6.1]:: is_a_theorem(b) -> is_a_theorem(c)
% 2.93/1.10  === Backtracking. Learning clause 10:2:2:[1.1,2.1]:TopTop: is_a_theorem(x0) -> is_a_theorem(implies(x1,x0))
% 2.93/1.10  === Backtracking. Learning clause 11:2:2:[1.1,4.1]:TopTop: is_a_theorem(implies(x0,x1)) -> is_a_theorem(implies(not(x1),not(x0)))
% 2.93/1.10  === Clause set with instances from active satisfied. Growing active. New size: 13
% 2.93/1.10  === Restarting.
% 2.93/1.10  === Conflict found: 10:2:2:[1.1,2.1]:TopTop: is_a_theorem(x0) -> is_a_theorem(implies(x1,x0)) {x0 -> c, x1 -> a}
% 2.93/1.10  === Backtracking. Learning clause 12:1:0:[10.2,7.1,9.2,8.2]:: is_a_theorem(a) -> 
% 2.93/1.10  === Backtracking. Learning clause 13:2:3:[1.1,3.1]:TopTopTop: is_a_theorem(implies(x0,implies(x1,x2))) -> is_a_theorem(implies(implies(x0,x1),implies(x0,x2)))
% 2.93/1.10  === Clause set with instances from active satisfied. Growing active. New size: 65
% 2.93/1.10  === Conflict found: 13:2:3:[1.1,3.1]:TopTopTop: is_a_theorem(implies(x0,implies(x1,x2))) -> is_a_theorem(implies(implies(x0,x1),implies(x0,x2))) {x0 -> a, x1 -> b, x2 -> a}
% 2.93/1.10  === Backtracking. Learning clause 14:1:0:[13.2,1.1,2.1,5.1]::  -> is_a_theorem(implies(a,a))
% 2.93/1.10  === Clause set with instances from active satisfied. Growing active. New size: 129
% 2.93/1.10  === Clause set with instances from active satisfied. Growing active. New size: 193
% 2.93/1.10  === Clause set with instances from active satisfied. Growing active. New size: 257
% 2.93/1.10  
% 2.93/1.10  SZS status Unsatisfiable
% 2.93/1.10  
% 2.93/1.10  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.10  
% 2.93/1.10  SPASS-SCL-FOL Statistics:
% 2.93/1.10  Number of learned clauses: 7
% 2.93/1.10  Number of propagations: 259
% 2.93/1.10  Number of decisions: 48
% 2.93/1.10  Number of resolutions: 17
% 2.93/1.10  Number of condensations: 0
% 2.93/1.10  Number of sub resolutions: 0
% 2.93/1.10  Number of input literals (deduplicated): 8
% 2.93/1.10  Number of grows: 5
% 2.93/1.10  Number of considered ground atoms: 257
% 2.93/1.10  
% 2.93/1.10   Needed:       0:00:00.56
% 2.93/1.10  
%------------------------------------------------------------------------------