TSTP Solution File: SYN403+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN403+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:57 EDT 2022
% Result : Theorem 0.86s 1.10s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN403+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n020.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 : Tue Jul 12 04:38:57 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.86/1.10 ============================== Prover9 ===============================
% 0.86/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.86/1.10 Process 11337 was started by sandbox2 on n020.cluster.edu,
% 0.86/1.10 Tue Jul 12 04:38:58 2022
% 0.86/1.10 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11184_n020.cluster.edu".
% 0.86/1.10 ============================== end of head ===========================
% 0.86/1.10
% 0.86/1.10 ============================== INPUT =================================
% 0.86/1.10
% 0.86/1.10 % Reading from file /tmp/Prover9_11184_n020.cluster.edu
% 0.86/1.10
% 0.86/1.10 set(prolog_style_variables).
% 0.86/1.10 set(auto2).
% 0.86/1.10 % set(auto2) -> set(auto).
% 0.86/1.10 % set(auto) -> set(auto_inference).
% 0.86/1.10 % set(auto) -> set(auto_setup).
% 0.86/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.86/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.86/1.10 % set(auto) -> set(auto_limits).
% 0.86/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.86/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.86/1.10 % set(auto) -> set(auto_denials).
% 0.86/1.10 % set(auto) -> set(auto_process).
% 0.86/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.86/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.86/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.86/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.86/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.86/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.86/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.86/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.86/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.86/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.86/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.86/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.86/1.10 % set(auto2) -> assign(stats, some).
% 0.86/1.10 % set(auto2) -> clear(echo_input).
% 0.86/1.10 % set(auto2) -> set(quiet).
% 0.86/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.86/1.10 % set(auto2) -> clear(print_given).
% 0.86/1.10 assign(lrs_ticks,-1).
% 0.86/1.10 assign(sos_limit,10000).
% 0.86/1.10 assign(order,kbo).
% 0.86/1.10 set(lex_order_vars).
% 0.86/1.10 clear(print_given).
% 0.86/1.10
% 0.86/1.10 % formulas(sos). % not echoed (1 formulas)
% 0.86/1.10
% 0.86/1.10 ============================== end of input ==========================
% 0.86/1.10
% 0.86/1.10 % From the command line: assign(max_seconds, 300).
% 0.86/1.10
% 0.86/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.86/1.10
% 0.86/1.10 % Formulas that are not ordinary clauses:
% 0.86/1.10 1 -(all X ((f(X) -> g(X)) & (g(X) -> h(X)) -> (f(X) -> h(X)))) # label(kalish234) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.86/1.10
% 0.86/1.10 ============================== end of process non-clausal formulas ===
% 0.86/1.10
% 0.86/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.86/1.10
% 0.86/1.10 ============================== PREDICATE ELIMINATION =================
% 0.86/1.10 2 -f(c1) | g(c1) # label(kalish234) # label(negated_conjecture). [clausify(1)].
% 0.86/1.10 3 f(c1) # label(kalish234) # label(negated_conjecture). [clausify(1)].
% 0.86/1.10 Derived: g(c1). [resolve(2,a,3,a)].
% 0.86/1.10 4 -g(c1) | h(c1) # label(kalish234) # label(negated_conjecture). [clausify(1)].
% 0.86/1.10 5 -h(c1) # label(kalish234) # label(negated_conjecture). [clausify(1)].
% 0.86/1.10 Derived: -g(c1). [resolve(4,b,5,a)].
% 0.86/1.10 6 -g(c1). [resolve(4,b,5,a)].
% 0.86/1.10 7 g(c1). [resolve(2,a,3,a)].
% 0.86/1.10 Derived: $F. [resolve(6,a,7,a)].
% 0.86/1.10
% 0.86/1.10 ============================== end predicate elimination =============
% 0.86/1.10
% 0.86/1.10 Auto_denials: (no changes).
% 0.86/1.10
% 0.86/1.10 Term ordering decisions:
% 0.86/1.10 Function symbol KB weights:
% 0.86/1.10
% 0.86/1.10 ============================== PROOF =================================
% 0.86/1.10 % SZS status Theorem
% 0.86/1.10 % SZS output start Refutation
% 0.86/1.10
% 0.86/1.10 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.86/1.10 % Length of proof is 8.
% 0.86/1.10 % Level of proof is 3.
% 0.86/1.10 % Maximum clause weight is 0.000.
% 0.86/1.10 % Given clauses 0.
% 0.86/1.10
% 0.86/1.10 1 -(all X ((f(X) -> g(X)) & (g(X) -> h(X)) -> (f(X) -> h(X)))) # label(kalish234) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.86/1.10 2 -f(c1) | g(c1) # label(kalish234) # label(negated_conjecture). [clausify(1)].
% 0.86/1.10 3 f(c1) # label(kalish234) # label(negated_conjecture). [clausify(1)].
% 0.86/1.10 4 -g(c1) | h(c1) # label(kalish234) # label(negated_conjecture). [clausify(1)].
% 0.86/1.10 5 -h(c1) # label(kalish234) # label(negated_conjecture). [clausify(1)].
% 0.86/1.10 6 -g(c1). [resolve(4,b,5,a)].
% 0.86/1.10 7 g(c1). [resolve(2,a,3,a)].
% 0.86/1.10 8 $F. [resolve(6,a,7,a)].
% 0.86/1.10
% 0.86/1.10 % SZS output end Refutation
% 0.86/1.10 ============================== end of proof ==========================
% 0.86/1.10
% 0.86/1.10 ============================== STATISTICS ============================
% 0.86/1.10
% 0.86/1.10 Given=0. Generated=1. Kept=0. proofs=1.
% 0.86/1.10 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=7. Hints=0.
% 0.86/1.10 Megabytes=0.02.
% 0.86/1.10 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.86/1.10
% 0.86/1.10 ============================== end of statistics =====================
% 0.86/1.10
% 0.86/1.10 ============================== end of search =========================
% 0.86/1.10
% 0.86/1.10 THEOREM PROVED
% 0.86/1.10 % SZS status Theorem
% 0.86/1.10
% 0.86/1.10 Exiting with 1 proof.
% 0.86/1.10
% 0.86/1.10 Process 11337 exit (max_proofs) Tue Jul 12 04:38:58 2022
% 0.86/1.10 Prover9 interrupted
%------------------------------------------------------------------------------