%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN142-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 : n018.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 4.70s 1.48s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN142-1 : TPTP v9.2.1. Released v1.1.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n018.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:39:47 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 4.70/1.48 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.70/1.48 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.70/1.48 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.70/1.48 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.70/1.48 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.70/1.48 Execution lmodel_grow ended with status: unsatisfiable
% 4.70/1.48 Used heuristic: lmodel_grow
% 4.70/1.48
% 4.70/1.48 Input Clauses:
% 4.70/1.48
% 4.70/1.48 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
% 4.70/1.48 Fol Constants: d e a b c
% 4.70/1.48 Fol Functions:
% 4.70/1.48 Problem Properties:
% 4.70/1.48 This is a Bernays Schoenfinkel problem.
% 4.70/1.48
% 4.70/1.48 After reduction: Problem Properties:
% 4.70/1.48 This is a Bernays Schoenfinkel problem.
% 4.70/1.48
% 4.70/1.48
% 4.70/1.48 Reduced Input Clauses:
% 4.70/1.48 371:3:2:[1.0,57.1,17.0,370.2]:TopTop: r0(c),p0(x0,x1) -> m1(x0,x1,c)
% 4.70/1.48 372:1:0:[24.0,58.0]:: -> m1(c,c,c)
% 4.70/1.48 374:1:0:[20.0,61.0,1.0,373.1]:: -> m1(a,a,a)
% 4.70/1.48 375:3:2:[12.0,62.0]:TopTop: q0(x0,x1),m1(x1,c,x1) -> m1(x0,a,x1)
% 4.70/1.48 376:1:0:[13.0,68.0]:: -> m1(e,e,e)
% 4.70/1.48 378:2:0:[13.0,69.0,28.0,377.2]:: m0(a,e,c) -> m1(c,a,c)
% 4.70/1.48 379:2:1:[5.0,79.0]:Top: m1(b,x0,e) -> n1(e,e,x0)
% 4.70/1.48 380:1:0:[24.0,87.0]:: -> n1(c,c,c)
% 4.70/1.48 382:2:2:[5.0,88.0,14.0,381.2]:TopTop: l0(x0) -> n1(x0,x1,x0)
% 4.70/1.48 383:3:0:[9.0,93.2]:: p0(d,d),n1(e,e,e) -> n1(d,e,e)
% 4.70/1.48 385:2:0:[21.0,98.0,32.0,384.2]:: m1(d,e,e) -> n1(d,d,b)
% 4.70/1.48 386:3:2:[40.1,103.0]:TopTop: p0(x0,x1),n0(x1,x1) -> p1(x0,x0,x0)
% 4.70/1.48 387:3:4:[5.0,109.2]:TopTopTopTop: l0(x0),p1(x1,x2,x3) -> p1(x3,x1,x3)
% 4.70/1.48 389:2:1:[28.0,117.0,24.0,388.2]:Top: k1(x0) -> p1(x0,x0,x0)
% 4.70/1.48 390:2:0:[9.0,125.0]:: p1(a,a,a) -> p1(a,b,a)
% 4.70/1.48 391:1:0:[20.0,126.0]:: -> p1(a,a,a)
% 4.70/1.48 393:2:0:[32.0,132.1,24.0,392.2]:: s0(e) -> q1(b,e,e)
% 4.70/1.48 395:1:1:[19.0,145.0,19.0,394.1]:Top: -> q1(e,x0,x0)
% 4.70/1.48 396:3:3:[6.0,146.2]:TopTopTop: p0(x0,x1),p1(x2,b,b) -> q1(x2,x2,x2)
% 4.70/1.48 397:2:0:[16.0,149.0]:: m1(c,d,a) -> q1(d,d,c)
% 4.70/1.48 398:2:1:[5.0,150.1]:Top: k1(x0) -> q1(x0,x0,x0)
% 4.70/1.48 399:3:2:[5.0,156.1]:TopTop: p0(b,d),n1(x0,d,x1) -> q1(x1,x1,x1)
% 4.70/1.48 400:2:1:[5.0,157.1]:Top: s0(x0) -> q1(x0,b,b)
% 4.70/1.48 401:3:2:[1.0,162.1]:TopTop: q0(x0,x1),q1(d,x1,d) -> r1(x0)
% 4.70/1.48 402:2:0:[32.0,177.1]:: l1(e,c) -> n2(c)
% 4.70/1.48 403:3:2:[13.0,178.1]:TopTop: r1(b),p1(b,x0,x1) -> n2(e)
% 4.70/1.48 404:2:0:[395.2,181.1]:: l1(c,b) -> p2(c,e,e)
% 4.70/1.48 406:3:1:[13.0,182.0,14.0,405.2]:Top: n1(c,x0,x0),k2(c,a) -> p2(b,c,a)
% 4.70/1.48 407:2:2:[13.0,183.0]:TopTop: p1(x0,x1,e) -> p2(e,x0,x1)
% 4.70/1.48 408:3:2:[24.0,221.1]:TopTop: k1(x0),l2(x0,x1) -> q2(x1,c,x0)
% 4.70/1.48 409:2:0:[1.0,228.1]:: s1(a) -> s2(d)
% 4.70/1.48 410:3:2:[32.0,365.1]:TopTop: s4(x0),n3(x1) -> r5(x0,x1)
% 4.70/1.48 411:3:1:[13.0,249.2]:Top: l0(x0),r2(e) -> k3(x0,x0,x0)
% 4.70/1.48 412:3:0:[9.0,262.2]:: s2(d),k3(a,c,a) -> l3(d,c)
% 4.70/1.48 413:2:2:[278.1,286.1]:TopTop: p2(x0,x1,x1) -> p3(x1,x1,x1)
% 4.70/1.48 414:4:2:[19.0,297.0]:TopTop: k1(x0),r2(d),q3(x1,x0) -> q3(x0,x0)
% 4.70/1.48 415:3:0:[34.0,312.0]:: q3(e,b),n3(e) -> k4(c)
% 4.70/1.48
% 4.70/1.48 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)
% 4.70/1.48
% 4.70/1.48 === Starting SPASS-SCL-FOL A Little Less Naive, considering 372 atoms initially, heuristics mode: lmodel_grow ===
% 4.70/1.48
% 4.70/1.48 === Clause set with instances from active satisfied. Growing active. New size: 497
% 4.70/1.48 === Backtracking. Learning clause 416:4:3:[175.1,124.3,255.1]:TopTopTop: l0(x0),m0(x1,x2,x0),m2(b) -> l3(x0,x0)
% 4.70/1.48 === Clause set with instances from active satisfied. Growing active. New size: 588
% 4.70/1.48 === Backtracking. Learning clause 417:5:3:[49.3,165.1]:TopTopTop: k0(x0),n0(x1,x1),k1(x2),k2(x2,x0) -> k2(x1,x0)
% 4.70/1.48 === Clause set with instances from active satisfied. Growing active. New size: 663
% 4.70/1.48 === Backtracking. Learning clause 418:5:3:[165.1,73.3]:TopTopTop: k1(x0),k2(x0,x1),r0(x2),l0(x1) -> k2(x2,x1)
% 4.70/1.48 === Backtracking. Learning clause 419:7:4:[169.3,172.4,408.2]:TopTopTopTop: s1(x0),n0(e,x1),m0(x2,x1,x3),m1(x3,x2,x2),p0(x2,x1),k1(x0) -> q2(x1,c,x0)
% 4.70/1.48 === Clause set with instances from active satisfied. Growing active. New size: 718
% 4.70/1.48 === Backtracking. Learning clause 420:5:3:[310.3,298.3]:TopTopTop: k2(x0,x1),r2(x1),s2(x2),l2(c,x1) -> r3(x2,x0,x1)
% 4.70/1.48 === Clause set with instances from active satisfied. Growing active. New size: 754
% 4.70/1.48 === Backtracking. Learning clause 421:6:4:[293.1,225.5]:TopTopTopTop: n0(x0,x1),r1(x1),m0(x2,x3,x0),k0(x1),q2(x1,x1,x1) -> q3(x1,x0)
% 4.70/1.48 === Conflict found: 401:3:2:[1.0,162.1]:TopTop: q0(x0,x1),q1(d,x1,d) -> r1(x0) {x0 -> b, x1 -> d}
% 4.70/1.48 === Backtracking. Learning clause 422:7:6:[401.1,17.1,225.1,223.4]:TopTopTopTopTopTop: q1(d,d,d),m0(x0,x1,x2),k0(x3),n1(x4,d,x5),k1(x3),q2(x5,x5,x4) -> q2(x2,x3,x2)
% 4.70/1.48 === Backtracking. Learning clause 423:6:4:[208.2,184.3,78.3,272.2]:TopTopTopTop: p1(x0,x1,x2),l1(x1,x2),m0(x0,x3,e),k1(x0),n2(e) -> m3(x0,e,e)
% 4.70/1.48 === Backtracking. Learning clause 424:2:3:[130.2,14.1]:TopTopTop: n0(x0,x1) -> q1(x2,x1,x2)
% 4.70/1.48 === Clause set with instances from active satisfied. Growing active. New size: 771
% 4.70/1.48 === Backtracking. Learning clause 425:3:2:[193.2,214.2]:TopTop: k1(x0),m1(x1,e,x1) -> p2(x1,e,e)
% 4.70/1.48 === Backtracking. Learning clause 426:5:3:[167.1,424.2,165.3,406.2]:TopTopTop: n0(x0,a),m1(x1,a,c),k1(a),n1(c,x2,x2) -> p2(b,c,a)
% 4.70/1.48 === Backtracking. Learning clause 427:5:3:[310.3,305.2,226.3,188.2]:TopTopTop: k2(x0,x1),r1(x1),l0(x1),m1(x2,x2,x1) -> r3(x1,x0,x1)
% 4.70/1.48 === Clause set with instances from active satisfied. Growing active. New size: 798
% 4.70/1.48 === Backtracking. Learning clause 428:5:5:[289.2,184.4]:TopTopTopTopTop: m3(x0,x1,x0),p1(x2,x3,x4),l1(x3,x4),p2(x2,x0,x2) -> p3(x2,x0,x0)
% 4.70/1.48 === Clause set with instances from active satisfied. Growing active. New size: 821
% 4.70/1.48 === Backtracking. Learning clause 429:4:3:[165.1,43.2]:TopTopTop: k1(x0),k2(x0,x1),m0(x1,x1,x2) -> k2(x2,x1)
% 4.70/1.48 === Conflict found: 429:4:3:[165.1,43.2]:TopTopTop: k1(x0),k2(x0,x1),m0(x1,x1,x2) -> k2(x2,x1) {x0 -> d, x1 -> d, x2 -> a}
% 4.70/1.48 === Backtracking. Learning clause 430:3:2:[429.3,19.1]:TopTop: k1(x0),k2(x0,d) -> k2(x1,d)
% 4.70/1.48 === Backtracking. Learning clause 434:8:7:[30.0,431.4,32.0,432.8,391.0,433.9,227.1,220.4,311.2,92.4,222.2,317.2,343.2,369.1,169.4,171.4,164.3,163.2,14.1,123.2,215.3,40.2,20.1]:TopTopTopTopTopTopTop: m0(a,x0,e),n1(a,b,a),q1(x1,c,a),s4(d),m0(x2,b,e),q0(x3,x4),p0(x5,b),n0(x6,a) ->
% 4.70/1.48 === Conflict found: 382:2:2:[5.0,88.0,14.0,381.2]:TopTop: l0(x0) -> n1(x0,x1,x0) {x0 -> a, x1 -> b}
% 4.70/1.48
% 4.70/1.48 SZS status Unsatisfiable
% 4.70/1.48
% 4.70/1.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.70/1.48
% 4.70/1.48 SPASS-SCL-FOL Statistics:
% 4.70/1.48 Number of learned clauses: 16
% 4.70/1.48 Number of propagations: 4019
% 4.70/1.48 Number of decisions: 1530
% 4.70/1.48 Number of resolutions: 57
% 4.70/1.48 Number of condensations: 4
% 4.70/1.48 Number of sub resolutions: 49
% 4.70/1.48 Number of input literals (deduplicated): 372
% 4.70/1.48 Number of grows: 8
% 4.70/1.48 Number of considered ground atoms: 821
% 4.70/1.48
% 4.70/1.48 Needed: 0:00:00.94
% 4.70/1.48
%------------------------------------------------------------------------------