%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1 % Problem : SYN740-1 : TPTP v9.2.1. Released v2.5.0. % Transfm : none % Format : tptp % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % Computer : n031.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:13 PM UTC 2026 % Result : Satisfiable 18.99s 4.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SYN740-1 : TPTP v9.2.1. Released v2.5.0. % 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 % Computer : n031.cluster.edu % 0.19/0.35 % Model : x86_64 x86_64 % 0.19/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.19/0.35 % Memory : 8042.1875MB % 0.19/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.19/0.35 % CPULimit : 300 % 0.19/0.35 % WCLimit : 300 % 0.19/0.35 % DateTime : Thu May 7 13:49:56 EDT 2026 % 0.19/0.35 % CPUTime : % 0.19/0.35 SPASS-SCL-FOL version: % 0.21/0.45 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode] % 18.99/4.37 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.99/4.37 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.99/4.37 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.99/4.37 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.99/4.37 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.99/4.37 Execution lmodel_grow ended with status: satisfiable % 18.99/4.37 Used heuristic: lmodel_grow % 18.99/4.37 % 18.99/4.37 Input Clauses: % 18.99/4.37 % 18.99/4.37 Predicates: ssRr ssPv3 ssPv1 ssPv2 ssPv4 % 18.99/4.37 Fol Constants: a % 18.99/4.37 Fol Functions: skf1 % 18.99/4.37 Problem Properties: % 18.99/4.37 This is a full first-order problem without equality. % 18.99/4.37 % 18.99/4.37 After reduction: Problem Properties: % 18.99/4.37 This is a full first-order problem without equality. % 18.99/4.37 % 18.99/4.37 % 18.99/4.37 Reduced Input Clauses: % 18.99/4.37 32:5:3:[20.4,10.5]:TopTopTop: ssRr(x0,x1),ssPv1(x1),ssRr(x0,x2),ssPv2(x0) -> ssPv1(x2) % 18.99/4.37 % 18.99/4.37 Most General Atoms: ssRr(x0,x3) ssPv3(x3) ssPv1(x3) ssPv2(x3) ssPv4(x3) % 18.99/4.37 % 18.99/4.37 === Starting SPASS-SCL-FOL A Little Less Naive, considering 54 atoms initially, heuristics mode: lmodel_grow === % 18.99/4.37 % 18.99/4.37 === Backtracking. Learning clause 33:7:3:[19.6,3.2]:TopTopTop: ssRr(x0,x1),ssPv2(x0),ssPv3(x0),ssRr(x1,x2),ssPv3(x1) -> ssPv4(x2),ssPv2(x1) % 18.99/4.37 === Clause set with instances from active satisfied. Growing active. New size: 71 % 18.99/4.37 === Clause set with instances from active satisfied. Growing active. New size: 84 % 18.99/4.37 === Clause set with instances from active satisfied. Growing active. New size: 88 % 18.99/4.37 === Clause set with instances from active satisfied. Growing active. New size: 91 % 18.99/4.37 === Clause set with instances from active satisfied. Growing active. New size: 92 % 18.99/4.37 === Clause set with instances from active satisfied. Growing active. New size: 94 % 18.99/4.37 === Backtracking. Learning clause 34:10:5:[18.6,19.2]:TopTopTopTopTop: ssRr(x0,x1),ssPv4(x1),ssRr(x0,x2),ssPv2(x0),ssPv3(x0),ssRr(x3,x2),ssRr(x3,x4),ssPv2(x3),ssPv3(x3) -> ssPv1(x4) % 18.99/4.37 === Backtracking. Learning clause 36:7:4:[22.3,35.6,5.6,19.2,34.2,4.2,34.10,18.6,21.6,16.5,14.5]:TopTopTopTop: ssPv4(x0),ssRr(x0,x1),ssPv4(x2),ssRr(x2,x0),ssRr(x3,x2),ssPv1(x3) -> ssPv2(x3) % 18.99/4.37 === Backtracking. Learning clause 37:9:5:[25.6,18.5]:TopTopTopTopTop: ssRr(x0,x1),ssPv4(x1),ssRr(x0,x2),ssRr(x2,x3),ssPv4(x3),ssRr(x2,x4),ssPv2(x2) -> ssPv4(x0),ssPv3(x4) % 18.99/4.37 === Backtracking. Learning clause 38:15:8:[12.4,12.5,31.4]:TopTopTopTopTopTopTopTop: ssRr(x0,x1),ssPv2(x1),ssRr(x0,x2),ssRr(x3,x4),ssPv2(x4),ssRr(x3,x0),ssPv1(x3),ssRr(x5,x6),ssPv2(x6),ssRr(x5,x2),ssRr(x5,x7),ssPv2(x5) -> ssPv3(x0),ssPv3(x3),ssPv4(x7) % 18.99/4.37 === Backtracking. Learning clause 39:10:6:[2.4,30.6,28.6,26.7]:TopTopTopTopTopTop: ssRr(x0,x1),ssPv2(x1),ssRr(x0,x2),ssRr(x0,x3),ssPv3(x3),ssRr(x0,x4),ssPv1(x4),ssRr(x0,x5) -> ssPv3(x2),ssPv1(x5) % 18.99/4.37 === Backtracking. Learning clause 40:13:7:[9.6,11.2,32.5]:TopTopTopTopTopTopTop: ssRr(x0,x1),ssPv1(x1),ssRr(x0,x2),ssRr(x3,x0),ssRr(x3,x4),ssPv1(x3),ssRr(x5,x6),ssPv1(x6),ssRr(x5,x0),ssPv2(x5) -> ssPv3(x2),ssPv3(x4),ssPv3(x3) % 18.99/4.37 === Clause set with instances from active satisfied. Growing active. New size: 95 % 18.99/4.37 % 18.99/4.37 Linear Model Building succeeded. % 18.99/4.37 SZS status Satisfiable % 18.99/4.37 % 18.99/4.37 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.99/4.37 % 18.99/4.37 SPASS-SCL-FOL Statistics: % 18.99/4.37 Number of learned clauses: 7 % 18.99/4.37 Number of propagations: 175 % 18.99/4.37 Number of decisions: 71 % 18.99/4.37 Number of resolutions: 18 % 18.99/4.37 Number of condensations: 4 % 18.99/4.37 Number of sub resolutions: 2 % 18.99/4.37 Number of input literals (deduplicated): 6 % 18.99/4.37 Number of grows: 7 % 18.99/4.37 Number of considered ground atoms: 95 % 18.99/4.37 % 18.99/4.37 Needed: 0:00:03.78 % 18.99/4.37 %------------------------------------------------------------------------------