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