%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN139-1 : TPTP v9.2.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:20 PM UTC 2026
% Result : Unsatisfiable 21.72s 4.84s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN139-1 : TPTP v9.2.1. Released v1.1.0.
% 0.12/0.12 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n003.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 13:39:42 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 21.72/4.84 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.72/4.84 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.72/4.84 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.72/4.84 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.72/4.84 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.72/4.84 Execution resolution_2 ended with status: unsatisfiable
% 21.72/4.84 Used heuristic: resolution_2
% 21.72/4.84
% 21.72/4.84 Input Clauses:
% 21.72/4.84
% 21.72/4.84 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
% 21.72/4.84 Fol Constants: d e a b c
% 21.72/4.84 Fol Functions:
% 21.72/4.84 Problem Properties:
% 21.72/4.84 This is a Bernays Schoenfinkel problem.
% 21.72/4.84
% 21.72/4.84 After reduction: Problem Properties:
% 21.72/4.84 This is a Bernays Schoenfinkel problem.
% 21.72/4.84
% 21.72/4.84
% 21.72/4.84 Reduced Input Clauses:
% 21.72/4.84 371:3:2:[1.0,57.1,17.0,370.2]:TopTop: r0(c),p0(x0,x1) -> m1(x0,x1,c)
% 21.72/4.84 372:1:0:[24.0,58.0]:: -> m1(c,c,c)
% 21.72/4.84 374:1:0:[20.0,61.0,1.0,373.1]:: -> m1(a,a,a)
% 21.72/4.84 375:3:2:[12.0,62.0]:TopTop: q0(x0,x1),m1(x1,c,x1) -> m1(x0,a,x1)
% 21.72/4.84 376:1:0:[13.0,68.0]:: -> m1(e,e,e)
% 21.72/4.84 378:2:0:[13.0,69.0,28.0,377.2]:: m0(a,e,c) -> m1(c,a,c)
% 21.72/4.84 379:2:1:[5.0,79.0]:Top: m1(b,x0,e) -> n1(e,e,x0)
% 21.72/4.84 380:1:0:[24.0,87.0]:: -> n1(c,c,c)
% 21.72/4.84 382:2:2:[5.0,88.0,14.0,381.2]:TopTop: l0(x0) -> n1(x0,x1,x0)
% 21.72/4.84 383:3:0:[9.0,93.2]:: p0(d,d),n1(e,e,e) -> n1(d,e,e)
% 21.72/4.84 385:2:0:[21.0,98.0,32.0,384.2]:: m1(d,e,e) -> n1(d,d,b)
% 21.72/4.84 386:3:2:[40.1,103.0]:TopTop: p0(x0,x1),n0(x1,x1) -> p1(x0,x0,x0)
% 21.72/4.84 387:3:4:[5.0,109.2]:TopTopTopTop: l0(x0),p1(x1,x2,x3) -> p1(x3,x1,x3)
% 21.72/4.84 389:2:1:[28.0,117.0,24.0,388.2]:Top: k1(x0) -> p1(x0,x0,x0)
% 21.72/4.84 390:2:0:[9.0,125.0]:: p1(a,a,a) -> p1(a,b,a)
% 21.72/4.84 391:1:0:[20.0,126.0]:: -> p1(a,a,a)
% 21.72/4.84 393:2:0:[32.0,132.1,24.0,392.2]:: s0(e) -> q1(b,e,e)
% 21.72/4.84 395:1:1:[19.0,145.0,19.0,394.1]:Top: -> q1(e,x0,x0)
% 21.72/4.84 396:3:3:[6.0,146.2]:TopTopTop: p0(x0,x1),p1(x2,b,b) -> q1(x2,x2,x2)
% 21.72/4.84 397:2:0:[16.0,149.0]:: m1(c,d,a) -> q1(d,d,c)
% 21.72/4.84 398:2:1:[5.0,150.1]:Top: k1(x0) -> q1(x0,x0,x0)
% 21.72/4.84 399:3:2:[5.0,156.1]:TopTop: p0(b,d),n1(x0,d,x1) -> q1(x1,x1,x1)
% 21.72/4.84 400:2:1:[5.0,157.1]:Top: s0(x0) -> q1(x0,b,b)
% 21.72/4.84 401:3:2:[1.0,162.1]:TopTop: q0(x0,x1),q1(d,x1,d) -> r1(x0)
% 21.72/4.84 402:2:0:[32.0,177.1]:: l1(e,c) -> n2(c)
% 21.72/4.84 403:3:2:[13.0,178.1]:TopTop: r1(b),p1(b,x0,x1) -> n2(e)
% 21.72/4.84 404:2:0:[395.2,181.1]:: l1(c,b) -> p2(c,e,e)
% 21.72/4.84 406:3:1:[13.0,182.0,14.0,405.2]:Top: n1(c,x0,x0),k2(c,a) -> p2(b,c,a)
% 21.72/4.84 407:2:2:[13.0,183.0]:TopTop: p1(x0,x1,e) -> p2(e,x0,x1)
% 21.72/4.84 408:3:2:[24.0,221.1]:TopTop: k1(x0),l2(x0,x1) -> q2(x1,c,x0)
% 21.72/4.84 409:2:0:[1.0,228.1]:: s1(a) -> s2(d)
% 21.72/4.84 410:3:2:[32.0,365.1]:TopTop: s4(x0),n3(x1) -> r5(x0,x1)
% 21.72/4.84 411:3:1:[13.0,249.2]:Top: l0(x0),r2(e) -> k3(x0,x0,x0)
% 21.72/4.84 412:3:0:[9.0,262.2]:: s2(d),k3(a,c,a) -> l3(d,c)
% 21.72/4.84 413:2:2:[278.1,286.1]:TopTop: p2(x0,x1,x1) -> p3(x1,x1,x1)
% 21.72/4.84 414:4:2:[19.0,297.0]:TopTop: k1(x0),r2(d),q3(x1,x0) -> q3(x0,x0)
% 21.72/4.84 415:3:0:[34.0,312.0]:: q3(e,b),n3(e) -> k4(c)
% 21.72/4.84
% 21.72/4.84 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)
% 21.72/4.84
% 21.72/4.84 === Starting SPASS-SCL-FOL A Little Less Naive, considering 372 atoms initially, heuristics mode: resolution_2 ===
% 21.72/4.84
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 372
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 416:1:1:[43.1,19.1]:Top: -> m1(x0,d,x0)
% 21.72/4.84 === Backtracking. Learning clause 417:2:1:[168.1,40.2,232.1,325.1]:Top: n0(x0,e) -> p4(e,e,e)
% 21.72/4.84 === Backtracking. Learning clause 418:3:2:[293.1,224.2]:TopTop: n0(x0,x0),l1(x1,x0) -> q3(x0,x1)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 376
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 419:3:2:[230.3,3.1]:TopTop: s1(x0),p2(x1,x0,e) -> k3(d,x0,d)
% 21.72/4.84 === Backtracking. Learning clause 420:2:1:[293.2,3.1]:Top: q2(d,e,x0) -> q3(e,x0)
% 21.72/4.84 === Backtracking. Learning clause 421:2:2:[130.1,3.1]:TopTop: p0(x0,x1) -> q1(x1,e,x1)
% 21.72/4.84 === Backtracking. Learning clause 422:2:1:[101.1,3.1]:Top: k0(x0) -> p1(e,e,x0)
% 21.72/4.84 === Backtracking. Learning clause 423:1:0:[39.1,3.1]:: -> k1(e)
% 21.72/4.84 === Backtracking. Learning clause 424:3:2:[172.2,56.2,14.1]:TopTop: m0(b,x0,b),q0(x1,b) -> l2(x0,x0)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 381
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 425:1:0:[106.1,32.1]:: -> p1(b,b,b)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 394
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 426:1:1:[63.1,19.1]:Top: -> m1(x0,x0,x0)
% 21.72/4.84 === Conflict found: 401:3:2:[1.0,162.1]:TopTop: q0(x0,x1),q1(d,x1,d) -> r1(x0) {x0 -> a, x1 -> d}
% 21.72/4.84 === Backtracking. Learning clause 427:2:2:[401.3,226.1,17.1,20.1,159.2]:TopTop: m0(x0,x1,d) -> r2(a)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 458
% 21.72/4.84 === Backtracking. Learning clause 428:5:4:[167.1,159.2,165.3,406.2]:TopTopTopTop: m0(x0,x1,a),m1(x2,a,c),k1(a),n1(c,x3,x3) -> p2(b,c,a)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 462
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 429:3:2:[230.3,7.1]:TopTop: s1(x0),p2(x1,x0,b) -> k3(d,x0,d)
% 21.72/4.84 === Backtracking. Learning clause 430:2:1:[293.2,7.1]:Top: q2(d,b,x0) -> q3(b,x0)
% 21.72/4.84 === Backtracking. Learning clause 431:2:1:[101.1,7.1]:Top: k0(x0) -> p1(b,b,x0)
% 21.72/4.84 === Backtracking. Learning clause 432:2:0:[96.2,7.1]:: l1(d,b) -> n1(b,b,b)
% 21.72/4.84 === Backtracking. Learning clause 433:1:0:[40.1,7.1]:: -> l1(b,b)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 467
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 434:3:2:[75.3,9.1]:TopTop: p0(x0,b),l0(x1) -> n1(b,x1,b)
% 21.72/4.84 === Backtracking. Learning clause 435:2:2:[130.1,7.1]:TopTop: p0(x0,x1) -> q1(x1,b,x1)
% 21.72/4.84 === Backtracking. Learning clause 436:1:0:[138.1,7.1]:: -> q1(b,b,b)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 469
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 437:3:2:[230.3,11.1]:TopTop: s1(x0),p2(x1,x0,b) -> k3(e,x0,e)
% 21.72/4.84 === Backtracking. Learning clause 438:1:0:[39.1,7.1]:: -> k1(b)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 477
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 439:1:0:[159.1,12.1]:: -> q1(a,a,a)
% 21.72/4.84 === Backtracking. Learning clause 441:3:2:[17.0,440.2,214.2,184.3,416.1,305.1,323.2,41.4,341.2,105.2,19.1,13.1]:TopTop: p0(x0,d),r0(x1) -> m5(x1,d)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 541
% 21.72/4.84 === Backtracking. Learning clause 442:4:5:[120.2,387.3]:TopTopTopTopTop: m0(x0,x1,x0),l0(x2),p1(x1,x3,x0) -> p1(x1,x4,x0)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 543
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 443:3:2:[230.3,15.1]:TopTop: s1(x0),p2(x1,x0,b) -> k3(a,x0,a)
% 21.72/4.84 === Backtracking. Learning clause 444:2:1:[293.2,15.1]:Top: q2(a,b,x0) -> q3(b,x0)
% 21.72/4.84 === Backtracking. Learning clause 445:2:0:[96.2,15.1]:: l1(a,b) -> n1(b,b,b)
% 21.72/4.84 === Backtracking. Learning clause 446:3:2:[327.2,15.1]:TopTop: l4(a),p4(x0,x1,x0) -> p4(a,a,a)
% 21.72/4.84 === Backtracking. Learning clause 447:1:1:[67.1,14.1,5.1]:Top: -> m1(b,x0,b)
% 21.72/4.84 === Backtracking. Learning clause 448:3:3:[165.1,416.1,39.2]:TopTopTop: k2(x0,d),n0(x1,x0) -> k2(x2,d)
% 21.72/4.84 === Backtracking. Learning clause 450:5:2:[32.0,449.0,225.4,217.3,293.1,401.3,21.1,19.1]:TopTop: k1(x0),n1(b,b,x0),n0(x1,b),q1(d,e,d) -> q3(b,x1)
% 21.72/4.84 === Backtracking. Learning clause 453:7:1:[28.0,451.1,389.1,452.2,220.3,215.3,279.1,319.1,322.3,78.3,415.3,19.1]:Top: p1(e,e,e),k2(x0,x0),m3(e,e,e),k1(d),q3(e,b),n3(e) -> n4(e,x0)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 547
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Conflict found: 428:5:4:[167.1,159.2,165.3,406.2]:TopTopTopTop: m0(x0,x1,a),m1(x2,a,c),k1(a),n1(c,x3,x3) -> p2(b,c,a) {x0 -> c, x1 -> b, x2 -> d, x3 -> d}
% 21.72/4.84 === Backtracking. Learning clause 454:4:2:[428.1,16.1]:TopTop: m1(x0,a,c),k1(a),n1(c,x1,x1) -> p2(b,c,a)
% 21.72/4.84 === Backtracking. Learning clause 455:4:1:[225.2,16.1]:Top: r1(x0),k0(x0),q2(x0,x0,x0) -> q2(a,x0,a)
% 21.72/4.84 === Backtracking. Learning clause 456:3:1:[311.3,16.1]:Top: q2(c,x0,c),s2(x0) -> s3(x0,a)
% 21.72/4.84 === Backtracking. Learning clause 458:2:0:[18.0,457.1,172.1,16.1]:: m1(a,c,c) -> l2(b,b)
% 21.72/4.84 === Backtracking. Learning clause 459:3:1:[171.3,16.1]:Top: p0(x0,x0),s1(b) -> l2(a,a)
% 21.72/4.84 === Backtracking. Learning clause 460:3:1:[41.3,16.1]:Top: p0(a,b),r0(x0) -> l1(b,c)
% 21.72/4.84 === Backtracking. Learning clause 461:2:1:[120.1,16.1]:Top: p1(c,b,a) -> p1(b,x0,c)
% 21.72/4.84 === Backtracking. Learning clause 462:2:1:[97.2,16.1]:Top: m0(b,x0,x0) -> n1(a,a,c)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 560
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 463:3:1:[348.1,18.1]:Top: m4(x0,x0),k5(d) -> n5(c,c)
% 21.72/4.84 === Backtracking. Learning clause 464:3:2:[336.3,18.1]:TopTop: n3(b),q3(x0,x1) -> r4(b)
% 21.72/4.84 === Backtracking. Learning clause 465:3:1:[190.2,18.1]:Top: n1(x0,b,x0),p2(c,b,c) -> p2(c,b,b)
% 21.72/4.84 === Backtracking. Learning clause 466:3:1:[172.3,18.1]:Top: m0(c,b,x0),m1(x0,c,c) -> l2(b,b)
% 21.72/4.84 === Backtracking. Learning clause 467:3:2:[41.1,18.1]:TopTop: r0(x0),m0(x1,b,c) -> l1(b,x1)
% 21.72/4.84 === Conflict found: 386:3:2:[40.1,103.0]:TopTop: p0(x0,x1),n0(x1,x1) -> p1(x0,x0,x0) {x0 -> c, x1 -> b}
% 21.72/4.84 === Backtracking. Learning clause 468:2:0:[386.1,18.1]:: n0(b,b) -> p1(c,c,c)
% 21.72/4.84 === Conflict found: 371:3:2:[1.0,57.1,17.0,370.2]:TopTop: r0(c),p0(x0,x1) -> m1(x0,x1,c) {x0 -> c, x1 -> b}
% 21.72/4.84 === Backtracking. Learning clause 469:2:0:[371.2,18.1]:: r0(c) -> m1(c,b,c)
% 21.72/4.84 === Backtracking. Learning clause 470:2:2:[130.2,18.1]:TopTop: n0(x0,x1) -> q1(b,x1,b)
% 21.72/4.84 === Conflict found: 421:2:2:[130.1,3.1]:TopTop: p0(x0,x1) -> q1(x1,e,x1) {x0 -> c, x1 -> b}
% 21.72/4.84 === Backtracking. Learning clause 471:1:0:[421.1,18.1]:: -> q1(b,e,b)
% 21.72/4.84 === Conflict found: 407:2:2:[13.0,183.0]:TopTop: p1(x0,x1,e) -> p2(e,x0,x1) {x0 -> c, x1 -> c}
% 21.72/4.84 === Backtracking. Learning clause 473:2:1:[28.0,472.1,407.1,101.3]:Top: n0(d,x0) -> p2(e,x0,x0)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 568
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 474:1:0:[97.1,19.1]:: -> n1(d,d,d)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 632
% 21.72/4.84 === Backtracking. Learning clause 475:6:5:[310.1,165.4]:TopTopTopTopTop: r2(x0),r3(x0,x1,x1),m1(x2,x0,x3),k1(x4),k2(x4,x0) -> r3(x1,x3,x0)
% 21.72/4.84 === Backtracking. Learning clause 476:1:0:[169.1,164.3,171.4,163.2,14.1,31.1,33.1,30.1]:: -> l2(d,e)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 635
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 477:3:4:[119.2,17.1]:TopTopTopTop: m1(x0,x1,x2),l0(x3) -> p1(x2,x2,x2)
% 21.72/4.84 === Backtracking. Learning clause 478:1:0:[105.1,33.1]:: -> p1(c,c,c)
% 21.72/4.84 === Backtracking. Learning clause 479:2:2:[224.1,40.2]:TopTop: n0(x0,x1) -> q2(x1,x1,x1)
% 21.72/4.84 === Backtracking. Learning clause 480:4:4:[337.1,290.3]:TopTopTopTop: l1(x0,x1),q0(x2,x1),k2(x3,x3) -> s4(x0)
% 21.72/4.84 === Backtracking. Learning clause 481:3:2:[325.1,235.3]:TopTop: l2(x0,b),k1(x1) -> p4(x1,x1,x1)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 637
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 482:3:2:[230.3,26.1]:TopTop: s1(x0),p2(x1,x0,c) -> k3(d,x0,d)
% 21.72/4.84 === Backtracking. Learning clause 483:1:0:[131.1,33.1]:: -> q1(c,c,c)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 642
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Conflict found: 434:3:2:[75.3,9.1]:TopTop: p0(x0,b),l0(x1) -> n1(b,x1,b) {x0 -> c, x1 -> c}
% 21.72/4.84 === Backtracking. Learning clause 484:1:0:[434.1,18.1,24.1]:: -> n1(b,c,b)
% 21.72/4.84 === Backtracking. Learning clause 486:4:0:[11.0,485.2,268.2,173.3,408.3,1.1,39.2,34.1,40.2,169.4]:: l1(d,b),s1(d),l2(b,b) -> m3(c,b,d)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 644
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Conflict found: 389:2:1:[28.0,117.0,24.0,388.2]:Top: k1(x0) -> p1(x0,x0,x0) {x0 -> e}
% 21.72/4.84 === Backtracking. Learning clause 487:1:0:[389.1,423.1]:: -> p1(e,e,e)
% 21.72/4.84 === Backtracking. Learning clause 488:2:1:[215.2,391.1]:Top: k0(x0) -> q2(a,x0,x0)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 708
% 21.72/4.84 === Backtracking. Learning clause 489:3:2:[165.3,167.2,447.1]:TopTop: k1(x0),q1(x1,x0,x0) -> k2(b,x0)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 709
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 490:1:0:[219.1,425.1]:: -> q2(b,b,b)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 713
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 491:4:1:[225.2,35.1]:Top: r1(x0),k0(x0),q2(x0,x0,x0) -> q2(c,x0,c)
% 21.72/4.84 === Backtracking. Learning clause 492:3:0:[172.1,35.1]:: m1(c,d,d),p0(d,e) -> l2(e,e)
% 21.72/4.84 === Backtracking. Learning clause 493:3:1:[171.3,35.1,303.1]:Top: p0(x0,x0),s1(e) -> r3(c,c,c)
% 21.72/4.84 === Backtracking. Learning clause 494:3:1:[41.3,35.1]:Top: p0(c,e),r0(x0) -> l1(e,d)
% 21.72/4.84 === Backtracking. Learning clause 495:2:1:[120.1,35.1]:Top: p1(d,e,c) -> p1(e,x0,d)
% 21.72/4.84 === Backtracking. Learning clause 496:2:0:[301.1,35.1]:: r3(c,c,e) -> r3(c,c,c)
% 21.72/4.84 === Backtracking. Learning clause 497:1:0:[77.1,35.1]:: -> n1(e,c,e)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 718
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Backtracking. Learning clause 498:2:2:[288.1,438.1]:TopTop: q2(x0,x1,b) -> p3(b,b,b)
% 21.72/4.84 === Backtracking. Learning clause 499:1:0:[82.1,14.1]:: -> n1(b,b,b)
% 21.72/4.84 === Backtracking. Learning clause 500:4:5:[120.2,120.3]:TopTopTopTopTop: m0(x0,x1,x2),m0(x2,x0,x3),p1(x2,x0,x3) -> p1(x1,x4,x0)
% 21.72/4.84 === Backtracking. Learning clause 502:7:3:[438.0,501.6,266.3,274.2,307.4,225.5,401.3,28.1,17.1,174.2]:TopTopTop: m2(x0),n2(a),k2(a,a),m0(x1,x2,x0),q2(e,e,e),q1(d,d,d) -> r3(a,a,e)
% 21.72/4.84 === Backtracking. Learning clause 503:4:2:[54.2,72.4,375.3,39.2,37.1]:TopTop: q0(x0,x0),q0(x0,x1),m1(x1,c,x1) -> m1(x1,a,a)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 724
% 21.72/4.84 === Restarting.
% 21.72/4.84 === Conflict found: 382:2:2:[5.0,88.0,14.0,381.2]:TopTop: l0(x0) -> n1(x0,x1,x0) {x0 -> a, x1 -> a}
% 21.72/4.84 === Backtracking. Learning clause 504:1:1:[382.1,20.1]:Top: -> n1(a,x0,a)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 788
% 21.72/4.84 === Conflict found: 419:3:2:[230.3,3.1]:TopTop: s1(x0),p2(x1,x0,e) -> k3(d,x0,d) {x0 -> a, x1 -> e}
% 21.72/4.84 === Backtracking. Learning clause 505:4:1:[419.2,214.2,280.2]:Top: s1(x0),m1(x0,e,x0),r2(d) -> p3(d,d,x0)
% 21.72/4.84 === Backtracking. Learning clause 506:4:2:[193.2,214.2,272.2]:TopTop: k1(x0),m1(x1,e,x1),n2(e) -> m3(x1,e,e)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 852
% 21.72/4.84 === Backtracking. Learning clause 507:3:1:[253.2,179.2]:Top: r0(x0),q1(x0,a,x0) -> l3(x0,a)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 916
% 21.72/4.84 === Backtracking. Learning clause 508:5:6:[279.2,165.4]:TopTopTopTopTopTop: q2(x0,d,x1),m1(x2,x3,x4),k1(x5),k2(x5,x3) -> p3(x1,x4,x3)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 980
% 21.72/4.84 === Backtracking. Learning clause 509:4:3:[49.3,54.1]:TopTopTop: k0(x0),n0(x1,x1),m1(x0,x2,x0) -> m1(x1,x0,x0)
% 21.72/4.84 === Backtracking. Learning clause 510:5:5:[319.2,322.3,289.3]:TopTopTopTopTop: k4(x0),m3(x1,x1,x1),m3(x2,x3,x4),p2(x1,x2,x4) -> n4(x1,x2)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 1044
% 21.72/4.84 === Conflict found: 407:2:2:[13.0,183.0]:TopTop: p1(x0,x1,e) -> p2(e,x0,x1) {x0 -> e, x1 -> d}
% 21.72/4.84 === Backtracking. Learning clause 511:3:3:[407.1,387.3]:TopTopTop: l0(x0),p1(x1,x2,e) -> p2(e,e,x1)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 1108
% 21.72/4.84 === Conflict found: 500: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 -> b}
% 21.72/4.84 === Backtracking. Learning clause 512:3:2:[500.1,12.1,461.1]:TopTop: m0(a,a,x0),p1(a,a,x0) -> p1(b,x1,c)
% 21.72/4.84 === Backtracking. Learning clause 513:5:3:[226.1,401.3,269.1]:TopTopTop: l0(x0),q0(x0,x1),q1(d,x1,d),k2(c,x2) -> m3(x0,x2,x0)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 1172
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 1236
% 21.72/4.84 === Backtracking. Learning clause 514:6:3:[92.4,220.2]:TopTopTop: l0(x0),l1(x0,x1),n1(x1,x2,x1),p1(x2,x2,x2),q2(x1,x2,x2) -> q2(x2,x1,x2)
% 21.72/4.84 === Clause set with instances from active satisfied. Growing active. New size: 1300
% 21.72/4.84 === Backtracking. Learning clause 515:5:4:[137.3,151.3]:TopTopTopTop: k0(x0),l0(x1),r0(x2),m1(x3,x0,x0) -> q1(x1,x3,x3)
% 21.72/4.84 === Backtracking. Learning clause 516:8:8:[179.1,130.3,184.3,289.2,41.4]:TopTopTopTopTopTopTopTop: n0(x0,a),p0(x1,x2),p1(x2,x3,x4),m3(a,x5,a),p0(x6,x3),r0(x7),m0(x4,x3,x6) -> p3(x2,a,a)
% 21.72/4.84
% 21.72/4.84 SZS status Unsatisfiable
% 21.72/4.84
% 21.72/4.84 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.72/4.84
% 21.72/4.84 SPASS-SCL-FOL Statistics:
% 21.72/4.84 Number of learned clauses: 93
% 21.72/4.84 Number of propagations: 18655
% 21.72/4.84 Number of decisions: 5733
% 21.72/4.84 Number of resolutions: 170
% 21.72/4.84 Number of condensations: 5
% 21.72/4.84 Number of sub resolutions: 54
% 21.72/4.84 Number of input literals (deduplicated): 372
% 21.72/4.84 Number of grows: 33
% 21.72/4.84 Number of considered ground atoms: 1300
% 21.72/4.84
% 21.72/4.84 Needed: 0:00:04.29
% 21.72/4.84
%------------------------------------------------------------------------------