↑ Up

Prover9---1109a.TMO-Non.f

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWX198+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n027.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 : Wed Apr 29 02:38:04 PM UTC 2026

% Result   : Timeout 299.63s 300.03s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX198+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.16/0.34  % Computer : n027.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Wed Apr 29 00:26:49 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.44/1.01  ============================== Prover9 ===============================
% 0.44/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01  Process 14833 was started by sandbox2 on n027.cluster.edu,
% 0.44/1.01  Wed Apr 29 00:26:50 2026
% 0.44/1.01  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14680_n027.cluster.edu".
% 0.44/1.01  ============================== end of head ===========================
% 0.44/1.01  
% 0.44/1.01  ============================== INPUT =================================
% 0.44/1.01  
% 0.44/1.01  % Reading from file /tmp/Prover9_14680_n027.cluster.edu
% 0.44/1.01  
% 0.44/1.01  set(prolog_style_variables).
% 0.44/1.01  set(auto2).
% 0.44/1.01      % set(auto2) -> set(auto).
% 0.44/1.01      % set(auto) -> set(auto_inference).
% 0.44/1.01      % set(auto) -> set(auto_setup).
% 0.44/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01      % set(auto) -> set(auto_limits).
% 0.44/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01      % set(auto) -> set(auto_denials).
% 0.44/1.01      % set(auto) -> set(auto_process).
% 0.44/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01      % set(auto2) -> assign(stats, some).
% 0.44/1.01      % set(auto2) -> clear(echo_input).
% 0.44/1.01      % set(auto2) -> set(quiet).
% 0.44/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01      % set(auto2) -> clear(print_given).
% 0.44/1.01  assign(lrs_ticks,-1).
% 0.44/1.01  assign(sos_limit,10000).
% 0.44/1.01  assign(order,kbo).
% 0.44/1.01  set(lex_order_vars).
% 0.44/1.01  clear(print_given).
% 0.44/1.01  
% 0.44/1.01  % formulas(sos).  % not echoed (24 formulas)
% 0.44/1.01  
% 0.44/1.01  ============================== end of input ==========================
% 0.44/1.01  
% 0.44/1.01  % From the command line: assign(max_seconds, 300).
% 0.44/1.01  
% 0.44/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01  
% 0.44/1.01  % Formulas that are not ordinary clauses:
% 0.44/1.01  1 (all X all X2 head(cons(X,X2)) = X) # label(axiom_001) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  2 (all X all X2 tail(cons(X,X2)) = X2) # label(axiom_002) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  3 (all X all X2 nil != cons(X,X2)) # label(axiom_003) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  4 (all X proj1S(s(X)) = X) # label(axiom_004) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  5 (all X z != s(X)) # label(axiom_005) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  6 (all Z ltNat(z,s(Z))) # label(axiom_007) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  7 (all X2 -ltNat(s(X2),z)) # label(axiom_008) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  8 (all X2 all M (ltNat(s(X2),s(M)) <-> ltNat(X2,M))) # label(axiom_009) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  9 (all Y usorted(cons(Y,nil))) # label(axiom_011) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  10 (all Y all Y2 all Xs (usorted(cons(Y,cons(Y2,Xs))) <-> ltNat(Y,Y2) & usorted(cons(Y2,Xs)))) # label(axiom_012) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  11 (all Y leqNat(z,Y)) # label(axiom_013) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  12 (all Z -leqNat(s(Z),z)) # label(axiom_014) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  13 (all Z all M (leqNat(s(Z),s(M)) <-> leqNat(Z,M))) # label(axiom_015) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  14 (all Y all Xs lengthNat(cons(Y,Xs)) = s(lengthNat(Xs))) # label(axiom_017) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  15 (all Y append(nil,Y) = Y) # label(axiom_018) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  16 (all Y all Z all Xs append(cons(Z,Xs),Y) = cons(Z,append(Xs,Y))) # label(axiom_019) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  17 (all Y all Xs rev(cons(Y,Xs)) = append(rev(Xs),cons(Y,nil))) # label(axiom_021) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.01  18 (all X allsmall(X,nil)) # label(axiom_022) # label(axio
% 0.44/1.01  WARNING: denials share constants (see output).
% 0.44/1.01  
% 299.63/300.03  Terminated 
% 299.63/300.03  Prover9 interrupted
%------------------------------------------------------------------------------