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