%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN783-1 : TPTP v9.2.1. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n024.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:40:16 PM UTC 2026
% Result : Satisfiable 3.31s 1.07s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SYN783-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.07 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.25 % Computer : n024.cluster.edu
% 0.08/0.25 % Model : x86_64 x86_64
% 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.25 % Memory : 8042.1875MB
% 0.08/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.25 % CPULimit : 300
% 0.08/0.25 % WCLimit : 300
% 0.08/0.25 % DateTime : Thu May 7 08:48:42 EDT 2026
% 0.08/0.25 % CPUTime :
% 0.08/0.25 SPASS-SCL-FOL version:
% 0.08/0.30 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.31/1.07 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.31/1.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.31/1.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.31/1.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.31/1.07 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.31/1.07 Execution resolution_2 ended with status: satisfiable
% 3.31/1.07 Used heuristic: resolution_2
% 3.31/1.07
% 3.31/1.07 Input Clauses:
% 3.31/1.07
% 3.31/1.07 Predicates: ssRr ssPv3 ssPv4 ssPv5 ssPv6 ssPv2 ssPv8 ssPv7 ssPv1
% 3.31/1.07 Fol Constants: a
% 3.31/1.07 Fol Functions: skf3 skf2
% 3.31/1.07 Problem Properties:
% 3.31/1.07 This is a full first-order problem without equality.
% 3.31/1.07
% 3.31/1.07 After reduction: Problem Properties:
% 3.31/1.07 This is a full first-order problem without equality.
% 3.31/1.07
% 3.31/1.07
% 3.31/1.07 Reduced Input Clauses:
% 3.31/1.07
% 3.31/1.07 Most General Atoms: ssPv7(x0) ssPv3(x1) ssPv2(x5) ssPv6(x4) ssPv1(x5) ssRr(x5,x6) ssPv5(x6) ssPv8(x6) ssPv4(x6)
% 3.31/1.07
% 3.31/1.07 === Starting SPASS-SCL-FOL A Little Less Naive, considering 55 atoms initially, heuristics mode: resolution_2 ===
% 3.31/1.07
% 3.31/1.07 === Clause set with instances from active satisfied. Growing active. New size: 55
% 3.31/1.07 === Restarting.
% 3.31/1.07 === Backtracking. Learning clause 33:6:3:[24.1,1.1]:TopTopTop: ssRr(x0,x1),ssRr(x2,x1),ssPv2(x2) -> ssPv8(skf3(x0)),ssPv7(skf3(x0)),ssPv8(x1)
% 3.31/1.07 === Backtracking. Learning clause 34:6:2:[24.2,1.1]:TopTop: ssRr(x0,skf3(x1)),ssRr(x1,x1),ssPv2(skf3(x1)) -> ssPv8(x0),ssPv7(skf3(x1)),ssPv8(x1)
% 3.31/1.07 === Backtracking. Learning clause 35:5:2:[3.1,1.1]:TopTop: ssRr(x0,x1) -> ssPv3(skf3(x0)),ssPv4(x1),ssPv5(x1),ssPv6(x1)
% 3.31/1.07 === Clause set with instances from active satisfied. Growing active. New size: 55
% 3.31/1.07 === Restarting.
% 3.31/1.07 === Backtracking. Learning clause 36:10:6:[30.9,20.2,4.6]:TopTopTopTopTopTop: ssRr(x0,x1),ssRr(x1,x2),ssRr(x3,x4),ssRr(x2,x3),ssRr(x5,x2),ssRr(x2,x5) -> ssPv5(x0),ssPv6(x2),ssPv2(x4),ssPv4(x4)
% 3.31/1.07 === Backtracking. Learning clause 37:5:2:[3.2,2.1]:TopTop: ssRr(x0,x1) -> ssPv3(x0),ssPv4(skf2(x1)),ssPv5(skf2(x1)),ssPv6(skf2(x1))
% 3.31/1.07 === Conflict found: 37:5:2:[3.2,2.1]:TopTop: ssRr(x0,x1) -> ssPv3(x0),ssPv4(skf2(x1)),ssPv5(skf2(x1)),ssPv6(skf2(x1)) {x0 -> skf3(a), x1 -> a}
% 3.31/1.07 === Backtracking. Learning clause 38:4:1:[37.1,1.1]:Top: -> ssPv3(skf3(x0)),ssPv4(skf2(x0)),ssPv5(skf2(x0)),ssPv6(skf2(x0))
% 3.31/1.07 === Clause set with instances from active satisfied. Growing active. New size: 55
% 3.31/1.07 === Restarting.
% 3.31/1.07 === Backtracking. Learning clause 39:12:7:[20.4,2.1,10.4]:TopTopTopTopTopTopTop: ssRr(x0,x1),ssPv8(x1),ssRr(x2,x0),ssRr(x2,x3),ssPv8(x2),ssRr(x4,x5),ssRr(x5,x6),ssRr(x2,x6),ssPv8(x6) -> ssPv4(skf2(x3)),ssPv7(x4),ssPv7(x6)
% 3.31/1.07 === Backtracking. Learning clause 40:19:10:[14.6,38.4,39.11,20.8,2.1]:TopTopTopTopTopTopTopTopTopTop: ssRr(skf2(x1),x2),ssRr(x3,x4),ssPv8(x4),ssRr(x5,x3),ssRr(x5,x6),ssPv8(x5),ssRr(x2,x7),ssRr(x7,x2),ssRr(x5,x2),ssPv8(x2),ssRr(x8,x9),ssPv8(x9),ssRr(x0,x8),ssRr(x0,x1),ssPv8(x0) -> ssPv3(skf3(x1)),ssPv5(skf2(x1)),ssPv4(skf2(x6)),ssPv4(skf2(x1))
% 3.31/1.07
% 3.31/1.07 Linear Model Building succeeded.
% 3.31/1.07 SZS status Satisfiable
% 3.31/1.07
% 3.31/1.07 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.31/1.07
% 3.31/1.07 SPASS-SCL-FOL Statistics:
% 3.31/1.07 Number of learned clauses: 8
% 3.31/1.07 Number of propagations: 148
% 3.31/1.07 Number of decisions: 112
% 3.31/1.07 Number of resolutions: 13
% 3.31/1.07 Number of condensations: 1
% 3.31/1.07 Number of sub resolutions: 0
% 3.31/1.07 Number of input literals (deduplicated): 11
% 3.31/1.07 Number of grows: 3
% 3.31/1.07 Number of considered ground atoms: 55
% 3.31/1.07
% 3.31/1.07 Needed: 0:00:00.70
% 3.31/1.07
%------------------------------------------------------------------------------