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