TSTP Solution File: SEU251+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU251+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:22 EDT 2022
% Result : Timeout 300.01s 300.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU251+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 20 05:01:17 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.03 ============================== Prover9 ===============================
% 0.45/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03 Process 8218 was started by sandbox on n024.cluster.edu,
% 0.45/1.03 Mon Jun 20 05:01:18 2022
% 0.45/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8065_n024.cluster.edu".
% 0.45/1.03 ============================== end of head ===========================
% 0.45/1.03
% 0.45/1.03 ============================== INPUT =================================
% 0.45/1.03
% 0.45/1.03 % Reading from file /tmp/Prover9_8065_n024.cluster.edu
% 0.45/1.03
% 0.45/1.03 set(prolog_style_variables).
% 0.45/1.03 set(auto2).
% 0.45/1.03 % set(auto2) -> set(auto).
% 0.45/1.03 % set(auto) -> set(auto_inference).
% 0.45/1.03 % set(auto) -> set(auto_setup).
% 0.45/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03 % set(auto) -> set(auto_limits).
% 0.45/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03 % set(auto) -> set(auto_denials).
% 0.45/1.03 % set(auto) -> set(auto_process).
% 0.45/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03 % set(auto2) -> assign(stats, some).
% 0.45/1.03 % set(auto2) -> clear(echo_input).
% 0.45/1.03 % set(auto2) -> set(quiet).
% 0.45/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03 % set(auto2) -> clear(print_given).
% 0.45/1.03 assign(lrs_ticks,-1).
% 0.45/1.03 assign(sos_limit,10000).
% 0.45/1.03 assign(order,kbo).
% 0.45/1.03 set(lex_order_vars).
% 0.45/1.03 clear(print_given).
% 0.45/1.03
% 0.45/1.03 % formulas(sos). % not echoed (40 formulas)
% 0.45/1.03
% 0.45/1.03 ============================== end of input ==========================
% 0.45/1.03
% 0.45/1.03 % From the command line: assign(max_seconds, 300).
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03
% 0.45/1.03 % Formulas that are not ordinary clauses:
% 0.45/1.03 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 2 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 3 (all A (relation(A) & empty(A) & function(A) -> relation(A) & function(A) & one_to_one(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 4 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 5 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 6 (all A (relation(A) -> (all B all C (C = fiber(A,B) <-> (all D (in(D,C) <-> D != B & in(ordered_pair(D,B),A))))))) # label(d1_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 7 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 8 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 9 (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.45/1.03 10 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 11 $T # label(dt_k1_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 12 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 13 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 14 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 15 (all A all B (relation(A) -> relation(relation_restriction(A,B)))) # label(dt_k2_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 16 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 17 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 18 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 19 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 20 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 21 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 22 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 23 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 24 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 25 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 26 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 27 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 28 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 29 (all A all B all C (relation(C) -> (in(A,relation_restriction(C,B)) <-> in(A,C) & in(A,cartesian_product2(B,B))))) # label(t16_wellord1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 30 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 31 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 32 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 33 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 34 (all A all B all C (in(A,B) & element(B,powerset(C)) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 35 (all A all B all C -(in(A,B) & element(B,powerset(C)) & empty(C))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 36 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 37 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 38 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.03 39 -(all A all B all C (relation(C) -> subset(fiber(relation_restriction(C,A),B),fiber(C,B)))) # label(t21_wellord1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.03
% 0.45/1.03 ============================== end of process non-clausal formulas ===
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03
% 0.45/1.03 ============================== PREDICATE ELIMINATION =================
% 0.45/1.03 40 -relation(A) | -empty(A) | -function(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom). [clausify(3)].
% 0.45/1.03 41 function(c1) # label(rc1_funct_1) # label(axiom). [clausify(23)].
% 0.45/1.03 42 function(c3) # label(rc2_funct_1) # label(axiom). [clausify(25)].
% 0.45/1.03 43 function(c5) # label(rc3_funct_1) # label(axiom). [clausify(27)].
% 0.45/1.03 44 -empty(A) | function(A) # label(cc1_funct_1) # label(axiom). [clausify(2)].
% 0.45/1.03 Derived: -relation(c1) | -empty(c1) | one_to_one(c1). [resolve(40,c,41,a)].
% 0.45/1.03 Derived: -relation(c3) | -empty(c3) | one_to_one(c3). [resolve(40,c,42,a)].
% 0.45/1.03 Derived: -relation(c5) | -empty(c5) | one_to_one(c5). [resolve(40,c,43,a)].
% 0.45/1.03 Derived: -relation(A) | -empty(A) | one_to_one(A) | -empty(A). [resolve(40,c,44,b)].
% 0.45/1.03
% 0.45/1.03 ============================== end predicate elimination =============
% 0.45/1.03
% 0.45/1.03 Auto_denials: (non-Horn, no changes).
% 0.45/1.03
% 0.45/1.03 Term ordering decisions:
% 0.45/1.03 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. fiber=1. ordered_pair=1. relation_restriction=1. set_intersection2=1. unordered_pair=1. cartesian_product2=1. f2=1. powerset=1. singleton=1. f3=1. f1=1.
% 0.45/1.03
% 0.45/1.03 ======================Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------