↑ Up

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

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

% Result   : Unsatisfiable 7.80s 2.07s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN615-1 : TPTP v9.2.1. Released v2.5.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 : n020.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:46:21 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]
% 7.80/2.07  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.80/2.07  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.80/2.07  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.80/2.07  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.80/2.07  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.80/2.07  Execution resolution_3 ended with status: unsatisfiable
% 7.80/2.07  Used heuristic: resolution_3
% 7.80/2.07  
% 7.80/2.07   Input Clauses:
% 7.80/2.07  
% 7.80/2.07   Predicates: p13 p7 p2 p15 p19 p20 
% 7.80/2.07   Fol Constants: c26 c22 c21 c23 c24 c28 c27 c25 
% 7.80/2.07   Fol Functions: f3 f5 f4 f6 f12 f11 f17 f16 f14 f9 f8 f10 f18 
% 7.80/2.07   Problem Properties:
% 7.80/2.07   This is a full first-order problem without equality.
% 7.80/2.07  
% 7.80/2.07   After reduction:  Problem Properties:
% 7.80/2.07   This is a full first-order problem without equality.
% 7.80/2.07  
% 7.80/2.07  
% 7.80/2.07   Reduced Input Clauses:
% 7.80/2.07  
% 7.80/2.07   Most General Atoms: p13(x1,x2) p15(x1,x2) p2(x2,x3) p20(x3,x1) p19(x1,x3) p7(x2,x3) 
% 7.80/2.07  
% 7.80/2.07  === Starting SPASS-SCL-FOL A Little Less Naive, considering 52 atoms initially, heuristics mode: resolution_3 ===
% 7.80/2.07  
% 7.80/2.07  === Backtracking. Learning clause 32:1:0:[17.3,6.1,5.1]:: p2(c26,c21) -> 
% 7.80/2.07  === Backtracking. Learning clause 33:2:2:[16.2,2.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 7.80/2.07  === Backtracking. Learning clause 34:2:2:[17.2,3.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 7.80/2.07  === Backtracking. Learning clause 35:3:2:[20.3,7.1]:TopTop: p2(c23,x0),p2(f3(f4(f5(c22))),x1) -> p19(x0,x1)
% 7.80/2.07  === Backtracking. Learning clause 36:2:2:[15.2,1.1]:TopTop: p13(x0,x1) -> p13(x1,x0)
% 7.80/2.07  === Backtracking. Learning clause 37:3:2:[19.2,8.1]:TopTop: p2(f6(f3(f4(f5(c22))),c21),x0),p2(c24,x1) -> p20(x1,x0)
% 7.80/2.07  === Clause set with instances from active satisfied. Growing active. New size: 97
% 7.80/2.07  === Restarting.
% 7.80/2.07  === Conflict found: 34:2:2:[17.2,3.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c26, x1 -> f3(f4(f5(c22)))}
% 7.80/2.07  === Backtracking. Learning clause 38:3:2:[34.2,35.2]:TopTop: p2(x0,f3(f4(f5(c22)))),p2(c23,x1) -> p19(x1,x0)
% 7.80/2.07  === Backtracking. Learning clause 39:2:2:[18.2,4.1]:TopTop: p15(x0,x1) -> p15(x1,x0)
% 7.80/2.07  === Conflict found: 34:2:2:[17.2,3.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c26, x1 -> f6(f3(f4(f5(c22))),c21)}
% 7.80/2.07  === Backtracking. Learning clause 40:3:2:[34.2,37.1]:TopTop: p2(x0,f6(f3(f4(f5(c22))),c21)),p2(c24,x1) -> p20(x1,x0)
% 7.80/2.07  === Backtracking. Learning clause 41:2:1:[16.2,29.1]:Top: p7(c25,x0) -> p7(x0,f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),c26),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)))))
% 7.80/2.07  === Backtracking. Learning clause 42:5:3:[16.3,30.4]:TopTopTop: p7(x0,c25),p7(x0,f8(f10(f12(f11(f3(f5(c22)))),x1),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(x2),f10(f11(f3(f4(f5(c22)))),c27))))),p19(x1,f3(f4(f5(c22)))),p20(x2,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) -> 
% 7.80/2.07  === Clause set with instances from active satisfied. Growing active. New size: 106
% 7.80/2.07  === Restarting.
% 7.80/2.07  === Backtracking. Learning clause 43:6:4:[23.3,42.2]:TopTopTopTop: p7(x0,f10(f12(f11(f3(f5(c22)))),x1)),p7(x2,f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(x3),f10(f11(f3(f4(f5(c22)))),c27)))),p7(f8(x0,x2),c25),p19(x1,f3(f4(f5(c22)))),p20(x3,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) -> 
% 7.80/2.07  === Clause set with instances from active satisfied. Growing active. New size: 112
% 7.80/2.07  === Restarting.
% 7.80/2.07  === Backtracking. Learning clause 44:7:5:[23.3,43.2]:TopTopTopTopTop: p7(x0,f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(x1,f9(f11(x2),f10(f11(f3(f4(f5(c22)))),c27))),p7(x3,f10(f12(f11(f3(f5(c22)))),x4)),p7(f8(x3,f8(x0,x1)),c25),p19(x4,f3(f4(f5(c22)))),p20(x2,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) -> 
% 7.80/2.07  === Conflict found: 43:6:4:[23.3,42.2]:TopTopTopTop: p7(x0,f10(f12(f11(f3(f5(c22)))),x1)),p7(x2,f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(x3),f10(f11(f3(f4(f5(c22)))),c27)))),p7(f8(x0,x2),c25),p19(x1,f3(f4(f5(c22)))),p20(x3,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) ->  {x0 -> c26, x1 -> c26, x2 -> f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c26),f10(f11(f3(f4(f5(c22)))),c27))), x3 -> c26}
% 7.80/2.07  === Backtracking. Learning clause 45:5:3:[43.2,2.1]:TopTopTop: p7(x0,f10(f12(f11(f3(f5(c22)))),x1)),p7(f8(x0,f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(x2),f10(f11(f3(f4(f5(c22)))),c27)))),c25),p19(x1,f3(f4(f5(c22)))),p20(x2,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) -> 
% 7.80/2.07  === Clause set with instances from active satisfied. Growing active. New size: 123
% 7.80/2.07  === Restarting.
% 7.80/2.07  === Conflict found: 44:7:5:[23.3,43.2]:TopTopTopTopTop: p7(x0,f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(x1,f9(f11(x2),f10(f11(f3(f4(f5(c22)))),c27))),p7(x3,f10(f12(f11(f3(f5(c22)))),x4)),p7(f8(x3,f8(x0,x1)),c25),p19(x4,f3(f4(f5(c22)))),p20(x2,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) ->  {x0 -> f10(c26,c26), x1 -> c26, x2 -> c26, x3 -> c26, x4 -> c26}
% 7.80/2.07  === Backtracking. Learning clause 46:8:6:[44.1,24.3]:TopTopTopTopTopTop: p7(x0,f9(f11(x1),f10(f11(f3(f4(f5(c22)))),c27))),p7(x2,f10(f12(f11(f3(f5(c22)))),x3)),p7(f8(x2,f8(f10(x4,x5),x0)),c25),p19(x3,f3(f4(f5(c22)))),p20(x1,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p2(x5,f14(f16(c28,f17(c21,c27)),c25)),p7(x4,f11(f3(f4(f5(c22))))) -> 
% 7.80/2.07  === Conflict found: 44:7:5:[23.3,43.2]:TopTopTopTopTop: p7(x0,f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(x1,f9(f11(x2),f10(f11(f3(f4(f5(c22)))),c27))),p7(x3,f10(f12(f11(f3(f5(c22)))),x4)),p7(f8(x3,f8(x0,x1)),c25),p19(x4,f3(f4(f5(c22)))),p20(x2,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) ->  {x0 -> c26, x1 -> f9(f11(c26),f10(f11(f3(f4(f5(c22)))),c27)), x2 -> c26, x3 -> c26, x4 -> c26}
% 7.80/2.07  === Backtracking. Learning clause 47:6:4:[44.2,2.1]:TopTopTopTop: p7(x0,f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(x1,f10(f12(f11(f3(f5(c22)))),x2)),p7(f8(x1,f8(x0,f9(f11(x3),f10(f11(f3(f4(f5(c22)))),c27)))),c25),p19(x2,f3(f4(f5(c22)))),p20(x3,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) -> 
% 7.80/2.07  === Conflict found: 33:2:2:[16.2,2.1]:TopTop: p7(x0,x1) -> p7(x1,x0) {x0 -> c25, x1 -> f8(c26,f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c26),f10(f11(f3(f4(f5(c22)))),c27))))}
% 7.80/2.07  === Backtracking. Learning clause 48:6:4:[33.2,45.2,16.3]:TopTopTopTop: p7(x0,f10(f12(f11(f3(f5(c22)))),x1)),p19(x1,f3(f4(f5(c22)))),p20(x2,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p7(x3,c25),p7(x3,f8(x0,f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(x2),f10(f11(f3(f4(f5(c22)))),c27))))) -> 
% 7.80/2.07  === Clause set with instances from active satisfied. Growing active. New size: 133
% 7.80/2.07  === Restarting.
% 7.80/2.07  === Conflict found: 33:2:2:[16.2,2.1]:TopTop: p7(x0,x1) -> p7(x1,x0) {x0 -> c25, x1 -> f8(c26,f8(c26,f9(f11(c26),f10(f11(f3(f4(f5(c22)))),c27))))}
% 7.80/2.07  === Backtracking. Learning clause 49:7:5:[33.2,47.3,16.3]:TopTopTopTopTop: p7(x0,f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(x1,f10(f12(f11(f3(f5(c22)))),x2)),p19(x2,f3(f4(f5(c22)))),p20(x3,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p7(x4,c25),p7(x4,f8(x1,f8(x0,f9(f11(x3),f10(f11(f3(f4(f5(c22)))),c27))))) -> 
% 7.80/2.07  === Clause set with instances from active satisfied. Growing active. New size: 139
% 7.80/2.07  === Restarting.
% 7.80/2.07  === Backtracking. Learning clause 50:9:7:[16.2,23.3,49.7]:TopTopTopTopTopTopTop: p7(f8(x0,x1),x2),p7(x0,x3),p7(x1,f8(x4,f9(f11(x5),f10(f11(f3(f4(f5(c22)))),c27)))),p7(x4,f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(x3,f10(f12(f11(f3(f5(c22)))),x6)),p19(x6,f3(f4(f5(c22)))),p20(x5,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p7(x2,c25) -> 
% 7.80/2.07  === Conflict found: 49:7:5:[33.2,47.3,16.3]:TopTopTopTopTop: p7(x0,f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(x1,f10(f12(f11(f3(f5(c22)))),x2)),p19(x2,f3(f4(f5(c22)))),p20(x3,f6(f3(f4(f5(c22))),c21)),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p7(x4,c25),p7(x4,f8(x1,f8(x0,f9(f11(x3),f10(f11(f3(f4(f5(c22)))),c27))))) ->  {x0 -> f10(f11(f3(f4(f5(c22)))),c26), x1 -> f10(f12(f11(f3(f5(c22)))),c23), x2 -> c26, x3 -> c24, x4 -> c26}
% 7.80/2.07  === Backtracking. Learning clause 53:5:2:[8.0,51.3,33.1,52.5,49.7,41.2]:TopTop: p7(f10(f11(f3(f4(f5(c22)))),c26),f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(f10(f12(f11(f3(f5(c22)))),c23),f10(f12(f11(f3(f5(c22)))),x0)),p19(x0,f3(f4(f5(c22)))),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p7(c25,x1) -> 
% 7.80/2.07  === Clause set with instances from active satisfied. Growing active. New size: 149
% 7.80/2.07  === Restarting.
% 7.80/2.07  === Conflict found: 53:5:2:[8.0,51.3,33.1,52.5,49.7,41.2]:TopTop: p7(f10(f11(f3(f4(f5(c22)))),c26),f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25))),p7(f10(f12(f11(f3(f5(c22)))),c23),f10(f12(f11(f3(f5(c22)))),x0)),p19(x0,f3(f4(f5(c22)))),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p7(c25,x1) ->  {x0 -> c26, x1 -> c25}
% 7.80/2.07  === Backtracking. Learning clause 56:4:2:[14.0,54.4,2.0,55.5,53.1,24.3]:TopTop: p7(f10(f12(f11(f3(f5(c22)))),c23),f10(f12(f11(f3(f5(c22)))),x0)),p19(x0,f3(f4(f5(c22)))),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p7(c25,x1) -> 
% 7.80/2.07  === Clause set with instances from active satisfied. Growing active. New size: 153
% 7.80/2.07  === Restarting.
% 7.80/2.07  === Conflict found: 56:4:2:[14.0,54.4,2.0,55.5,53.1,24.3]:TopTop: p7(f10(f12(f11(f3(f5(c22)))),c23),f10(f12(f11(f3(f5(c22)))),x0)),p19(x0,f3(f4(f5(c22)))),p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),p7(c25,x1) ->  {x0 -> c26, x1 -> c25}
% 7.80/2.07  === Backtracking. Learning clause 58:4:3:[5.0,57.4,56.1,16.3,17.3,14.1]:TopTopTop: p19(x0,f3(f4(f5(c22)))),p7(c25,x1),p7(x2,f10(f12(f11(f3(f5(c22)))),c23)),p7(x2,f10(f12(f11(f3(f5(c22)))),x0)) -> 
% 7.80/2.07  === Backtracking. Learning clause 60:3:2:[5.0,59.3,24.3,56.1,2.1,17.3,14.1]:TopTop: p2(c23,x0),p19(x0,f3(f4(f5(c22)))),p7(c25,x1) -> 
% 7.80/2.07  === Backtracking. Learning clause 61:5:4:[20.2,10.2,60.2]:TopTopTopTop: p2(x0,x1),p19(x0,f3(x2)),p2(x2,f4(f5(c22))),p2(c23,x1),p7(c25,x3) -> 
% 7.80/2.07  === Conflict found: 35:3:2:[20.3,7.1]:TopTop: p2(c23,x0),p2(f3(f4(f5(c22))),x1) -> p19(x0,x1) {x0 -> c26, x1 -> f3(f4(f5(c22)))}
% 7.80/2.07  === Backtracking. Learning clause 62:2:2:[35.2,3.1,60.2]:TopTop: p2(c23,x0),p7(c25,x1) -> 
% 7.80/2.07  === Backtracking. Learning clause 63:6:6:[20.2,10.2,20.3,34.2]:TopTopTopTopTopTop: p2(x0,x1),p19(x0,f3(x2)),p2(x2,x3),p2(x1,x4),p2(x5,f3(x3)) -> p19(x4,x5)
% 7.80/2.07  === Conflict found: 58:4:3:[5.0,57.4,56.1,16.3,17.3,14.1]:TopTopTop: p19(x0,f3(f4(f5(c22)))),p7(c25,x1),p7(x2,f10(f12(f11(f3(f5(c22)))),c23)),p7(x2,f10(f12(f11(f3(f5(c22)))),x0)) ->  {x0 -> c23, x1 -> c26, x2 -> f10(f12(f11(f3(f5(c22)))),c23)}
% 7.80/2.07  === Backtracking. Learning clause 64:1:1:[58.3,2.1,7.1,16.3]:Top: p7(x0,c25) -> 
% 7.80/2.07  === Conflict found: 64:1:1:[58.3,2.1,7.1,16.3]:Top: p7(x0,c25) ->  {x0 -> c25}
% 7.80/2.07  
% 7.80/2.07  SZS status Unsatisfiable
% 7.80/2.07  
% 7.80/2.07  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.80/2.07  
% 7.80/2.07  SPASS-SCL-FOL Statistics:
% 7.80/2.07  Number of learned clauses: 27
% 7.80/2.07  Number of propagations: 1065
% 7.80/2.07  Number of decisions: 977
% 7.80/2.07  Number of resolutions: 43
% 7.80/2.07  Number of condensations: 1
% 7.80/2.07  Number of sub resolutions: 6
% 7.80/2.07  Number of input literals (deduplicated): 34
% 7.80/2.07  Number of grows: 8
% 7.80/2.07  Number of considered ground atoms: 153
% 7.80/2.07  
% 7.80/2.07   Needed:       0:00:01.54
% 7.80/2.07  
%------------------------------------------------------------------------------