↑ Up

SPASS-SCL---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : SYN349+1 : TPTP v9.2.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n009.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:38 PM UTC 2026

% Result   : Theorem 0.37s 0.59s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN349+1 : TPTP v9.2.1. Released v2.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.34  % Computer : n009.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit : 300
% 0.15/0.34  % WCLimit  : 300
% 0.15/0.34  % DateTime : Thu May  7 13:40:57 EDT 2026
% 0.15/0.34  % CPUTime  : 
% 0.15/0.34  SPASS-SCL-FOL version:
% 0.19/0.43  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.37/0.59  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.59  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.59  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.59  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.59  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.59  Execution resolution_2 ended with status: unsatisfiable
% 0.37/0.59  Used heuristic: resolution_2
% 0.37/0.59  
% 0.37/0.59   Input Clauses:
% 0.37/0.59  
% 0.37/0.59   Predicates: big_f ren1 ren2 
% 0.37/0.59   Fol Constants: a 
% 0.37/0.59   Fol Functions: skf1 skf2 
% 0.37/0.59   Problem Properties:
% 0.37/0.59   This is a full first-order problem without equality.
% 0.37/0.59  
% 0.37/0.59   After reduction:  Problem Properties:
% 0.37/0.59   This is a full first-order problem without equality.
% 0.37/0.59  
% 0.37/0.59  
% 0.37/0.59   Reduced Input Clauses:
% 0.37/0.59  
% 0.37/0.59   Most General Atoms: ren1(x0,x1,x2) ren2(x0,x1,x2) big_f(x2,x1) 
% 0.37/0.59  
% 0.37/0.59  === Starting SPASS-SCL-FOL A Little Less Naive, considering 56 atoms initially, heuristics mode: resolution_2 ===
% 0.37/0.59  
% 0.37/0.59  === Backtracking. Learning clause 13:1:1:[3.1,4.1]:Top:  -> ren1(x0,x0,x0)
% 0.37/0.59  === Clause set with instances from active satisfied. Growing active. New size: 56
% 0.37/0.59  === Restarting.
% 0.37/0.59  === Clause set with instances from active satisfied. Growing active. New size: 60
% 0.37/0.59  === Restarting.
% 0.37/0.59  === Backtracking. Learning clause 14:3:3:[6.2,9.2]:TopTopTop: ren2(x0,skf2(x1,x2),skf1(x1)),big_f(x1,skf2(x1,x2)) -> ren1(x0,skf2(x1,x2),skf1(x1))
% 0.37/0.59  === Backtracking. Learning clause 15:3:3:[2.2,9.2]:TopTopTop: ren1(x0,skf1(x1),skf2(x1,x2)),big_f(x1,skf2(x1,x2)) -> big_f(x0,skf1(x1))
% 0.37/0.59  === Backtracking. Learning clause 16:3:3:[1.2,9.2]:TopTopTop: ren1(skf1(x0),skf2(x0,x1),x2),big_f(x0,skf2(x0,x1)) -> big_f(skf2(x0,x1),x2)
% 0.37/0.59  === Clause set with instances from active satisfied. Growing active. New size: 60
% 0.37/0.59  === Restarting.
% 0.37/0.59  === Backtracking. Learning clause 17:3:3:[5.3,10.1]:TopTopTop: ren2(x0,skf2(x1,x2),skf1(x1)),ren1(x0,skf2(x1,x2),skf1(x1)) -> big_f(x1,skf2(x1,x2))
% 0.37/0.59  === Backtracking. Learning clause 18:3:3:[2.3,10.1]:TopTopTop: ren1(skf1(x0),skf2(x0,x1),x2),big_f(skf2(x0,x1),x2) -> big_f(x0,skf2(x0,x1))
% 0.37/0.59  === Backtracking. Learning clause 19:3:3:[1.3,10.1]:TopTopTop: ren1(x0,skf1(x1),skf2(x1,x2)),big_f(x0,skf1(x1)) -> big_f(x1,skf2(x1,x2))
% 0.37/0.59  === Backtracking. Learning clause 20:4:4:[8.2,3.1]:TopTopTopTop: big_f(x0,x1) -> ren1(x2,x0,x3),ren2(x2,x0,x3),ren1(x3,x0,x1)
% 0.37/0.59  === Clause set with instances from active satisfied. Growing active. New size: 61
% 0.37/0.59  === Restarting.
% 0.37/0.59  === Backtracking. Learning clause 21:3:2:[7.3,11.1]:TopTop: ren1(x0,skf2(x0,x1),x1),big_f(x1,skf2(x0,x1)),big_f(skf2(x0,x1),skf1(x0)) -> 
% 0.37/0.59  === Clause set with instances from active satisfied. Growing active. New size: 125
% 0.37/0.59  === Clause set with instances from active satisfied. Growing active. New size: 126
% 0.37/0.59  === Restarting.
% 0.37/0.59  === Conflict found: 17:3:3:[5.3,10.1]:TopTopTop: ren2(x0,skf2(x1,x2),skf1(x1)),ren1(x0,skf2(x1,x2),skf1(x1)) -> big_f(x1,skf2(x1,x2)) {x0 -> a, x1 -> a, x2 -> skf1(a)}
% 0.37/0.59  === Backtracking. Learning clause 22:2:1:[17.1,12.1,1.2]:Top: ren1(x0,skf2(x0,skf1(x0)),skf1(x0)) -> big_f(skf2(x0,skf1(x0)),skf1(x0))
% 0.37/0.59  === Conflict found: 14:3:3:[6.2,9.2]:TopTopTop: ren2(x0,skf2(x1,x2),skf1(x1)),big_f(x1,skf2(x1,x2)) -> ren1(x0,skf2(x1,x2),skf1(x1)) {x0 -> a, x1 -> a, x2 -> skf1(a)}
% 0.37/0.59  === Backtracking. Learning clause 23:1:1:[14.1,12.1,4.1,22.1]:Top:  -> big_f(skf2(x0,skf1(x0)),skf1(x0))
% 0.37/0.59  === Backtracking. Learning clause 24:4:4:[9.2,7.2,2.3]:TopTopTopTop: ren1(x0,skf2(x1,x2),skf1(x1)),ren1(x1,skf2(x1,x2),x3),big_f(skf2(x1,x2),x3) -> ren2(x0,skf2(x1,x2),skf1(x1))
% 0.37/0.59  
% 0.37/0.59  SZS status Unsatisfiable
% 0.37/0.59  
% 0.37/0.59  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.59  
% 0.37/0.59  SPASS-SCL-FOL Statistics:
% 0.37/0.59  Number of learned clauses: 12
% 0.37/0.59  Number of propagations: 236
% 0.37/0.59  Number of decisions: 176
% 0.37/0.59  Number of resolutions: 21
% 0.37/0.59  Number of condensations: 1
% 0.37/0.59  Number of sub resolutions: 0
% 0.37/0.59  Number of input literals (deduplicated): 7
% 0.37/0.59  Number of grows: 6
% 0.37/0.59  Number of considered ground atoms: 126
% 0.37/0.59  
% 0.37/0.59   Needed:       0:00:00.05
% 0.37/0.59  
%------------------------------------------------------------------------------