TSTP Solution File: SYN334+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:15 EDT 2022
% Result : Theorem 0.47s 1.05s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 20:35:42 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.05 ============================== Prover9 ===============================
% 0.47/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.05 Process 26522 was started by sandbox on n026.cluster.edu,
% 0.47/1.05 Mon Jul 11 20:35:43 2022
% 0.47/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26369_n026.cluster.edu".
% 0.47/1.05 ============================== end of head ===========================
% 0.47/1.05
% 0.47/1.05 ============================== INPUT =================================
% 0.47/1.05
% 0.47/1.05 % Reading from file /tmp/Prover9_26369_n026.cluster.edu
% 0.47/1.05
% 0.47/1.05 set(prolog_style_variables).
% 0.47/1.05 set(auto2).
% 0.47/1.05 % set(auto2) -> set(auto).
% 0.47/1.05 % set(auto) -> set(auto_inference).
% 0.47/1.05 % set(auto) -> set(auto_setup).
% 0.47/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.05 % set(auto) -> set(auto_limits).
% 0.47/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.05 % set(auto) -> set(auto_denials).
% 0.47/1.05 % set(auto) -> set(auto_process).
% 0.47/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.05 % set(auto2) -> assign(stats, some).
% 0.47/1.05 % set(auto2) -> clear(echo_input).
% 0.47/1.05 % set(auto2) -> set(quiet).
% 0.47/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.05 % set(auto2) -> clear(print_given).
% 0.47/1.05 assign(lrs_ticks,-1).
% 0.47/1.05 assign(sos_limit,10000).
% 0.47/1.05 assign(order,kbo).
% 0.47/1.05 set(lex_order_vars).
% 0.47/1.05 clear(print_given).
% 0.47/1.05
% 0.47/1.05 % formulas(sos). % not echoed (1 formulas)
% 0.47/1.05
% 0.47/1.05 ============================== end of input ==========================
% 0.47/1.05
% 0.47/1.05 % From the command line: assign(max_seconds, 300).
% 0.47/1.05
% 0.47/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.05
% 0.47/1.05 % Formulas that are not ordinary clauses:
% 0.47/1.05 1 -(exists X exists Y all Z ((big_f(X,Y) -> (big_f(X,Z) <-> big_g(Y,Z))) -> ((big_f(X,Y) <-> (big_f(Z,Z) -> big_g(Z,Z))) -> (big_g(X,Y) <-> big_g(Z,Z))))) # label(church_46_14_6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.05
% 0.47/1.05 ============================== end of process non-clausal formulas ===
% 0.47/1.05
% 0.47/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.05
% 0.47/1.05 ============================== PREDICATE ELIMINATION =================
% 0.47/1.05
% 0.47/1.05 ============================== end predicate elimination =============
% 0.47/1.05
% 0.47/1.05 Auto_denials: (non-Horn, no changes).
% 0.47/1.05
% 0.47/1.05 Term ordering decisions:
% 0.47/1.05 Function symbol KB weights: f1=1.
% 0.47/1.05
% 0.47/1.05 ============================== end of process initial clauses ========
% 0.47/1.05
% 0.47/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.05
% 0.47/1.05 ============================== end of clauses for search =============
% 0.47/1.05
% 0.47/1.05 ============================== SEARCH ================================
% 0.47/1.05
% 0.47/1.05 % Starting search at 0.01 seconds.
% 0.47/1.05
% 0.47/1.05 ============================== PROOF =================================
% 0.47/1.05 % SZS status Theorem
% 0.47/1.05 % SZS output start Refutation
% 0.47/1.05
% 0.47/1.05 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.47/1.05 % Length of proof is 24.
% 0.47/1.05 % Level of proof is 15.
% 0.47/1.05 % Maximum clause weight is 37.000.
% 0.47/1.05 % Given clauses 24.
% 0.47/1.05
% 0.47/1.05 1 -(exists X exists Y all Z ((big_f(X,Y) -> (big_f(X,Z) <-> big_g(Y,Z))) -> ((big_f(X,Y) <-> (big_f(Z,Z) -> big_g(Z,Z))) -> (big_g(X,Y) <-> big_g(Z,Z))))) # label(church_46_14_6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.05 2 big_f(A,B) | big_f(f1(A,B),f1(A,B)) # label(church_46_14_6) # label(negated_conjecture). [clausify(1)].
% 0.47/1.05 3 big_g(A,B) | big_g(f1(A,B),f1(A,B)) # label(church_46_14_6) # label(negated_conjecture). [clausify(1)].
% 0.47/1.05 4 -big_g(A,B) | -big_g(f1(A,B),f1(A,B)) # label(church_46_14_6) # label(negated_conjecture). [clausify(1)].
% 0.47/1.05 5 big_f(A,B) | -big_g(f1(A,B),f1(A,B)) # label(church_46_14_6) # label(negated_conjecture). [clausify(1)].
% 0.47/1.05 6 -big_f(A,B) | -big_f(A,f1(A,B)) | big_g(B,f1(A,B)) # label(church_46_14_6) # label(negated_conjecture). [clausify(1)].
% 0.47/1.05 7 -big_f(A,B) | big_f(A,f1(A,B)) | -big_g(B,f1(A,B)) # label(church_46_14_6) # label(negated_conjecture). [clausify(1)].
% 0.47/1.05 8 -big_f(A,B) | -big_f(f1(A,B),f1(A,B)) | big_g(f1(A,B),f1(A,B)) # label(church_46_14_6) # label(negated_conjecture). [clausify(1)].
% 0.47/1.05 9 big_f(A,B) | big_g(A,B). [resolve(5,b,3,b)].
% 0.47/1.05 10 big_f(A,f1(B,A)) | -big_f(B,A) | big_f(B,f1(B,A)). [resolve(9,b,7,c)].
% 0.47/1.05 11 big_f(f1(A,B),f1(A,B)) | -big_g(A,B). [resolve(9,b,4,b)].
% 0.47/1.05 12 big_f(A,f1(A,A)) | -big_f(A,A). [factor(10,a,c)].
% 0.47/1.05 13 big_f(f1(A,B),f1(f1(A,B),f1(A,B))) | big_f(A,B). [resolve(12,b,2,b)].
% 0.47/1.05 16 big_f(A,B) | -big_f(f1(A,B),f1(A,B)) | big_g(f1(A,B),f1(f1(A,B),f1(A,B))). [resolve(13,a,6,b)].
% 0.47/1.05 20 big_f(A,B) | big_g(f1(A,B),f1(f1(A,B),f1(A,B))). [resolve(16,b,2,b),merge(c)].
% 0.47/1.05 21 big_f(A,B) | big_f(f1(f1(A,B),f1(f1(A,B),f1(A,B))),f1(f1(A,B),f1(f1(A,B),f1(A,B)))). [resolve(20,b,11,b)].
% 0.47/1.05 23 big_f(A,B) | -big_f(f1(A,B),f1(f1(A,B),f1(A,B))) | big_g(f1(f1(A,B),f1(f1(A,B),f1(A,B))),f1(f1(A,B),f1(f1(A,B),f1(A,B)))). [resolve(21,b,8,b)].
% 0.47/1.05 31 big_f(A,B) | big_g(f1(f1(A,B),f1(f1(A,B),f1(A,B))),f1(f1(A,B),f1(f1(A,B),f1(A,B)))). [resolve(23,b,13,a),merge(c)].
% 0.47/1.05 34 big_f(A,B) | -big_g(f1(A,B),f1(f1(A,B),f1(A,B))). [resolve(31,b,4,b)].
% 0.47/1.05 37 big_f(A,B). [resolve(34,b,20,b),merge(b)].
% 0.47/1.05 38 big_g(f1(A,B),f1(A,B)). [back_unit_del(8),unit_del(a,37),unit_del(b,37)].
% 0.47/1.05 39 big_g(A,f1(B,A)). [back_unit_del(6),unit_del(a,37),unit_del(b,37)].
% 0.47/1.05 40 -big_g(A,B). [back_unit_del(4),unit_del(b,38)].
% 0.47/1.05 41 $F. [resolve(40,a,39,a)].
% 0.47/1.05
% 0.47/1.05 % SZS output end Refutation
% 0.47/1.05 ============================== end of proof ==========================
% 0.47/1.05
% 0.47/1.05 ============================== STATISTICS ============================
% 0.47/1.05
% 0.47/1.05 Given=24. Generated=57. Kept=39. proofs=1.
% 0.47/1.05 Usable=0. Sos=1. Demods=0. Limbo=2, Disabled=42. Hints=0.
% 0.47/1.05 Megabytes=0.11.
% 0.47/1.05 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.47/1.05
% 0.47/1.05 ============================== end of statistics =====================
% 0.47/1.05
% 0.47/1.05 ============================== end of search =========================
% 0.47/1.05
% 0.47/1.05 THEOREM PROVED
% 0.47/1.05 % SZS status Theorem
% 0.47/1.05
% 0.47/1.05 Exiting with 1 proof.
% 0.47/1.05
% 0.47/1.05 Process 26522 exit (max_proofs) Mon Jul 11 20:35:43 2022
% 0.47/1.05 Prover9 interrupted
%------------------------------------------------------------------------------