TSTP Solution File: SWV011+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV011+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 : Wed Jul 20 21:10:13 EDT 2022
% Result : Theorem 0.47s 1.04s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV011+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Wed Jun 15 07:44:50 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.47/1.04 ============================== Prover9 ===============================
% 0.47/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.04 Process 6339 was started by sandbox on n023.cluster.edu,
% 0.47/1.04 Wed Jun 15 07:44:51 2022
% 0.47/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5956_n023.cluster.edu".
% 0.47/1.04 ============================== end of head ===========================
% 0.47/1.04
% 0.47/1.04 ============================== INPUT =================================
% 0.47/1.04
% 0.47/1.04 % Reading from file /tmp/Prover9_5956_n023.cluster.edu
% 0.47/1.04
% 0.47/1.04 set(prolog_style_variables).
% 0.47/1.04 set(auto2).
% 0.47/1.04 % set(auto2) -> set(auto).
% 0.47/1.04 % set(auto) -> set(auto_inference).
% 0.47/1.04 % set(auto) -> set(auto_setup).
% 0.47/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.04 % set(auto) -> set(auto_limits).
% 0.47/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.04 % set(auto) -> set(auto_denials).
% 0.47/1.04 % set(auto) -> set(auto_process).
% 0.47/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.04 % set(auto2) -> assign(stats, some).
% 0.47/1.04 % set(auto2) -> clear(echo_input).
% 0.47/1.04 % set(auto2) -> set(quiet).
% 0.47/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.04 % set(auto2) -> clear(print_given).
% 0.47/1.04 assign(lrs_ticks,-1).
% 0.47/1.04 assign(sos_limit,10000).
% 0.47/1.04 assign(order,kbo).
% 0.47/1.04 set(lex_order_vars).
% 0.47/1.04 clear(print_given).
% 0.47/1.04
% 0.47/1.04 % formulas(sos). % not echoed (17 formulas)
% 0.47/1.04
% 0.47/1.04 ============================== end of input ==========================
% 0.47/1.04
% 0.47/1.04 % From the command line: assign(max_seconds, 300).
% 0.47/1.04
% 0.47/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.04
% 0.47/1.04 % Formulas that are not ordinary clauses:
% 0.47/1.04 1 -(exists U (a_holds(key(U,b)) & b_holds(key(U,a)))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.04
% 0.47/1.04 ============================== end of process non-clausal formulas ===
% 0.47/1.04
% 0.47/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.04
% 0.47/1.04 ============================== PREDICATE ELIMINATION =================
% 0.47/1.04 2 -a_holds(key(A,b)) | -b_holds(key(A,a)) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.47/1.04 3 a_holds(key(at,t)) # label(a_holds_key_at_for_t) # label(axiom). [assumption].
% 0.47/1.04 4 a_holds(key(generate_key(an_a_nonce),b)) # label(ax3) # label(axiom). [assumption].
% 0.47/1.04 Derived: -b_holds(key(generate_key(an_a_nonce),a)). [resolve(2,a,4,a)].
% 0.47/1.04 5 -b_holds(key(generate_key(an_a_nonce),a)). [resolve(2,a,4,a)].
% 0.47/1.04 6 b_holds(key(bt,t)) # label(b_hold_key_bt_for_t) # label(axiom). [assumption].
% 0.47/1.04 7 b_holds(key(generate_key(an_a_nonce),a)) # label(ax1) # label(axiom). [assumption].
% 0.47/1.04 Derived: $F. [resolve(5,a,7,a)].
% 0.47/1.04
% 0.47/1.04 ============================== end predicate elimination =============
% 0.47/1.04
% 0.47/1.04 Auto_denials: (no changes).
% 0.47/1.04
% 0.47/1.04 Term ordering decisions:
% 0.47/1.04 Function symbol KB weights:
% 0.47/1.04
% 0.47/1.04 ============================== PROOF =================================
% 0.47/1.04 % SZS status Theorem
% 0.47/1.04 % SZS output start Refutation
% 0.47/1.04
% 0.47/1.04 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.47/1.04 % Length of proof is 6.
% 0.47/1.04 % Level of proof is 3.
% 0.47/1.04 % Maximum clause weight is 0.000.
% 0.47/1.04 % Given clauses 0.
% 0.47/1.04
% 0.47/1.04 1 -(exists U (a_holds(key(U,b)) & b_holds(key(U,a)))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.04 2 -a_holds(key(A,b)) | -b_holds(key(A,a)) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.47/1.04 4 a_holds(key(generate_key(an_a_nonce),b)) # label(ax3) # label(axiom). [assumption].
% 0.47/1.04 5 -b_holds(key(generate_key(an_a_nonce),a)). [resolve(2,a,4,a)].
% 0.47/1.04 7 b_holds(key(generate_key(an_a_nonce),a)) # label(ax1) # label(axiom). [assumption].
% 0.47/1.04 8 $F. [resolve(5,a,7,a)].
% 0.47/1.04
% 0.47/1.04 % SZS output end Refutation
% 0.47/1.04 ============================== end of proof ==========================
% 0.47/1.04
% 0.47/1.04 ============================== STATISTICS ============================
% 0.47/1.04
% 0.47/1.04 Given=0. Generated=1. Kept=0. proofs=1.
% 0.47/1.04 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=19. Hints=0.
% 0.47/1.04 Megabytes=0.02.
% 0.47/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.47/1.04
% 0.47/1.04 ============================== end of statistics =====================
% 0.47/1.04
% 0.47/1.04 ============================== end of search =========================
% 0.47/1.04
% 0.47/1.04 THEOREM PROVED
% 0.47/1.04 % SZS status Theorem
% 0.47/1.04
% 0.47/1.04 Exiting with 1 proof.
% 0.47/1.04
% 0.47/1.04 Process 6339 exit (max_proofs) Wed Jun 15 07:44:51 2022
% 0.47/1.04 Prover9 interrupted
%------------------------------------------------------------------------------