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