%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : LCL688+1.001 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:28:17 PM UTC 2026
% Result : Theorem 10.70s 2.62s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : LCL688+1.001 : TPTP v9.2.1. Released v4.0.0.
% 0.10/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 7 12:38:31 EDT 2026
% 0.14/0.34 % CPUTime :
% 0.14/0.34 SPASS-SCL-FOL version:
% 0.18/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 10.70/2.62 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.70/2.62 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.70/2.62 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.70/2.62 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.70/2.62 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.70/2.62 Execution normal ended with status: unsatisfiable
% 10.70/2.62 Used heuristic: normal
% 10.70/2.62
% 10.70/2.62 Input Clauses:
% 10.70/2.62
% 10.70/2.62 Predicates: r1 p4 p3 p2 p1 ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8
% 10.70/2.62 Fol Constants: skc5 skc7 skc8 skc9 skc10 skc11
% 10.70/2.62 Fol Functions: skf1 skf2 skf3 skf4 skf6 skf12 skf13
% 10.70/2.62 Problem Properties:
% 10.70/2.62 This is a full first-order problem without equality.
% 10.70/2.62
% 10.70/2.62 After reduction: Problem Properties:
% 10.70/2.62 This is a full first-order problem without equality.
% 10.70/2.62
% 10.70/2.62
% 10.70/2.62 Reduced Input Clauses:
% 10.70/2.62
% 10.70/2.62 Most General Atoms: ren1(x1,x0) p3(skf1(x0)) p3(skf2(x0)) p2(x1) ren3(x2,x0) ren4(x0) ren2(x2) r1(x1,x3) ren5(x1,x0) p1(x2) ren6(x3,x0) ren7(x1,x0) ren8(x1,x0) p4(x0)
% 10.70/2.62
% 10.70/2.62 === Starting SPASS-SCL-FOL A Little Less Naive, considering 57 atoms initially, heuristics mode: normal ===
% 10.70/2.62
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 121
% 10.70/2.62 === Backtracking. Learning clause 34:4:2:[28.1,1.1,33.4]:TopTop: r1(skc5,x0),r1(x0,x1),r1(x1,skc9),ren8(x0,skf13(x0)) ->
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 185
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 249
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 313
% 10.70/2.62 === Backtracking. Learning clause 35:6:3:[28.1,14.1,15.1,25.2,18.3]:TopTopTop: r1(skc5,skc9),ren6(skc5,skc7),r1(x0,skc5),r1(skc5,x1) -> p1(x1),ren6(x2,x0)
% 10.70/2.62 === Backtracking. Learning clause 36:3:0:[28.1,14.1,15.1,25.2]:: r1(skc5,skc9),ren6(skc5,skc7) -> p1(skc5)
% 10.70/2.62 === Backtracking. Learning clause 37:1:1:[28.2,15.1,14.1]:Top: -> ren5(skc9,x0)
% 10.70/2.62 === Backtracking. Learning clause 38:2:3:[22.1,17.1]:TopTopTop: -> ren8(x0,x1),ren6(x2,x1)
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 377
% 10.70/2.62 === Backtracking. Learning clause 39:2:3:[11.2,6.1,3.1]:TopTopTop: -> ren3(x0,x1),ren1(x1,x2)
% 10.70/2.62 === Backtracking. Learning clause 40:2:2:[12.1,10.1,39.2]:TopTop: -> ren4(x0),ren3(x0,x1)
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 441
% 10.70/2.62 === Backtracking. Learning clause 41:7:4:[13.3,9.2,40.2]:TopTopTopTop: r1(x0,x1),r1(x1,x2),p2(x1),r1(x1,x3) -> ren4(x0),p2(x2),ren4(x3)
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 505
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 569
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 633
% 10.70/2.62 === Backtracking. Learning clause 42:3:1:[33.2,1.1]:Top: r1(skc5,x0),p1(x0),ren8(x0,skf13(x0)) ->
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 697
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 761
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 825
% 10.70/2.62 === Backtracking. Learning clause 43:4:4:[2.2,2.3]:TopTopTopTop: r1(x0,x1),r1(x1,x2),r1(x2,x3) -> r1(x0,x3)
% 10.70/2.62 === Backtracking. Learning clause 44:1:1:[24.2,40.1,1.1]:Top: -> ren3(skc5,x0)
% 10.70/2.62 === Conflict found: 40:2:2:[12.1,10.1,39.2]:TopTop: -> ren4(x0),ren3(x0,x1) {x0 -> skf6(skc5), x1 -> skf4(skf6(skc5))}
% 10.70/2.62 === Backtracking. Learning clause 45:7:4:[40.2,13.6]:TopTopTopTop: r1(x0,x1),r1(x1,x2),ren2(x2),p2(x1),r1(x1,x3) -> ren4(x3),ren4(x0)
% 10.70/2.62 === Clause set with instances from active satisfied. Growing active. New size: 889
% 10.70/2.62 === Conflict found: 45:7:4:[40.2,13.6]:TopTopTopTop: r1(x0,x1),r1(x1,x2),ren2(x2),p2(x1),r1(x1,x3) -> ren4(x3),ren4(x0) {x0 -> skc11, x1 -> skf3(skc11), x2 -> skf12(skf3(skc11)), x3 -> skf1(skf3(skc11))}
% 10.70/2.62
% 10.70/2.62 SZS status Unsatisfiable
% 10.70/2.62
% 10.70/2.62 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.70/2.62
% 10.70/2.62 SPASS-SCL-FOL Statistics:
% 10.70/2.62 Number of learned clauses: 12
% 10.70/2.62 Number of propagations: 2901
% 10.70/2.62 Number of decisions: 999
% 10.70/2.62 Number of resolutions: 37
% 10.70/2.62 Number of condensations: 3
% 10.70/2.62 Number of sub resolutions: 0
% 10.70/2.62 Number of input literals (deduplicated): 32
% 10.70/2.62 Number of grows: 13
% 10.70/2.62 Number of considered ground atoms: 889
% 10.70/2.62
% 10.70/2.62 Needed: 0:00:02.11
% 10.70/2.62
%------------------------------------------------------------------------------