↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : SYN621-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 : n017.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 11.70s 2.82s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN621-1 : TPTP v9.2.1. Released v2.5.0.
% 0.13/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.34  % Computer : n017.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Thu May  7 13:45:28 EDT 2026
% 0.18/0.34  % CPUTime  : 
% 0.18/0.34  SPASS-SCL-FOL version:
% 0.20/0.43  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 11.70/2.81  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.70/2.81  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.70/2.81  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.70/2.81  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.70/2.81  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.70/2.81  Execution resolution_3 ended with status: unsatisfiable
% 11.70/2.81  Used heuristic: resolution_3
% 11.70/2.81  
% 11.70/2.81   Input Clauses:
% 11.70/2.81  
% 11.70/2.81   Predicates: p10 p8 p7 p4 p2 p13 p21 p22 
% 11.70/2.81   Fol Constants: c23 c24 c27 c25 c26 c28 
% 11.70/2.81   Fol Functions: f3 f14 f5 f16 f18 f17 f11 f12 f15 f19 f6 f20 f9 
% 11.70/2.81   Problem Properties:
% 11.70/2.81   This is a full first-order problem without equality.
% 11.70/2.82  
% 11.70/2.82   After reduction:  Problem Properties:
% 11.70/2.82   This is a full first-order problem without equality.
% 11.70/2.82  
% 11.70/2.82  
% 11.70/2.82   Reduced Input Clauses:
% 11.70/2.82  
% 11.70/2.82   Most General Atoms: p10(x1,x2) p21(x1,x3) p13(x1,x3) p22(x2,x3) p7(x2,x3) p8(x2,x3) p4(x4,x5) p2(x6,x7) 
% 11.70/2.82  
% 11.70/2.82  === Starting SPASS-SCL-FOL A Little Less Naive, considering 51 atoms initially, heuristics mode: resolution_3 ===
% 11.70/2.82  
% 11.70/2.82  === Backtracking. Learning clause 35:2:2:[17.2,4.1]:TopTop: p4(x0,x1) -> p4(x1,x0)
% 11.70/2.82  === Backtracking. Learning clause 36:2:2:[19.2,5.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 11.70/2.82  === Backtracking. Learning clause 37:2:2:[20.2,6.1]:TopTop: p13(x0,x1) -> p13(x1,x0)
% 11.70/2.82  === Backtracking. Learning clause 38:2:2:[14.2,1.1]:TopTop: p10(x0,x1) -> p10(x1,x0)
% 11.70/2.82  === Backtracking. Learning clause 39:2:2:[16.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 11.70/2.82  === Clause set with instances from active satisfied. Growing active. New size: 96
% 11.70/2.82  === Restarting.
% 11.70/2.82  === Backtracking. Learning clause 40:5:4:[18.2,31.2,21.4]:TopTopTopTop: p22(x0,f14(f11(c25,f12(c23,c26)))),p4(x1,x2),p4(x3,f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27)))),p21(x1,x3) -> p21(x2,f5(f6(c27,x0)))
% 11.70/2.82  === Backtracking. Learning clause 41:3:2:[18.1,31.2]:TopTop: p21(f5(f6(c27,x0)),x1),p22(x0,f14(f11(c25,f12(c23,c26)))) -> p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),x1)
% 11.70/2.82  === Backtracking. Learning clause 42:3:2:[18.2,31.2]:TopTop: p21(x0,f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27)))),p22(x1,f14(f11(c25,f12(c23,c26)))) -> p21(x0,f5(f6(c27,x1)))
% 11.70/2.82  === Backtracking. Learning clause 43:3:5:[18.1,34.2]:TopTopTopTopTop: p21(f15(f19(f11(x0,f12(x1,x2)),x3),f16(f3(f17(f18(c24))))),x4) -> p21(f5(f6(x3,f20(x0,x1,x2,x3))),x4),p2(x1,f3(c24))
% 11.70/2.82  === Backtracking. Learning clause 44:3:5:[18.2,34.2]:TopTopTopTopTop: p21(x0,f5(f6(x1,f20(x2,x3,x4,x1)))) -> p21(x0,f15(f19(f11(x2,f12(x3,x4)),x1),f16(f3(f17(f18(c24)))))),p2(x3,f3(c24))
% 11.70/2.82  === Backtracking. Learning clause 45:4:3:[18.3,32.1,21.4]:TopTopTop: p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),x0),p4(x1,x0),p4(x2,f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))),p21(x1,x2) -> 
% 11.70/2.82  === Backtracking. Learning clause 46:2:1:[18.3,32.1]:Top: p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),x0),p21(x0,f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))) -> 
% 11.70/2.82  === Clause set with instances from active satisfied. Growing active. New size: 122
% 11.70/2.82  === Restarting.
% 11.70/2.82  === Conflict found: 46:2:1:[18.3,32.1]:Top: p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),x0),p21(x0,f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))) ->  {x0 -> c23}
% 11.70/2.82  === Backtracking. Learning clause 48:3:2:[7.0,47.3,46.2,44.2,41.3]:TopTop: p21(x0,f5(f6(c27,f20(c25,c23,c26,c27)))),p21(f5(f6(c27,x1)),x0),p22(x1,f14(f11(c25,f12(c23,c26)))) -> 
% 11.70/2.82  === Backtracking. Learning clause 49:5:7:[21.4,43.1]:TopTopTopTopTopTopTop: p4(x0,f15(f19(f11(x1,f12(x2,x3)),x4),f16(f3(f17(f18(c24)))))),p4(x5,x6),p21(x0,x5) -> p21(f5(f6(x4,f20(x1,x2,x3,x4))),x6),p2(x2,f3(c24))
% 11.70/2.82  === Conflict found: 45:4:3:[18.3,32.1,21.4]:TopTopTop: p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),x0),p4(x1,x0),p4(x2,f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))),p21(x1,x2) ->  {x0 -> f5(f6(c27,c23)), x1 -> c23, x2 -> f15(c23,c23)}
% 11.70/2.82  === Backtracking. Learning clause 50:5:4:[45.3,25.3,31.2]:TopTopTopTop: p4(x0,f5(f6(c27,x1))),p21(x0,f15(x2,x3)),p4(x2,f19(f11(c25,f12(c23,c26)),c27)),p4(x3,f16(f3(f17(f18(c24))))),p22(x1,f14(f11(c25,f12(c23,c26)))) -> 
% 11.70/2.82  === Backtracking. Learning clause 51:4:4:[33.3,42.1]:TopTopTopTop: p22(f9(f11(c25,f12(c23,c26)),c28,c27),f14(f11(x0,f12(x1,x2)))),p22(x3,f14(f11(c25,f12(c23,c26)))) -> p2(x1,f3(c24)),p21(f5(f6(c27,f20(x0,x1,x2,c27))),f5(f6(c27,x3)))
% 11.70/2.82  === Clause set with instances from active satisfied. Growing active. New size: 154
% 11.70/2.82  === Restarting.
% 11.70/2.82  === Backtracking. Learning clause 52:5:4:[21.4,48.1]:TopTopTopTop: p4(x0,x1),p4(x2,f5(f6(c27,f20(c25,c23,c26,c27)))),p21(x0,x2),p21(f5(f6(c27,x3)),x1),p22(x3,f14(f11(c25,f12(c23,c26)))) -> 
% 11.70/2.82  === Conflict found: 50:5:4:[45.3,25.3,31.2]:TopTopTopTop: p4(x0,f5(f6(c27,x1))),p21(x0,f15(x2,x3)),p4(x2,f19(f11(c25,f12(c23,c26)),c27)),p4(x3,f16(f3(f17(f18(c24))))),p22(x1,f14(f11(c25,f12(c23,c26)))) ->  {x0 -> c23, x1 -> c23, x2 -> f19(c23,c23), x3 -> c23}
% 11.70/2.82  === Backtracking. Learning clause 53:6:5:[50.3,26.3]:TopTopTopTopTop: p4(x0,f5(f6(c27,x1))),p21(x0,f15(f19(x2,x3),x4)),p4(x4,f16(f3(f17(f18(c24))))),p22(x1,f14(f11(c25,f12(c23,c26)))),p4(x3,c27),p7(x2,f11(c25,f12(c23,c26))) -> 
% 11.70/2.82  === Conflict found: 53:6:5:[50.3,26.3]:TopTopTopTopTop: p4(x0,f5(f6(c27,x1))),p21(x0,f15(f19(x2,x3),x4)),p4(x4,f16(f3(f17(f18(c24))))),p22(x1,f14(f11(c25,f12(c23,c26)))),p4(x3,c27),p7(x2,f11(c25,f12(c23,c26))) ->  {x0 -> c23, x1 -> f20(c25,c23,c26,c23), x2 -> c23, x3 -> c23, x4 -> c23}
% 11.70/2.82  === Backtracking. Learning clause 55:5:5:[7.0,54.5,53.4,28.2]:TopTopTopTopTop: p4(x0,f5(f6(c27,f20(c25,c23,c26,x1)))),p21(x0,f15(f19(x2,x3),x4)),p4(x4,f16(f3(f17(f18(c24))))),p4(x3,c27),p7(x2,f11(c25,f12(c23,c26))) -> 
% 11.70/2.82  === Conflict found: 48:3:2:[7.0,47.3,46.2,44.2,41.3]:TopTop: p21(x0,f5(f6(c27,f20(c25,c23,c26,c27)))),p21(f5(f6(c27,x1)),x0),p22(x1,f14(f11(c25,f12(c23,c26)))) ->  {x0 -> c23, x1 -> f20(c25,c23,c26,c23)}
% 11.70/2.82  === Backtracking. Learning clause 57:2:2:[7.0,56.2,48.3,28.2]:TopTop: p21(x0,f5(f6(c27,f20(c25,c23,c26,c27)))),p21(f5(f6(c27,f20(c25,c23,c26,x1))),x0) -> 
% 11.70/2.82  === Conflict found: 46:2:1:[18.3,32.1]:Top: p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),x0),p21(x0,f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))) ->  {x0 -> c23}
% 11.70/2.82  === Backtracking. Learning clause 59:4:3:[7.0,58.4,46.2,44.2,21.4]:TopTopTop: p21(x0,f5(f6(c27,f20(c25,c23,c26,c27)))),p4(x1,f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27)))),p4(x2,x0),p21(x1,x2) -> 
% 11.70/2.82  === Backtracking. Learning clause 60:4:3:[9.2,59.2]:TopTopTop: p4(x0,f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),p21(x1,f5(f6(c27,f20(c25,c23,c26,c27)))),p4(x2,x1),p21(f5(x0),x2) -> 
% 11.70/2.82  === Conflict found: 49:5:7:[21.4,43.1]:TopTopTopTopTopTopTop: p4(x0,f15(f19(f11(x1,f12(x2,x3)),x4),f16(f3(f17(f18(c24)))))),p4(x5,x6),p21(x0,x5) -> p21(f5(f6(x4,f20(x1,x2,x3,x4))),x6),p2(x2,f3(c24)) {x0 -> f15(c23,c23), x1 -> c23, x2 -> c23, x3 -> c23, x4 -> c23, x5 -> c23, x6 -> f5(f6(c27,c23))}
% 11.70/2.82  === Backtracking. Learning clause 61:7:9:[49.1,25.3,18.1]:TopTopTopTopTopTopTopTopTop: p4(x0,x1),p21(f15(x2,x3),x0),p4(x2,f19(f11(x4,f12(x5,x6)),x7)),p4(x3,f16(f3(f17(f18(c24))))),p21(x1,x8) -> p2(x5,f3(c24)),p21(f5(f6(x7,f20(x4,x5,x6,x7))),x8)
% 11.70/2.82  === Conflict found: 48:3:2:[7.0,47.3,46.2,44.2,41.3]:TopTop: p21(x0,f5(f6(c27,f20(c25,c23,c26,c27)))),p21(f5(f6(c27,x1)),x0),p22(x1,f14(f11(c25,f12(c23,c26)))) ->  {x0 -> f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))), x1 -> f20(c23,c23,c23,c27)}
% 11.70/2.82  === Backtracking. Learning clause 62:4:3:[48.1,31.2,33.3]:TopTopTop: p22(f20(x0,x1,x2,c27),f14(f11(c25,f12(c23,c26)))),p22(f20(c25,c23,c26,c27),f14(f11(c25,f12(c23,c26)))),p22(f9(f11(c25,f12(c23,c26)),c28,c27),f14(f11(x0,f12(x1,x2)))) -> p2(x1,f3(c24))
% 11.70/2.82  === Conflict found: 48:3:2:[7.0,47.3,46.2,44.2,41.3]:TopTop: p21(x0,f5(f6(c27,f20(c25,c23,c26,c27)))),p21(f5(f6(c27,x1)),x0),p22(x1,f14(f11(c25,f12(c23,c26)))) ->  {x0 -> f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))), x1 -> f20(c23,c23,c23,c27)}
% 11.70/2.82  === Backtracking. Learning clause 63:3:1:[48.1,31.2]:Top: p21(f5(f6(c27,x0)),f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27)))),p22(x0,f14(f11(c25,f12(c23,c26)))),p22(f20(c25,c23,c26,c27),f14(f11(c25,f12(c23,c26)))) -> 
% 11.70/2.82  === Conflict found: 46:2:1:[18.3,32.1]:Top: p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),x0),p21(x0,f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))) ->  {x0 -> f5(f6(c27,f20(c25,c23,c26,c27)))}
% 11.70/2.82  
% 11.70/2.82  SZS status Unsatisfiable
% 11.70/2.82  
% 11.70/2.82  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.70/2.82  
% 11.70/2.82  SPASS-SCL-FOL Statistics:
% 11.70/2.82  Number of learned clauses: 25
% 11.70/2.82  Number of propagations: 615
% 11.70/2.82  Number of decisions: 512
% 11.70/2.82  Number of resolutions: 36
% 11.70/2.82  Number of condensations: 0
% 11.70/2.82  Number of sub resolutions: 4
% 11.70/2.82  Number of input literals (deduplicated): 36
% 11.70/2.82  Number of grows: 3
% 11.70/2.82  Number of considered ground atoms: 154
% 11.70/2.82  
% 11.70/2.82   Needed:       0:00:02.28
% 11.70/2.82  
%------------------------------------------------------------------------------