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