TSTP Solution File: SYN074-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN074-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:08 EDT 2022
% Result : Unsatisfiable 0.69s 1.00s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN074-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n026.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 : Tue Jul 12 06:05:42 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.69/1.00 ============================== Prover9 ===============================
% 0.69/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.00 Process 25155 was started by sandbox2 on n026.cluster.edu,
% 0.69/1.00 Tue Jul 12 06:05:43 2022
% 0.69/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25002_n026.cluster.edu".
% 0.69/1.00 ============================== end of head ===========================
% 0.69/1.00
% 0.69/1.00 ============================== INPUT =================================
% 0.69/1.00
% 0.69/1.00 % Reading from file /tmp/Prover9_25002_n026.cluster.edu
% 0.69/1.00
% 0.69/1.00 set(prolog_style_variables).
% 0.69/1.00 set(auto2).
% 0.69/1.00 % set(auto2) -> set(auto).
% 0.69/1.00 % set(auto) -> set(auto_inference).
% 0.69/1.00 % set(auto) -> set(auto_setup).
% 0.69/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.69/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.00 % set(auto) -> set(auto_limits).
% 0.69/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.00 % set(auto) -> set(auto_denials).
% 0.69/1.00 % set(auto) -> set(auto_process).
% 0.69/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.69/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.69/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.69/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.69/1.00 % set(auto2) -> assign(stats, some).
% 0.69/1.00 % set(auto2) -> clear(echo_input).
% 0.69/1.00 % set(auto2) -> set(quiet).
% 0.69/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.00 % set(auto2) -> clear(print_given).
% 0.69/1.00 assign(lrs_ticks,-1).
% 0.69/1.00 assign(sos_limit,10000).
% 0.69/1.00 assign(order,kbo).
% 0.69/1.00 set(lex_order_vars).
% 0.69/1.00 clear(print_given).
% 0.69/1.00
% 0.69/1.00 % formulas(sos). % not echoed (11 formulas)
% 0.69/1.00
% 0.69/1.00 ============================== end of input ==========================
% 0.69/1.00
% 0.69/1.00 % From the command line: assign(max_seconds, 300).
% 0.69/1.00
% 0.69/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.00
% 0.69/1.00 % Formulas that are not ordinary clauses:
% 0.69/1.00
% 0.69/1.00 ============================== end of process non-clausal formulas ===
% 0.69/1.00
% 0.69/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.00
% 0.69/1.00 ============================== PREDICATE ELIMINATION =================
% 0.69/1.00
% 0.69/1.00 ============================== end predicate elimination =============
% 0.69/1.00
% 0.69/1.00 Auto_denials: (non-Horn, no changes).
% 0.69/1.00
% 0.69/1.00 Term ordering decisions:
% 0.69/1.00 Function symbol KB weights: a=1. b=1. h=1. f=1. g=1.
% 0.69/1.00
% 0.69/1.00 ============================== end of process initial clauses ========
% 0.69/1.00
% 0.69/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.00
% 0.69/1.00 ============================== end of clauses for search =============
% 0.69/1.00
% 0.69/1.00 ============================== SEARCH ================================
% 0.69/1.00
% 0.69/1.00 % Starting search at 0.01 seconds.
% 0.69/1.00
% 0.69/1.00 ============================== PROOF =================================
% 0.69/1.00 % SZS status Unsatisfiable
% 0.69/1.00 % SZS output start Refutation
% 0.69/1.00
% 0.69/1.00 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.69/1.00 % Length of proof is 20.
% 0.69/1.00 % Level of proof is 8.
% 0.69/1.00 % Maximum clause weight is 15.000.
% 0.69/1.00 % Given clauses 26.
% 0.69/1.00
% 0.69/1.00 1 f(A) != A | h(A,B) != B | -big_f(f(A),h(A,B)) # label(clause_11) # label(negated_conjecture). [assumption].
% 0.69/1.00 2 -big_f(A,B) | A = a # label(clause_1) # label(axiom). [assumption].
% 0.69/1.00 3 -big_f(A,B) | a = A. [copy(2),flip(b)].
% 0.69/1.00 4 -big_f(A,B) | B = b # label(clause_2) # label(axiom). [assumption].
% 0.69/1.00 5 -big_f(A,B) | b = B. [copy(4),flip(b)].
% 0.69/1.00 6 A != a | B != b | big_f(A,B) # label(clause_3) # label(axiom). [assumption].
% 0.69/1.00 7 a != A | b != B | big_f(A,B). [copy(6),flip(a),flip(b)].
% 0.69/1.00 10 A != g(B) | big_f(f(B),A) | f(B) = B # label(clause_8) # label(negated_conjecture). [assumption].
% 0.69/1.00 11 g(A) != B | big_f(f(A),B) | f(A) = A. [copy(10),flip(a)].
% 0.69/1.00 12 f(A) != A | big_f(f(A),h(A,B)) | h(A,B) = B # label(clause_10) # label(negated_conjecture). [assumption].
% 0.69/1.00 23 b != A | big_f(a,A). [xx_res(7,a)].
% 0.69/1.00 25 big_f(f(A),g(A)) | f(A) = A. [xx_res(11,a)].
% 0.69/1.00 27 big_f(a,b). [xx_res(23,a)].
% 0.69/1.00 29 f(A) = A | f(A) = a. [resolve(25,a,3,a),flip(b)].
% 0.69/1.00 30 f(a) = a. [factor(29,a,b)].
% 0.69/1.00 31 big_f(a,h(a,A)) | h(a,A) = A. [resolve(30,a,12,a),rewrite([30(2)])].
% 0.69/1.00 32 h(a,A) != A | -big_f(a,h(a,A)). [para(30(a,1),1(c,1)),rewrite([30(2)]),xx(a)].
% 0.69/1.00 57 h(a,A) = A | h(a,A) = b. [resolve(31,a,5,a),flip(b)].
% 0.69/1.00 58 h(a,b) = b. [factor(57,a,b)].
% 0.69/1.00 59 $F. [ur(32,a,58,a),rewrite([58(4)]),unit_del(a,27)].
% 0.69/1.00
% 0.69/1.00 % SZS output end Refutation
% 0.69/1.00 ============================== end of proof ==========================
% 0.69/1.00
% 0.69/1.00 ============================== STATISTICS ============================
% 0.69/1.00
% 0.69/1.00 Given=26. Generated=115. Kept=49. proofs=1.
% 0.69/1.00 Usable=26. Sos=22. Demods=2. Limbo=0, Disabled=12. Hints=0.
% 0.69/1.00 Megabytes=0.07.
% 0.69/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.69/1.00
% 0.69/1.00 ============================== end of statistics =====================
% 0.69/1.00
% 0.69/1.00 ============================== end of search =========================
% 0.69/1.00
% 0.69/1.00 THEOREM PROVED
% 0.69/1.00 % SZS status Unsatisfiable
% 0.69/1.00
% 0.69/1.00 Exiting with 1 proof.
% 0.69/1.00
% 0.69/1.00 Process 25155 exit (max_proofs) Tue Jul 12 06:05:43 2022
% 0.69/1.00 Prover9 interrupted
%------------------------------------------------------------------------------