TSTP Solution File: SYO846+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO846+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 : 600s
% DateTime : Thu Jul 21 19:18:49 EDT 2022
% Result : Unknown 0.82s 1.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYO846+1 : TPTP v8.1.0. Released v7.5.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jul 8 19:55:38 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.48/1.05 ============================== Prover9 ===============================
% 0.48/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.05 Process 6047 was started by sandbox2 on n019.cluster.edu,
% 0.48/1.05 Fri Jul 8 19:55:39 2022
% 0.48/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5894_n019.cluster.edu".
% 0.48/1.05 ============================== end of head ===========================
% 0.48/1.05
% 0.48/1.05 ============================== INPUT =================================
% 0.48/1.05
% 0.48/1.05 % Reading from file /tmp/Prover9_5894_n019.cluster.edu
% 0.48/1.05
% 0.48/1.05 set(prolog_style_variables).
% 0.48/1.05 set(auto2).
% 0.48/1.05 % set(auto2) -> set(auto).
% 0.48/1.05 % set(auto) -> set(auto_inference).
% 0.48/1.05 % set(auto) -> set(auto_setup).
% 0.48/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.05 % set(auto) -> set(auto_limits).
% 0.48/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.05 % set(auto) -> set(auto_denials).
% 0.48/1.05 % set(auto) -> set(auto_process).
% 0.48/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.05 % set(auto2) -> assign(stats, some).
% 0.48/1.05 % set(auto2) -> clear(echo_input).
% 0.48/1.05 % set(auto2) -> set(quiet).
% 0.48/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.05 % set(auto2) -> clear(print_given).
% 0.48/1.05 assign(lrs_ticks,-1).
% 0.48/1.05 assign(sos_limit,10000).
% 0.48/1.05 assign(order,kbo).
% 0.48/1.05 set(lex_order_vars).
% 0.48/1.05 clear(print_given).
% 0.48/1.05
% 0.48/1.05 % formulas(sos). % not echoed (80 formulas)
% 0.48/1.05
% 0.48/1.05 ============================== end of input ==========================
% 0.48/1.05
% 0.48/1.05 % From the command line: assign(max_seconds, 300).
% 0.48/1.05
% 0.48/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.05
% 0.48/1.05 % Formulas that are not ordinary clauses:
% 0.48/1.05 1 (all X24 (aal6(X24) <-> (exists X25 (asubq(X25,X24) & -asubq(X24,X25) & aal5(X25))))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 2 (all X24 (aex3(X24) <-> aal3(X24) & -aal4(X24))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 3 (all X24 (ain(X24,a3) <-> X24 = a0 | X24 = a1 | X24 = a2)) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 4 (all X24 all X25 (ain(X25,apow(X24)) -> asubq(X25,X24))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 5 (all X24 all X25 all X26 (ain(X26,asm(X24,X25)) -> -ain(X26,X25))) # label(ax5) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 6 (all X24 ain(X24,apow(X24))) # label(ax6) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 7 (all X24 all X25 (asubq(X25,X24) -> (-asubq(X24,X25) -> (exists X26 (ain(X26,X24) & asubq(X25,asm(X24,asing(X26)))))))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 8 (all X24 all X25 (-aal6(X24) -> -aal7(aun(X24,asing(X25))))) # label(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 9 (all X24 all X25 all X26 (ain(X26,aun(X24,X25)) -> (aal4(asm(aun(X24,X25),asing(X26))) -> aal3(X24) | aal3(X25)))) # label(ax9) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 10 (all X24 (asubq(X24,aun(asing(a1),asing(asing(a1)))) -> (-ain(asing(a1),X24) -> (ain(a1,X24) -> X24 = asing(a1))))) # label(ax43) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 11 (all X24 (ain(X24,aun(aun(asing(a1),asing(asing(a1))),apow(asing(asing(a1))))) -> X24 = a0 | X24 = a1 | X24 = asing(a1) | X24 = asing(asing(a1)))) # label(ax44) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 12 (all X24 (ain(X24,asm(a4,asing(a1))) -> X24 = a0 | X24 = a2 | X24 = a3)) # label(ax45) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 13 (all X24 (ain(X24,asm(a4,apow(asing(a2)))) -> X24 = a1 | X24 = a2 | X24 = a3)) # label(ax46) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 14 (all X24 (ain(X24,aun(apow(a2),asing(asing(a2)))) -> (ain(X24,aun(asing(a2),aun(apow(asing(a2)),asing(apow(a2))))) -> -ain(X24,asing(apow(a2)))))) # label(ax59) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.09 15 (all X24 (ain(X24,a2) -> -aal2(asm(a2,asing(X24))))) # label(ax62) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.09 16 (all X24 (ain(X24,aun(apow(asing(a2)),asing(apow(a2)))) -> -aal3(asm(aun(apow(asing(a2)),asing(apow(a2))),asing(X24))))) # label(ax63) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.09 17 (all X24 (ain(X24,a3) -> (ain(X24,apow(asm(a3,asing(a1)))) -> -aal3(asm(aint(aun(a3,asing(asm(a3,asing(a1)))),apow(asm(a3,asing(a1)))),asing(X24)))))) # label(ax75) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.09
% 0.82/1.09 ============================== end of process non-clausal formulas ===
% 0.82/1.09
% 0.82/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.09
% 0.82/1.09 ============================== PREDICATE ELIMINATION =================
% 0.82/1.09 18 -aex3(A) | -aal4(A) # label(ax2) # label(axiom). [clausify(2)].
% 0.82/1.09 19 aex3(aun(a2,asing(apow(a2)))) # label(ax74) # label(axiom). [assumption].
% 0.82/1.09 Derived: -aal4(aun(a2,asing(apow(a2)))). [resolve(18,a,19,a)].
% 0.82/1.09 20 -aex3(A) | aal3(A) # label(ax2) # label(axiom). [clausify(2)].
% 0.82/1.09 Derived: aal3(aun(a2,asing(apow(a2)))). [resolve(20,a,19,a)].
% 0.82/1.09 21 aex3(A) | -aal3(A) | aal4(A) # label(ax2) # label(axiom). [clausify(2)].
% 0.82/1.09 22 aal6(A) | -asubq(B,A) | asubq(A,B) | -aal5(B) # label(ax1) # label(axiom). [clausify(1)].
% 0.82/1.09 23 aal5(aun(apow(a2),asing(asing(a2)))) # label(ax70) # label(axiom). [assumption].
% 0.82/1.09 24 -aal6(A) | aal5(f1(A)) # label(ax1) # label(axiom). [clausify(1)].
% 0.82/1.09 Derived: aal6(A) | -asubq(aun(apow(a2),asing(asing(a2))),A) | asubq(A,aun(apow(a2),asing(asing(a2)))). [resolve(22,d,23,a)].
% 0.82/1.09 Derived: aal6(A) | -asubq(f1(B),A) | asubq(A,f1(B)) | -aal6(B). [resolve(22,d,24,b)].
% 0.82/1.09
% 0.82/1.09 ============================== end predicate elimination =============
% 0.82/1.09
% 0.82/1.09 Auto_denials: (non-Horn, no changes).
% 0.82/1.09
% 0.82/1.09 Term ordering decisions:
% 0.82/1.09 Function symbol KB weights: a2=1. a1=1. a4=1. a3=1. a0=1. aun=1. asm=1. aint=1. f2=1. asing=1. apow=1. f1=1.
% 0.82/1.09
% 0.82/1.09 ============================== end of process initial clauses ========
% 0.82/1.09
% 0.82/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.09
% 0.82/1.09 ============================== end of clauses for search =============
% 0.82/1.09
% 0.82/1.09 ============================== SEARCH ================================
% 0.82/1.09
% 0.82/1.09 % Starting search at 0.02 seconds.
% 0.82/1.09
% 0.82/1.09 ============================== STATISTICS ============================
% 0.82/1.09
% 0.82/1.09 Given=186. Generated=296. Kept=196. proofs=0.
% 0.82/1.09 Usable=186. Sos=0. Demods=5. Limbo=0, Disabled=103. Hints=0.
% 0.82/1.09 Megabytes=0.85.
% 0.82/1.09 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.82/1.09
% 0.82/1.09 ============================== end of statistics =====================
% 0.82/1.09
% 0.82/1.09 ============================== end of search =========================
% 0.82/1.09
% 0.82/1.09 SEARCH FAILED
% 0.82/1.09
% 0.82/1.09 Exiting with failure.
% 0.82/1.09
% 0.82/1.09 Process 6047 exit (sos_empty) Fri Jul 8 19:55:39 2022
% 0.82/1.09 Prover9 interrupted
%------------------------------------------------------------------------------