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