TSTP Solution File: SET445-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET445-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:29:37 EDT 2022
% Result : Timeout 300.05s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET445-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jul 11 05:17:04 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 32208 was started by sandbox2 on n014.cluster.edu,
% 0.74/1.00 Mon Jul 11 05:17:05 2022
% 0.74/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32055_n014.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_32055_n014.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (115 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00 1 -member(null_class,A) | -subclass(image(successor_relation,A),A) | inductive(A) # label(inductive3) # label(axiom). [assumption].
% 0.74/1.00 2 -inductive(A) | member(null_class,A) # label(inductive1) # label(axiom). [assumption].
% 0.74/1.00 3 -inductive(A) | subclass(image(successor_relation,A),A) # label(inductive2) # label(axiom). [assumption].
% 0.74/1.00 4 inductive(omega) # label(omega_is_inductive1) # label(axiom). [assumption].
% 0.74/1.00 Derived: member(null_class,omega). [resolve(4,a,2,a)].
% 0.74/1.00 Derived: subclass(image(successor_relation,omega),omega). [resolve(4,a,3,a)].
% 0.74/1.00 5 -inductive(A) | subclass(omega,A) # label(omega_is_inductive2) # label(axiom). [assumption].
% 0.74/1.00 Derived: subclass(omega,A) | -member(null_class,A) | -subclass(image(successor_relation,A),A). [resolve(5,a,1,c)].
% 0.74/1.00 Derived: subclass(omega,omega). [resolve(5,a,4,a)].
% 0.74/1.00 6 -subclass(compose(A,inverse(A)),identity_relation) | single_valued_class(A) # label(single_valued_class2) # label(axiom). [assumption].
% 0.74/1.00 7 -single_valued_class(A) | subclass(compose(A,inverse(A)),identity_relation) # label(single_valued_class1) # label(axiom). [assumption].
% 0.74/1.00 8 -function(inverse(A)) | -function(A) | one_to_one(A) # label(one_to_one3) # label(axiom). [assumption].
% 0.74/1.00 9 -one_to_one(A) | function(A) # label(one_to_one1) # label(axiom). [assumption].
% 0.74/1.00 10 -one_to_one(A) | function(inverse(A)) # label(one_to_one2) # label(axiom). [assumption].
% 0.74/1.00 11 -function(A) | domain_of(domain_of(B)) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(C))) | compatible(A,B,C) # label(compatible4) # label(axiom). [assumption].
% 0.74/1.00 12 -compatible(A,B,C) | function(A) # label(compatible1) # label(axiom). [assumption].
% 0.74/1.00 13 -compatible(A,B,C) | domain_of(domain_of(B)) = domain_of(A) # label(compatible2) # label(axiom). [assumption].
% 0.74/1.00 14 -compatible(A,B,C) | subclass(range_of(A),domain_of(domain_of(C))) # label(compatible3) # label(axiom). [assumption].
% 0.74/1.00 15 -homomorphism(A,B,C) | compatible(A,B,C) # label(homomorphism3) # label(axiom). [assumption].
% 0.74/1.00 Derived: -homomorphism(A,B,C) | function(A). [resolve(15,b,12,a)].
% 0.74/1.00 Derived: -homomorphism(A,B,C) | domain_of(domain_of(B)) = domain_of(A). [resolve(15,b,13,a)].
% 0.74/1.00 Derived: -homomorphism(A,B,C) | subclass(range_of(A),domain_of(domain_of(C))). [resolve(15,b,14,a)].
% 0.74/1.00 16 -operation(A) | -operation(B) | -compatible(C,A,B) | member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A)) | homomorphism(C,A,B) # label(homomorphism5) # label(axiom). [assumption].
% 0.74/1.00 Derived: -operation(A) | -operation(B) | member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A)) | homomorphism(C,A,B) | -function(C) | domain_of(domain_of(A)) != domain_of(C) | -subclass(range_of(C),domain_of(domain_of(B))). [resolve(16,c,11,d)].
% 0.74/1.00 17 -operation(A) | -operation(B) | -compatible(C,A,B) | apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B)))) != apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)))) | homomorphism(C,A,B) # label(homomorphism6) # label(axiom). [assumption].
% 0.74/1.00 Derived: -operation(A) | -operation(B) | apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B)))) != apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)))) | homomorphism(C,A,B) | -function(C) | domain_of(domain_of(A)) != domain_of(C) | -subclass(range_of(C),domain_of(domain_of(B))). [resolve(17,c,11,d)].
% 0.74/1.00 18 -operation(A) | -operation(B) | member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A)) | homomorphism(C,A,B) | -function(C) | domain_of(domain_of(A)) != domain_of(C) | -subclass(range_of(C),domain_of(domain_of(B))). [resolve(16,c,11,d)].
% 0.74/1.00 19 -homomorphism(A,B,C) | operation(B) # label(homomorphism1) # label(axiom). [assumption].
% 0.74/1.00 20 -homomorphism(A,B,C) | operation(C) # label(homomorphism2) # label(axiom). [assumption].
% 0.74/1.00 21 -homomorphism(A,B,C) | -member(ordered_pair(D,E),domain_of(B)) | apply(C,ordered_pair(apply(A,D),apply(A,E))) = apply(A,apply(B,ordered_pair(D,E))) # label(homomorphism4) # label(axiom). [assumption].
% 0.74/1.00 22 -homomorphism(A,B,C) | function(A). [resolve(15,b,12,a)].
% 0.74/1.00 23 -homomorphism(A,B,C) | domain_of(domain_of(B)) = domain_of(A). [resolve(15,b,13,a)].
% 0.74/1.00 24 -homomorphism(A,B,C) | subclass(range_of(A),domain_of(domain_of(C))). [resolve(15,b,14,a)].
% 0.74/1.00 Derived: -operation(A) | -operation(B) | member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A)) | -function(C) | domain_of(domain_of(A)) != domain_of(C) | -subclass(range_of(C),domain_of(domain_of(B))) | -member(ordered_pair(D,E),domain_of(A)) | apply(B,ordered_pair(apply(C,D),apply(C,E))) = apply(C,apply(A,ordered_pair(D,E))). [resolve(18,d,21,a)].
% 0.74/1.00 25 -operation(A) | -operation(B) | apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B)))) != apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)))) | homomorphism(C,A,B) | -function(C) | domain_of(domain_of(A)) != domain_of(C) | -subclass(range_of(C),domain_of(domain_of(B))). [resolve(17,c,11,d)].
% 0.74/1.00 Derived: -operation(A) | -operation(B) | apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B)))) != apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)))) | -function(C) | domain_of(domain_of(A)) != domain_of(C) | -subclass(range_of(C),domain_of(domain_of(B))) | -member(ordered_pair(D,E),domain_of(A)) | apply(B,ordered_pair(apply(C,D),apply(C,E))) = apply(C,apply(A,ordered_pair(D,E))). [resolve(25,d,21,a)].
% 0.74/1.00 26 -function(A) | -subclass(range_of(A),B) | maps(A,domain_of(A),B) # label(maps4) # label(axiom). [assumption].
% 0.74/1.00 27 -maps(A,B,C) | function(A) # label(maps1) # label(axiom). [assumption].
% 0.74/1.00 28 -maps(A,B,C) | domain_of(A) = B # label(maps2) # label(axiom). [assumption].
% 0.74/1.00 29 -maps(A,B,C) | subclass(Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------