↑ Up

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

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

% Result   : Unsatisfiable 2.29s 1.01s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : TOP005-2 : TPTP v9.2.1. Released v1.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34  % Computer : n018.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Thu May  7 14:01:32 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.16/0.34  SPASS-SCL-FOL version:
% 0.20/0.43  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.29/1.01  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.29/1.01  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.29/1.01  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.29/1.01  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.29/1.01  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.29/1.01  Execution resolution_1 ended with status: unsatisfiable
% 2.29/1.01  Used heuristic: resolution_1
% 2.29/1.01  
% 2.29/1.01   Input Clauses:
% 2.29/1.01  
% 2.29/1.01   Predicates: element_of_set element_of_collection subset_sets subset_collections 
% 2.29/1.01   Fol Constants: g f 
% 2.29/1.01   Fol Functions: union_of_members f1 top_of_basis f10 f11 
% 2.29/1.01   Problem Properties:
% 2.29/1.01   This is a full first-order problem without equality.
% 2.29/1.01  
% 2.29/1.01   After reduction:  Problem Properties:
% 2.29/1.01   This is a full first-order problem without equality.
% 2.29/1.01  
% 2.29/1.01  
% 2.29/1.01   Reduced Input Clauses:
% 2.29/1.01  
% 2.29/1.01   Most General Atoms: element_of_set(x0,x2) subset_sets(x0,x1) subset_collections(x0,x1) element_of_collection(x2,x1) 
% 2.29/1.01  
% 2.29/1.01  === Starting SPASS-SCL-FOL A Little Less Naive, considering 20 atoms initially, heuristics mode: resolution_1 ===
% 2.29/1.01  
% 2.29/1.01  === Backtracking. Learning clause 13:2:1:[10.1,11.1]:Top: element_of_collection(x0,g) -> element_of_collection(x0,top_of_basis(f))
% 2.29/1.01  === Backtracking. Learning clause 14:3:2:[7.1,6.2]:TopTop: element_of_collection(x0,x1),subset_sets(x0,x0) -> element_of_collection(x0,top_of_basis(x1))
% 2.29/1.01  === Conflict found: 13:2:1:[10.1,11.1]:Top: element_of_collection(x0,g) -> element_of_collection(x0,top_of_basis(f)) {x0 -> union_of_members(g)}
% 2.29/1.01  === Backtracking. Learning clause 15:1:0:[13.2,12.1]:: element_of_collection(union_of_members(g),g) -> 
% 2.29/1.01  === Clause set with instances from active satisfied. Growing active. New size: 23
% 2.29/1.01  === Restarting.
% 2.29/1.01  === Clause set with instances from active satisfied. Growing active. New size: 82
% 2.29/1.01  === Clause set with instances from active satisfied. Growing active. New size: 146
% 2.29/1.01  === Backtracking. Learning clause 16:5:4:[10.3,7.2]:TopTopTopTop: subset_collections(x0,x1),element_of_collection(x2,x0),element_of_set(f11(x1,x3),x2),subset_sets(x2,x3) -> element_of_collection(x3,top_of_basis(x1))
% 2.29/1.01  === Clause set with instances from active satisfied. Growing active. New size: 210
% 2.29/1.01  === Clause set with instances from active satisfied. Growing active. New size: 274
% 2.29/1.01  === Clause set with instances from active satisfied. Growing active. New size: 338
% 2.29/1.01  === Backtracking. Learning clause 17:6:5:[7.1,8.3,8.2]:TopTopTopTopTop: element_of_collection(x0,x1),element_of_set(f11(x1,x2),x3),element_of_set(x4,x0) -> element_of_collection(x2,top_of_basis(x1)),subset_sets(x3,x0),element_of_set(x4,x2)
% 2.29/1.01  === Clause set with instances from active satisfied. Growing active. New size: 402
% 2.29/1.01  === Conflict found: 17:6:5:[7.1,8.3,8.2]:TopTopTopTopTop: element_of_collection(x0,x1),element_of_set(f11(x1,x2),x3),element_of_set(x4,x0) -> element_of_collection(x2,top_of_basis(x1)),subset_sets(x3,x0),element_of_set(x4,x2) {x0 -> f1(g,f11(g,g)), x1 -> g, x2 -> f, x3 -> f, x4 -> f11(g,union_of_members(g))}
% 2.29/1.01  === Backtracking. Learning clause 18:7:6:[17.6,8.1]:TopTopTopTopTopTop: element_of_collection(x0,x1),element_of_set(f11(x1,x2),x3),element_of_set(x4,x0) -> element_of_collection(x2,top_of_basis(x1)),subset_sets(x3,x0),subset_sets(x2,x5),element_of_set(x4,x5)
% 2.29/1.01  === Backtracking. Learning clause 19:7:6:[9.1,5.3,7.3,4.3,3.3,8.3,9.1,10.3,2.2,8.3,8.3]:TopTopTopTopTopTop: element_of_set(f11(x0,union_of_members(x1)),x2),subset_collections(x1,top_of_basis(x0)),element_of_set(x3,x4) -> element_of_collection(union_of_members(x1),top_of_basis(x0)),subset_sets(x2,union_of_members(x1)),subset_sets(x5,union_of_members(x1)),subset_sets(x4,x5)
% 2.29/1.01  === Backtracking. Learning clause 20:5:4:[6.2,17.2]:TopTopTopTop: element_of_collection(x0,x1),element_of_set(x2,x0) -> element_of_collection(x3,top_of_basis(x1)),subset_sets(x3,x0),element_of_set(x2,x3)
% 2.29/1.01  === Clause set with instances from active satisfied. Growing active. New size: 466
% 2.29/1.01  
% 2.29/1.01  SZS status Unsatisfiable
% 2.29/1.01  
% 2.29/1.01  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.29/1.01  
% 2.29/1.01  SPASS-SCL-FOL Statistics:
% 2.29/1.01  Number of learned clauses: 8
% 2.29/1.01  Number of propagations: 729
% 2.29/1.01  Number of decisions: 610
% 2.29/1.01  Number of resolutions: 28
% 2.29/1.01  Number of condensations: 0
% 2.29/1.01  Number of sub resolutions: 0
% 2.29/1.01  Number of input literals (deduplicated): 16
% 2.29/1.01  Number of grows: 8
% 2.29/1.01  Number of considered ground atoms: 466
% 2.29/1.01  
% 2.29/1.01   Needed:       0:00:00.47
% 2.29/1.01  
%------------------------------------------------------------------------------