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