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