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