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