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