TSTP Solution File: SYN364+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN364+1 : TPTP v8.1.0. Released v2.0.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 : 600s
% DateTime : Thu Jul 21 11:18:36 EDT 2022
% Result : Theorem 0.46s 0.75s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : SYN364+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.07 % Command : tptp2X_and_run_prover9 %d %s
% 0.06/0.26 % Computer : n027.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Tue Jul 12 07:03:04 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.46/0.75 ============================== Prover9 ===============================
% 0.46/0.75 Prover9 (32) version 2009-11A, November 2009.
% 0.46/0.75 Process 4842 was started by sandbox on n027.cluster.edu,
% 0.46/0.75 Tue Jul 12 07:03:05 2022
% 0.46/0.75 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4392_n027.cluster.edu".
% 0.46/0.75 ============================== end of head ===========================
% 0.46/0.75
% 0.46/0.75 ============================== INPUT =================================
% 0.46/0.75
% 0.46/0.75 % Reading from file /tmp/Prover9_4392_n027.cluster.edu
% 0.46/0.75
% 0.46/0.75 set(prolog_style_variables).
% 0.46/0.75 set(auto2).
% 0.46/0.75 % set(auto2) -> set(auto).
% 0.46/0.75 % set(auto) -> set(auto_inference).
% 0.46/0.75 % set(auto) -> set(auto_setup).
% 0.46/0.75 % set(auto_setup) -> set(predicate_elim).
% 0.46/0.75 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/0.75 % set(auto) -> set(auto_limits).
% 0.46/0.75 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/0.75 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/0.75 % set(auto) -> set(auto_denials).
% 0.46/0.75 % set(auto) -> set(auto_process).
% 0.46/0.75 % set(auto2) -> assign(new_constants, 1).
% 0.46/0.75 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/0.75 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/0.75 % set(auto2) -> assign(max_hours, 1).
% 0.46/0.75 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/0.75 % set(auto2) -> assign(max_seconds, 0).
% 0.46/0.75 % set(auto2) -> assign(max_minutes, 5).
% 0.46/0.75 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/0.75 % set(auto2) -> set(sort_initial_sos).
% 0.46/0.75 % set(auto2) -> assign(sos_limit, -1).
% 0.46/0.75 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/0.75 % set(auto2) -> assign(max_megs, 400).
% 0.46/0.75 % set(auto2) -> assign(stats, some).
% 0.46/0.75 % set(auto2) -> clear(echo_input).
% 0.46/0.75 % set(auto2) -> set(quiet).
% 0.46/0.75 % set(auto2) -> clear(print_initial_clauses).
% 0.46/0.75 % set(auto2) -> clear(print_given).
% 0.46/0.75 assign(lrs_ticks,-1).
% 0.46/0.75 assign(sos_limit,10000).
% 0.46/0.75 assign(order,kbo).
% 0.46/0.75 set(lex_order_vars).
% 0.46/0.75 clear(print_given).
% 0.46/0.75
% 0.46/0.75 % formulas(sos). % not echoed (1 formulas)
% 0.46/0.75
% 0.46/0.75 ============================== end of input ==========================
% 0.46/0.75
% 0.46/0.75 % From the command line: assign(max_seconds, 300).
% 0.46/0.75
% 0.46/0.75 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/0.75
% 0.46/0.75 % Formulas that are not ordinary clauses:
% 0.46/0.75 1 -((all X ((exists Y big_p(X,Y)) -> (all Z big_p(Z,Z)))) & (all U exists V (big_p(U,V) | big_m(U) & big_q(f(U,V)))) & (all W (big_q(W) -> -big_m(g(W)))) -> (all U exists V (big_p(g(U),V) & big_p(U,U)))) # label(x2115) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/0.75
% 0.46/0.75 ============================== end of process non-clausal formulas ===
% 0.46/0.75
% 0.46/0.75 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/0.75
% 0.46/0.75 ============================== PREDICATE ELIMINATION =================
% 0.46/0.75 2 -big_q(A) | -big_m(g(A)) # label(x2115) # label(negated_conjecture). [clausify(1)].
% 0.46/0.75 3 big_p(A,f1(A)) | big_m(A) # label(x2115) # label(negated_conjecture). [clausify(1)].
% 0.46/0.75 Derived: -big_q(A) | big_p(g(A),f1(g(A))). [resolve(2,b,3,b)].
% 0.46/0.75 4 -big_q(A) | big_p(g(A),f1(g(A))). [resolve(2,b,3,b)].
% 0.46/0.75 5 big_p(A,f1(A)) | big_q(f(A,f1(A))) # label(x2115) # label(negated_conjecture). [clausify(1)].
% 0.46/0.75 Derived: big_p(g(f(A,f1(A))),f1(g(f(A,f1(A))))) | big_p(A,f1(A)). [resolve(4,a,5,b)].
% 0.46/0.75
% 0.46/0.75 ============================== end predicate elimination =============
% 0.46/0.75
% 0.46/0.75 Auto_denials: (non-Horn, no changes).
% 0.46/0.75
% 0.46/0.75 Term ordering decisions:
% 0.46/0.75 Function symbol KB weights: c1=1. f=1. g=1. f1=1.
% 0.46/0.75
% 0.46/0.75 ============================== end of process initial clauses ========
% 0.46/0.75
% 0.46/0.75 ============================== CLAUSES FOR SEARCH ====================
% 0.46/0.75
% 0.46/0.75 ============================== end of clauses for search =============
% 0.46/0.75
% 0.46/0.75 ============================== SEARCH ================================
% 0.46/0.75
% 0.46/0.75 % Starting search at 0.01 seconds.
% 0.46/0.75
% 0.46/0.75 ============================== PROOF =================================
% 0.46/0.75 % SZS status Theorem
% 0.46/0.75 % SZS output start Refutation
% 0.46/0.75
% 0.46/0.75 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/0.75 % Length of proof is 15.
% 0.46/0.75 % Level of proof is 8.
% 0.46/0.75 % Maximum clause weight is 16.000.
% 0.46/0.75 % Given clauses 4.
% 0.46/0.75
% 0.46/0.75 1 -((all X ((exists Y big_p(X,Y)) -> (all Z big_p(Z,Z)))) & (all U exists V (big_p(U,V) | big_m(U) & big_q(f(U,V)))) & (all W (big_q(W) -> -big_m(g(W)))) -> (all U exists V (big_p(g(U),V) & big_p(U,U)))) # label(x2115) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/0.75 2 -big_q(A) | -big_m(g(A)) # label(x2115) # label(negated_conjecture). [clausify(1)].
% 0.46/0.75 3 big_p(A,f1(A)) | big_m(A) # label(x2115) # label(negated_conjecture). [clausify(1)].
% 0.46/0.75 4 -big_q(A) | big_p(g(A),f1(g(A))). [resolve(2,b,3,b)].
% 0.46/0.75 5 big_p(A,f1(A)) | big_q(f(A,f1(A))) # label(x2115) # label(negated_conjecture). [clausify(1)].
% 0.46/0.75 6 -big_p(g(c1),A) | -big_p(c1,c1) # label(x2115) # label(negated_conjecture). [clausify(1)].
% 0.46/0.75 7 -big_p(A,B) | big_p(C,C) # label(x2115) # label(negated_conjecture). [clausify(1)].
% 0.46/0.75 8 big_p(g(f(A,f1(A))),f1(g(f(A,f1(A))))) | big_p(A,f1(A)). [resolve(4,a,5,b)].
% 0.46/0.75 9 big_p(A,f1(A)) | big_p(B,B). [resolve(8,a,7,a)].
% 0.46/0.75 10 big_p(A,A) | big_p(B,B). [resolve(9,a,7,a)].
% 0.46/0.75 11 big_p(A,f1(A)) | -big_p(c1,c1). [resolve(9,b,6,a)].
% 0.46/0.75 12 big_p(A,A). [factor(10,a,b)].
% 0.46/0.75 13 big_p(A,f1(A)). [back_unit_del(11),unit_del(b,12)].
% 0.46/0.75 14 -big_p(g(c1),A). [back_unit_del(6),unit_del(b,12)].
% 0.46/0.75 15 $F. [resolve(14,a,13,a)].
% 0.46/0.75
% 0.46/0.75 % SZS output end Refutation
% 0.46/0.75 ============================== end of proof ==========================
% 0.46/0.75
% 0.46/0.75 ============================== STATISTICS ============================
% 0.46/0.75
% 0.46/0.75 Given=4. Generated=11. Kept=9. proofs=1.
% 0.46/0.75 Usable=1. Sos=0. Demods=0. Limbo=2, Disabled=12. Hints=0.
% 0.46/0.75 Megabytes=0.03.
% 0.46/0.75 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/0.75
% 0.46/0.75 ============================== end of statistics =====================
% 0.46/0.75
% 0.46/0.75 ============================== end of search =========================
% 0.46/0.75
% 0.46/0.75 THEOREM PROVED
% 0.46/0.75 % SZS status Theorem
% 0.46/0.75
% 0.46/0.75 Exiting with 1 proof.
% 0.46/0.75
% 0.46/0.75 Process 4842 exit (max_proofs) Tue Jul 12 07:03:05 2022
% 0.46/0.75 Prover9 interrupted
%------------------------------------------------------------------------------