↑ Up

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

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

% 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 : Wed Apr 29 02:38:10 PM UTC 2026

% Result   : Timeout 299.78s 300.05s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWX241_1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.15/0.33  % Computer : n009.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit : 300
% 0.15/0.33  % WCLimit  : 300
% 0.15/0.33  % DateTime : Wed Apr 29 03:12:25 EDT 2026
% 0.15/0.33  % CPUTime  : 
% 0.43/1.02  ============================== Prover9 ===============================
% 0.43/1.02  Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.02  Process 24986 was started by sandbox2 on n009.cluster.edu,
% 0.43/1.02  Wed Apr 29 03:12:26 2026
% 0.43/1.02  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24833_n009.cluster.edu".
% 0.43/1.02  ============================== end of head ===========================
% 0.43/1.02  
% 0.43/1.02  ============================== INPUT =================================
% 0.43/1.02  
% 0.43/1.02  % Reading from file /tmp/Prover9_24833_n009.cluster.edu
% 0.43/1.02  
% 0.43/1.02  set(prolog_style_variables).
% 0.43/1.02  set(auto2).
% 0.43/1.02      % set(auto2) -> set(auto).
% 0.43/1.02      % set(auto) -> set(auto_inference).
% 0.43/1.02      % set(auto) -> set(auto_setup).
% 0.43/1.02      % set(auto_setup) -> set(predicate_elim).
% 0.43/1.02      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.02      % set(auto) -> set(auto_limits).
% 0.43/1.02      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.02      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.02      % set(auto) -> set(auto_denials).
% 0.43/1.02      % set(auto) -> set(auto_process).
% 0.43/1.02      % set(auto2) -> assign(new_constants, 1).
% 0.43/1.02      % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.02      % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.02      % set(auto2) -> assign(max_hours, 1).
% 0.43/1.02      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.02      % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.02      % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.02      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.02      % set(auto2) -> set(sort_initial_sos).
% 0.43/1.02      % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.02      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.02      % set(auto2) -> assign(max_megs, 400).
% 0.43/1.02      % set(auto2) -> assign(stats, some).
% 0.43/1.02      % set(auto2) -> clear(echo_input).
% 0.43/1.02      % set(auto2) -> set(quiet).
% 0.43/1.02      % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.02      % set(auto2) -> clear(print_given).
% 0.43/1.02  assign(lrs_ticks,-1).
% 0.43/1.02  assign(sos_limit,10000).
% 0.43/1.02  assign(order,kbo).
% 0.43/1.02  set(lex_order_vars).
% 0.43/1.02  clear(print_given).
% 0.43/1.02  
% 0.43/1.02  % formulas(sos).  % not echoed (65 formulas)
% 0.43/1.02  
% 0.43/1.02  ============================== end of input ==========================
% 0.43/1.02  
% 0.43/1.02  % From the command line: assign(max_seconds, 300).
% 0.43/1.02  
% 0.43/1.02  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.02  
% 0.43/1.02  % Formulas that are not ordinary clauses:
% 0.43/1.02  1 (all X all X2 head(cons(X,X2)) = X) # label(axiom_001) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  2 (all X all X2 tail(cons(X,X2)) = X2) # label(axiom_002) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  3 (all X all X2 nil != cons(X,X2)) # label(axiom_003) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  4 (all X proj1Suc(suc(X)) = X) # label(axiom_004) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  5 (all X zero != suc(X)) # label(axiom_005) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  6 (all X proj1High(high(X)) = X) # label(axiom_006) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  7 (all X proj1Low(low(X)) = X) # label(axiom_007) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  8 (all X all X2 high(X) != low(X2)) # label(axiom_008) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  9 (all X all X2 proj1Nand(nand(X,X2)) = X) # label(axiom_009) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  10 (all X all X2 proj2Nand(nand(X,X2)) = X2) # label(axiom_010) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  11 (all X proj1Var(var(X)) = X) # label(axiom_011) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  12 (all X all X2 nand(X,X2) != tT) # label(axiom_012) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  13 (all X all X2 nand(X,X2) != fF) # label(axiom_013) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  14 (all X all X2 all X3 nand(X,X2) != var(X3)) # label(axiom_014) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  15 (all X tT != var(X)) # label(axiom_016) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  16 (all X fF != var(X)) # label(axiom_017) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  17 (all X all X2 proj1Assign(assign(X,X2)) = X) # label(axiom_018) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  18 (all X all X2 proj2Assign(assign(X,X2)) = X2) # label(axiom_019) # label(axiom) # label(non_clause).  [assumption].
% 0.43/1.02  19 (all X all X2 proj1Seq(seq(X,X2)) = X) # label(axiom_020) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  20 (all X all X2 proj2Seq(seq(X,X2)) = X2) # label(axiom_021) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  21 (all X all X2 all X3 proj1IfThenElse(ifThenElse(X,X2,X3)) = X) # label(axiom_022) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  22 (all X all X2 all X3 proj2IfThenElse(ifThenElse(X,X2,X3)) = X2) # label(axiom_023) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  23 (all X all X2 all X3 proj3IfThenElse(ifThenElse(X,X2,X3)) = X3) # label(axiom_024) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  24 (all X all X2 proj1While(while(X,X2)) = X) # label(axiom_025) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  25 (all X all X2 proj2While(while(X,X2)) = X2) # label(axiom_026) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  26 (all X all X2 skip != assign(X,X2)) # label(axiom_027) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  27 (all X all X2 skip != seq(X,X2)) # label(axiom_028) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  28 (all X all X2 all X3 skip != ifThenElse(X,X2,X3)) # label(axiom_029) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  29 (all X all X2 skip != while(X,X2)) # label(axiom_030) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  30 (all X all X2 all X3 all X4 assign(X,X2) != seq(X3,X4)) # label(axiom_031) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  31 (all X all X2 all X3 all X4 all X5 assign(X,X2) != ifThenElse(X3,X4,X5)) # label(axiom_032) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  32 (all X all X2 all X3 all X4 assign(X,X2) != while(X3,X4)) # label(axiom_033) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  33 (all X all X2 all X3 all X4 all X5 seq(X,X2) != ifThenElse(X3,X4,X5)) # label(axiom_034) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  34 (all X all X2 all X3 all X4 seq(X,X2) != while(X3,X4)) # label(axiom_035) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  35 (all X all X2 all X3 all X4 all X5 ifThenElse(X,X2,X3) != while(X4,X5)) # label(axiom_036) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  36 (all X (X != nand(proj1Nand(X),proj2Nand(X)) -> (X != var(proj1Var(X)) -> -secret(X)))) # label(axiom_037) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  37 (all A all B (secret(nand(A,B)) <-> secret(A) | secret(B))) # label(axiom_038) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  38 (all Z secret(var(high(Z)))) # label(axiom_039) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  39 (all X2 -secret(var(low(X2)))) # label(axiom_040) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  40 (all E all Z typeCorrect(assign(high(Z),E))) # label(axiom_042) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  41 (all E all X2 (typeCorrect(assign(low(X2),E)) <-> -secret(E))) # label(axiom_043) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  42 (all P all Q (typeCorrect(seq(P,Q)) <-> typeCorrect(P) & typeCorrect(Q))) # label(axiom_044) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  43 (all C all R all Q2 (typeCorrect(ifThenElse(C,R,Q2)) <-> typeCorrect(R) & typeCorrect(Q2))) # label(axiom_045) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  44 (all E2 all P2 (typeCorrect(while(E2,P2)) <-> typeCorrect(P2))) # label(axiom_046) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  45 (all X -elem(X,nil)) # label(axiom_049) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  46 (all X all Z all Xs (elem(X,cons(Z,Xs)) <-> Z = X | elem(X,Xs))) # label(axiom_050) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  47 (all X all A all B (eval(X,nand(A,B)) <-> -eval(X,A) | -eval(X,B))) # label(axiom_051) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  48 (all X eval(X,tT)) # label(axiom_052) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  49 (all X -eval(X,fF)) # label(axiom_053) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  50 (all X all Z (eval(X,var(Z)) <-> elem(Z,X))) # label(axiom_054) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  51 (all X del(X,nil) = nil) # label(axiom_055) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.02  52 (all X all Z all Ys (X = Z -> Terminated 
% 299.78/300.05  Prover9 interrupted
%------------------------------------------------------------------------------