↑ Up

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

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

% Computer : n026.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:20:11 PM UTC 2026

% Result   : Theorem 0.24s 0.71s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.29  % Problem  : CSR073+1 : TPTP v9.2.1. Released v3.4.0.
% 0.08/0.30  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.49  % Computer : n026.cluster.edu
% 0.11/0.49  % Model    : x86_64 x86_64
% 0.11/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.49  % Memory   : 8042.1875MB
% 0.11/0.49  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.49  % CPULimit : 300
% 0.11/0.49  % WCLimit  : 300
% 0.11/0.49  % DateTime : Thu May  7 11:42:14 EDT 2026
% 0.11/0.49  % CPUTime  : 
% 0.11/0.49  SPASS-SCL-FOL version:
% 0.22/0.58  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.24/0.71  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.71  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.71  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.71  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.71  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.71  Execution resolution_3 ended with status: unsatisfiable
% 0.24/0.71  Used heuristic: resolution_3
% 0.24/0.71  
% 0.24/0.71   Input Clauses:
% 0.24/0.71  
% 0.24/0.71   Predicates: genlmt transitivebinarypredicate genlpreds tptptypes_6_388 tptptypes_5_387 tptptypes_7_396 tptptypes_8_400 genlinverse tptptypes_9_401 mtvisible isa disjointwith collection genls tptpcol_16_10258 pushingababycarriage firstordercollection binarypredicate predicate thing microtheory 
% 0.24/0.71   Fol Constants: c_calendarsmt c_calendarsvocabularymt c_genlmt c_basekb c_universalvocabularymt c_cyclistsmt c_tptptypes_6_388 c_tptptypes_5_387 c_tptptypes_7_396 c_tptptypes_8_400 c_tptptypes_9_401 c_tptp_spindleheadmt c_tptp_spindlecollectormt c_tptp_member237_mt c_tptp_member3993_mt c_pushingababycarriage c_tptpcol_16_10258 c_transitivebinarypredicate 
% 0.24/0.71   Fol Functions: 
% 0.24/0.71   Problem Properties:
% 0.24/0.71   This is a Bernays Schoenfinkel problem.
% 0.24/0.71  
% 0.24/0.71   After reduction:  Problem Properties:
% 0.24/0.71   This is a Bernays Schoenfinkel problem.
% 0.24/0.71  
% 0.24/0.71  
% 0.24/0.71   Reduced Input Clauses:
% 0.24/0.71  
% 0.24/0.71   Most General Atoms: tptptypes_6_388(x0,x1) tptptypes_5_387(x0,x1) tptptypes_7_396(x0,x1) tptptypes_9_401(x0,x1) tptptypes_8_400(x1,x0) isa(x0,x2) collection(x0) disjointwith(x2,x1) tptpcol_16_10258(x0) pushingababycarriage(x0) firstordercollection(x0) binarypredicate(x0) genlinverse(x0,x2) genlpreds(x0,x1) predicate(x0) transitivebinarypredicate(x0) genlmt(x0,x2) thing(x0) genls(x1,x2) mtvisible(x1) microtheory(x1) 
% 0.24/0.71  
% 0.24/0.71  === Starting SPASS-SCL-FOL A Little Less Naive, considering 68 atoms initially, heuristics mode: resolution_3 ===
% 0.24/0.71  
% 0.24/0.71  === Backtracking. Learning clause 70:2:1:[64.2,3.1]:Top: genlmt(x0,c_basekb) -> genlmt(x0,c_universalvocabularymt)
% 0.24/0.71  === Backtracking. Learning clause 71:2:1:[64.1,14.1]:Top: genlmt(c_cyclistsmt,x0) -> genlmt(c_tptp_spindleheadmt,x0)
% 0.24/0.71  === Backtracking. Learning clause 72:2:1:[64.2,15.1]:Top: genlmt(x0,c_tptp_spindlecollectormt) -> genlmt(x0,c_tptp_member237_mt)
% 0.24/0.71  === Backtracking. Learning clause 73:2:1:[64.1,16.1]:Top: genlmt(c_tptp_spindleheadmt,x0) -> genlmt(c_tptp_member3993_mt,x0)
% 0.24/0.71  === Backtracking. Learning clause 74:1:0:[45.1,6.1]::  -> predicate(c_tptptypes_5_387)
% 0.24/0.71  === Backtracking. Learning clause 75:1:0:[47.1,6.1]::  -> predicate(c_tptptypes_6_388)
% 0.24/0.71  === Backtracking. Learning clause 76:1:0:[47.1,8.1]::  -> predicate(c_tptptypes_7_396)
% 0.24/0.71  === Backtracking. Learning clause 77:1:0:[47.1,10.1]::  -> predicate(c_tptptypes_8_400)
% 0.24/0.71  === Backtracking. Learning clause 78:1:0:[32.1,12.1]::  -> binarypredicate(c_tptptypes_8_400)
% 0.24/0.71  === Backtracking. Learning clause 79:1:0:[33.1,12.1]::  -> binarypredicate(c_tptptypes_9_401)
% 0.24/0.71  === Backtracking. Learning clause 80:2:0:[30.1,18.2]:: mtvisible(c_tptp_member237_mt) -> firstordercollection(c_tptpcol_16_10258)
% 0.24/0.71  === Backtracking. Learning clause 81:2:0:[31.1,18.2]:: mtvisible(c_tptp_member237_mt) -> firstordercollection(c_pushingababycarriage)
% 0.24/0.71  === Backtracking. Learning clause 82:2:0:[13.1,18.2]:: mtvisible(c_tptp_member237_mt) -> tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage)
% 0.24/0.71  === Clause set with instances from active satisfied. Growing active. New size: 86
% 0.24/0.71  === Restarting.
% 0.24/0.71  === Backtracking. Learning clause 83:2:0:[59.2,1.1]:: mtvisible(c_calendarsmt) -> mtvisible(c_calendarsvocabularymt)
% 0.24/0.71  === Backtracking. Learning clause 84:1:0:[61.1,1.1]::  -> microtheory(c_calendarsvocabularymt)
% 0.24/0.71  === Backtracking. Learning clause 85:1:0:[64.2,5.1,61.1,1.1]::  -> microtheory(c_basekb)
% 0.24/0.71  === Conflict found: 70:2:1:[64.2,3.1]:Top: genlmt(x0,c_basekb) -> genlmt(x0,c_universalvocabularymt) {x0 -> c_calendarsmt}
% 0.24/0.71  === Backtracking. Learning clause 86:2:1:[70.2,61.1]:Top: genlmt(x0,c_basekb) -> microtheory(c_universalvocabularymt)
% 0.24/0.71  === Conflict found: 86:2:1:[70.2,61.1]:Top: genlmt(x0,c_basekb) -> microtheory(c_universalvocabularymt) {x0 -> c_calendarsvocabularymt}
% 0.24/0.71  === Backtracking. Learning clause 87:1:0:[86.1,5.1]::  -> microtheory(c_universalvocabularymt)
% 0.24/0.71  === Backtracking. Learning clause 88:1:0:[63.1,4.1]::  -> microtheory(c_cyclistsmt)
% 0.24/0.71  === Conflict found: 71:2:1:[64.1,14.1]:Top: genlmt(c_cyclistsmt,x0) -> genlmt(c_tptp_spindleheadmt,x0) {x0 -> c_calendarsmt}
% 0.24/0.71  === Backtracking. Learning clause 89:1:0:[71.2,63.1,4.1]::  -> microtheory(c_tptp_spindleheadmt)
% 0.24/0.71  === Backtracking. Learning clause 90:1:0:[63.1,15.1]::  -> microtheory(c_tptp_spindlecollectormt)
% 0.24/0.71  === Conflict found: 72:2:1:[64.2,15.1]:Top: genlmt(x0,c_tptp_spindlecollectormt) -> genlmt(x0,c_tptp_member237_mt) {x0 -> c_calendarsmt}
% 0.24/0.71  === Backtracking. Learning clause 91:2:1:[72.2,61.1]:Top: genlmt(x0,c_tptp_spindlecollectormt) -> microtheory(c_tptp_member237_mt)
% 0.24/0.71  === Backtracking. Learning clause 92:1:0:[61.1,15.1]::  -> microtheory(c_tptp_member237_mt)
% 0.24/0.71  === Backtracking. Learning clause 93:2:1:[64.2,17.1,61.1]:Top: genlmt(x0,c_tptp_spindlecollectormt) -> microtheory(c_tptp_member3993_mt)
% 0.24/0.71  === Backtracking. Learning clause 94:1:0:[61.1,17.1]::  -> microtheory(c_tptp_member3993_mt)
% 0.24/0.71  === Backtracking. Learning clause 95:2:0:[11.1,82.2]:: mtvisible(c_tptp_member237_mt) -> tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage)
% 0.24/0.71  === Clause set with instances from active satisfied. Growing active. New size: 95
% 0.24/0.71  === Restarting.
% 0.24/0.71  === Backtracking. Learning clause 96:2:0:[9.1,95.2]:: mtvisible(c_tptp_member237_mt) -> tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage)
% 0.24/0.71  === Clause set with instances from active satisfied. Growing active. New size: 154
% 0.24/0.71  === Clause set with instances from active satisfied. Growing active. New size: 218
% 0.24/0.71  === Backtracking. Learning clause 97:1:0:[53.2,55.1,2.1]::  -> collection(c_transitivebinarypredicate)
% 0.24/0.71  === Backtracking. Learning clause 99:4:2:[17.0,98.0,59.3,95.1,59.3,64.3,68.1,73.2,64.3]:TopTop: genlmt(c_tptp_spindleheadmt,x0),genlmt(x0,x1),genlmt(x1,c_tptp_member237_mt) -> tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage)
% 0.24/0.71  === Backtracking. Learning clause 101:1:0:[15.0,100.0,59.1,68.1,95.1]::  -> tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage)
% 0.24/0.71  
% 0.24/0.71  SZS status Unsatisfiable
% 0.24/0.71  
% 0.24/0.71  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.71  
% 0.24/0.71  SPASS-SCL-FOL Statistics:
% 0.24/0.71  Number of learned clauses: 30
% 0.24/0.71  Number of propagations: 1137
% 0.24/0.71  Number of decisions: 528
% 0.24/0.71  Number of resolutions: 44
% 0.24/0.71  Number of condensations: 0
% 0.24/0.71  Number of sub resolutions: 2
% 0.24/0.71  Number of input literals (deduplicated): 45
% 0.24/0.71  Number of grows: 4
% 0.24/0.71  Number of considered ground atoms: 218
% 0.24/0.71  
% 0.24/0.71   Needed:       0:00:00.04
% 0.24/0.71  
%------------------------------------------------------------------------------