TSTP Solution File: SYN077+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN077+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:16:11 EDT 2022
% Result : Theorem 0.75s 1.04s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN077+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 04:29:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.75/1.04 ============================== Prover9 ===============================
% 0.75/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.04 Process 10798 was started by sandbox2 on n008.cluster.edu,
% 0.75/1.04 Tue Jul 12 04:29:39 2022
% 0.75/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10644_n008.cluster.edu".
% 0.75/1.04 ============================== end of head ===========================
% 0.75/1.04
% 0.75/1.04 ============================== INPUT =================================
% 0.75/1.04
% 0.75/1.04 % Reading from file /tmp/Prover9_10644_n008.cluster.edu
% 0.75/1.04
% 0.75/1.04 set(prolog_style_variables).
% 0.75/1.04 set(auto2).
% 0.75/1.04 % set(auto2) -> set(auto).
% 0.75/1.04 % set(auto) -> set(auto_inference).
% 0.75/1.04 % set(auto) -> set(auto_setup).
% 0.75/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.04 % set(auto) -> set(auto_limits).
% 0.75/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.04 % set(auto) -> set(auto_denials).
% 0.75/1.04 % set(auto) -> set(auto_process).
% 0.75/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.04 % set(auto2) -> assign(stats, some).
% 0.75/1.04 % set(auto2) -> clear(echo_input).
% 0.75/1.04 % set(auto2) -> set(quiet).
% 0.75/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.04 % set(auto2) -> clear(print_given).
% 0.75/1.04 assign(lrs_ticks,-1).
% 0.75/1.04 assign(sos_limit,10000).
% 0.75/1.04 assign(order,kbo).
% 0.75/1.04 set(lex_order_vars).
% 0.75/1.04 clear(print_given).
% 0.75/1.04
% 0.75/1.04 % formulas(sos). % not echoed (2 formulas)
% 0.75/1.04
% 0.75/1.04 ============================== end of input ==========================
% 0.75/1.04
% 0.75/1.04 % From the command line: assign(max_seconds, 300).
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.04
% 0.75/1.04 % Formulas that are not ordinary clauses:
% 0.75/1.04 1 (all Y exists Z all X (big_f(X,Z) <-> X = Y)) # label(pel54_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 2 --(exists W all X (big_f(X,W) <-> (all U (big_f(X,U) -> (exists Y (big_f(Y,U) & -(exists Z (big_f(Z,U) & big_f(Z,Y))))))))) # label(pel54) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.04
% 0.75/1.04 ============================== end of process non-clausal formulas ===
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.04
% 0.75/1.04 ============================== PREDICATE ELIMINATION =================
% 0.75/1.04
% 0.75/1.04 ============================== end predicate elimination =============
% 0.75/1.04
% 0.75/1.04 Auto_denials: (non-Horn, no changes).
% 0.75/1.04
% 0.75/1.04 Term ordering decisions:
% 0.75/1.04 Function symbol KB weights: c1=1. f2=1. f4=1. f1=1. f3=1.
% 0.75/1.04
% 0.75/1.04 ============================== end of process initial clauses ========
% 0.75/1.04
% 0.75/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.04
% 0.75/1.04 ============================== end of clauses for search =============
% 0.75/1.04
% 0.75/1.04 ============================== SEARCH ================================
% 0.75/1.04
% 0.75/1.04 % Starting search at 0.01 seconds.
% 0.75/1.04
% 0.75/1.04 ============================== PROOF =================================
% 0.75/1.04 % SZS status Theorem
% 0.75/1.04 % SZS output start Refutation
% 0.75/1.04
% 0.75/1.04 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.75/1.04 % Length of proof is 24.
% 0.75/1.04 % Level of proof is 12.
% 0.75/1.04 % Maximum clause weight is 25.000.
% 0.75/1.04 % Given clauses 120.
% 0.75/1.04
% 0.75/1.04 1 (all Y exists Z all X (big_f(X,Z) <-> X = Y)) # label(pel54_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 2 --(exists W all X (big_f(X,W) <-> (all U (big_f(X,U) -> (exists Y (big_f(Y,U) & -(exists Z (big_f(Z,U) & big_f(Z,Y))))))))) # label(pel54) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.04 3 big_f(A,c1) | big_f(A,f3(A)) # label(pel54) # label(negated_conjecture). [clausify(2)].
% 0.75/1.04 4 -big_f(A,c1) | -big_f(A,B) | -big_f(C,B) | -big_f(C,f2(A,B)) # label(pel54) # label(negated_conjecture). [clausify(2)].
% 0.75/1.04 5 -big_f(A,f1(B)) | A = B # label(pel54_1) # label(axiom). [clausify(1)].
% 0.75/1.04 6 big_f(A,f1(B)) | A != B # label(pel54_1) # label(axiom). [clausify(1)].
% 0.75/1.04 7 -big_f(A,c1) | -big_f(A,B) | big_f(f2(A,B),B) # label(pel54) # label(negated_conjecture). [clausify(2)].
% 0.75/1.04 8 big_f(A,c1) | -big_f(B,f3(A)) | big_f(f4(A,B),B) # label(pel54) # label(negated_conjecture). [clausify(2)].
% 0.75/1.04 9 big_f(A,c1) | -big_f(B,f3(A)) | big_f(f4(A,B),f3(A)) # label(pel54) # label(negated_conjecture). [clausify(2)].
% 0.75/1.04 14 big_f(A,f1(A)). [xx_res(6,b)].
% 0.75/1.04 15 big_f(A,c1) | big_f(f4(A,A),A). [resolve(8,b,3,b),merge(c)].
% 0.75/1.04 16 big_f(A,c1) | big_f(f4(A,A),f3(A)). [resolve(9,b,3,b),merge(c)].
% 0.75/1.04 17 -big_f(A,c1) | big_f(f2(A,f1(A)),f1(A)). [resolve(14,a,7,b)].
% 0.75/1.04 22 big_f(c1,c1) | -big_f(f4(c1,c1),A) | big_f(f2(f4(c1,c1),A),A). [resolve(15,b,7,a)].
% 0.75/1.04 55 big_f(c1,c1) | big_f(f2(f4(c1,c1),f3(c1)),f3(c1)). [resolve(22,b,16,b),merge(c)].
% 0.75/1.04 56 big_f(c1,c1) | big_f(f4(c1,f2(f4(c1,c1),f3(c1))),f3(c1)). [resolve(55,b,9,b),merge(b)].
% 0.75/1.04 57 big_f(c1,c1) | big_f(f4(c1,f2(f4(c1,c1),f3(c1))),f2(f4(c1,c1),f3(c1))). [resolve(55,b,8,b),merge(b)].
% 0.75/1.04 100 big_f(c1,c1) | -big_f(f4(c1,c1),c1) | -big_f(f4(c1,c1),f3(c1)) | -big_f(f4(c1,f2(f4(c1,c1),f3(c1))),f3(c1)). [resolve(57,b,4,d)].
% 0.75/1.04 224 big_f(c1,c1) | -big_f(f4(c1,c1),c1) | -big_f(f4(c1,c1),f3(c1)). [resolve(100,d,56,b),merge(d)].
% 0.75/1.04 225 big_f(c1,c1) | -big_f(f4(c1,c1),c1). [resolve(224,c,16,b),merge(c)].
% 0.75/1.04 226 big_f(c1,c1). [resolve(225,b,15,b),merge(b)].
% 0.75/1.04 227 big_f(f2(c1,f1(c1)),f1(c1)). [resolve(226,a,17,a)].
% 0.75/1.04 240 f2(c1,f1(c1)) = c1. [resolve(227,a,5,a)].
% 0.75/1.04 241 $F. [ur(4,a,226,a,b,14,a,c,227,a),rewrite([240(4),240(5)]),unit_del(a,226)].
% 0.75/1.04
% 0.75/1.04 % SZS output end Refutation
% 0.75/1.04 ============================== end of proof ==========================
% 0.75/1.04
% 0.75/1.04 ============================== STATISTICS ============================
% 0.75/1.04
% 0.75/1.04 Given=120. Generated=375. Kept=238. proofs=1.
% 0.75/1.04 Usable=81. Sos=80. Demods=1. Limbo=2, Disabled=82. Hints=0.
% 0.75/1.04 Megabytes=0.42.
% 0.75/1.04 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.75/1.04
% 0.75/1.04 ============================== end of statistics =====================
% 0.75/1.04
% 0.75/1.04 ============================== end of search =========================
% 0.75/1.04
% 0.75/1.04 THEOREM PROVED
% 0.75/1.04 % SZS status Theorem
% 0.75/1.04
% 0.75/1.04 Exiting with 1 proof.
% 0.75/1.04
% 0.75/1.04 Process 10798 exit (max_proofs) Tue Jul 12 04:29:39 2022
% 0.75/1.04 Prover9 interrupted
%------------------------------------------------------------------------------