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