%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN254-1 : TPTP v9.2.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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:39:29 PM UTC 2026
% Result : Unsatisfiable 6.74s 1.88s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN254-1 : TPTP v9.2.1. Released v1.1.0.
% 0.12/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.33 % Computer : n014.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Thu May 7 13:40:53 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.33 SPASS-SCL-FOL version:
% 0.18/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 6.74/1.88 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.74/1.88 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.74/1.88 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.74/1.88 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.74/1.88 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.74/1.88 Execution lmodel_grow ended with status: unsatisfiable
% 6.74/1.88 Used heuristic: lmodel_grow
% 6.74/1.88
% 6.74/1.88 Input Clauses:
% 6.74/1.88
% 6.74/1.88 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
% 6.74/1.88 Fol Constants: d e a b c
% 6.74/1.88 Fol Functions:
% 6.74/1.88 Problem Properties:
% 6.74/1.88 This is a Bernays Schoenfinkel problem.
% 6.74/1.88
% 6.74/1.88 After reduction: Problem Properties:
% 6.74/1.88 This is a Bernays Schoenfinkel problem.
% 6.74/1.88
% 6.74/1.88
% 6.74/1.88 Reduced Input Clauses:
% 6.74/1.88 371:3:2:[1.0,57.1,17.0,370.2]:TopTop: r0(c),p0(x0,x1) -> m1(x0,x1,c)
% 6.74/1.88 372:1:0:[24.0,58.0]:: -> m1(c,c,c)
% 6.74/1.88 374:1:0:[20.0,61.0,1.0,373.1]:: -> m1(a,a,a)
% 6.74/1.88 375:3:2:[12.0,62.0]:TopTop: q0(x0,x1),m1(x1,c,x1) -> m1(x0,a,x1)
% 6.74/1.88 376:1:0:[13.0,68.0]:: -> m1(e,e,e)
% 6.74/1.88 378:2:0:[13.0,69.0,28.0,377.2]:: m0(a,e,c) -> m1(c,a,c)
% 6.74/1.88 379:2:1:[5.0,79.0]:Top: m1(b,x0,e) -> n1(e,e,x0)
% 6.74/1.88 380:1:0:[24.0,87.0]:: -> n1(c,c,c)
% 6.74/1.88 382:2:2:[5.0,88.0,14.0,381.2]:TopTop: l0(x0) -> n1(x0,x1,x0)
% 6.74/1.88 383:3:0:[9.0,93.2]:: p0(d,d),n1(e,e,e) -> n1(d,e,e)
% 6.74/1.88 385:2:0:[21.0,98.0,32.0,384.2]:: m1(d,e,e) -> n1(d,d,b)
% 6.74/1.88 386:3:2:[40.1,103.0]:TopTop: p0(x0,x1),n0(x1,x1) -> p1(x0,x0,x0)
% 6.74/1.88 387:3:4:[5.0,109.2]:TopTopTopTop: l0(x0),p1(x1,x2,x3) -> p1(x3,x1,x3)
% 6.74/1.88 389:2:1:[28.0,117.0,24.0,388.2]:Top: k1(x0) -> p1(x0,x0,x0)
% 6.74/1.88 390:2:0:[9.0,125.0]:: p1(a,a,a) -> p1(a,b,a)
% 6.74/1.88 391:1:0:[20.0,126.0]:: -> p1(a,a,a)
% 6.74/1.88 393:2:0:[32.0,132.1,24.0,392.2]:: s0(e) -> q1(b,e,e)
% 6.74/1.88 395:1:1:[19.0,145.0,19.0,394.1]:Top: -> q1(e,x0,x0)
% 6.74/1.88 396:3:3:[6.0,146.2]:TopTopTop: p0(x0,x1),p1(x2,b,b) -> q1(x2,x2,x2)
% 6.74/1.88 397:2:0:[16.0,149.0]:: m1(c,d,a) -> q1(d,d,c)
% 6.74/1.88 398:2:1:[5.0,150.1]:Top: k1(x0) -> q1(x0,x0,x0)
% 6.74/1.88 399:3:2:[5.0,156.1]:TopTop: p0(b,d),n1(x0,d,x1) -> q1(x1,x1,x1)
% 6.74/1.88 400:2:1:[5.0,157.1]:Top: s0(x0) -> q1(x0,b,b)
% 6.74/1.88 401:3:2:[1.0,162.1]:TopTop: q0(x0,x1),q1(d,x1,d) -> r1(x0)
% 6.74/1.88 402:2:0:[32.0,177.1]:: l1(e,c) -> n2(c)
% 6.74/1.88 403:3:2:[13.0,178.1]:TopTop: r1(b),p1(b,x0,x1) -> n2(e)
% 6.74/1.88 404:2:0:[395.2,181.1]:: l1(c,b) -> p2(c,e,e)
% 6.74/1.88 406:3:1:[13.0,182.0,14.0,405.2]:Top: n1(c,x0,x0),k2(c,a) -> p2(b,c,a)
% 6.74/1.88 407:2:2:[13.0,183.0]:TopTop: p1(x0,x1,e) -> p2(e,x0,x1)
% 6.74/1.88 408:3:2:[24.0,221.1]:TopTop: k1(x0),l2(x0,x1) -> q2(x1,c,x0)
% 6.74/1.88 409:2:0:[1.0,228.1]:: s1(a) -> s2(d)
% 6.74/1.88 410:3:2:[32.0,365.1]:TopTop: s4(x0),n3(x1) -> r5(x0,x1)
% 6.74/1.88 411:3:1:[13.0,249.2]:Top: l0(x0),r2(e) -> k3(x0,x0,x0)
% 6.74/1.88 412:3:0:[9.0,262.2]:: s2(d),k3(a,c,a) -> l3(d,c)
% 6.74/1.88 413:2:2:[278.1,286.1]:TopTop: p2(x0,x1,x1) -> p3(x1,x1,x1)
% 6.74/1.88 414:4:2:[19.0,297.0]:TopTop: k1(x0),r2(d),q3(x1,x0) -> q3(x0,x0)
% 6.74/1.88 415:3:0:[34.0,312.0]:: q3(e,b),n3(e) -> k4(c)
% 6.74/1.88
% 6.74/1.88 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) n5(x2,x4) s5(x0) l0(x4) m1(x3,x1,x0) q1(x2,x0,x1) p4(x0,x1,x2) m5(x0,x2) l5(x1) q0(x1,x2) k5(x2) s4(x3) k1(x3) r4(x1) l1(x1,x2) m2(x0) p0(x2,x1) r1(x1) q4(x1,x3) n2(x0) n1(x2,x0,x1) n0(x3,x2) k2(x2,x3) r5(x0,x1) s2(x3) l3(x0,x1) s0(x2) n4(x1,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)
% 6.74/1.88
% 6.74/1.88 === Starting SPASS-SCL-FOL A Little Less Naive, considering 372 atoms initially, heuristics mode: lmodel_grow ===
% 6.74/1.88
% 6.74/1.88 === Clause set with instances from active satisfied. Growing active. New size: 505
% 6.74/1.88 === Backtracking. Learning clause 416:2:2:[175.1,107.2]:TopTop: p0(x0,x1) -> n2(x0)
% 6.74/1.88 === Backtracking. Learning clause 417:4:4:[163.1,14.1,164.2,409.1,311.2]:TopTopTopTop: q0(a,x0),q2(x1,d,x1),m0(x1,x2,x3) -> s3(d,x3)
% 6.74/1.88 === Backtracking. Learning clause 418:2:3:[167.1,159.2]:TopTopTop: m0(x0,x1,x2) -> k2(x2,x2)
% 6.74/1.88 === Clause set with instances from active satisfied. Growing active. New size: 590
% 6.74/1.88 === Backtracking. Learning clause 419:3:3:[323.2,305.2]:TopTopTop: r0(x0),p2(x1,x2,x0) -> p4(x0,x0,x1)
% 6.74/1.88 === Clause set with instances from active satisfied. Growing active. New size: 646
% 6.74/1.88 === Backtracking. Learning clause 420:4:5:[120.3,120.2]:TopTopTopTopTop: m0(x0,x1,x2),p1(x0,x1,x2),m0(x1,x3,x0) -> p1(x3,x4,x1)
% 6.74/1.88 === Clause set with instances from active satisfied. Growing active. New size: 697
% 6.74/1.88 === Backtracking. Learning clause 421:4:2:[319.1,280.3]:TopTop: n4(x0,x0),r2(x1),k3(x1,x1,x0) -> n4(x0,x1)
% 6.74/1.88 === Clause set with instances from active satisfied. Growing active. New size: 737
% 6.74/1.88 === Conflict found: 421:4:2:[319.1,280.3]:TopTop: n4(x0,x0),r2(x1),k3(x1,x1,x0) -> n4(x0,x1) {x0 -> c, x1 -> a}
% 6.74/1.88 === Backtracking. Learning clause 422:4:2:[421.3,232.2]:TopTop: n4(x0,x0),r2(x1),k2(x0,x1) -> n4(x0,x1)
% 6.74/1.88 === Clause set with instances from active satisfied. Growing active. New size: 781
% 6.74/1.88 === Backtracking. Learning clause 423:4:3:[311.1,219.2]:TopTopTop: s2(x0),m0(x0,x1,x2),p1(x0,x0,x0) -> s3(x0,x2)
% 6.74/1.88 === Backtracking. Learning clause 424:4:3:[214.2,289.2,59.3]:TopTopTop: m3(x0,x1,x2),l0(x0),k0(x2) -> p3(x2,x0,x0)
% 6.74/1.88 === Backtracking. Learning clause 425:7:6:[224.1,41.4,279.1,165.4,43.2]:TopTopTopTopTopTop: p0(x0,x1),r0(x2),m0(d,x1,x0),k1(x3),k2(x3,x4),m0(x4,x4,x5) -> p3(x1,x5,x4)
% 6.74/1.88 === Backtracking. Learning clause 426:4:5:[266.1,175.2]:TopTopTopTopTop: m2(x0),m3(x1,x2,x1),p1(x3,x4,x2) -> m3(x2,x0,x0)
% 6.74/1.88 === Conflict found: 426:4:5:[266.1,175.2]:TopTopTopTopTop: m2(x0),m3(x1,x2,x1),p1(x3,x4,x2) -> m3(x2,x0,x0) {x0 -> b, x1 -> d, x2 -> c, x3 -> b, x4 -> b}
% 6.74/1.88 === Backtracking. Learning clause 427:7:7:[426.4,289.1,263.5,19.1]:TopTopTopTopTopTopTop: m2(x0),p1(x1,x2,x3),p2(x4,x3,x0),l2(x5,x6),m0(x6,x5,x5),s2(d) -> p3(x4,x3,x3)
% 6.74/1.88 === Backtracking. Learning clause 428:5:3:[137.3,143.3]:TopTopTop: k0(x0),l0(x1),s0(x2),p0(x0,d) -> q1(x1,x2,x2)
% 6.74/1.88 === Conflict found: 426:4:5:[266.1,175.2]:TopTopTopTopTop: m2(x0),m3(x1,x2,x1),p1(x3,x4,x2) -> m3(x2,x0,x0) {x0 -> b, x1 -> d, x2 -> c, x3 -> b, x4 -> b}
% 6.74/1.88 === Backtracking. Learning clause 429:8:6:[426.4,424.1,263.5,19.1]:TopTopTopTopTopTop: m2(x0),p1(x1,x2,x3),l0(x3),k0(x0),l2(x4,x5),m0(x5,x4,x4),s2(d) -> p3(x0,x3,x3)
% 6.74/1.88 === Backtracking. Learning clause 430:4:4:[214.2,184.3,43.2]:TopTopTopTop: p1(x0,x1,x2),l1(x1,x2),m0(x0,x0,x3) -> p2(x0,x3,x3)
% 6.74/1.88 === Backtracking. Learning clause 431:4:2:[293.1,215.3]:TopTop: n0(x0,x1),k0(x1),p1(x0,x0,x0) -> q3(x1,x1)
% 6.74/1.88 === Clause set with instances from active satisfied. Growing active. New size: 809
% 6.74/1.88 === Backtracking. Learning clause 432:3:3:[325.1,239.3]:TopTopTop: p1(x0,x1,x2),m2(x1) -> p4(x2,x0,x2)
% 6.74/1.88 === Backtracking. Learning clause 433:6:3:[227.1,408.3,311.2]:TopTopTop: s1(b),k1(b),l2(b,b),q2(x0,c,x0),m0(x0,x1,x2) -> s3(c,x2)
% 6.74/1.88 === Clause set with instances from active satisfied. Growing active. New size: 846
% 6.74/1.88 === Backtracking. Learning clause 434:5:3:[306.2,269.3]:TopTopTop: m2(x0),r3(x0,x1,x1),r2(x2),k2(c,b) -> r3(x2,x2,x0)
% 6.74/1.88
% 6.74/1.88 SZS status Unsatisfiable
% 6.74/1.88
% 6.74/1.88 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.74/1.88
% 6.74/1.88 SPASS-SCL-FOL Statistics:
% 6.74/1.88 Number of learned clauses: 19
% 6.74/1.88 Number of propagations: 4896
% 6.74/1.88 Number of decisions: 1506
% 6.74/1.88 Number of resolutions: 55
% 6.74/1.88 Number of condensations: 4
% 6.74/1.88 Number of sub resolutions: 46
% 6.74/1.88 Number of input literals (deduplicated): 372
% 6.74/1.88 Number of grows: 8
% 6.74/1.88 Number of considered ground atoms: 846
% 6.74/1.88
% 6.74/1.88 Needed: 0:00:01.32
% 6.74/1.88
%------------------------------------------------------------------------------