TSTP Solution File: SYN075+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN075+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:16:09 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.03/0.11 % Problem : SYN075+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n018.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 05:36:14 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 20695 was started by sandbox2 on n018.cluster.edu,
% 0.42/0.97 Tue Jul 12 05:36:15 2022
% 0.42/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20542_n018.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_20542_n018.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 (2 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 (exists Z exists W all X all Y (big_f(X,Y) <-> X = Z & Y = W)) # label(pel52_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 2 -(exists W all Y ((exists Z all X (big_f(X,Y) <-> X = Z)) <-> Y = W)) # label(pel52) # 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: (non-Horn, no changes).
% 0.42/0.97
% 0.42/0.97 Term ordering decisions:
% 0.42/0.97 Function symbol KB weights: c1=1. c2=1. f3=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.
% 0.42/0.97 % Length of proof is 22.
% 0.42/0.97 % Level of proof is 9.
% 0.42/0.97 % Maximum clause weight is 15.000.
% 0.42/0.97 % Given clauses 20.
% 0.42/0.97
% 0.42/0.97 1 (exists Z exists W all X all Y (big_f(X,Y) <-> X = Z & Y = W)) # label(pel52_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.97 2 -(exists W all Y ((exists Z all X (big_f(X,Y) <-> X = Z)) <-> Y = W)) # label(pel52) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.97 3 -big_f(f3(A,B),f1(A)) | f3(A,B) != B | f1(A) != A # label(pel52) # label(negated_conjecture). [clausify(2)].
% 0.42/0.97 4 -big_f(A,B) | A = c1 # label(pel52_1) # label(axiom). [clausify(1)].
% 0.42/0.97 5 -big_f(A,B) | c1 = A. [copy(4),flip(b)].
% 0.42/0.97 6 -big_f(A,B) | B = c2 # label(pel52_1) # label(axiom). [clausify(1)].
% 0.42/0.97 7 -big_f(A,B) | c2 = B. [copy(6),flip(b)].
% 0.42/0.97 8 big_f(A,B) | A != c1 | B != c2 # label(pel52_1) # label(axiom). [clausify(1)].
% 0.42/0.97 9 big_f(A,B) | c1 != A | c2 != B. [copy(8),flip(b),flip(c)].
% 0.42/0.97 12 big_f(A,f1(B)) | A != f2(B) | f1(B) = B # label(pel52) # label(negated_conjecture). [clausify(2)].
% 0.42/0.97 13 big_f(A,f1(B)) | f2(B) != A | f1(B) = B. [copy(12),flip(b)].
% 0.42/0.97 14 big_f(f3(A,B),f1(A)) | f3(A,B) = B | f1(A) != A # label(pel52) # label(negated_conjecture). [clausify(2)].
% 0.42/0.97 15 big_f(c1,A) | c2 != A. [xx_res(9,b)].
% 0.42/0.97 17 big_f(f2(A),f1(A)) | f1(A) = A. [xx_res(13,b)].
% 0.42/0.97 18 big_f(c1,c2). [xx_res(15,b)].
% 0.42/0.97 19 f1(A) = A | f1(A) = c2. [resolve(17,a,7,a),flip(b)].
% 0.42/0.97 21 f1(c2) = c2. [factor(19,a,b)].
% 0.42/0.97 22 big_f(f3(c2,A),c2) | f3(c2,A) = A. [resolve(21,a,14,c),rewrite([21(4)])].
% 0.42/0.97 23 -big_f(f3(c2,A),c2) | f3(c2,A) != A. [para(21(a,1),3(a,2)),rewrite([21(9)]),xx(c)].
% 0.42/0.97 35 f3(c2,A) = A | f3(c2,A) = c1. [resolve(22,a,5,a),flip(b)].
% 0.42/0.97 36 f3(c2,c1) = c1. [factor(35,a,b)].
% 0.42/0.97 37 $F. [ur(23,b,36,a),rewrite([36(3)]),unit_del(a,18)].
% 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=20. Generated=75. Kept=29. proofs=1.
% 0.42/0.97 Usable=20. Sos=9. Demods=2. Limbo=0, Disabled=7. Hints=0.
% 0.42/0.97 Megabytes=0.05.
% 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 1 proof.
% 0.42/0.97
% 0.42/0.97 Process 20695 exit (max_proofs) Tue Jul 12 05:36:15 2022
% 0.42/0.97 Prover9 interrupted
%------------------------------------------------------------------------------