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