%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GRP124-8.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 : n017.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:03 PM UTC 2026
% Result : Satisfiable 2.24s 1.06s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP124-8.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.18/0.35 % Computer : n017.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu May 7 11:59:58 EDT 2026
% 0.18/0.35 % CPUTime :
% 0.18/0.35 SPASS-SCL-FOL version:
% 0.21/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.24/1.06 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.06 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.06 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.06 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.06 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.06 Execution lmodel_grow ended with status: satisfiable
% 2.24/1.06 Used heuristic: lmodel_grow
% 2.24/1.06
% 2.24/1.06 Input Clauses:
% 2.24/1.06
% 2.24/1.06 Predicates: next greater cycle equalish group_element product product1 product2
% 2.24/1.06 Fol Constants: e_0 e_1 e_2 e_3 e_4 e_5
% 2.24/1.06 Fol Functions:
% 2.24/1.06 Problem Properties:
% 2.24/1.06 This is a Bernays Schoenfinkel problem.
% 2.24/1.06
% 2.24/1.06 After reduction: Problem Properties:
% 2.24/1.06 This is a Bernays Schoenfinkel problem.
% 2.24/1.06
% 2.24/1.06
% 2.24/1.06 Reduced Input Clauses:
% 2.24/1.06
% 2.24/1.06 Most General Atoms: cycle(x3,x4) greater(x1,x0) product(x0,e_1,x2) next(x0,x3) group_element(x1) equalish(x0,x3) product1(x2,x0,x3) product2(x3,x1,x0)
% 2.24/1.06
% 2.24/1.06 === Starting SPASS-SCL-FOL A Little Less Naive, considering 618 atoms initially, heuristics mode: lmodel_grow ===
% 2.24/1.06
% 2.24/1.06 === Backtracking. Learning clause 70:37:6:[32.0,64.0,31.0,65.2,28.0,66.5,30.0,67.7,29.0,68.9,46.0,69.32,53.4,63.2,63.2,53.7,63.1,61.1,63.2,58.7,60.1,60.1,58.4,61.1,58.6,61.1,63.3,63.2,53.6,60.1,63.2,60.1,58.3,61.1,58.6,61.1,60.1]:TopTopTopTopTopTop: product1(e_1,e_5,x0),group_element(x1),group_element(x2),product1(e_1,x2,e_2),group_element(x3),product2(x4,x2,e_3),product2(x3,x5,e_3) -> product1(e_5,e_4,e_4),product1(e_5,e_4,e_5),product2(e_2,e_2,e_4),product1(e_4,e_2,e_2),product1(e_4,e_2,e_4),equalish(x0,e_3),product2(e_3,e_4,e_3),product2(e_3,e_4,e_4),equalish(e_1,x2),equalish(e_4,x2),product2(e_3,x2,e_3),product2(e_3,x2,e_5),equalish(e_3,x1),product2(x1,x2,e_2),product2(x1,x2,e_5),equalish(x1,e_4),product2(e_1,e_1,e_2),product1(e_2,e_1,e_1),product1(e_2,e_1,e_2),product1(e_2,e_1,e_5),equalish(x2,e_2),product2(e_3,e_2,e_2),product2(e_3,e_2,e_3),product2(e_3,e_2,e_5),equalish(e_3,x3),product2(x3,e_2,e_1),product2(x3,e_2,e_2),product2(x3,e_2,e_5),equalish(x1,x4),equalish(e_2,x5)
% 2.24/1.06 === Backtracking. Learning clause 79:41:7:[32.0,71.0,31.0,72.1,29.0,73.4,28.0,74.5,30.0,75.7,36.0,76.16,40.0,77.19,35.0,78.20,53.5,56.1,63.1,53.4,56.2,55.1,53.5,63.2,63.2,53.7,63.2,63.2,60.2,58.4,60.1,58.6,53.6,63.2,60.1,60.1,58.3,61.2,58.4,61.1,59.1,61.1]:TopTopTopTopTopTopTop: group_element(x0),group_element(x1),product1(e_1,x0,e_2),group_element(x2),group_element(x3),product2(x4,x3,e_5),product2(e_2,e_4,x5),product2(x6,x3,e_5) -> product1(e_1,e_4,e_1),product1(e_1,e_4,e_2),product1(e_1,e_4,e_4),product1(e_5,e_1,e_1),product1(e_5,e_1,e_5),product1(e_5,e_4,e_4),product1(e_5,e_4,e_5),product2(e_1,e_2,e_4),product2(e_2,e_2,e_4),product1(e_4,e_2,e_2),product1(e_4,e_2,e_4),product2(e_1,e_1,e_2),equalish(x0,e_1),product2(e_3,x0,e_3),product2(e_3,x0,e_5),equalish(x0,x1),product2(e_3,x1,e_2),product2(e_3,x1,e_3),product2(e_3,x1,e_5),product1(e_2,e_1,e_1),product1(e_2,e_1,e_2),product1(e_2,e_1,e_5),equalish(x1,x3),equalish(x0,x3),product2(e_3,x3,e_3),product2(e_3,x3,e_4),equalish(x2,e_3),product2(x2,x3,e_1),product2(x2,x3,e_3),product2(x2,x3,e_4),equalish(x2,x4),equalish(e_1,x5),equalish(e_3,x6)
% 2.24/1.06 === Backtracking. Learning clause 86:32:5:[28.0,80.2,32.0,81.3,29.0,82.5,30.0,83.7,42.0,84.16,49.0,85.24,58.6,60.1,60.2,58.7,61.1,63.3,53.4,55.2,53.7,56.2,53.5,63.2,53.7,63.2,60.2,60.2,58.4,60.2]:TopTopTopTopTop: group_element(x0),product2(e_3,x1,e_4),group_element(x2),product1(e_2,x0,x2),group_element(x3),product2(e_3,x4,e_4) -> product2(e_3,x0,e_1),product2(e_3,x0,e_3),equalish(x0,x1),equalish(x2,x0),product2(e_3,x2,e_3),product2(e_3,x2,e_4),product1(e_5,e_1,e_1),product1(e_5,e_1,e_4),product1(e_5,e_1,e_5),equalish(x2,e_1),product1(e_1,x2,e_1),product1(e_1,x2,e_2),product1(e_1,x2,e_4),product1(e_5,x2,e_1),product1(e_5,x2,e_4),product1(e_5,x2,e_5),product2(e_2,e_2,x2),product1(x2,e_2,e_1),product1(x2,e_2,e_2),product1(x2,e_2,e_4),equalish(x3,x0),equalish(x3,x2),product2(e_3,x3,e_1),product2(e_3,x3,e_3),product2(e_3,x3,e_5),equalish(x4,x3)
% 2.24/1.06 === Backtracking. Learning clause 87:15:6:[53.7,56.2,63.2,63.2,53.7,56.2]:TopTopTopTopTopTop: group_element(x0),product1(x1,x2,x0),product1(x1,x3,x0),group_element(x4),group_element(x1),product1(x5,x1,e_3) -> product1(x0,x1,e_3),product1(x0,x1,e_4),equalish(x4,x0),product2(e_1,x2,x1),product2(e_2,x3,x1),product1(x4,x1,e_1),product1(x4,x1,e_2),product1(x4,x1,e_4),equalish(x5,x4)
% 2.24/1.06 === Backtracking. Learning clause 90:25:5:[30.0,88.2,29.0,89.6,58.6,61.2,60.2,58.4,61.2,58.7,60.2,58.6,60.1,63.3,53.5]:TopTopTopTopTop: group_element(x0),group_element(x1),group_element(x2),product1(e_2,x3,x4),group_element(x4) -> product2(x0,x2,e_1),product2(x0,x2,e_3),product2(x0,x2,e_5),equalish(x1,x2),product2(x0,x1,e_1),product2(x0,x1,e_3),product2(x0,x1,e_4),equalish(e_3,x0),product2(e_3,x1,e_1),product2(e_3,x1,e_3),product2(e_3,x1,e_4),equalish(x3,x1),product2(e_3,x2,e_1),product2(e_3,x2,e_3),product2(e_3,x2,e_5),equalish(x2,x3),product1(x4,e_2,e_1),product1(x4,e_2,e_2),product1(x4,e_2,e_4),product1(x4,e_2,e_5)
% 2.24/1.06 === Backtracking. Learning clause 96:51:9:[32.0,91.0,30.0,92.4,29.0,93.5,31.0,94.7,45.0,95.38,53.4,63.2,63.2,90.25,60.2,58.3,86.2,61.2,63.3,56.2,63.2]:TopTopTopTopTopTopTopTopTop: group_element(x0),group_element(x1),product1(e_2,x2,e_4),group_element(x3),product1(e_2,x3,e_4),group_element(x4),product1(e_1,x4,x5),product1(x5,e_1,x6),product1(x7,e_1,e_4),product1(e_2,x8,e_4) -> product2(x0,x4,e_1),product2(x0,x4,e_3),product2(x0,x4,e_5),equalish(x1,x4),product2(x0,x1,e_1),product2(x0,x1,e_3),product2(x0,x1,e_4),equalish(e_3,x0),product2(e_3,x1,e_3),product2(e_3,x1,e_4),equalish(x2,x1),equalish(x4,x2),equalish(e_2,x1),product2(e_3,e_2,e_2),product2(e_3,e_2,e_3),product2(e_3,e_2,e_5),product2(e_3,x3,e_1),product2(e_3,x3,e_3),equalish(x3,e_2),equalish(e_4,x3),product2(e_3,e_4,e_3),product2(e_3,e_4,e_4),product1(e_5,e_1,e_1),product1(e_5,e_1,e_5),product1(e_1,e_4,e_1),product1(e_1,e_4,e_2),product1(e_1,e_4,e_4),product1(e_5,e_4,e_1),product1(e_5,e_4,e_4),product1(e_5,e_4,e_5),product2(e_2,e_2,e_4),product1(e_4,e_2,e_2),product1(e_4,e_2,e_4),equalish(x4,x3),equalish(x4,e_4),product2(e_3,x4,e_3),product2(e_3,x4,e_5),equalish(e_2,x4),equalish(x6,e_3),equalish(x7,e_5),product2(e_1,x8,e_2)
% 2.24/1.06 === Backtracking. Learning clause 98:14:4:[32.0,97.1,53.6,63.2,63.2,61.2,58.7]:TopTopTopTop: group_element(x0),product1(e_5,x1,x0),product1(e_5,x2,x0),group_element(x3),group_element(x2) -> product1(x0,e_5,e_2),product1(x0,e_5,e_3),product1(x0,e_5,e_5),product2(e_4,x1,e_5),equalish(x3,e_1),product2(x3,x2,e_1),product2(x3,x2,e_2),product2(x3,x2,e_3),product2(x3,x2,e_4)
% 2.24/1.06 === Conflict found: 98:14:4:[32.0,97.1,53.6,63.2,63.2,61.2,58.7]:TopTopTopTop: group_element(x0),product1(e_5,x1,x0),product1(e_5,x2,x0),group_element(x3),group_element(x2) -> product1(x0,e_5,e_2),product1(x0,e_5,e_3),product1(x0,e_5,e_5),product2(e_4,x1,e_5),equalish(x3,e_1),product2(x3,x2,e_1),product2(x3,x2,e_2),product2(x3,x2,e_3),product2(x3,x2,e_4) {x0 -> e_3, x1 -> e_4, x2 -> e_4, x3 -> e_3}
% 2.24/1.06 === Backtracking. Learning clause 99:16:6:[98.11,59.2,59.2]:TopTopTopTopTopTop: group_element(x0),product1(e_5,x1,x0),product1(e_5,x2,x0),group_element(x3),group_element(x2),product2(x3,x2,x4),product2(x3,x2,x5) -> product1(x0,e_5,e_2),product1(x0,e_5,e_3),product1(x0,e_5,e_5),product2(e_4,x1,e_5),equalish(x3,e_1),product2(x3,x2,e_3),product2(x3,x2,e_4),equalish(x4,e_1),equalish(x5,e_2)
% 2.24/1.06 === Backtracking. Learning clause 102:24:6:[32.0,100.0,28.0,101.2,53.5,55.2,63.2,61.2,63.2,53.7,56.2,98.11]:TopTopTopTopTopTop: product1(e_5,x0,e_3),product1(x1,x2,e_3),group_element(x3),product1(e_5,x4,x3),product1(e_5,x2,x3),group_element(x5),group_element(x2) -> product1(e_5,e_1,e_1),product1(e_5,e_1,e_5),equalish(x0,e_1),equalish(x5,e_2),product2(e_4,x2,e_1),product1(e_1,x2,e_1),product1(e_1,x2,e_2),product1(e_1,x2,e_4),equalish(x1,e_1),product1(x3,e_5,e_2),product1(x3,e_5,e_3),product1(x3,e_5,e_5),product2(e_4,x4,e_5),equalish(x5,e_1),product2(x5,x2,e_2),product2(x5,x2,e_3),product2(x5,x2,e_4)
% 2.24/1.06 === Backtracking. Learning clause 103:4:5:[61.2,63.3]:TopTopTopTopTop: product2(x0,x1,x2),product1(x2,x1,x3),product1(x3,x2,x4) -> equalish(x0,x4)
% 2.24/1.06 === Backtracking. Learning clause 104:2:2:[61.3,41.1]:TopTop: product2(e_3,x0,x1),product2(e_1,x0,x1) ->
% 2.24/1.06 === Backtracking. Learning clause 105:2:2:[60.3,50.1]:TopTop: product2(x0,e_5,x1),product2(x0,e_2,x1) ->
% 2.24/1.06 === Backtracking. Learning clause 106:2:2:[56.3,49.1]:TopTop: product1(e_5,x0,x1),product1(e_1,x0,x1) ->
% 2.24/1.06 === Backtracking. Learning clause 110:6:1:[32.0,107.2,49.0,108.5,106.0,109.7,53.1,28.1,55.1,103.3,106.2,63.2,55.1,53.3,55.1,59.1,57.1,62.1,52.1,103.2,57.1,42.1,45.1,31.1]:Top: product2(e_3,e_4,e_5),product1(e_1,e_4,e_3),product1(e_5,e_1,e_4),product2(x0,e_4,e_5) -> product1(e_5,e_4,e_2),equalish(x0,e_5)
% 2.24/1.06
% 2.24/1.06 Linear Model Building succeeded.
% 2.24/1.06 SZS status Satisfiable
% 2.24/1.06
% 2.24/1.06 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.06
% 2.24/1.06 SPASS-SCL-FOL Statistics:
% 2.24/1.06 Number of learned clauses: 14
% 2.24/1.06 Number of propagations: 1429
% 2.24/1.06 Number of decisions: 166
% 2.24/1.06 Number of resolutions: 125
% 2.24/1.06 Number of condensations: 0
% 2.24/1.06 Number of sub resolutions: 33
% 2.24/1.06 Number of input literals (deduplicated): 72
% 2.24/1.06 Number of grows: 0
% 2.24/1.06 Number of considered ground atoms: 618
% 2.24/1.06
% 2.24/1.06 Needed: 0:00:00.46
% 2.24/1.06
%------------------------------------------------------------------------------