TSTP Solution File: SEU247+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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 13:30:20 EDT 2022
% Result : Theorem 0.44s 0.97s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n012.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 Jun 19 18:16:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.97 ============================== Prover9 ===============================
% 0.44/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.97 Process 7864 was started by sandbox on n012.cluster.edu,
% 0.44/0.97 Sun Jun 19 18:16:38 2022
% 0.44/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7710_n012.cluster.edu".
% 0.44/0.97 ============================== end of head ===========================
% 0.44/0.97
% 0.44/0.97 ============================== INPUT =================================
% 0.44/0.97
% 0.44/0.97 % Reading from file /tmp/Prover9_7710_n012.cluster.edu
% 0.44/0.97
% 0.44/0.97 set(prolog_style_variables).
% 0.44/0.97 set(auto2).
% 0.44/0.97 % set(auto2) -> set(auto).
% 0.44/0.97 % set(auto) -> set(auto_inference).
% 0.44/0.97 % set(auto) -> set(auto_setup).
% 0.44/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.97 % set(auto) -> set(auto_limits).
% 0.44/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.97 % set(auto) -> set(auto_denials).
% 0.44/0.97 % set(auto) -> set(auto_process).
% 0.44/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.97 % set(auto2) -> assign(stats, some).
% 0.44/0.97 % set(auto2) -> clear(echo_input).
% 0.44/0.97 % set(auto2) -> set(quiet).
% 0.44/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.97 % set(auto2) -> clear(print_given).
% 0.44/0.97 assign(lrs_ticks,-1).
% 0.44/0.97 assign(sos_limit,10000).
% 0.44/0.97 assign(order,kbo).
% 0.44/0.97 set(lex_order_vars).
% 0.44/0.97 clear(print_given).
% 0.44/0.97
% 0.44/0.97 % formulas(sos). % not echoed (11 formulas)
% 0.44/0.97
% 0.44/0.97 ============================== end of input ==========================
% 0.44/0.97
% 0.44/0.97 % From the command line: assign(max_seconds, 300).
% 0.44/0.97
% 0.44/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.97
% 0.44/0.97 % Formulas that are not ordinary clauses:
% 0.44/0.97 1 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 2 (all A (relation(A) -> (all B relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B))))) # label(d6_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 3 (all A all B (relation(A) -> relation(relation_restriction(A,B)))) # label(dt_k2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 4 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 5 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 6 (all A all B (relation(A) -> relation(relation_dom_restriction(A,B)))) # label(dt_k7_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 7 (all A all B (relation(B) -> relation(relation_rng_restriction(A,B)))) # label(dt_k8_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 8 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 9 (all A all B all C (relation(C) -> relation_dom_restriction(relation_rng_restriction(A,C),B) = relation_rng_restriction(A,relation_dom_restriction(C,B)))) # label(t140_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 10 (all A all B (relation(B) -> relation_restriction(B,A) = relation_dom_restriction(relation_rng_restriction(A,B),A))) # label(t17_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 11 -(all A all B (relation(B) -> relation_restriction(B,A) = relation_rng_restriction(A,relation_dom_restriction(B,A)))) # label(t18_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.97
% 0.44/0.97 ============================== end of process non-clausal formulas ===
% 0.44/0.97
% 0.44/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.97
% 0.44/0.97 ============================== PREDICATE ELIMINATION =================
% 0.44/0.97
% 0.44/0.97 ============================== end predicate elimination =============
% 0.44/0.97
% 0.44/0.97 Auto_denials:
% 0.44/0.97 % copying label t18_wellord1 to answer in negative clause
% 0.44/0.97
% 0.44/0.97 Term ordering decisions:
% 0.44/0.97 Function symbol KB weights: c1=1. c2=1. relation_dom_restriction=1. relation_rng_restriction=1. set_intersection2=1. relation_restriction=1. cartesian_product2=1.
% 0.44/0.97
% 0.44/0.97 ============================== end of process initial clauses ========
% 0.44/0.97
% 0.44/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.97
% 0.44/0.97 ============================== end of clauses for search =============
% 0.44/0.97
% 0.44/0.97 ============================== SEARCH ================================
% 0.44/0.97
% 0.44/0.97 % Starting search at 0.01 seconds.
% 0.44/0.97
% 0.44/0.97 ============================== PROOF =================================
% 0.44/0.97 % SZS status Theorem
% 0.44/0.97 % SZS output start Refutation
% 0.44/0.97
% 0.44/0.97 % Proof 1 at 0.01 (+ 0.00) seconds: t18_wellord1.
% 0.44/0.97 % Length of proof is 10.
% 0.44/0.97 % Level of proof is 3.
% 0.44/0.97 % Maximum clause weight is 13.000.
% 0.44/0.97 % Given clauses 10.
% 0.44/0.97
% 0.44/0.97 9 (all A all B all C (relation(C) -> relation_dom_restriction(relation_rng_restriction(A,C),B) = relation_rng_restriction(A,relation_dom_restriction(C,B)))) # label(t140_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 10 (all A all B (relation(B) -> relation_restriction(B,A) = relation_dom_restriction(relation_rng_restriction(A,B),A))) # label(t17_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.97 11 -(all A all B (relation(B) -> relation_restriction(B,A) = relation_rng_restriction(A,relation_dom_restriction(B,A)))) # label(t18_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.97 12 relation(c2) # label(t18_wellord1) # label(negated_conjecture). [clausify(11)].
% 0.44/0.97 15 relation_rng_restriction(c1,relation_dom_restriction(c2,c1)) != relation_restriction(c2,c1) # label(t18_wellord1) # label(negated_conjecture) # answer(t18_wellord1). [clausify(11)].
% 0.44/0.97 21 -relation(A) | relation_dom_restriction(relation_rng_restriction(B,A),B) = relation_restriction(A,B) # label(t17_wellord1) # label(axiom). [clausify(10)].
% 0.44/0.97 22 -relation(A) | relation_rng_restriction(B,relation_dom_restriction(A,C)) = relation_dom_restriction(relation_rng_restriction(B,A),C) # label(t140_relat_1) # label(axiom). [clausify(9)].
% 0.44/0.97 27 relation_dom_restriction(relation_rng_restriction(A,c2),A) = relation_restriction(c2,A). [hyper(21,a,12,a)].
% 0.44/0.97 28 relation_rng_restriction(A,relation_dom_restriction(c2,B)) = relation_dom_restriction(relation_rng_restriction(A,c2),B). [hyper(22,a,12,a)].
% 0.44/0.97 29 $F # answer(t18_wellord1). [back_rewrite(15),rewrite([28(5),27(5)]),xx(a)].
% 0.44/0.97
% 0.44/0.97 % SZS output end Refutation
% 0.44/0.97 ============================== end of proof ==========================
% 0.44/0.97
% 0.44/0.97 ============================== STATISTICS ============================
% 0.44/0.97
% 0.44/0.97 Given=10. Generated=23. Kept=16. proofs=1.
% 0.44/0.97 Usable=9. Sos=5. Demods=5. Limbo=1, Disabled=11. Hints=0.
% 0.44/0.97 Megabytes=0.05.
% 0.44/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.97
% 0.44/0.97 ============================== end of statistics =====================
% 0.44/0.97
% 0.44/0.97 ============================== end of search =========================
% 0.44/0.97
% 0.44/0.97 THEOREM PROVED
% 0.44/0.97 % SZS status Theorem
% 0.44/0.97
% 0.44/0.97 Exiting with 1 proof.
% 0.44/0.97
% 0.44/0.97 Process 7864 exit (max_proofs) Sun Jun 19 18:16:38 2022
% 0.44/0.97 Prover9 interrupted
%------------------------------------------------------------------------------