TSTP Solution File: SWB031+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWB031+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 19:18:56 EDT 2022
% Result : Unsatisfiable 0.45s 0.99s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWB031+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.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 : Wed Jun 1 00:47:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.98 ============================== Prover9 ===============================
% 0.45/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.98 Process 17347 was started by sandbox2 on n027.cluster.edu,
% 0.45/0.98 Wed Jun 1 00:47:48 2022
% 0.45/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17086_n027.cluster.edu".
% 0.45/0.98 ============================== end of head ===========================
% 0.45/0.98
% 0.45/0.98 ============================== INPUT =================================
% 0.45/0.98
% 0.45/0.98 % Reading from file /tmp/Prover9_17086_n027.cluster.edu
% 0.45/0.98
% 0.45/0.98 set(prolog_style_variables).
% 0.45/0.98 set(auto2).
% 0.45/0.98 % set(auto2) -> set(auto).
% 0.45/0.98 % set(auto) -> set(auto_inference).
% 0.45/0.98 % set(auto) -> set(auto_setup).
% 0.45/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.98 % set(auto) -> set(auto_limits).
% 0.45/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.98 % set(auto) -> set(auto_denials).
% 0.45/0.98 % set(auto) -> set(auto_process).
% 0.45/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.98 % set(auto2) -> assign(stats, some).
% 0.45/0.98 % set(auto2) -> clear(echo_input).
% 0.45/0.98 % set(auto2) -> set(quiet).
% 0.45/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.98 % set(auto2) -> clear(print_given).
% 0.45/0.98 assign(lrs_ticks,-1).
% 0.45/0.98 assign(sos_limit,10000).
% 0.45/0.98 assign(order,kbo).
% 0.45/0.98 set(lex_order_vars).
% 0.45/0.98 clear(print_given).
% 0.45/0.98
% 0.45/0.98 % formulas(sos). % not echoed (6 formulas)
% 0.45/0.98
% 0.45/0.98 ============================== end of input ==========================
% 0.45/0.98
% 0.45/0.98 % From the command line: assign(max_seconds, 300).
% 0.45/0.98
% 0.45/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.98
% 0.45/0.98 % Formulas that are not ordinary clauses:
% 0.45/0.98 1 (all X ir(X)) # label(simple_ir) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 2 (all X (icext(uri_owl_Thing,X) <-> ir(X))) # label(owl_class_thing_ext) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 3 (all X -icext(uri_owl_Nothing,X)) # label(owl_class_nothing_ext) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 4 (all Z all S1 all A1 (iext(uri_rdf_first,S1,A1) & iext(uri_rdf_rest,S1,uri_rdf_nil) -> (iext(uri_owl_oneOf,Z,S1) <-> ic(Z) & (all X (icext(Z,X) <-> X = A1))))) # label(owl_enum_class_001) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 5 (all C1 all C2 (iext(uri_owl_equivalentClass,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) <-> icext(C2,X))))) # label(owl_eqdis_equivalentclass) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 6 (exists BNODE_x exists BNODE_l (iext(uri_owl_equivalentClass,uri_owl_Thing,BNODE_x) & iext(uri_owl_oneOf,BNODE_x,BNODE_l) & iext(uri_rdf_first,BNODE_l,uri_ex_w) & iext(uri_rdf_rest,BNODE_l,uri_rdf_nil))) # label(testcase_premise_fullish_031_Large_Universe) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98
% 0.45/0.98 ============================== end of process non-clausal formulas ===
% 0.45/0.98
% 0.45/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.98
% 0.45/0.98 ============================== PREDICATE ELIMINATION =================
% 0.45/0.98 7 icext(uri_owl_Thing,A) | -ir(A) # label(owl_class_thing_ext) # label(axiom). [clausify(2)].
% 0.45/0.98 8 ir(A) # label(simple_ir) # label(axiom). [clausify(1)].
% 0.45/0.98 9 -icext(uri_owl_Thing,A) | ir(A) # label(owl_class_thing_ext) # label(axiom). [clausify(2)].
% 0.45/0.98 Derived: icext(uri_owl_Thing,A). [resolve(7,b,8,a)].
% 0.45/0.98
% 0.45/0.98 ============================== end predicate elimination =============
% 0.45/0.98
% 0.45/0.98 Auto_denials: (non-Horn, no changes).
% 0.45/0.98
% 0.45/0.98 Term ordering decisions:
% 0.45/0.98 Function symbol KB weights: uri_owl_equivalentClass=1. uri_owl_oneOf=1. uri_rdf_first=1. uri_rdf_nil=1. uri_rdf_rest=1. uri_owl_Thing=1. uri_ex_w=1. uri_owl_Nothing=1. c1=1. c2=1. f2=1. f1=1.
% 0.45/0.98
% 0.45/0.98 ============================== end of process initial clauses ========
% 0.45/0.99
% 0.45/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.99
% 0.45/0.99 ============================== end of clauses for search =============
% 0.45/0.99
% 0.45/0.99 ============================== SEARCH ================================
% 0.45/0.99
% 0.45/0.99 % Starting search at 0.01 seconds.
% 0.45/0.99
% 0.45/0.99 ============================== PROOF =================================
% 0.45/0.99 % SZS status Unsatisfiable
% 0.45/0.99 % SZS output start Refutation
% 0.45/0.99
% 0.45/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.45/0.99 % Length of proof is 21.
% 0.45/0.99 % Level of proof is 7.
% 0.45/0.99 % Maximum clause weight is 18.000.
% 0.45/0.99 % Given clauses 32.
% 0.45/0.99
% 0.45/0.99 1 (all X ir(X)) # label(simple_ir) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 2 (all X (icext(uri_owl_Thing,X) <-> ir(X))) # label(owl_class_thing_ext) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 3 (all X -icext(uri_owl_Nothing,X)) # label(owl_class_nothing_ext) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 4 (all Z all S1 all A1 (iext(uri_rdf_first,S1,A1) & iext(uri_rdf_rest,S1,uri_rdf_nil) -> (iext(uri_owl_oneOf,Z,S1) <-> ic(Z) & (all X (icext(Z,X) <-> X = A1))))) # label(owl_enum_class_001) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 5 (all C1 all C2 (iext(uri_owl_equivalentClass,C1,C2) <-> ic(C1) & ic(C2) & (all X (icext(C1,X) <-> icext(C2,X))))) # label(owl_eqdis_equivalentclass) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 6 (exists BNODE_x exists BNODE_l (iext(uri_owl_equivalentClass,uri_owl_Thing,BNODE_x) & iext(uri_owl_oneOf,BNODE_x,BNODE_l) & iext(uri_rdf_first,BNODE_l,uri_ex_w) & iext(uri_rdf_rest,BNODE_l,uri_rdf_nil))) # label(testcase_premise_fullish_031_Large_Universe) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 7 icext(uri_owl_Thing,A) | -ir(A) # label(owl_class_thing_ext) # label(axiom). [clausify(2)].
% 0.45/0.99 8 ir(A) # label(simple_ir) # label(axiom). [clausify(1)].
% 0.45/0.99 10 iext(uri_owl_equivalentClass,uri_owl_Thing,c1) # label(testcase_premise_fullish_031_Large_Universe) # label(axiom). [clausify(6)].
% 0.45/0.99 11 iext(uri_owl_oneOf,c1,c2) # label(testcase_premise_fullish_031_Large_Universe) # label(axiom). [clausify(6)].
% 0.45/0.99 12 iext(uri_rdf_first,c2,uri_ex_w) # label(testcase_premise_fullish_031_Large_Universe) # label(axiom). [clausify(6)].
% 0.45/0.99 13 iext(uri_rdf_rest,c2,uri_rdf_nil) # label(testcase_premise_fullish_031_Large_Universe) # label(axiom). [clausify(6)].
% 0.45/0.99 14 -icext(uri_owl_Nothing,A) # label(owl_class_nothing_ext) # label(axiom). [clausify(3)].
% 0.45/0.99 17 -iext(uri_owl_equivalentClass,A,B) | -icext(A,C) | icext(B,C) # label(owl_eqdis_equivalentclass) # label(axiom). [clausify(5)].
% 0.45/0.99 20 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_owl_oneOf,C,A) | -icext(C,D) | B = D # label(owl_enum_class_001) # label(axiom). [clausify(4)].
% 0.45/0.99 28 icext(uri_owl_Thing,A). [resolve(7,b,8,a)].
% 0.45/0.99 33 icext(c1,A). [resolve(17,a,10,a),unit_del(a,28)].
% 0.45/0.99 37 -iext(uri_rdf_first,c2,A) | A = B. [resolve(20,c,11,a),unit_del(b,13),unit_del(c,33)].
% 0.45/0.99 55 uri_ex_w = A. [resolve(37,a,12,a)].
% 0.45/0.99 70 -icext(uri_ex_w,A). [para(55(a,2),14(a,1))].
% 0.45/0.99 94 $F. [para(55(a,2),28(a,1)),unit_del(a,70)].
% 0.45/0.99
% 0.45/0.99 % SZS output end Refutation
% 0.45/0.99 ============================== end of proof ==========================
% 0.45/0.99
% 0.45/0.99 ============================== STATISTICS ============================
% 0.45/0.99
% 0.45/0.99 Given=32. Generated=108. Kept=82. proofs=1.
% 0.45/0.99 Usable=32. Sos=9. Demods=0. Limbo=36, Disabled=25. Hints=0.
% 0.45/0.99 Megabytes=0.10.
% 0.45/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/0.99
% 0.45/0.99 ============================== end of statistics =====================
% 0.45/0.99
% 0.45/0.99 ============================== end of search =========================
% 0.45/0.99
% 0.45/0.99 THEOREM PROVED
% 0.45/0.99 % SZS status Unsatisfiable
% 0.45/0.99
% 0.45/0.99 Exiting with 1 proof.
% 0.45/0.99
% 0.45/0.99 Process 17347 exit (max_proofs) Wed Jun 1 00:47:48 2022
% 0.45/0.99 Prover9 interrupted
%------------------------------------------------------------------------------