↑ Up

SPASS-SCL---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : SYN166-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 : n023.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:22 PM UTC 2026

% Result   : Unsatisfiable 4.73s 1.42s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN166-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.33  % Computer : n023.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit : 300
% 0.16/0.33  % WCLimit  : 300
% 0.16/0.33  % DateTime : Thu May  7 13:41:09 EDT 2026
% 0.16/0.33  % CPUTime  : 
% 0.16/0.33  SPASS-SCL-FOL version:
% 0.18/0.42  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 4.73/1.42  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.73/1.42  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.73/1.42  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.73/1.42  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.73/1.42  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.73/1.42  Execution lmodel_grow ended with status: unsatisfiable
% 4.73/1.42  Used heuristic: lmodel_grow
% 4.73/1.42  
% 4.73/1.42   Input Clauses:
% 4.73/1.42  
% 4.73/1.42   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.73/1.42   Fol Constants: d e a b c 
% 4.73/1.42   Fol Functions: 
% 4.73/1.42   Problem Properties:
% 4.73/1.42   This is a Bernays Schoenfinkel problem.
% 4.73/1.42  
% 4.73/1.42   After reduction:  Problem Properties:
% 4.73/1.42   This is a Bernays Schoenfinkel problem.
% 4.73/1.42  
% 4.73/1.42  
% 4.73/1.42   Reduced Input Clauses:
% 4.73/1.42  371:3:2:[1.0,57.1,17.0,370.2]:TopTop: r0(c),p0(x0,x1) -> m1(x0,x1,c)
% 4.73/1.42  372:1:0:[24.0,58.0]::  -> m1(c,c,c)
% 4.73/1.42  374:1:0:[20.0,61.0,1.0,373.1]::  -> m1(a,a,a)
% 4.73/1.42  375:3:2:[12.0,62.0]:TopTop: q0(x0,x1),m1(x1,c,x1) -> m1(x0,a,x1)
% 4.73/1.42  376:1:0:[13.0,68.0]::  -> m1(e,e,e)
% 4.73/1.42  378:2:0:[13.0,69.0,28.0,377.2]:: m0(a,e,c) -> m1(c,a,c)
% 4.73/1.42  379:2:1:[5.0,79.0]:Top: m1(b,x0,e) -> n1(e,e,x0)
% 4.73/1.42  380:1:0:[24.0,87.0]::  -> n1(c,c,c)
% 4.73/1.42  382:2:2:[5.0,88.0,14.0,381.2]:TopTop: l0(x0) -> n1(x0,x1,x0)
% 4.73/1.42  383:3:0:[9.0,93.2]:: p0(d,d),n1(e,e,e) -> n1(d,e,e)
% 4.73/1.42  385:2:0:[21.0,98.0,32.0,384.2]:: m1(d,e,e) -> n1(d,d,b)
% 4.73/1.42  386:3:2:[40.1,103.0]:TopTop: p0(x0,x1),n0(x1,x1) -> p1(x0,x0,x0)
% 4.73/1.42  387:3:4:[5.0,109.2]:TopTopTopTop: l0(x0),p1(x1,x2,x3) -> p1(x3,x1,x3)
% 4.73/1.42  389:2:1:[28.0,117.0,24.0,388.2]:Top: k1(x0) -> p1(x0,x0,x0)
% 4.73/1.42  390:2:0:[9.0,125.0]:: p1(a,a,a) -> p1(a,b,a)
% 4.73/1.42  391:1:0:[20.0,126.0]::  -> p1(a,a,a)
% 4.73/1.42  393:2:0:[32.0,132.1,24.0,392.2]:: s0(e) -> q1(b,e,e)
% 4.73/1.42  395:1:1:[19.0,145.0,19.0,394.1]:Top:  -> q1(e,x0,x0)
% 4.73/1.42  396:3:3:[6.0,146.2]:TopTopTop: p0(x0,x1),p1(x2,b,b) -> q1(x2,x2,x2)
% 4.73/1.42  397:2:0:[16.0,149.0]:: m1(c,d,a) -> q1(d,d,c)
% 4.73/1.42  398:2:1:[5.0,150.1]:Top: k1(x0) -> q1(x0,x0,x0)
% 4.73/1.42  399:3:2:[5.0,156.1]:TopTop: p0(b,d),n1(x0,d,x1) -> q1(x1,x1,x1)
% 4.73/1.42  400:2:1:[5.0,157.1]:Top: s0(x0) -> q1(x0,b,b)
% 4.73/1.42  401:3:2:[1.0,162.1]:TopTop: q0(x0,x1),q1(d,x1,d) -> r1(x0)
% 4.73/1.42  402:2:0:[32.0,177.1]:: l1(e,c) -> n2(c)
% 4.73/1.42  403:3:2:[13.0,178.1]:TopTop: r1(b),p1(b,x0,x1) -> n2(e)
% 4.73/1.42  404:2:0:[395.2,181.1]:: l1(c,b) -> p2(c,e,e)
% 4.73/1.42  406:3:1:[13.0,182.0,14.0,405.2]:Top: n1(c,x0,x0),k2(c,a) -> p2(b,c,a)
% 4.73/1.42  407:2:2:[13.0,183.0]:TopTop: p1(x0,x1,e) -> p2(e,x0,x1)
% 4.73/1.42  408:3:2:[24.0,221.1]:TopTop: k1(x0),l2(x0,x1) -> q2(x1,c,x0)
% 4.73/1.42  409:2:0:[1.0,228.1]:: s1(a) -> s2(d)
% 4.73/1.42  410:3:2:[32.0,365.1]:TopTop: s4(x0),n3(x1) -> r5(x0,x1)
% 4.73/1.42  411:3:1:[13.0,249.2]:Top: l0(x0),r2(e) -> k3(x0,x0,x0)
% 4.73/1.42  412:3:0:[9.0,262.2]:: s2(d),k3(a,c,a) -> l3(d,c)
% 4.73/1.42  413:2:2:[278.1,286.1]:TopTop: p2(x0,x1,x1) -> p3(x1,x1,x1)
% 4.73/1.42  414:4:2:[19.0,297.0]:TopTop: k1(x0),r2(d),q3(x1,x0) -> q3(x0,x0)
% 4.73/1.42  415:3:0:[34.0,312.0]:: q3(e,b),n3(e) -> k4(c)
% 4.73/1.42  
% 4.73/1.42   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.73/1.42  
% 4.73/1.42  === Starting SPASS-SCL-FOL A Little Less Naive, considering 372 atoms initially, heuristics mode: lmodel_grow ===
% 4.73/1.42  
% 4.73/1.42  === Clause set with instances from active satisfied. Growing active. New size: 510
% 4.73/1.42  === Backtracking. Learning clause 416:2:2:[214.1,43.2]:TopTop: m0(x0,x0,x1) -> p2(x0,x1,x0)
% 4.73/1.42  === Backtracking. Learning clause 417:6:5:[225.1,401.3]:TopTopTopTopTop: m0(x0,x1,x2),k0(x3),q2(x3,x3,x3),q0(x3,x4),q1(d,x4,d) -> q2(x2,x3,x2)
% 4.73/1.42  === Backtracking. Learning clause 419:5:3:[24.0,418.1,165.1,59.3,167.2,269.2]:TopTopTop: k1(x0),k0(x0),q1(x1,x0,x0),r2(x2) -> m3(x2,x0,x2)
% 4.73/1.42  === Clause set with instances from active satisfied. Growing active. New size: 587
% 4.73/1.42  === Backtracking. Learning clause 420:10:7:[333.2,225.5,419.5]:TopTopTopTopTopTopTop: k3(x0,x0,x1),r1(x2),m0(x3,x4,x1),k0(x2),q2(x2,x2,x2),k1(x5),k0(x5),q1(x6,x5,x5),r2(x1) -> q4(x1,x2)
% 4.73/1.42  === Clause set with instances from active satisfied. Growing active. New size: 644
% 4.73/1.42  === Backtracking. Learning clause 421:5:3:[137.3,143.3]:TopTopTop: k0(x0),l0(x1),s0(x2),p0(x0,d) -> q1(x1,x2,x2)
% 4.73/1.42  === Clause set with instances from active satisfied. Growing active. New size: 686
% 4.73/1.42  === Backtracking. Learning clause 422:4:2:[41.1,14.1,85.3]:TopTop: m0(d,x0,b),p0(x0,x0),r0(x1) -> n1(x1,d,x0)
% 4.73/1.42  === Backtracking. Learning clause 423:7:4:[92.4,220.2,41.4,14.1]:TopTopTopTop: l0(x0),n1(x1,x2,x1),p1(x2,x2,x2),q2(x1,x2,x2),r0(x3),m0(x1,x0,b) -> q2(x2,x1,x2)
% 4.73/1.42  === Backtracking. Learning clause 424:2:2:[53.2,19.1]:TopTop: l0(x0) -> m1(x1,d,d)
% 4.73/1.42  === Clause set with instances from active satisfied. Growing active. New size: 736
% 4.73/1.42  === Backtracking. Learning clause 425:4:4:[184.3,416.2]:TopTopTopTop: p1(x0,x1,x2),l1(x1,x2),m0(x0,x0,x3) -> p2(x0,x3,x3)
% 4.73/1.42  === Backtracking. Learning clause 426:5:7:[266.2,173.3,175.2]:TopTopTopTopTopTopTop: m3(x0,x1,x0),s0(x2),l1(x3,x4),p1(x5,x6,x1) -> m3(x1,x2,x2)
% 4.73/1.42  === Clause set with instances from active satisfied. Growing active. New size: 778
% 4.73/1.42  
% 4.73/1.42  SZS status Unsatisfiable
% 4.73/1.42  
% 4.73/1.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.73/1.42  
% 4.73/1.42  SPASS-SCL-FOL Statistics:
% 4.73/1.42  Number of learned clauses: 10
% 4.73/1.42  Number of propagations: 2507
% 4.73/1.42  Number of decisions: 1085
% 4.73/1.42  Number of resolutions: 23
% 4.73/1.42  Number of condensations: 5
% 4.73/1.42  Number of sub resolutions: 47
% 4.73/1.42  Number of input literals (deduplicated): 372
% 4.73/1.42  Number of grows: 6
% 4.73/1.42  Number of considered ground atoms: 778
% 4.73/1.42  
% 4.73/1.42   Needed:       0:00:00.89
% 4.73/1.42  
%------------------------------------------------------------------------------