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