TSTP Solution File: SET788+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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 : Tue Jul 19 04:32:05 EDT 2022
% Result : Theorem 0.71s 1.00s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n010.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 06:31:45 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 307 was started by sandbox2 on n010.cluster.edu,
% 0.71/0.99 Mon Jul 11 06:31:46 2022
% 0.71/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32622_n010.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_32622_n010.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (1 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.00
% 0.71/1.00 % Formulas that are not ordinary clauses:
% 0.71/1.00 1 -((all X all Y (equalish(X,Y) <-> (all Z (a_member_of(Z,X) <-> a_member_of(Z,Y))))) -> (all X all Y (equalish(X,Y) <-> equalish(Y,X)))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/1.00
% 0.71/1.00 ============================== end of process non-clausal formulas ===
% 0.71/1.00
% 0.71/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.00
% 0.71/1.00 ============================== PREDICATE ELIMINATION =================
% 0.71/1.00
% 0.71/1.00 ============================== end predicate elimination =============
% 0.71/1.00
% 0.71/1.00 Auto_denials: (non-Horn, no changes).
% 0.71/1.00
% 0.71/1.00 Term ordering decisions:
% 0.71/1.00 Function symbol KB weights: c1=1. c2=1. f1=1.
% 0.71/1.00
% 0.71/1.00 ============================== end of process initial clauses ========
% 0.71/1.00
% 0.71/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.00
% 0.71/1.00 ============================== end of clauses for search =============
% 0.71/1.00
% 0.71/1.00 ============================== SEARCH ================================
% 0.71/1.00
% 0.71/1.00 % Starting search at 0.01 seconds.
% 0.71/1.00
% 0.71/1.00 ============================== PROOF =================================
% 0.71/1.00 % SZS status Theorem
% 0.71/1.00 % SZS output start Refutation
% 0.71/1.00
% 0.71/1.00 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.71/1.00 % Length of proof is 37.
% 0.71/1.00 % Level of proof is 22.
% 0.71/1.00 % Maximum clause weight is 30.000.
% 0.71/1.00 % Given clauses 33.
% 0.71/1.00
% 0.71/1.00 1 -((all X all Y (equalish(X,Y) <-> (all Z (a_member_of(Z,X) <-> a_member_of(Z,Y))))) -> (all X all Y (equalish(X,Y) <-> equalish(Y,X)))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/1.00 2 equalish(c1,c2) | equalish(c2,c1) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.71/1.00 3 equalish(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.71/1.00 4 -equalish(c1,c2) | -equalish(c2,c1) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.71/1.00 5 -equalish(A,B) | -a_member_of(C,A) | a_member_of(C,B) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.71/1.00 6 -equalish(A,B) | a_member_of(C,A) | -a_member_of(C,B) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.71/1.00 7 equalish(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.71/1.00 10 -equalish(c1,c2) | a_member_of(f1(c2,c1),c2) | a_member_of(f1(c2,c1),c1). [resolve(4,b,3,a)].
% 0.71/1.00 11 -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,3,a)].
% 0.71/1.00 12 -a_member_of(A,c2) | a_member_of(A,c1) | equalish(c1,c2). [resolve(5,a,2,b)].
% 0.71/1.00 13 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,3,a)].
% 0.71/1.00 14 a_member_of(A,c2) | -a_member_of(A,c1) | equalish(c1,c2). [resolve(6,a,2,b)].
% 0.71/1.00 15 a_member_of(f1(c2,c1),c2) | a_member_of(f1(c2,c1),c1) | a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2). [resolve(10,a,3,a)].
% 0.71/1.00 16 a_member_of(f1(c2,c1),c1) | a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2) | a_member_of(f1(c2,c1),A) | a_member_of(f1(A,c2),A) | a_member_of(f1(A,c2),c2). [resolve(15,a,13,b)].
% 0.71/1.00 17 a_member_of(f1(c2,c1),c1) | a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2). [factor(16,a,d),merge(d),merge(e)].
% 0.71/1.00 19 a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2) | a_member_of(f1(c2,c1),A) | a_member_of(f1(c1,A),c1) | a_member_of(f1(c1,A),A). [resolve(17,a,11,a)].
% 0.71/1.00 20 a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2) | equalish(c2,c1) | -a_member_of(f1(c2,c1),c2). [resolve(17,a,7,c)].
% 0.71/1.00 21 a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2) | a_member_of(f1(c2,c1),c2). [factor(19,a,d),merge(d)].
% 0.71/1.00 25 a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2) | equalish(c2,c1). [resolve(20,d,21,c),merge(d),merge(e)].
% 0.71/1.00 26 a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2) | -equalish(c1,c2). [resolve(25,c,4,b)].
% 0.71/1.00 45 a_member_of(f1(c1,c2),c1) | a_member_of(f1(c1,c2),c2). [resolve(26,c,3,a),merge(c),merge(d)].
% 0.71/1.00 47 a_member_of(f1(c1,c2),c1) | equalish(c1,c2). [resolve(45,b,12,a),merge(b)].
% 0.71/1.00 49 a_member_of(f1(c1,c2),c1) | a_member_of(A,c1) | -a_member_of(A,c2). [resolve(47,b,6,a)].
% 0.71/1.00 51 a_member_of(f1(c1,c2),c1) | -a_member_of(f1(c1,c2),c2). [factor(49,a,b)].
% 0.71/1.00 52 a_member_of(f1(c1,c2),c1). [resolve(51,b,45,b),merge(b)].
% 0.71/1.00 53 a_member_of(f1(c1,c2),c2) | equalish(c1,c2). [resolve(52,a,14,b)].
% 0.71/1.00 56 equalish(c1,c2) | -a_member_of(f1(c1,c2),c2). [resolve(52,a,7,b)].
% 0.71/1.00 58 a_member_of(f1(c1,c2),c2) | -a_member_of(A,c1) | a_member_of(A,c2). [resolve(53,b,5,a)].
% 0.71/1.00 59 a_member_of(f1(c1,c2),c2). [factor(58,a,c),unit_del(b,52)].
% 0.71/1.00 60 equalish(c1,c2). [back_unit_del(56),unit_del(b,59)].
% 0.71/1.00 61 a_member_of(f1(c2,c1),c2) | a_member_of(f1(c2,c1),c1). [back_unit_del(10),unit_del(a,60)].
% 0.71/1.00 62 -equalish(c2,c1). [back_unit_del(4),unit_del(a,60)].
% 0.71/1.00 63 a_member_of(A,c1) | -a_member_of(A,c2). [resolve(60,a,6,a)].
% 0.71/1.00 64 -a_member_of(A,c1) | a_member_of(A,c2). [resolve(60,a,5,a)].
% 0.71/1.00 74 a_member_of(f1(c2,c1),c1). [resolve(61,a,63,b),merge(b)].
% 0.71/1.00 75 a_member_of(f1(c2,c1),c2). [resolve(74,a,64,a)].
% 0.71/1.00 78 $F. [resolve(74,a,7,c),unit_del(a,62),unit_del(b,75)].
% 0.71/1.00
% 0.71/1.00 % SZS output end Refutation
% 0.71/1.00 ============================== end of proof ==========================
% 0.71/1.00
% 0.71/1.00 ============================== STATISTICS ============================
% 0.71/1.00
% 0.71/1.00 Given=33. Generated=289. Kept=76. proofs=1.
% 0.71/1.00 Usable=16. Sos=10. Demods=0. Limbo=3, Disabled=53. Hints=0.
% 0.71/1.00 Megabytes=0.08.
% 0.71/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.71/1.00
% 0.71/1.00 ============================== end of statistics =====================
% 0.71/1.00
% 0.71/1.00 ============================== end of search =========================
% 0.71/1.00
% 0.71/1.00 THEOREM PROVED
% 0.71/1.00 % SZS status Theorem
% 0.71/1.00
% 0.71/1.00 Exiting with 1 proof.
% 0.71/1.00
% 0.71/1.00 Process 307 exit (max_proofs) Mon Jul 11 06:31:46 2022
% 0.71/1.00 Prover9 interrupted
%------------------------------------------------------------------------------