%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GRP129-1.003 : 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 : n020.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:06 PM UTC 2026
% Result : Unsatisfiable 0.35s 0.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP129-1.003 : 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.16/0.34 % Computer : n020.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:21 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]
% 0.35/0.57 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.57 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.57 Execution normal ended with status: unsatisfiable
% 0.35/0.57 Used heuristic: normal
% 0.35/0.57
% 0.35/0.57 Input Clauses:
% 0.35/0.57
% 0.35/0.57 Predicates: group_element equalish product
% 0.35/0.57 Fol Constants: e_1 e_2 e_3
% 0.35/0.57 Fol Functions:
% 0.35/0.57 Problem Properties:
% 0.35/0.57 This is a Bernays Schoenfinkel problem.
% 0.35/0.57
% 0.35/0.57 After reduction: Problem Properties:
% 0.35/0.57 This is a Bernays Schoenfinkel problem.
% 0.35/0.57
% 0.35/0.57
% 0.35/0.57 Reduced Input Clauses:
% 0.35/0.57
% 0.35/0.57 Most General Atoms: group_element(x1) equalish(x0,x3) product(x2,x0,x3)
% 0.35/0.57
% 0.35/0.57 === Starting SPASS-SCL-FOL A Little Less Naive, considering 39 atoms initially, heuristics mode: normal ===
% 0.35/0.57
% 0.35/0.57 === Backtracking. Learning clause 16:9:2:[1.0,15.2,12.2,10.4,10.4,14.1,12.1,13.1,10.3,12.1,13.1,10.5]:TopTop: group_element(x0),group_element(x1) -> equalish(e_1,x1),product(x0,x1,e_3),product(e_1,x1,e_2),equalish(x1,e_1),equalish(x0,e_1),product(e_1,e_1,e_1),product(e_1,e_1,e_2)
% 0.35/0.57 === Backtracking. Learning clause 21:10:2:[2.0,17.0,3.0,18.1,1.0,19.2,8.0,20.7,14.3,14.2,10.3,14.2,10.4,14.2,14.1,10.5,14.2,14.1,14.2,12.1,10.5,14.1,12.1,13.1,16.9]:TopTop: group_element(x0),group_element(x1) -> product(e_3,e_2,e_3),product(e_1,e_2,e_2),equalish(e_1,x1),product(x0,x1,e_3),product(e_1,x1,e_2),equalish(x1,e_1),equalish(x0,e_1),product(e_1,e_1,e_1)
% 0.35/0.57 === Backtracking. Learning clause 26:10:2:[1.0,22.0,2.0,23.3,4.0,24.11,6.0,25.12,14.3,13.2,14.3,10.4,12.1,16.4,12.1,12.2,10.3,13.1,12.1,21.4]:TopTop: group_element(x0),group_element(x1) -> equalish(x1,e_2),equalish(e_1,x0),equalish(x0,e_1),equalish(x0,e_2),product(x1,e_2,e_3),equalish(x1,e_1),product(e_3,e_2,e_3),product(e_1,e_1,e_1)
% 0.35/0.57 === Backtracking. Learning clause 27:10:3:[10.4,13.1,12.1,16.5]:TopTopTop: group_element(x0),product(x0,x1,e_1),group_element(x2) -> product(x0,x2,e_3),equalish(x0,e_1),equalish(x2,x1),equalish(e_1,x2),equalish(x2,e_1),product(e_1,e_1,e_1),product(e_1,e_1,e_2)
% 0.35/0.57 === Backtracking. Learning clause 28:11:4:[12.2,14.3,27.10]:TopTopTopTop: product(x0,e_1,e_1),group_element(x1),product(x1,x2,e_1),group_element(x3) -> equalish(e_1,x0),product(x1,x3,e_3),equalish(x1,e_1),equalish(x3,x2),equalish(e_1,x3),equalish(x3,e_1),product(e_1,e_1,e_1)
% 0.35/0.57 === Backtracking. Learning clause 31:14:3:[2.0,29.0,1.0,30.3,14.3,13.1,10.3,13.1,12.1,10.3,13.1,10.4,16.5]:TopTopTop: product(x0,e_2,e_3),group_element(x1),group_element(x2) -> equalish(e_2,x1),equalish(e_1,x0),equalish(e_2,x2),product(x1,x2,e_3),equalish(x1,e_1),product(x2,e_1,e_1),product(x2,e_1,e_3),equalish(e_1,x2),equalish(x2,e_1),product(e_1,e_1,e_1),product(e_1,e_1,e_2)
% 0.35/0.57 === Backtracking. Learning clause 39:1:0:[1.0,32.0,3.0,33.1,7.0,34.2,5.0,35.3,4.0,36.4,9.0,37.5,8.0,38.6,13.1,10.4,31.14,28.1,12.1,12.1,26.7]:: -> product(e_1,e_1,e_1)
% 0.35/0.57 === Backtracking. Learning clause 40:2:2:[12.3,6.1]:TopTop: product(x0,e_2,x1),product(x0,e_1,x1) ->
% 0.35/0.57 === Backtracking. Learning clause 41:1:0:[12.2,39.1,6.1]:: product(e_1,e_2,e_1) ->
% 0.35/0.57 === Backtracking. Learning clause 42:4:5:[14.2,14.3]:TopTopTopTopTop: product(x0,x1,x2),product(x2,x3,x1),product(x3,x1,x4) -> product(x2,x0,x4)
% 0.35/0.57 === Backtracking. Learning clause 43:4:4:[12.3,8.1,42.4]:TopTopTopTop: product(x0,e_1,x1),product(e_3,x2,x0),product(x0,x3,x2),product(x3,x2,x1) ->
% 0.35/0.57 === Backtracking. Learning clause 44:3:0:[10.1,3.1]:: -> product(e_3,e_3,e_1),product(e_3,e_3,e_2),product(e_3,e_3,e_3)
% 0.35/0.57 === Backtracking. Learning clause 45:3:0:[14.1,14.3,42.1,10.3,12.2,9.1,2.1,40.1,3.1,44.2,43.2]:: product(e_3,e_1,e_3) -> product(e_3,e_1,e_1),product(e_3,e_3,e_1)
% 0.35/0.57 === Backtracking. Learning clause 46:4:1:[10.2,1.1]:Top: group_element(x0) -> product(x0,e_1,e_1),product(x0,e_1,e_2),product(x0,e_1,e_3)
% 0.35/0.57 === Backtracking. Learning clause 49:7:2:[39.0,47.0,3.0,48.1,10.5,42.1,43.3,10.3,12.2,9.1,2.1,1.1,40.1,42.2,44.3]:TopTop: product(e_3,e_1,e_2),product(x0,e_1,e_1),product(e_3,e_1,x1) -> product(e_3,e_1,e_3),product(e_1,x0,x1),product(e_3,e_3,e_1),product(e_3,e_3,e_2)
% 0.35/0.57 === Backtracking. Learning clause 50:4:1:[12.3,8.1,49.7,46.3,3.1,45.1]:Top: product(x0,e_1,e_1) -> product(e_1,x0,e_2),product(e_3,e_1,e_1),product(e_3,e_3,e_1)
% 0.35/0.57 === Backtracking. Learning clause 52:1:0:[41.0,51.0,10.4,12.2,42.1,2.1,9.1,1.1,14.3,46.3,43.1,50.4,3.1,43.2,39.1]:: -> product(e_1,e_1,e_2)
% 0.35/0.57 === Conflict found: 45:3:0:[14.1,14.3,42.1,10.3,12.2,9.1,2.1,40.1,3.1,44.2,43.2]:: product(e_3,e_1,e_3) -> product(e_3,e_1,e_1),product(e_3,e_3,e_1) {}
% 0.35/0.57 === Backtracking. Learning clause 53:4:2:[45.2,42.2,43.3]:TopTop: product(x0,e_1,e_3),product(e_1,e_1,x1),product(e_3,e_1,e_3) -> product(e_3,x0,x1)
% 0.35/0.57 === Conflict found: 43:4:4:[12.3,8.1,42.4]:TopTopTopTop: product(x0,e_1,x1),product(e_3,x2,x0),product(x0,x3,x2),product(x3,x2,x1) -> {x0 -> e_1, x1 -> e_2, x2 -> e_1, x3 -> e_1}
% 0.35/0.57 === Backtracking. Learning clause 55:2:0:[3.0,54.0,43.3,39.1,46.2,53.1,52.1]:: -> product(e_3,e_1,e_2),product(e_3,e_3,e_2)
% 0.35/0.57 === Conflict found: 42:4:5:[14.2,14.3]:TopTopTopTopTop: product(x0,x1,x2),product(x2,x3,x1),product(x3,x1,x4) -> product(x2,x0,x4) {x0 -> e_3, x1 -> e_1, x2 -> e_3, x3 -> e_1, x4 -> e_2}
% 0.35/0.57 === Backtracking. Learning clause 56:3:1:[42.3,52.1,45.2,43.3]:Top: product(x0,e_1,e_3),product(e_3,e_1,e_3) -> product(e_3,x0,e_2)
% 0.35/0.57 === Conflict found: 43:4:4:[12.3,8.1,42.4]:TopTopTopTop: product(x0,e_1,x1),product(e_3,x2,x0),product(x0,x3,x2),product(x3,x2,x1) -> {x0 -> e_1, x1 -> e_2, x2 -> e_1, x3 -> e_1}
% 0.35/0.57 === Backtracking. Learning clause 57:2:1:[43.3,39.1]:Top: product(e_3,e_1,e_1),product(e_1,e_1,x0) ->
% 0.35/0.57 === Backtracking. Learning clause 58:1:0:[10.3,41.1,40.1,42.1,2.1,1.1,55.1,52.1,56.1]:: -> product(e_3,e_3,e_2)
% 0.35/0.57 === Conflict found: 45:3:0:[14.1,14.3,42.1,10.3,12.2,9.1,2.1,40.1,3.1,44.2,43.2]:: product(e_3,e_1,e_3) -> product(e_3,e_1,e_1),product(e_3,e_3,e_1) {}
% 0.35/0.57 === Backtracking. Learning clause 59:1:0:[45.3,43.3,57.1,52.1]:: product(e_3,e_1,e_3) ->
% 0.35/0.57 === Backtracking. Learning clause 61:2:0:[59.0,60.2,10.1,3.1,1.1]:: -> product(e_3,e_1,e_1),product(e_3,e_1,e_2)
% 0.35/0.57
% 0.35/0.57 SZS status Unsatisfiable
% 0.35/0.57
% 0.35/0.57 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.57
% 0.35/0.57 SPASS-SCL-FOL Statistics:
% 0.35/0.57 Number of learned clauses: 24
% 0.35/0.57 Number of propagations: 278
% 0.35/0.57 Number of decisions: 66
% 0.35/0.57 Number of resolutions: 132
% 0.35/0.57 Number of condensations: 7
% 0.35/0.57 Number of sub resolutions: 23
% 0.35/0.57 Number of input literals (deduplicated): 15
% 0.35/0.57 Number of grows: 0
% 0.35/0.57 Number of considered ground atoms: 39
% 0.35/0.57
% 0.35/0.57 Needed: 0:00:00.03
% 0.35/0.57
%------------------------------------------------------------------------------