↑ Up

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

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

% Computer : n001.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:30 PM UTC 2026

% Result   : Unsatisfiable 0.39s 0.90s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL190-1 : TPTP v9.2.1. Released v1.1.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34  % Computer : n001.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Thu May  7 12:29:04 EDT 2026
% 0.17/0.35  % CPUTime  : 
% 0.17/0.35  SPASS-SCL-FOL version:
% 0.19/0.44  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.39/0.90  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.90  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.90  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.90  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.90  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.90  Execution resolution_1 ended with status: unsatisfiable
% 0.39/0.90  Used heuristic: resolution_1
% 0.39/0.90  
% 0.39/0.90   Input Clauses:
% 0.39/0.90  
% 0.39/0.90   Predicates: axiom theorem 
% 0.39/0.90   Fol Constants: p q r 
% 0.39/0.90   Fol Functions: or not 
% 0.39/0.90   Problem Properties:
% 0.39/0.90   This is a full first-order problem without equality.
% 0.39/0.90  
% 0.39/0.90   After reduction:  Problem Properties:
% 0.39/0.90   This is a full first-order problem without equality.
% 0.39/0.90  
% 0.39/0.90  
% 0.39/0.90   Reduced Input Clauses:
% 0.39/0.90  
% 0.39/0.90   Most General Atoms: axiom(x0) theorem(x1) 
% 0.39/0.90  
% 0.39/0.90  === Starting SPASS-SCL-FOL A Little Less Naive, considering 19 atoms initially, heuristics mode: resolution_1 ===
% 0.39/0.90  
% 0.39/0.90  === Backtracking. Learning clause 10:2:1:[7.1,1.1]:Top: theorem(or(x0,x0)) -> theorem(x0)
% 0.39/0.90  === Backtracking. Learning clause 11:1:0:[6.2,9.1]:: axiom(or(not(or(p,or(q,r))),or(p,or(r,q)))) -> 
% 0.39/0.90  === Backtracking. Learning clause 12:2:1:[8.3,9.1]:Top: axiom(or(not(or(p,or(q,r))),x0)),theorem(or(not(x0),or(p,or(r,q)))) -> 
% 0.39/0.90  === Backtracking. Learning clause 13:2:4:[8.1,5.1]:TopTopTopTop: theorem(or(not(or(not(or(x0,x1)),or(x0,x2))),x3)) -> theorem(or(not(or(not(x1),x2)),x3))
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 24
% 0.39/0.90  === Restarting.
% 0.39/0.90  === Backtracking. Learning clause 14:2:1:[6.2,10.1]:Top: axiom(or(x0,x0)) -> theorem(x0)
% 0.39/0.90  === Backtracking. Learning clause 15:1:1:[6.2,8.2,1.1,2.1]:Top:  -> theorem(or(not(x0),x0))
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 27
% 0.39/0.90  === Restarting.
% 0.39/0.90  === Backtracking. Learning clause 16:2:2:[7.1,2.1]:TopTop: theorem(x0) -> theorem(or(x1,x0))
% 0.39/0.90  === Conflict found: 12:2:1:[8.3,9.1]:Top: axiom(or(not(or(p,or(q,r))),x0)),theorem(or(not(x0),or(p,or(r,q)))) ->  {x0 -> p}
% 0.39/0.90  === Backtracking. Learning clause 17:2:1:[12.2,6.2]:Top: axiom(or(not(or(p,or(q,r))),x0)),axiom(or(not(x0),or(p,or(r,q)))) -> 
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 34
% 0.39/0.90  === Restarting.
% 0.39/0.90  === Conflict found: 17:2:1:[12.2,6.2]:Top: axiom(or(not(or(p,or(q,r))),x0)),axiom(or(not(x0),or(p,or(r,q)))) ->  {x0 -> or(r,or(p,q))}
% 0.39/0.90  === Backtracking. Learning clause 18:1:0:[17.2,4.1]:: axiom(or(not(or(p,or(q,r))),or(r,or(p,q)))) -> 
% 0.39/0.90  === Conflict found: 17:2:1:[12.2,6.2]:Top: axiom(or(not(or(p,or(q,r))),x0)),axiom(or(not(x0),or(p,or(r,q)))) ->  {x0 -> or(or(r,q),p)}
% 0.39/0.90  === Backtracking. Learning clause 19:1:0:[17.2,3.1]:: axiom(or(not(or(p,or(q,r))),or(or(r,q),p))) -> 
% 0.39/0.90  === Conflict found: 16:2:2:[7.1,2.1]:TopTop: theorem(x0) -> theorem(or(x1,x0)) {x0 -> or(p,or(r,q)), x1 -> not(or(p,or(q,r)))}
% 0.39/0.90  === Backtracking. Learning clause 20:1:0:[16.2,9.1]:: theorem(or(p,or(r,q))) -> 
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 36
% 0.39/0.90  === Restarting.
% 0.39/0.90  === Conflict found: 17:2:1:[12.2,6.2]:Top: axiom(or(not(or(p,or(q,r))),x0)),axiom(or(not(x0),or(p,or(r,q)))) ->  {x0 -> or(or(p,or(r,q)),or(p,or(r,q)))}
% 0.39/0.90  === Backtracking. Learning clause 21:1:0:[17.2,1.1]:: axiom(or(not(or(p,or(q,r))),or(or(p,or(r,q)),or(p,or(r,q))))) -> 
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 100
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 164
% 0.39/0.90  === Backtracking. Learning clause 22:1:0:[7.2,16.2,3.1,20.1]:: theorem(p) -> 
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 228
% 0.39/0.90  === Backtracking. Learning clause 23:4:3:[7.2,7.3]:TopTopTop: axiom(or(not(x0),x1)),axiom(or(not(x2),x0)),theorem(x2) -> theorem(x1)
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 292
% 0.39/0.90  === Clause set with instances from active satisfied. Growing active. New size: 356
% 0.39/0.90  
% 0.39/0.90  SZS status Unsatisfiable
% 0.39/0.90  
% 0.39/0.90  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.90  
% 0.39/0.90  SPASS-SCL-FOL Statistics:
% 0.39/0.90  Number of learned clauses: 14
% 0.39/0.90  Number of propagations: 646
% 0.39/0.90  Number of decisions: 215
% 0.39/0.90  Number of resolutions: 22
% 0.39/0.90  Number of condensations: 0
% 0.39/0.90  Number of sub resolutions: 0
% 0.39/0.90  Number of input literals (deduplicated): 10
% 0.39/0.90  Number of grows: 9
% 0.39/0.90  Number of considered ground atoms: 356
% 0.39/0.90  
% 0.39/0.90   Needed:       0:00:00.31
% 0.39/0.90  
%------------------------------------------------------------------------------