%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN720-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 : n011.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:11 PM UTC 2026
% Result : Satisfiable 12.68s 3.12s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN720-1 : TPTP v9.2.1. Released v2.5.0.
% 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n011.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 13:47:18 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 12.68/3.12 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.68/3.12 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.68/3.12 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.68/3.12 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.68/3.12 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.68/3.12 Execution lmodel_grow ended with status: satisfiable
% 12.68/3.12 Used heuristic: lmodel_grow
% 12.68/3.12
% 12.68/3.12 Input Clauses:
% 12.68/3.12
% 12.68/3.12 Predicates: s0 q0 n0 m0 r0 p0 l0 k0 k1 l1 m1 n1 p1 q1 r1 s1 k2 l2 m2 n2 p2 q2 r2 s2 k3 l3 m3 n3 p3 q3 r3 s3 k4 l4 m4 n4 p4 q4 r4 s4 k5 l5 m5 n5 p5 q5 r5 s5
% 12.68/3.12 Fol Constants: d e a b c
% 12.68/3.12 Fol Functions:
% 12.68/3.12 Problem Properties:
% 12.68/3.12 This is a Bernays Schoenfinkel problem.
% 12.68/3.12
% 12.68/3.12 After reduction: Problem Properties:
% 12.68/3.12 This is a Bernays Schoenfinkel problem.
% 12.68/3.12
% 12.68/3.12
% 12.68/3.12 Reduced Input Clauses:
% 12.68/3.12 370:3:2:[1.0,57.1,17.0,369.2]:TopTop: r0(c),p0(x0,x1) -> m1(x0,x1,c)
% 12.68/3.12 371:1:0:[24.0,58.0]:: -> m1(c,c,c)
% 12.68/3.12 373:1:0:[20.0,61.0,1.0,372.1]:: -> m1(a,a,a)
% 12.68/3.12 374:3:2:[12.0,62.0]:TopTop: q0(x0,x1),m1(x1,c,x1) -> m1(x0,a,x1)
% 12.68/3.12 375:1:0:[13.0,68.0]:: -> m1(e,e,e)
% 12.68/3.12 377:2:0:[13.0,69.0,28.0,376.2]:: m0(a,e,c) -> m1(c,a,c)
% 12.68/3.12 378:2:1:[5.0,79.0]:Top: m1(b,x0,e) -> n1(e,e,x0)
% 12.68/3.12 379:1:0:[24.0,87.0]:: -> n1(c,c,c)
% 12.68/3.12 381:2:2:[5.0,88.0,14.0,380.2]:TopTop: l0(x0) -> n1(x0,x1,x0)
% 12.68/3.12 382:3:0:[9.0,93.2]:: p0(d,d),n1(e,e,e) -> n1(d,e,e)
% 12.68/3.12 384:2:0:[21.0,98.0,32.0,383.2]:: m1(d,e,e) -> n1(d,d,b)
% 12.68/3.12 385:3:2:[40.1,103.0]:TopTop: p0(x0,x1),n0(x1,x1) -> p1(x0,x0,x0)
% 12.68/3.12 386:3:4:[5.0,109.2]:TopTopTopTop: l0(x0),p1(x1,x2,x3) -> p1(x3,x1,x3)
% 12.68/3.12 388:2:1:[28.0,117.0,24.0,387.2]:Top: k1(x0) -> p1(x0,x0,x0)
% 12.68/3.12 389:2:0:[9.0,125.0]:: p1(a,a,a) -> p1(a,b,a)
% 12.68/3.12 390:1:0:[20.0,126.0]:: -> p1(a,a,a)
% 12.68/3.12 392:2:0:[32.0,132.1,24.0,391.2]:: s0(e) -> q1(b,e,e)
% 12.68/3.12 394:1:1:[19.0,145.0,19.0,393.1]:Top: -> q1(e,x0,x0)
% 12.68/3.12 395:3:3:[6.0,146.2]:TopTopTop: p0(x0,x1),p1(x2,b,b) -> q1(x2,x2,x2)
% 12.68/3.12 396:2:0:[16.0,149.0]:: m1(c,d,a) -> q1(d,d,c)
% 12.68/3.12 397:2:1:[5.0,150.1]:Top: k1(x0) -> q1(x0,x0,x0)
% 12.68/3.12 398:3:2:[5.0,156.1]:TopTop: p0(b,d),n1(x0,d,x1) -> q1(x1,x1,x1)
% 12.68/3.12 399:2:1:[5.0,157.1]:Top: s0(x0) -> q1(x0,b,b)
% 12.68/3.12 400:3:2:[1.0,162.1]:TopTop: q0(x0,x1),q1(d,x1,d) -> r1(x0)
% 12.68/3.12 401:2:0:[32.0,177.1]:: l1(e,c) -> n2(c)
% 12.68/3.12 402:3:2:[13.0,178.1]:TopTop: r1(b),p1(b,x0,x1) -> n2(e)
% 12.68/3.12 403:2:0:[394.2,181.1]:: l1(c,b) -> p2(c,e,e)
% 12.68/3.12 405:3:1:[13.0,182.0,14.0,404.2]:Top: n1(c,x0,x0),k2(c,a) -> p2(b,c,a)
% 12.68/3.12 406:2:2:[13.0,183.0]:TopTop: p1(x0,x1,e) -> p2(e,x0,x1)
% 12.68/3.12 407:3:2:[24.0,221.1]:TopTop: k1(x0),l2(x0,x1) -> q2(x1,c,x0)
% 12.68/3.12 408:2:0:[1.0,228.1]:: s1(a) -> s2(d)
% 12.68/3.12 409:3:2:[32.0,365.1]:TopTop: s4(x0),n3(x1) -> r5(x0,x1)
% 12.68/3.12 410:3:1:[13.0,249.2]:Top: l0(x0),r2(e) -> k3(x0,x0,x0)
% 12.68/3.12 411:3:0:[9.0,262.2]:: s2(d),k3(a,c,a) -> l3(d,c)
% 12.68/3.12 412:2:2:[278.1,286.1]:TopTop: p2(x0,x1,x1) -> p3(x1,x1,x1)
% 12.68/3.12 413:4:2:[19.0,297.0]:TopTop: k1(x0),r2(d),q3(x1,x0) -> q3(x0,x0)
% 12.68/3.12 414:3:0:[34.0,312.0]:: q3(e,b),n3(e) -> k4(c)
% 12.68/3.12
% 12.68/3.12 Most General Atoms: q5(x0,x1) p5(x0,x1,x0) p5(x0,x2,x2) p5(x1,x1,x0) s1(x0) k4(x0) r0(x1) k0(x2) s5(x0) n5(x2,x4) r4(x1) l0(x4) p4(x0,x1,x2) m5(x0,x2) m1(x3,x1,x0) q1(x2,x0,x1) l5(x1) q0(x1,x2) k5(x2) s4(x3) k1(x3) l1(x1,x2) m2(x0) q4(x1,x3) p0(x2,x1) r1(x1) n2(x0) n1(x2,x0,x1) n0(x3,x2) n4(x1,x2) r5(x0,x1) k2(x2,x3) s2(x3) l3(x0,x1) s0(x2) p1(x1,x0,x2) n3(x2) k3(x0,x1,x2) p3(x2,x0,x1) m3(x0,x1,x2) p2(x3,x0,x2) q2(x0,x1,x2) q3(x1,x0) l2(x1,x0) r2(x1) r3(x2,x0,x1) m0(x0,x2,x3) s3(x1,x3) l4(x2) m4(x2,x1)
% 12.68/3.12
% 12.68/3.12 === Starting SPASS-SCL-FOL A Little Less Naive, considering 371 atoms initially, heuristics mode: lmodel_grow ===
% 12.68/3.12
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 480
% 12.68/3.12 === Backtracking. Learning clause 415:4:2:[208.1,78.3,253.2]:TopTop: m0(x0,x1,e),k1(x0),r0(x0) -> l3(x0,e)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 559
% 12.68/3.12 === Backtracking. Learning clause 416:4:4:[184.3,214.2]:TopTopTopTop: p1(x0,x1,x2),l1(x1,x2),m1(x3,x0,x3) -> p2(x0,x3,x3)
% 12.68/3.12 === Conflict found: 406:2:2:[13.0,183.0]:TopTop: p1(x0,x1,e) -> p2(e,x0,x1) {x0 -> c, x1 -> c}
% 12.68/3.12 === Backtracking. Learning clause 418:2:1:[28.0,417.1,406.1,101.3]:Top: n0(d,x0) -> p2(e,x0,x0)
% 12.68/3.12 === Conflict found: 418:2:1:[28.0,417.1,406.1,101.3]:Top: n0(d,x0) -> p2(e,x0,x0) {x0 -> c}
% 12.68/3.12 === Backtracking. Learning clause 419:1:0:[418.1,26.1]:: -> p2(e,c,c)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 622
% 12.68/3.12 === Backtracking. Learning clause 420:5:3:[165.1,73.3]:TopTopTop: k1(x0),k2(x0,x1),r0(x2),l0(x1) -> k2(x2,x1)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 676
% 12.68/3.12 === Backtracking. Learning clause 421:5:3:[310.2,226.3]:TopTopTop: k2(x0,x1),r3(x1,x2,x2),r1(x1),l0(x1) -> r3(x2,x0,x1)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 702
% 12.68/3.12 === Backtracking. Learning clause 422:7:4:[280.3,319.1,232.2,420.5,167.2,159.2]:TopTopTopTop: r2(x0),n4(x1,x1),k1(x0),r0(x1),l0(x0),m0(x2,x3,x0) -> n4(x1,x0)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 723
% 12.68/3.12 === Backtracking. Learning clause 423:4:5:[120.2,120.3]:TopTopTopTopTop: m0(x0,x1,x2),m0(x2,x0,x3),p1(x2,x0,x3) -> p1(x1,x4,x0)
% 12.68/3.12 === Backtracking. Learning clause 424:3:3:[214.1,45.3]:TopTopTop: p0(x0,x1),r0(x2) -> p2(x1,x2,x1)
% 12.68/3.12 === Backtracking. Learning clause 425:2:2:[163.1,14.1,164.2]:TopTop: q0(x0,x1) -> s1(x0)
% 12.68/3.12 === Backtracking. Learning clause 427:5:3:[371.0,426.3,165.1,374.3,405.2]:TopTopTop: k1(x0),k2(x0,a),q0(x1,c),n1(c,x2,x2) -> p2(b,c,a)
% 12.68/3.12 === Backtracking. Learning clause 429:4:1:[32.0,428.0,121.1,72.4]:Top: k1(a),k1(b),q0(x0,x0) -> p1(x0,b,b)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 747
% 12.68/3.12 === Conflict found: 423:4:5:[120.2,120.3]:TopTopTopTopTop: m0(x0,x1,x2),m0(x2,x0,x3),p1(x2,x0,x3) -> p1(x1,x4,x0) {x0 -> b, x1 -> a, x2 -> a, x3 -> a, x4 -> c}
% 12.68/3.12 === Backtracking. Learning clause 430:3:3:[423.2,12.1]:TopTopTop: m0(x0,x1,a),p1(a,x0,a) -> p1(x1,x2,x0)
% 12.68/3.12 === Backtracking. Learning clause 431:4:4:[305.1,416.4,323.2,45.3,9.1]:TopTopTopTop: p1(x0,x1,x2),l1(x1,x2),p0(x3,x0) -> p4(b,b,x0)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 768
% 12.68/3.12 === Backtracking. Learning clause 432:9:5:[220.2,92.4,227.1,311.2]:TopTopTopTopTop: p1(b,b,b),q2(x0,b,b),l0(x1),l1(x1,x0),n1(x0,b,x0),s1(b),q2(x2,x0,x2),m0(x2,x3,x4) -> s3(x0,x4)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 792
% 12.68/3.12 === Backtracking. Learning clause 433:4:3:[54.2,374.3]:TopTopTop: m1(x0,x1,x2),q0(x0,x1),m1(x1,c,x1) -> m1(x2,x1,x1)
% 12.68/3.12 === Backtracking. Learning clause 434:5:3:[137.3,143.3]:TopTopTop: k0(x0),l0(x1),s0(x2),p0(x0,d) -> q1(x1,x2,x2)
% 12.68/3.12 === Conflict found: 423:4:5:[120.2,120.3]:TopTopTopTopTop: m0(x0,x1,x2),m0(x2,x0,x3),p1(x2,x0,x3) -> p1(x1,x4,x0) {x0 -> a, x1 -> c, x2 -> a, x3 -> a, x4 -> c}
% 12.68/3.12 === Backtracking. Learning clause 436:1:2:[390.0,435.0,423.1,12.1,12.1]:TopTop: -> p1(x0,x1,a)
% 12.68/3.12 === Backtracking. Learning clause 437:5:3:[165.1,59.3]:TopTopTop: k1(x0),k2(x0,x1),l0(x2),k0(x1) -> k2(x2,x1)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 811
% 12.68/3.12 === Backtracking. Learning clause 438:4:2:[220.2,381.2]:TopTop: p1(x0,x0,x1),q2(x1,x1,x0),l0(x1) -> q2(x0,x1,x0)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 827
% 12.68/3.12 === Backtracking. Learning clause 439:4:4:[305.1,184.4]:TopTopTopTop: p1(x0,x1,x2),l1(x1,x2),p2(x0,x3,x0) -> r3(x0,x3,x0)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 840
% 12.68/3.12 === Conflict found: 421:5:3:[310.2,226.3]:TopTopTop: k2(x0,x1),r3(x1,x2,x2),r1(x1),l0(x1) -> r3(x2,x0,x1) {x0 -> b, x1 -> e, x2 -> b}
% 12.68/3.12 === Backtracking. Learning clause 440:8:5:[421.2,298.3,165.4]:TopTopTopTopTop: r1(x0),l0(x0),s2(x1),l2(c,x0),m1(x2,x0,x3),k1(x4),k2(x4,x0) -> r3(x1,x3,x0)
% 12.68/3.12 === Conflict found: 420:5:3:[165.1,73.3]:TopTopTop: k1(x0),k2(x0,x1),r0(x2),l0(x1) -> k2(x2,x1) {x0 -> a, x1 -> e, x2 -> b}
% 12.68/3.12 === Backtracking. Learning clause 441:7:4:[420.5,421.1]:TopTopTopTop: k1(x0),k2(x0,x1),r0(x2),r3(x1,x3,x3),r1(x1),l0(x1) -> r3(x3,x2,x1)
% 12.68/3.12 === Backtracking. Learning clause 442:9:4:[298.1,227.3,441.4]:TopTopTopTop: l2(c,x0),q2(b,x1,b),s1(b),k1(x2),k2(x2,x0),r0(x3),r1(x0),l0(x0) -> r3(x1,x3,x0)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 853
% 12.68/3.12 === Backtracking. Learning clause 443:5:3:[41.3,19.1,224.1,438.2]:TopTopTop: p0(x0,d),r0(x1),p1(d,d,x2),l0(x2) -> q2(d,x2,d)
% 12.68/3.12 === Conflict found: 442:9:4:[298.1,227.3,441.4]:TopTopTopTop: l2(c,x0),q2(b,x1,b),s1(b),k1(x2),k2(x2,x0),r0(x3),r1(x0),l0(x0) -> r3(x1,x3,x0) {x0 -> e, x1 -> b, x2 -> b, x3 -> b}
% 12.68/3.12 === Backtracking. Learning clause 445:12:7:[9.0,444.3,442.2,216.3,326.1,420.5]:TopTopTopTopTopTopTop: l2(c,x0),s1(b),k1(x1),r1(x0),q0(x2,b),n1(x2,b,x3),p4(x4,x4,x5),k1(x6),k2(x6,x0),r0(x1),l0(x0) -> p4(x0,b,b)
% 12.68/3.12 === Backtracking. Learning clause 446:8:4:[165.1,67.3,437.5]:TopTopTopTop: k1(x0),p0(x1,x2),s0(x1),k1(x3),k2(x3,x2),l0(x0),k0(x2) -> k2(x1,x2)
% 12.68/3.12 === Conflict found: 438:4:2:[220.2,381.2]:TopTop: p1(x0,x0,x1),q2(x1,x1,x0),l0(x1) -> q2(x0,x1,x0) {x0 -> d, x1 -> a}
% 12.68/3.12 === Backtracking. Learning clause 448:2:1:[20.0,447.1,438.1,436.1]:Top: q2(a,a,x0) -> q2(x0,a,x0)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 859
% 12.68/3.12 === Backtracking. Learning clause 449:5:3:[48.4,54.1]:TopTopTop: n0(x0,x0),l1(c,c),p0(x0,x1),m1(x1,x2,x1) -> m1(c,x1,x1)
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 863
% 12.68/3.12 === Clause set with instances from active satisfied. Growing active. New size: 864
% 12.68/3.12
% 12.68/3.12 Linear Model Building succeeded.
% 12.68/3.12 SZS status Satisfiable
% 12.68/3.12
% 12.68/3.12 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.68/3.12
% 12.68/3.12 SPASS-SCL-FOL Statistics:
% 12.68/3.12 Number of learned clauses: 29
% 12.68/3.12 Number of propagations: 7023
% 12.68/3.12 Number of decisions: 2796
% 12.68/3.12 Number of resolutions: 49
% 12.68/3.12 Number of condensations: 4
% 12.68/3.12 Number of sub resolutions: 52
% 12.68/3.12 Number of input literals (deduplicated): 371
% 12.68/3.12 Number of grows: 16
% 12.68/3.12 Number of considered ground atoms: 864
% 12.68/3.12
% 12.68/3.12 Needed: 0:00:02.51
% 12.68/3.12
%------------------------------------------------------------------------------