↑ Up

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

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

% Computer : n028.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:23:07 PM UTC 2026

% Result   : Satisfiable 4.20s 1.53s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP131-2.005 : TPTP v9.2.1. Released v1.2.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34  % Computer : n028.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 12:01:16 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.16/0.34  SPASS-SCL-FOL version:
% 0.19/0.43  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 4.20/1.53  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.53  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.53  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.53  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.53  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.53  Execution resolution_1 ended with status: satisfiable
% 4.20/1.53  Used heuristic: resolution_1
% 4.20/1.53  
% 4.20/1.53   Input Clauses:
% 4.20/1.53  
% 4.20/1.53   Predicates: next greater product group_element equalish 
% 4.20/1.53   Fol Constants: e_1 e_2 e_3 e_4 e_5 
% 4.20/1.53   Fol Functions: 
% 4.20/1.53   Problem Properties:
% 4.20/1.53   This is a Bernays Schoenfinkel problem.
% 4.20/1.53  
% 4.20/1.53   After reduction:  Problem Properties:
% 4.20/1.53   This is a Bernays Schoenfinkel problem.
% 4.20/1.53  
% 4.20/1.53  
% 4.20/1.53   Reduced Input Clauses:
% 4.20/1.53  
% 4.20/1.53   Most General Atoms: next(x0,x2) greater(x1,x2) group_element(x1) product(x5,x4,x3) equalish(x1,x4) 
% 4.20/1.53  
% 4.20/1.53  === Starting SPASS-SCL-FOL A Little Less Naive, considering 11 atoms initially, heuristics mode: resolution_1 ===
% 4.20/1.53  
% 4.20/1.53  === Backtracking. Learning clause 48:3:1:[16.0,47.0,41.7,15.1,44.1,44.1,44.1,46.1]:Top: next(e_1,x0),greater(e_5,x0) -> equalish(e_1,e_1)
% 4.20/1.53  === Backtracking. Learning clause 50:7:2:[16.0,49.1,41.7,15.1]:TopTop: group_element(x0),next(x0,x1),greater(e_5,x1) -> product(x0,e_1,e_1),product(x0,e_1,e_2),product(x0,e_1,e_3),product(x0,e_1,e_4)
% 4.20/1.53  === Clause set with instances from active satisfied. Growing active. New size: 14
% 4.20/1.53  === Restarting.
% 4.20/1.53  === Backtracking. Learning clause 51:3:1:[41.7,43.1,43.1,43.1,43.1,42.1]:Top: group_element(x0) -> equalish(x0,x0),equalish(e_1,e_1)
% 4.20/1.53  === Clause set with instances from active satisfied. Growing active. New size: 56
% 4.20/1.53  === Backtracking. Learning clause 52:5:2:[41.6,43.1,43.1,43.1]:TopTop: group_element(x0),group_element(x1) -> product(x0,x1,e_1),product(x0,x1,e_5),equalish(x1,x1)
% 4.20/1.53  === Clause set with instances from active satisfied. Growing active. New size: 120
% 4.20/1.53  === Backtracking. Learning clause 53:17:4:[43.2,41.4,41.4,43.1,43.1,41.5]:TopTopTopTop: group_element(x1),group_element(x2),group_element(x0),group_element(x3) -> equalish(x2,x1),product(x0,x1,e_1),product(x0,x1,e_4),product(x0,x1,e_5),product(x0,x2,e_1),product(x0,x2,e_4),product(x0,x2,e_5),equalish(x1,x3),equalish(x2,x3),product(x0,x3,e_1),product(x0,x3,e_2),product(x0,x3,e_4),product(x0,x3,e_5)
% 4.20/1.53  === Clause set with instances from active satisfied. Growing active. New size: 184
% 4.20/1.53  === Backtracking. Learning clause 55:26:8:[17.0,54.3,41.5,43.1,43.1,46.1,43.1,41.6,46.1,43.1,41.7,46.1,50.5,43.1,44.1]:TopTopTopTopTopTopTopTop: group_element(x0),product(e_2,x1,e_3),group_element(x2),group_element(x3),product(e_2,e_1,x4),group_element(x4),next(x4,x5),greater(e_5,x5),product(e_2,x6,e_3),product(x7,e_1,e_3) -> product(e_2,x0,e_1),equalish(x0,x1),equalish(x0,x3),equalish(x0,e_1),equalish(x0,x2),product(e_2,x2,e_1),equalish(x2,e_1),equalish(x2,x3),product(e_2,x3,e_1),product(e_2,x3,e_3),product(e_2,x3,e_4),equalish(x3,e_1),product(x4,e_1,e_1),product(x4,e_1,e_4),equalish(x2,x6),equalish(x4,x7)
% 4.20/1.53  === Backtracking. Learning clause 59:13:5:[20.0,56.0,19.0,57.3,40.0,58.10,41.7,44.1,45.1,41.7,46.1]:TopTopTopTopTop: product(x0,x1,e_4),product(e_4,x1,x0),group_element(x2),product(x3,x4,e_4),product(e_4,x4,x3) -> product(e_5,x2,e_1),product(e_5,x2,e_2),product(e_5,x2,e_3),equalish(e_5,x0),product(e_4,x2,e_1),product(e_4,x2,e_2),product(e_4,x2,e_3),equalish(x2,x4)
% 4.20/1.53  === Clause set with instances from active satisfied. Growing active. New size: 205
% 4.20/1.53  === Conflict found: 53:17:4:[43.2,41.4,41.4,43.1,43.1,41.5]:TopTopTopTop: group_element(x1),group_element(x2),group_element(x0),group_element(x3) -> equalish(x2,x1),product(x0,x1,e_1),product(x0,x1,e_4),product(x0,x1,e_5),product(x0,x2,e_1),product(x0,x2,e_4),product(x0,x2,e_5),equalish(x1,x3),equalish(x2,x3),product(x0,x3,e_1),product(x0,x3,e_2),product(x0,x3,e_4),product(x0,x3,e_5) {x0 -> e_5, x1 -> e_4, x2 -> e_5, x3 -> e_3}
% 4.20/1.53  === Backtracking. Learning clause 61:26:13:[20.0,60.2,53.9,46.4,46.1,46.1,45.2]:TopTopTopTopTopTopTopTopTopTopTopTopTop: group_element(x0),group_element(x1),group_element(x2),product(x3,x4,x5),product(e_1,x1,x5),product(e_5,x4,x3),product(x6,x7,e_5),product(e_5,x7,x6),product(x8,x9,e_5),product(e_5,x9,x8),product(x10,x11,e_1),product(x12,x11,x10),product(x12,x0,e_5) -> equalish(x1,x0),product(e_5,x0,e_4),product(e_5,x1,e_4),equalish(x0,x2),equalish(x1,x2),product(e_5,x2,e_1),product(e_5,x2,e_2),product(e_5,x2,e_4),product(e_5,x2,e_5),equalish(x4,x1),equalish(x1,x7),equalish(x0,x9),equalish(x10,e_5)
% 4.20/1.53  
% 4.20/1.53  Linear Model Building succeeded.
% 4.20/1.53  SZS status Satisfiable
% 4.20/1.53  
% 4.20/1.53  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.53  
% 4.20/1.53  SPASS-SCL-FOL Statistics:
% 4.20/1.53  Number of learned clauses: 8
% 4.20/1.53  Number of propagations: 290
% 4.20/1.53  Number of decisions: 61
% 4.20/1.53  Number of resolutions: 39
% 4.20/1.53  Number of condensations: 1
% 4.20/1.53  Number of sub resolutions: 7
% 4.20/1.53  Number of input literals (deduplicated): 50
% 4.20/1.53  Number of grows: 5
% 4.20/1.53  Number of considered ground atoms: 205
% 4.20/1.53  
% 4.20/1.53   Needed:       0:00:00.97
% 4.20/1.53  
%------------------------------------------------------------------------------