TSTP Solution File: SYN328-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN328-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:18:10 EDT 2022
% Result : Unsatisfiable 0.36s 1.03s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN328-1 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n006.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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 23:40:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.36/1.03 ============================== Prover9 ===============================
% 0.36/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.36/1.03 Process 18506 was started by sandbox2 on n006.cluster.edu,
% 0.36/1.03 Mon Jul 11 23:40:21 2022
% 0.36/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18130_n006.cluster.edu".
% 0.36/1.03 ============================== end of head ===========================
% 0.36/1.03
% 0.36/1.03 ============================== INPUT =================================
% 0.36/1.03
% 0.36/1.03 % Reading from file /tmp/Prover9_18130_n006.cluster.edu
% 0.36/1.03
% 0.36/1.03 set(prolog_style_variables).
% 0.36/1.03 set(auto2).
% 0.36/1.03 % set(auto2) -> set(auto).
% 0.36/1.03 % set(auto) -> set(auto_inference).
% 0.36/1.03 % set(auto) -> set(auto_setup).
% 0.36/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.36/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.36/1.03 % set(auto) -> set(auto_limits).
% 0.36/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.36/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.36/1.03 % set(auto) -> set(auto_denials).
% 0.36/1.03 % set(auto) -> set(auto_process).
% 0.36/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.36/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.36/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.36/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.36/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.36/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.36/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.36/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.36/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.36/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.36/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.36/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.36/1.03 % set(auto2) -> assign(stats, some).
% 0.36/1.03 % set(auto2) -> clear(echo_input).
% 0.36/1.03 % set(auto2) -> set(quiet).
% 0.36/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.36/1.03 % set(auto2) -> clear(print_given).
% 0.36/1.03 assign(lrs_ticks,-1).
% 0.36/1.03 assign(sos_limit,10000).
% 0.36/1.03 assign(order,kbo).
% 0.36/1.03 set(lex_order_vars).
% 0.36/1.03 clear(print_given).
% 0.36/1.03
% 0.36/1.03 % formulas(sos). % not echoed (11 formulas)
% 0.36/1.03
% 0.36/1.03 ============================== end of input ==========================
% 0.36/1.03
% 0.36/1.03 % From the command line: assign(max_seconds, 300).
% 0.36/1.03
% 0.36/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.36/1.03
% 0.36/1.03 % Formulas that are not ordinary clauses:
% 0.36/1.03
% 0.36/1.03 ============================== end of process non-clausal formulas ===
% 0.36/1.03
% 0.36/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.36/1.03
% 0.36/1.03 ============================== PREDICATE ELIMINATION =================
% 0.36/1.03 1 -f(z(A)) | -g(z(A)) | -h(z(A)) # label(clause11) # label(negated_conjecture). [assumption].
% 0.36/1.03 2 f(y(A)) | g(A) # label(clause5) # label(negated_conjecture). [assumption].
% 0.36/1.03 Derived: -f(z(A)) | -h(z(A)) | f(y(z(A))). [resolve(1,b,2,b)].
% 0.36/1.03 3 -g(y(A)) | f(A) # label(clause3) # label(negated_conjecture). [assumption].
% 0.36/1.03 Derived: f(A) | f(y(y(A))). [resolve(3,a,2,b)].
% 0.36/1.03 4 -h(y(A)) | g(A) # label(clause6) # label(negated_conjecture). [assumption].
% 0.36/1.03 Derived: -h(y(z(A))) | -f(z(A)) | -h(z(A)). [resolve(4,b,1,b)].
% 0.36/1.03 Derived: -h(y(y(A))) | f(A). [resolve(4,b,3,a)].
% 0.36/1.03 5 -f(y(A)) | g(y(A)) | -f(A) # label(clause1) # label(negated_conjecture). [assumption].
% 0.36/1.03 6 -f(y(A)) | h(y(A)) | -g(A) # label(clause4) # label(negated_conjecture). [assumption].
% 0.36/1.03 Derived: -f(y(y(A))) | h(y(y(A))) | -f(y(A)) | -f(A). [resolve(6,c,5,b)].
% 0.36/1.03 7 -g(y(A)) | h(y(A)) | -h(A) # label(clause8) # label(negated_conjecture). [assumption].
% 0.36/1.03 Derived: h(y(A)) | -h(A) | f(y(y(A))). [resolve(7,a,2,b)].
% 0.36/1.03 Derived: h(y(A)) | -h(A) | -h(y(y(A))). [resolve(7,a,4,b)].
% 0.36/1.03 Derived: h(y(A)) | -h(A) | -f(y(A)) | -f(A). [resolve(7,a,5,b)].
% 0.36/1.03 8 -f(y(A)) | g(y(A)) | h(A) # label(clause9) # label(negated_conjecture). [assumption].
% 0.36/1.03 Derived: -f(y(A)) | h(A) | f(A). [resolve(8,b,3,a)].
% 0.36/1.03 Derived: -f(y(A)) | h(A) | -f(y(y(A))) | h(y(y(A))). [resolve(8,b,6,c)].
% 0.36/1.03
% 0.36/1.03 ============================== end predicate elimination =============
% 0.36/1.03
% 0.36/1.03 Auto_denials: (non-Horn, no changes).
% 0.36/1.03
% 0.36/1.03 Term ordering decisions:
% 0.36/1.03 Function symbol KB weights: y=1. z=1.
% 0.36/1.03
% 0.36/1.03 ============================== end of process initial clauses ========
% 0.36/1.03
% 0.36/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.36/1.03
% 0.36/1.03 ============================== end of clauses for search =============
% 0.36/1.03
% 0.36/1.03 ============================== SEARCH ================================
% 0.36/1.03
% 0.36/1.03 % Starting search at 0.01 seconds.
% 0.36/1.03
% 0.36/1.03 ============================== PROOF =================================
% 0.36/1.03 % SZS status Unsatisfiable
% 0.36/1.03 % SZS output start Refutation
% 0.36/1.03
% 0.36/1.03 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.36/1.03 % Length of proof is 28.
% 0.36/1.03 % Level of proof is 13.
% 0.36/1.03 % Maximum clause weight is 14.000.
% 0.36/1.03 % Given clauses 40.
% 0.36/1.03
% 0.36/1.03 1 -f(z(A)) | -g(z(A)) | -h(z(A)) # label(clause11) # label(negated_conjecture). [assumption].
% 0.36/1.03 2 f(y(A)) | g(A) # label(clause5) # label(negated_conjecture). [assumption].
% 0.36/1.03 3 -g(y(A)) | f(A) # label(clause3) # label(negated_conjecture). [assumption].
% 0.36/1.03 4 -h(y(A)) | g(A) # label(clause6) # label(negated_conjecture). [assumption].
% 0.36/1.03 5 -f(y(A)) | g(y(A)) | -f(A) # label(clause1) # label(negated_conjecture). [assumption].
% 0.36/1.03 6 -f(y(A)) | h(y(A)) | -g(A) # label(clause4) # label(negated_conjecture). [assumption].
% 0.36/1.03 8 -f(y(A)) | g(y(A)) | h(A) # label(clause9) # label(negated_conjecture). [assumption].
% 0.36/1.03 9 f(y(A)) | f(A) # label(clause2) # label(negated_conjecture). [assumption].
% 0.36/1.03 10 -h(y(A)) | h(A) # label(clause10) # label(negated_conjecture). [assumption].
% 0.36/1.03 13 f(A) | f(y(y(A))). [resolve(3,a,2,b)].
% 0.36/1.03 14 -h(y(z(A))) | -f(z(A)) | -h(z(A)). [resolve(4,b,1,b)].
% 0.36/1.03 15 -h(y(y(A))) | f(A). [resolve(4,b,3,a)].
% 0.36/1.03 16 -f(y(y(A))) | h(y(y(A))) | -f(y(A)) | -f(A). [resolve(6,c,5,b)].
% 0.36/1.03 19 -f(y(A)) | h(A) | f(A). [resolve(8,b,3,a)].
% 0.36/1.03 21 h(A) | f(A). [resolve(19,a,9,a),merge(c)].
% 0.36/1.03 22 f(y(A)) | h(A). [resolve(21,a,10,a)].
% 0.36/1.03 23 f(y(y(y(A)))) | f(A). [resolve(22,b,15,a)].
% 0.36/1.03 31 f(A) | h(y(y(y(A)))) | -f(y(y(A))) | -f(y(A)). [resolve(23,a,16,a)].
% 0.36/1.03 57 f(A) | h(y(y(y(A)))) | -f(y(A)). [resolve(31,c,13,b),merge(d)].
% 0.36/1.03 58 f(A) | h(y(y(y(A)))). [resolve(57,c,9,a),merge(c)].
% 0.36/1.03 60 f(A) | h(y(y(A))). [resolve(58,b,10,a)].
% 0.36/1.03 61 f(A). [resolve(60,b,15,a),merge(b)].
% 0.36/1.03 64 h(y(y(A))). [back_unit_del(16),unit_del(a,61),unit_del(c,61),unit_del(d,61)].
% 0.36/1.03 65 -h(y(z(A))) | -h(z(A)). [back_unit_del(14),unit_del(b,61)].
% 0.36/1.03 66 h(y(A)). [resolve(64,a,10,a)].
% 0.36/1.03 67 -h(z(A)). [back_unit_del(65),unit_del(a,66)].
% 0.36/1.03 68 h(A). [back_unit_del(10),unit_del(a,66)].
% 0.36/1.03 69 $F. [resolve(68,a,67,a)].
% 0.36/1.03
% 0.36/1.03 % SZS output end Refutation
% 0.36/1.03 ============================== end of proof ==========================
% 0.36/1.03
% 0.36/1.03 ============================== STATISTICS ============================
% 0.36/1.03
% 0.36/1.03 Given=40. Generated=108. Kept=60. proofs=1.
% 0.36/1.03 Usable=1. Sos=0. Demods=0. Limbo=2, Disabled=77. Hints=0.
% 0.36/1.03 Megabytes=0.06.
% 0.36/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.36/1.03
% 0.36/1.03 ============================== end of statistics =====================
% 0.36/1.03
% 0.36/1.03 ============================== end of search =========================
% 0.36/1.03
% 0.36/1.03 THEOREM PROVED
% 0.36/1.03 % SZS status Unsatisfiable
% 0.36/1.03
% 0.36/1.03 Exiting with 1 proof.
% 0.36/1.03
% 0.36/1.03 Process 18506 exit (max_proofs) Mon Jul 11 23:40:21 2022
% 0.36/1.03 Prover9 interrupted
%------------------------------------------------------------------------------