TSTP Solution File: SYN346+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN346+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:25 EDT 2022
% Result : Theorem 0.42s 0.97s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN346+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n003.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 : Tue Jul 12 01:23:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.97 ============================== Prover9 ===============================
% 0.42/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.97 Process 27502 was started by sandbox on n003.cluster.edu,
% 0.42/0.97 Tue Jul 12 01:23:46 2022
% 0.42/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27341_n003.cluster.edu".
% 0.42/0.97 ============================== end of head ===========================
% 0.42/0.97
% 0.42/0.97 ============================== INPUT =================================
% 0.42/0.97
% 0.42/0.97 % Reading from file /tmp/Prover9_27341_n003.cluster.edu
% 0.42/0.97
% 0.42/0.97 set(prolog_style_variables).
% 0.42/0.97 set(auto2).
% 0.42/0.97 % set(auto2) -> set(auto).
% 0.42/0.97 % set(auto) -> set(auto_inference).
% 0.42/0.97 % set(auto) -> set(auto_setup).
% 0.42/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.97 % set(auto) -> set(auto_limits).
% 0.42/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.97 % set(auto) -> set(auto_denials).
% 0.42/0.97 % set(auto) -> set(auto_process).
% 0.42/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.97 % set(auto2) -> assign(stats, some).
% 0.42/0.97 % set(auto2) -> clear(echo_input).
% 0.42/0.97 % set(auto2) -> set(quiet).
% 0.42/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.97 % set(auto2) -> clear(print_given).
% 0.42/0.97 assign(lrs_ticks,-1).
% 0.42/0.97 assign(sos_limit,10000).
% 0.42/0.97 assign(order,kbo).
% 0.42/0.97 set(lex_order_vars).
% 0.42/0.97 clear(print_given).
% 0.42/0.97
% 0.42/0.97 % formulas(sos). % not echoed (1 formulas)
% 0.42/0.97
% 0.42/0.97 ============================== end of input ==========================
% 0.42/0.97
% 0.42/0.97 % From the command line: assign(max_seconds, 300).
% 0.42/0.97
% 0.42/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.97
% 0.42/0.97 % Formulas that are not ordinary clauses:
% 0.42/0.97 1 -(all X1 all X2 exists Y1 exists Y2 all Z1 all Z2 (big_f(X2,Z1) -> (big_f(Y1,Z2) -> big_f(Y1,Z1) & big_f(Y2,Z1) | big_f(X2,Z2) & big_f(Y2,Z2)))) # label(church_46_17_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.97
% 0.42/0.97 ============================== end of process non-clausal formulas ===
% 0.42/0.97
% 0.42/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.97
% 0.42/0.97 ============================== PREDICATE ELIMINATION =================
% 0.42/0.97
% 0.42/0.97 ============================== end predicate elimination =============
% 0.42/0.97
% 0.42/0.97 Auto_denials:
% 0.42/0.97 % copying label church_46_17_2 to answer in negative clause
% 0.42/0.97 % copying label church_46_17_2 to answer in negative clause
% 0.42/0.97 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.42/0.97
% 0.42/0.97 Term ordering decisions:
% 0.42/0.97 Function symbol KB weights: c2=1. f1=1. f2=1.
% 0.42/0.97
% 0.42/0.97 ============================== end of process initial clauses ========
% 0.42/0.97
% 0.42/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.97
% 0.42/0.97 ============================== end of clauses for search =============
% 0.42/0.97
% 0.42/0.97 ============================== SEARCH ================================
% 0.42/0.97
% 0.42/0.97 % Starting search at 0.01 seconds.
% 0.42/0.97
% 0.42/0.97 ============================== PROOF =================================
% 0.42/0.97 % SZS status Theorem
% 0.42/0.97 % SZS output start Refutation
% 0.42/0.97
% 0.42/0.97 % Proof 1 at 0.01 (+ 0.00) seconds: church_46_17_2.
% 0.42/0.97 % Length of proof is 5.
% 0.42/0.97 % Level of proof is 3.
% 0.42/0.97 % Maximum clause weight is 10.000.
% 0.42/0.97 % Given clauses 3.
% 0.42/0.97
% 0.42/0.97 1 -(all X1 all X2 exists Y1 exists Y2 all Z1 all Z2 (big_f(X2,Z1) -> (big_f(Y1,Z2) -> big_f(Y1,Z1) & big_f(Y2,Z1) | big_f(X2,Z2) & big_f(Y2,Z2)))) # label(church_46_17_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.97 2 big_f(c2,f1(A,B)) # label(church_46_17_2) # label(negated_conjecture). [clausify(1)].
% 0.42/0.97 4 -big_f(A,f1(A,B)) | -big_f(B,f1(A,B)) # label(church_46_17_2) # label(negated_conjecture) # answer(church_46_17_2). [clausify(1)].
% 0.42/0.97 6 -big_f(A,f1(c2,A)) # answer(church_46_17_2). [resolve(4,a,2,a)].
% 0.42/0.97 7 $F # answer(church_46_17_2). [resolve(6,a,2,a)].
% 0.42/0.97
% 0.42/0.97 % SZS output end Refutation
% 0.42/0.97 ============================== end of proof ==========================
% 0.42/0.97 % Redundant proof: 9 $F # answer(church_46_17_2). [resolve(8,a,2,a)].
% 0.42/0.97
% 0.42/0.97 % Disable descendants (x means already disabled):
% 0.42/0.97 4 6 8
% 0.42/0.97
% 0.42/0.97 ============================== PROOF =================================
% 0.42/0.97 % SZS status Theorem
% 0.42/0.97 % SZS output start Refutation
% 0.42/0.97
% 0.42/0.97 % Proof 2 at 0.01 (+ 0.00) seconds: church_46_17_2.
% 0.42/0.97 % Length of proof is 5.
% 0.42/0.97 % Level of proof is 3.
% 0.42/0.97 % Maximum clause weight is 10.000.
% 0.42/0.97 % Given clauses 4.
% 0.42/0.97
% 0.42/0.97 1 -(all X1 all X2 exists Y1 exists Y2 all Z1 all Z2 (big_f(X2,Z1) -> (big_f(Y1,Z2) -> big_f(Y1,Z1) & big_f(Y2,Z1) | big_f(X2,Z2) & big_f(Y2,Z2)))) # label(church_46_17_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.97 3 big_f(A,f2(A,B)) # label(church_46_17_2) # label(negated_conjecture). [clausify(1)].
% 0.42/0.97 5 -big_f(c2,f2(A,B)) | -big_f(B,f2(A,B)) # label(church_46_17_2) # label(negated_conjecture) # answer(church_46_17_2). [clausify(1)].
% 0.42/0.97 10 -big_f(A,f2(c2,A)) # answer(church_46_17_2). [resolve(5,a,3,a)].
% 0.42/0.97 11 $F # answer(church_46_17_2). [resolve(10,a,3,a)].
% 0.42/0.97
% 0.42/0.97 % SZS output end Refutation
% 0.42/0.97 ============================== end of proof ==========================
% 0.42/0.97
% 0.42/0.97 ============================== STATISTICS ============================
% 0.42/0.97
% 0.42/0.97 Given=4. Generated=9. Kept=7. proofs=2.
% 0.42/0.97 Usable=3. Sos=0. Demods=0. Limbo=0, Disabled=7. Hints=0.
% 0.42/0.97 Megabytes=0.03.
% 0.42/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/0.97
% 0.42/0.97 ============================== end of statistics =====================
% 0.42/0.97
% 0.42/0.97 ============================== end of search =========================
% 0.42/0.97
% 0.42/0.97 THEOREM PROVED
% 0.42/0.97 % SZS status Theorem
% 0.42/0.97
% 0.42/0.97 Exiting with 2 proofs.
% 0.42/0.97
% 0.42/0.97 Process 27502 exit (max_proofs) Tue Jul 12 01:23:46 2022
% 0.42/0.97 Prover9 interrupted
%------------------------------------------------------------------------------