↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : LCL442-2 : TPTP v9.2.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n004.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:27:52 PM UTC 2026

% Result   : Unsatisfiable 0.41s 0.57s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL442-2 : TPTP v9.2.1. Released v3.2.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 : n004.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 12:33:48 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.17/0.34  SPASS-SCL-FOL version:
% 0.22/0.43  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.41/0.57  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.57  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.57  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.57  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.57  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.57  Execution resolution_1 ended with status: unsatisfiable
% 0.41/0.57  Used heuristic: resolution_1
% 0.41/0.57  
% 0.41/0.57   Input Clauses:
% 0.41/0.57  
% 0.41/0.57   Predicates: c_in c_PropLog_Oeval 
% 0.41/0.57   Fol Constants: v_pl1 v_tt t_a c_PropLog_Opl_Ofalse v_pl2 
% 0.41/0.57   Fol Functions: c_PropLog_Ohyps c_PropLog_Othms tc_PropLog_Opl c_PropLog_Opl_Oop_A_N_62 c_union 
% 0.41/0.57   Problem Properties:
% 0.41/0.57   This is a full first-order problem without equality.
% 0.41/0.57  
% 0.41/0.57   After reduction:  Problem Properties:
% 0.41/0.57   This is a full first-order problem without equality.
% 0.41/0.57  
% 0.41/0.57  
% 0.41/0.57   Reduced Input Clauses:
% 0.41/0.57  
% 0.41/0.57   Most General Atoms: c_PropLog_Oeval(v_tt,v_pl1,t_a) c_PropLog_Oeval(v_tt,v_pl2,t_a) c_in(x0,c_PropLog_Othms(x1,x2),tc_PropLog_Opl(x2)) 
% 0.41/0.57  
% 0.41/0.57  === Starting SPASS-SCL-FOL A Little Less Naive, considering 25 atoms initially, heuristics mode: resolution_1 ===
% 0.41/0.57  
% 0.41/0.57  === Backtracking. Learning clause 13:2:1:[8.1,2.1]:Top:  -> c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,x0,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)),c_PropLog_Oeval(v_tt,v_pl1,t_a)
% 0.41/0.57  === Backtracking. Learning clause 14:2:1:[8.1,4.1]:Top:  -> c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,x0,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)),c_PropLog_Oeval(v_tt,v_pl2,t_a)
% 0.41/0.57  === Backtracking. Learning clause 15:2:0:[11.2,5.1]:: c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) -> c_PropLog_Oeval(v_tt,v_pl1,t_a)
% 0.41/0.57  === Backtracking. Learning clause 16:1:0:[10.2,5.1,13.1]::  -> c_PropLog_Oeval(v_tt,v_pl1,t_a)
% 0.41/0.57  === Backtracking. Learning clause 18:2:0:[16.0,17.1,11.2,7.1]:: c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) -> c_PropLog_Oeval(v_tt,v_pl2,t_a)
% 0.41/0.57  === Backtracking. Learning clause 20:2:0:[16.0,19.1,10.2,7.1]:: c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) -> c_PropLog_Oeval(v_tt,v_pl2,t_a)
% 0.41/0.57  === Backtracking. Learning clause 22:2:0:[16.0,21.1,12.2,7.1]:: c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) -> c_PropLog_Oeval(v_tt,v_pl2,t_a)
% 0.41/0.57  === Backtracking. Learning clause 25:2:0:[16.0,23.1,4.0,24.2,9.3,7.1,11.2]:: c_in(v_pl1,c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) -> c_PropLog_Oeval(v_tt,v_pl2,t_a)
% 0.41/0.57  === Clause set with instances from active satisfied. Growing active. New size: 32
% 0.41/0.57  === Restarting.
% 0.41/0.57  === Backtracking. Learning clause 26:2:4:[8.1,12.2]:TopTopTopTop: c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(x0,x1),tc_PropLog_Opl(x1)) -> c_in(c_PropLog_Opl_Oop_A_N_62(x2,x3,x1),c_PropLog_Othms(x0,x1),tc_PropLog_Opl(x1))
% 0.41/0.57  === Backtracking. Learning clause 27:3:0:[9.3,20.1]:: c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)),c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) -> c_PropLog_Oeval(v_tt,v_pl2,t_a)
% 0.41/0.57  === Backtracking. Learning clause 29:1:0:[16.0,28.0,10.2,25.1,1.2]::  -> c_PropLog_Oeval(v_tt,v_pl2,t_a)
% 0.41/0.57  === Conflict found: 26:2:4:[8.1,12.2]:TopTopTopTop: c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(x0,x1),tc_PropLog_Opl(x1)) -> c_in(c_PropLog_Opl_Oop_A_N_62(x2,x3,x1),c_PropLog_Othms(x0,x1),tc_PropLog_Opl(x1)) {x0 -> c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)), x1 -> t_a, x2 -> v_pl1, x3 -> v_pl2}
% 0.41/0.57  === Backtracking. Learning clause 31:1:0:[22.1,30.1,26.2,6.2]:: c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) -> 
% 0.41/0.57  
% 0.41/0.57  SZS status Unsatisfiable
% 0.41/0.57  
% 0.41/0.57  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.57  
% 0.41/0.57  SPASS-SCL-FOL Statistics:
% 0.41/0.57  Number of learned clauses: 12
% 0.41/0.57  Number of propagations: 180
% 0.41/0.57  Number of decisions: 121
% 0.41/0.57  Number of resolutions: 19
% 0.41/0.57  Number of condensations: 0
% 0.41/0.57  Number of sub resolutions: 7
% 0.41/0.57  Number of input literals (deduplicated): 13
% 0.41/0.57  Number of grows: 1
% 0.41/0.57  Number of considered ground atoms: 32
% 0.41/0.57  
% 0.41/0.57   Needed:       0:00:00.02
% 0.41/0.57  
%------------------------------------------------------------------------------