↑ Up

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

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

% Computer : n007.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:01 PM UTC 2026

% Result   : Satisfiable 0.62s 0.80s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP123-6.005 : TPTP v9.2.1. Released v1.2.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 : n007.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:00:54 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.17/0.34  SPASS-SCL-FOL version:
% 0.22/0.43  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.62/0.80  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.80  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.80  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.80  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.80  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.80  Execution normal ended with status: satisfiable
% 0.62/0.80  Used heuristic: normal
% 0.62/0.80  
% 0.62/0.80   Input Clauses:
% 0.62/0.80  
% 0.62/0.80   Predicates: group_element equalish product1 product2 
% 0.62/0.80   Fol Constants: e_1 e_2 e_3 e_4 e_5 
% 0.62/0.80   Fol Functions: 
% 0.62/0.80   Problem Properties:
% 0.62/0.80   This is a Bernays Schoenfinkel problem.
% 0.62/0.80  
% 0.62/0.80   After reduction:  Problem Properties:
% 0.62/0.80   This is a Bernays Schoenfinkel problem.
% 0.62/0.80  
% 0.62/0.80  
% 0.62/0.80   Reduced Input Clauses:
% 0.62/0.80  
% 0.62/0.80   Most General Atoms: group_element(x1) equalish(x0,x3) product1(x2,x1,x3) product2(x3,x0,x1) 
% 0.62/0.80  
% 0.62/0.80  === Starting SPASS-SCL-FOL A Little Less Naive, considering 280 atoms initially, heuristics mode: normal ===
% 0.62/0.80  
% 0.62/0.80  === Backtracking. Learning clause 39:13:4:[5.0,37.0,3.0,38.1,26.5,36.1,36.2,26.7,29.1,29.1,36.1]:TopTopTopTop: group_element(x0),product1(x1,x0,e_1),product1(x2,x0,e_1),product1(e_4,x0,x3) -> product1(e_5,x0,e_2),product1(e_5,x0,e_5),product2(e_5,e_5,x0),product2(e_4,e_3,x0),product1(e_3,x0,e_2),product1(e_3,x0,e_3),equalish(e_5,x1),equalish(e_3,x2),product2(x3,e_3,x0)
% 0.62/0.80  === Backtracking. Learning clause 42:18:5:[3.0,40.1,2.0,41.5,31.7,33.1,33.1,31.7,33.1,36.3,26.5,36.1]:TopTopTopTopTop: group_element(x0),group_element(x1),product1(x2,e_2,x3),group_element(x3),product1(e_5,e_2,x4) -> product2(e_3,x0,e_1),product2(e_3,x0,e_3),product2(e_3,x0,e_4),equalish(x0,x1),equalish(x0,x2),product2(e_3,x1,e_1),product2(e_3,x1,e_3),product2(e_3,x1,e_4),equalish(x1,x2),product1(x3,e_2,e_1),product1(x3,e_2,e_2),product1(x3,e_2,e_4),product2(x4,x3,e_2)
% 0.62/0.80  === Backtracking. Learning clause 46:20:2:[3.0,43.0,4.0,44.2,24.0,45.11,26.7,36.2,39.2,26.3,29.2,36.2,26.5]:TopTop: group_element(x0),group_element(x1) -> product2(e_5,e_4,x1),product1(e_5,x1,e_2),product1(e_5,x1,e_5),product2(e_5,e_5,x1),product2(e_4,e_3,x1),product1(e_3,x1,e_2),product1(e_3,x1,e_3),equalish(e_3,x0),product2(e_3,e_3,x1),product1(x0,x1,e_2),product1(x0,x1,e_4),product1(x0,x1,e_5),equalish(e_4,x0),product2(e_4,e_4,x1),product1(e_4,x1,e_1),product1(e_4,x1,e_2),product1(e_4,x1,e_4),product1(e_4,x1,e_5)
% 0.62/0.80  === Conflict found: 42:18:5:[3.0,40.1,2.0,41.5,31.7,33.1,33.1,31.7,33.1,36.3,26.5,36.1]:TopTopTopTopTop: group_element(x0),group_element(x1),product1(x2,e_2,x3),group_element(x3),product1(e_5,e_2,x4) -> product2(e_3,x0,e_1),product2(e_3,x0,e_3),product2(e_3,x0,e_4),equalish(x0,x1),equalish(x0,x2),product2(e_3,x1,e_1),product2(e_3,x1,e_3),product2(e_3,x1,e_4),equalish(x1,x2),product1(x3,e_2,e_1),product1(x3,e_2,e_2),product1(x3,e_2,e_4),product2(x4,x3,e_2) {x0 -> e_4, x1 -> e_1, x2 -> e_5, x3 -> e_1, x4 -> e_1}
% 0.62/0.80  === Backtracking. Learning clause 47:19:6:[42.17,36.1]:TopTopTopTopTopTop: group_element(x0),group_element(x1),product1(x2,e_2,x3),group_element(x3),product1(e_5,e_2,x4),product1(e_4,e_2,x5) -> product2(e_3,x0,e_1),product2(e_3,x0,e_3),product2(e_3,x0,e_4),equalish(x0,x1),equalish(x0,x2),product2(e_3,x1,e_1),product2(e_3,x1,e_3),product2(e_3,x1,e_4),equalish(x1,x2),product1(x3,e_2,e_1),product1(x3,e_2,e_2),product2(x4,x3,e_2),product2(x5,x3,e_2)
% 0.62/0.80  === Backtracking. Learning clause 57:41:7:[1.0,48.1,5.0,49.2,4.0,50.5,2.0,51.6,3.0,52.8,17.0,53.21,21.0,54.23,25.0,55.40,16.0,56.41,26.5,29.1,29.1,36.1,26.5,47.3,46.20,42.3,39.2,34.1,34.1,31.4,33.1,32.1,34.1]:TopTopTopTopTopTopTop: group_element(x0),group_element(x1),group_element(x2),group_element(x3),product2(x3,x4,e_1),product2(e_5,e_4,x5),product2(x6,x2,e_1) -> product1(x0,e_2,e_1),product1(x0,e_2,e_2),equalish(x0,e_5),equalish(x0,e_4),product2(e_5,x0,e_2),product1(e_1,e_2,e_1),product1(e_1,e_2,e_2),product2(e_1,e_1,e_2),product2(e_5,e_1,e_2),product2(e_3,e_3,e_2),product2(e_3,x1,e_1),product2(e_3,x1,e_3),product2(e_3,x1,e_4),equalish(x1,x2),equalish(x1,e_5),product2(e_3,x2,e_3),product2(e_3,x2,e_4),equalish(x2,e_5),product1(e_4,e_2,e_2),product1(e_4,e_2,e_4),product2(e_4,e_4,e_2),product1(e_5,e_2,e_2),product1(e_5,e_2,e_5),product2(e_5,e_5,e_2),product1(e_3,e_2,e_2),product1(e_3,e_2,e_3),equalish(e_1,x3),equalish(e_4,x3),product2(x3,e_3,e_3),product2(x3,e_3,e_4),product2(x3,e_3,e_5),equalish(e_3,x4),equalish(e_2,x5),equalish(e_3,x6)
% 0.62/0.80  === Backtracking. Learning clause 58:9:4:[26.3,36.2,36.2]:TopTopTopTop: group_element(x0),group_element(x1),product1(x2,x1,x0),product1(x3,x1,x0) -> product1(x0,x1,e_3),product1(x0,x1,e_4),product1(x0,x1,e_5),product2(e_1,x2,x1),product2(e_2,x3,x1)
% 0.62/0.80  === Backtracking. Learning clause 60:14:5:[4.0,59.2,26.3,29.1,58.3,34.2,36.1]:TopTopTopTopTop: group_element(x0),product1(x1,x2,e_1),group_element(x2),product2(x3,x0,x2),product1(e_2,x2,x4) -> product1(x0,x2,e_3),product1(x0,x2,e_5),equalish(x0,x1),product1(e_4,x2,e_3),product1(e_4,x2,e_4),product1(e_4,x2,e_5),product2(e_1,x0,x2),equalish(x3,e_2),product2(x4,x0,x2)
% 0.62/0.80  
% 0.62/0.80  Linear Model Building succeeded.
% 0.62/0.80  SZS status Satisfiable
% 0.62/0.80  
% 0.62/0.80  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.80  
% 0.62/0.80  SPASS-SCL-FOL Statistics:
% 0.62/0.80  Number of learned clauses: 7
% 0.62/0.80  Number of propagations: 496
% 0.62/0.80  Number of decisions: 17
% 0.62/0.80  Number of resolutions: 40
% 0.62/0.80  Number of condensations: 1
% 0.62/0.80  Number of sub resolutions: 17
% 0.62/0.80  Number of input literals (deduplicated): 41
% 0.62/0.80  Number of grows: 0
% 0.62/0.80  Number of considered ground atoms: 280
% 0.62/0.80  
% 0.62/0.80   Needed:       0:00:00.25
% 0.62/0.80  
%------------------------------------------------------------------------------