TSTP Solution File: SEU167+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU167+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:29:35 EDT 2022
% Result : Theorem 0.77s 1.03s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU167+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 07:06:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.77/1.03 ============================== Prover9 ===============================
% 0.77/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.03 Process 1439 was started by sandbox on n021.cluster.edu,
% 0.77/1.03 Sun Jun 19 07:06:33 2022
% 0.77/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1280_n021.cluster.edu".
% 0.77/1.03 ============================== end of head ===========================
% 0.77/1.03
% 0.77/1.03 ============================== INPUT =================================
% 0.77/1.03
% 0.77/1.03 % Reading from file /tmp/Prover9_1280_n021.cluster.edu
% 0.77/1.03
% 0.77/1.03 set(prolog_style_variables).
% 0.77/1.03 set(auto2).
% 0.77/1.03 % set(auto2) -> set(auto).
% 0.77/1.03 % set(auto) -> set(auto_inference).
% 0.77/1.03 % set(auto) -> set(auto_setup).
% 0.77/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.03 % set(auto) -> set(auto_limits).
% 0.77/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.03 % set(auto) -> set(auto_denials).
% 0.77/1.03 % set(auto) -> set(auto_process).
% 0.77/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.03 % set(auto2) -> assign(stats, some).
% 0.77/1.03 % set(auto2) -> clear(echo_input).
% 0.77/1.03 % set(auto2) -> set(quiet).
% 0.77/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.03 % set(auto2) -> clear(print_given).
% 0.77/1.03 assign(lrs_ticks,-1).
% 0.77/1.03 assign(sos_limit,10000).
% 0.77/1.03 assign(order,kbo).
% 0.77/1.03 set(lex_order_vars).
% 0.77/1.03 clear(print_given).
% 0.77/1.03
% 0.77/1.03 % formulas(sos). % not echoed (6 formulas)
% 0.77/1.03
% 0.77/1.03 ============================== end of input ==========================
% 0.77/1.03
% 0.77/1.03 % From the command line: assign(max_seconds, 300).
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.03
% 0.77/1.03 % Formulas that are not ordinary clauses:
% 0.77/1.03 1 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 2 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 3 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 4 (all A all B all C (subset(A,B) -> subset(cartesian_product2(A,C),cartesian_product2(B,C)) & subset(cartesian_product2(C,A),cartesian_product2(C,B)))) # label(t118_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 5 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 6 -(all A all B all C all D (subset(A,B) & subset(C,D) -> subset(cartesian_product2(A,C),cartesian_product2(B,D)))) # label(t119_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.77/1.03
% 0.77/1.03 ============================== end of process non-clausal formulas ===
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.03
% 0.77/1.03 ============================== PREDICATE ELIMINATION =================
% 0.77/1.03 7 -empty(c2) # label(rc2_xboole_0) # label(axiom). [clausify(2)].
% 0.77/1.03 8 empty(c1) # label(rc1_xboole_0) # label(axiom). [clausify(1)].
% 0.77/1.03
% 0.77/1.03 ============================== end predicate elimination =============
% 0.77/1.03
% 0.77/1.03 Auto_denials:
% 0.77/1.03 % copying label t119_zfmisc_1 to answer in negative clause
% 0.77/1.03
% 0.77/1.03 Term ordering decisions:
% 0.77/1.03 Function symbol KB weights: c3=1. c4=1. c5=1. c6=1. cartesian_product2=1.
% 0.77/1.03
% 0.77/1.03 ============================== end of process initial clauses ========
% 0.77/1.03
% 0.77/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.03
% 0.77/1.03 ============================== end of clauses for search =============
% 0.77/1.03
% 0.77/1.03 ============================== SEARCH ================================
% 0.77/1.03
% 0.77/1.03 % Starting search at 0.01 seconds.
% 0.77/1.03
% 0.77/1.03 ============================== PROOF =================================
% 0.77/1.03 % SZS status Theorem
% 0.77/1.03 % SZS output start Refutation
% 0.77/1.03
% 0.77/1.03 % Proof 1 at 0.01 (+ 0.00) seconds: t119_zfmisc_1.
% 0.77/1.03 % Length of proof is 14.
% 0.77/1.03 % Level of proof is 5.
% 0.77/1.03 % Maximum clause weight is 10.000.
% 0.77/1.03 % Given clauses 9.
% 0.77/1.03
% 0.77/1.03 4 (all A all B all C (subset(A,B) -> subset(cartesian_product2(A,C),cartesian_product2(B,C)) & subset(cartesian_product2(C,A),cartesian_product2(C,B)))) # label(t118_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 5 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 6 -(all A all B all C all D (subset(A,B) & subset(C,D) -> subset(cartesian_product2(A,C),cartesian_product2(B,D)))) # label(t119_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.77/1.03 10 subset(c3,c4) # label(t119_zfmisc_1) # label(negated_conjecture). [clausify(6)].
% 0.77/1.03 11 subset(c5,c6) # label(t119_zfmisc_1) # label(negated_conjecture). [clausify(6)].
% 0.77/1.03 12 -subset(cartesian_product2(c3,c5),cartesian_product2(c4,c6)) # label(t119_zfmisc_1) # label(negated_conjecture) # answer(t119_zfmisc_1). [clausify(6)].
% 0.77/1.03 13 -subset(A,B) | -subset(B,C) | subset(A,C) # label(t1_xboole_1) # label(axiom). [clausify(5)].
% 0.77/1.03 14 -subset(A,B) | subset(cartesian_product2(A,C),cartesian_product2(B,C)) # label(t118_zfmisc_1) # label(axiom). [clausify(4)].
% 0.77/1.03 15 -subset(A,B) | subset(cartesian_product2(C,A),cartesian_product2(C,B)) # label(t118_zfmisc_1) # label(axiom). [clausify(4)].
% 0.77/1.03 16 -subset(cartesian_product2(c3,c5),A) | -subset(A,cartesian_product2(c4,c6)) # answer(t119_zfmisc_1). [resolve(13,c,12,a)].
% 0.77/1.03 18 subset(cartesian_product2(c3,A),cartesian_product2(c4,A)). [ur(14,a,10,a)].
% 0.77/1.03 21 -subset(cartesian_product2(c3,A),cartesian_product2(c4,c6)) | -subset(c5,A) # answer(t119_zfmisc_1). [resolve(16,a,15,b)].
% 0.77/1.03 29 -subset(cartesian_product2(c3,c6),cartesian_product2(c4,c6)) # answer(t119_zfmisc_1). [resolve(21,b,11,a)].
% 0.77/1.03 30 $F # answer(t119_zfmisc_1). [resolve(29,a,18,a)].
% 0.77/1.03
% 0.77/1.03 % SZS output end Refutation
% 0.77/1.03 ============================== end of proof ==========================
% 0.77/1.03
% 0.77/1.03 ============================== STATISTICS ============================
% 0.77/1.03
% 0.77/1.03 Given=9. Generated=35. Kept=21. proofs=1.
% 0.77/1.03 Usable=9. Sos=8. Demods=0. Limbo=3, Disabled=9. Hints=0.
% 0.77/1.03 Megabytes=0.04.
% 0.77/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.77/1.03
% 0.77/1.03 ============================== end of statistics =====================
% 0.77/1.03
% 0.77/1.03 ============================== end of search =========================
% 0.77/1.03
% 0.77/1.03 THEOREM PROVED
% 0.77/1.03 % SZS status Theorem
% 0.77/1.03
% 0.77/1.03 Exiting with 1 proof.
% 0.77/1.03
% 0.77/1.03 Process 1439 exit (max_proofs) Sun Jun 19 07:06:33 2022
% 0.77/1.03 Prover9 interrupted
%------------------------------------------------------------------------------