TSTP Solution File: SYN062-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN062-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:57 EDT 2022
% Result : Unsatisfiable 0.43s 1.05s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN062-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.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:23:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.04 ============================== Prover9 ===============================
% 0.43/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.04 Process 32412 was started by sandbox on n025.cluster.edu,
% 0.43/1.04 Tue Jul 12 03:23:33 2022
% 0.43/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32060_n025.cluster.edu".
% 0.43/1.04 ============================== end of head ===========================
% 0.43/1.04
% 0.43/1.04 ============================== INPUT =================================
% 0.43/1.04
% 0.43/1.04 % Reading from file /tmp/Prover9_32060_n025.cluster.edu
% 0.43/1.04
% 0.43/1.04 set(prolog_style_variables).
% 0.43/1.04 set(auto2).
% 0.43/1.04 % set(auto2) -> set(auto).
% 0.43/1.04 % set(auto) -> set(auto_inference).
% 0.43/1.04 % set(auto) -> set(auto_setup).
% 0.43/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.04 % set(auto) -> set(auto_limits).
% 0.43/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.04 % set(auto) -> set(auto_denials).
% 0.43/1.04 % set(auto) -> set(auto_process).
% 0.43/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.04 % set(auto2) -> assign(stats, some).
% 0.43/1.04 % set(auto2) -> clear(echo_input).
% 0.43/1.04 % set(auto2) -> set(quiet).
% 0.43/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.04 % set(auto2) -> clear(print_given).
% 0.43/1.04 assign(lrs_ticks,-1).
% 0.43/1.04 assign(sos_limit,10000).
% 0.43/1.04 assign(order,kbo).
% 0.43/1.04 set(lex_order_vars).
% 0.43/1.04 clear(print_given).
% 0.43/1.04
% 0.43/1.04 % formulas(sos). % not echoed (7 formulas)
% 0.43/1.04
% 0.43/1.04 ============================== end of input ==========================
% 0.43/1.04
% 0.43/1.04 % From the command line: assign(max_seconds, 300).
% 0.43/1.04
% 0.43/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.05
% 0.43/1.05 % Formulas that are not ordinary clauses:
% 0.43/1.05
% 0.43/1.05 ============================== end of process non-clausal formulas ===
% 0.43/1.05
% 0.43/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.05
% 0.43/1.05 ============================== PREDICATE ELIMINATION =================
% 0.43/1.05 1 -big_f(A) | -big_g(A) | big_i(A) # label(clause_1) # label(axiom). [assumption].
% 0.43/1.05 2 big_f(a) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.43/1.05 Derived: -big_g(a) | big_i(a). [resolve(1,a,2,a)].
% 0.43/1.05 3 -big_f(A) | -big_h(A) | big_i(A) # label(clause_2) # label(axiom). [assumption].
% 0.43/1.05 Derived: -big_h(a) | big_i(a). [resolve(3,a,2,a)].
% 0.43/1.05 4 -big_k(A) | big_h(A) # label(clause_4) # label(axiom). [assumption].
% 0.43/1.05 5 big_k(a) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.43/1.05 Derived: big_h(a). [resolve(4,a,5,a)].
% 0.43/1.05 6 -big_i(A) | -big_h(A) | big_j(A) # label(clause_3) # label(axiom). [assumption].
% 0.43/1.05 7 -big_j(a) # label(clause_7) # label(negated_conjecture). [assumption].
% 0.43/1.05 Derived: -big_i(a) | -big_h(a). [resolve(6,c,7,a)].
% 0.43/1.05 8 big_h(a). [resolve(4,a,5,a)].
% 0.43/1.05 9 -big_h(a) | big_i(a). [resolve(3,a,2,a)].
% 0.43/1.05 Derived: big_i(a). [resolve(8,a,9,a)].
% 0.43/1.05 10 -big_i(a) | -big_h(a). [resolve(6,c,7,a)].
% 0.43/1.05 Derived: -big_i(a). [resolve(10,b,8,a)].
% 0.43/1.05 11 -big_i(a). [resolve(10,b,8,a)].
% 0.43/1.05 12 big_i(a). [resolve(8,a,9,a)].
% 0.43/1.05 Derived: $F. [resolve(11,a,12,a)].
% 0.43/1.05
% 0.43/1.05 ============================== end predicate elimination =============
% 0.43/1.05
% 0.43/1.05 Auto_denials: (no changes).
% 0.43/1.05
% 0.43/1.05 Term ordering decisions:
% 0.43/1.05 Function symbol KB weights:
% 0.43/1.05
% 0.43/1.05 ============================== PROOF =================================
% 0.43/1.05 % SZS status Unsatisfiable
% 0.43/1.05 % SZS output start Refutation
% 0.43/1.05
% 0.43/1.05 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/1.05 % Length of proof is 12.
% 0.43/1.05 % Level of proof is 3.
% 0.43/1.05 % Maximum clause weight is 0.000.
% 0.43/1.05 % Given clauses 0.
% 0.43/1.05
% 0.43/1.05 2 big_f(a) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.43/1.05 3 -big_f(A) | -big_h(A) | big_i(A) # label(clause_2) # label(axiom). [assumption].
% 0.43/1.05 4 -big_k(A) | big_h(A) # label(clause_4) # label(axiom). [assumption].
% 0.43/1.05 5 big_k(a) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.43/1.05 6 -big_i(A) | -big_h(A) | big_j(A) # label(clause_3) # label(axiom). [assumption].
% 0.43/1.05 7 -big_j(a) # label(clause_7) # label(negated_conjecture). [assumption].
% 0.43/1.05 8 big_h(a). [resolve(4,a,5,a)].
% 0.43/1.05 9 -big_h(a) | big_i(a). [resolve(3,a,2,a)].
% 0.43/1.05 10 -big_i(a) | -big_h(a). [resolve(6,c,7,a)].
% 0.43/1.05 11 -big_i(a). [resolve(10,b,8,a)].
% 0.43/1.05 12 big_i(a). [resolve(8,a,9,a)].
% 0.43/1.05 13 $F. [resolve(11,a,12,a)].
% 0.43/1.05
% 0.43/1.05 % SZS output end Refutation
% 0.43/1.05 ============================== end of proof ==========================
% 0.43/1.05
% 0.43/1.05 ============================== STATISTICS ============================
% 0.43/1.05
% 0.43/1.05 Given=0. Generated=1. Kept=0. proofs=1.
% 0.43/1.05 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=14. Hints=0.
% 0.43/1.05 Megabytes=0.02.
% 0.43/1.05 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/1.05
% 0.43/1.05 ============================== end of statistics =====================
% 0.43/1.05
% 0.43/1.05 ============================== end of search =========================
% 0.43/1.05
% 0.43/1.05 THEOREM PROVED
% 0.43/1.05 % SZS status Unsatisfiable
% 0.43/1.05
% 0.43/1.05 Exiting with 1 proof.
% 0.43/1.05
% 0.43/1.05 Process 32412 exit (max_proofs) Tue Jul 12 03:23:33 2022
% 0.43/1.05 Prover9 interrupted
%------------------------------------------------------------------------------