TSTP Solution File: SYN082+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN082+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : Theorem 0.43s 1.04s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN082+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 19:57:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.04 ============================== Prover9 ===============================
% 0.43/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.04 Process 572 was started by sandbox2 on n020.cluster.edu,
% 0.43/1.04 Mon Jul 11 19:57:13 2022
% 0.43/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32641_n020.cluster.edu".
% 0.43/1.04 ============================== end of head ===========================
% 0.43/1.04
% 0.43/1.04 ============================== INPUT =================================
% 0.43/1.04
% 0.43/1.04 % Reading from file /tmp/Prover9_32641_n020.cluster.edu
% 0.43/1.04
% 0.43/1.04 set(prolog_style_variables).
% 0.43/1.04 set(auto2).
% 0.43/1.04 % set(auto2) -> set(auto).
% 0.43/1.04 % set(auto) -> set(auto_inference).
% 0.43/1.04 % set(auto) -> set(auto_setup).
% 0.43/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.04 % set(auto) -> set(auto_limits).
% 0.43/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.04 % set(auto) -> set(auto_denials).
% 0.43/1.04 % set(auto) -> set(auto_process).
% 0.43/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.04 % set(auto2) -> assign(stats, some).
% 0.43/1.04 % set(auto2) -> clear(echo_input).
% 0.43/1.04 % set(auto2) -> set(quiet).
% 0.43/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.04 % set(auto2) -> clear(print_given).
% 0.43/1.04 assign(lrs_ticks,-1).
% 0.43/1.04 assign(sos_limit,10000).
% 0.43/1.04 assign(order,kbo).
% 0.43/1.04 set(lex_order_vars).
% 0.43/1.04 clear(print_given).
% 0.43/1.04
% 0.43/1.04 % formulas(sos). % not echoed (1 formulas)
% 0.43/1.04
% 0.43/1.04 ============================== end of input ==========================
% 0.43/1.04
% 0.43/1.04 % From the command line: assign(max_seconds, 300).
% 0.43/1.04
% 0.43/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.04
% 0.43/1.04 % Formulas that are not ordinary clauses:
% 0.43/1.04 1 -(all X (big_f(X,f(X)) <-> (exists Y ((all Z (big_f(Z,Y) -> big_f(Z,f(X)))) & big_f(X,Y))))) # label(pel60) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.04
% 0.43/1.04 ============================== end of process non-clausal formulas ===
% 0.43/1.04
% 0.43/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.04
% 0.43/1.04 ============================== PREDICATE ELIMINATION =================
% 0.43/1.04
% 0.43/1.04 ============================== end predicate elimination =============
% 0.43/1.04
% 0.43/1.04 Auto_denials: (non-Horn, no changes).
% 0.43/1.04
% 0.43/1.04 Term ordering decisions:
% 0.43/1.04 Function symbol KB weights: c1=1. c2=1. f=1. f1=1.
% 0.43/1.04
% 0.43/1.04 ============================== end of process initial clauses ========
% 0.43/1.04
% 0.43/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.04
% 0.43/1.04 ============================== end of clauses for search =============
% 0.43/1.04
% 0.43/1.04 ============================== SEARCH ================================
% 0.43/1.04
% 0.43/1.04 % Starting search at 0.01 seconds.
% 0.43/1.04
% 0.43/1.04 ============================== PROOF =================================
% 0.43/1.04 % SZS status Theorem
% 0.43/1.04 % SZS output start Refutation
% 0.43/1.04
% 0.43/1.04 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/1.04 % Length of proof is 14.
% 0.43/1.04 % Level of proof is 8.
% 0.43/1.04 % Maximum clause weight is 12.000.
% 0.43/1.04 % Given clauses 10.
% 0.43/1.04
% 0.43/1.04 1 -(all X (big_f(X,f(X)) <-> (exists Y ((all Z (big_f(Z,Y) -> big_f(Z,f(X)))) & big_f(X,Y))))) # label(pel60) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.04 2 big_f(c1,f(c1)) | big_f(c1,c2) # label(pel60) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 3 -big_f(c1,f(c1)) | -big_f(f1(A),f(c1)) | -big_f(c1,A) # label(pel60) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 4 big_f(c1,f(c1)) | -big_f(A,c2) | big_f(A,f(c1)) # label(pel60) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 5 -big_f(c1,f(c1)) | big_f(f1(A),A) | -big_f(c1,A) # label(pel60) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 6 -big_f(c1,f(c1)) | -big_f(f1(f(c1)),f(c1)). [factor(3,a,c)].
% 0.43/1.04 7 big_f(c1,f(c1)) | -big_f(c1,c2). [factor(4,a,c)].
% 0.43/1.04 8 -big_f(c1,f(c1)) | big_f(f1(f(c1)),f(c1)). [factor(5,a,c)].
% 0.43/1.04 10 big_f(f1(f(c1)),f(c1)) | big_f(c1,c2). [resolve(8,a,2,a)].
% 0.43/1.04 11 big_f(c1,c2) | -big_f(c1,f(c1)). [resolve(10,a,6,b)].
% 0.43/1.04 12 big_f(c1,c2). [resolve(11,b,2,a),merge(b)].
% 0.43/1.04 13 big_f(c1,f(c1)). [back_unit_del(7),unit_del(b,12)].
% 0.43/1.04 14 big_f(f1(f(c1)),f(c1)). [back_unit_del(8),unit_del(a,13)].
% 0.43/1.04 15 $F. [back_unit_del(6),unit_del(a,13),unit_del(b,14)].
% 0.43/1.04
% 0.43/1.04 % SZS output end Refutation
% 0.43/1.04 ============================== end of proof ==========================
% 0.43/1.04
% 0.43/1.04 ============================== STATISTICS ============================
% 0.43/1.04
% 0.43/1.04 Given=10. Generated=17. Kept=13. proofs=1.
% 0.43/1.04 Usable=2. Sos=1. Demods=0. Limbo=2, Disabled=12. Hints=0.
% 0.43/1.04 Megabytes=0.03.
% 0.43/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/1.04
% 0.43/1.04 ============================== end of statistics =====================
% 0.43/1.04
% 0.43/1.04 ============================== end of search =========================
% 0.43/1.04
% 0.43/1.04 THEOREM PROVED
% 0.43/1.04 % SZS status Theorem
% 0.43/1.04
% 0.43/1.04 Exiting with 1 proof.
% 0.43/1.04
% 0.43/1.04 Process 572 exit (max_proofs) Mon Jul 11 19:57:13 2022
% 0.43/1.04 Prover9 interrupted
%------------------------------------------------------------------------------