TSTP Solution File: SET787-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET787-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:32:05 EDT 2022
% Result : Unsatisfiable 0.44s 1.00s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET787-1 : TPTP v8.1.0. Released v2.7.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n008.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 Jul 10 02:39:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 12343 was started by sandbox2 on n008.cluster.edu,
% 0.44/1.00 Sun Jul 10 02:39:09 2022
% 0.44/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12190_n008.cluster.edu".
% 0.44/1.00 ============================== end of head ===========================
% 0.44/1.00
% 0.44/1.00 ============================== INPUT =================================
% 0.44/1.00
% 0.44/1.00 % Reading from file /tmp/Prover9_12190_n008.cluster.edu
% 0.44/1.00
% 0.44/1.00 set(prolog_style_variables).
% 0.44/1.00 set(auto2).
% 0.44/1.00 % set(auto2) -> set(auto).
% 0.44/1.00 % set(auto) -> set(auto_inference).
% 0.44/1.00 % set(auto) -> set(auto_setup).
% 0.44/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00 % set(auto) -> set(auto_limits).
% 0.44/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00 % set(auto) -> set(auto_denials).
% 0.44/1.00 % set(auto) -> set(auto_process).
% 0.44/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00 % set(auto2) -> assign(stats, some).
% 0.44/1.00 % set(auto2) -> clear(echo_input).
% 0.44/1.00 % set(auto2) -> set(quiet).
% 0.44/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00 % set(auto2) -> clear(print_given).
% 0.44/1.00 assign(lrs_ticks,-1).
% 0.44/1.00 assign(sos_limit,10000).
% 0.44/1.00 assign(order,kbo).
% 0.44/1.00 set(lex_order_vars).
% 0.44/1.00 clear(print_given).
% 0.44/1.00
% 0.44/1.00 % formulas(sos). % not echoed (14 formulas)
% 0.44/1.00
% 0.44/1.00 ============================== end of input ==========================
% 0.44/1.00
% 0.44/1.00 % From the command line: assign(max_seconds, 300).
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00
% 0.44/1.00 % Formulas that are not ordinary clauses:
% 0.44/1.00
% 0.44/1.00 ============================== end of process non-clausal formulas ===
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.00
% 0.44/1.00 ============================== PREDICATE ELIMINATION =================
% 0.44/1.00
% 0.44/1.00 ============================== end predicate elimination =============
% 0.44/1.00
% 0.44/1.00 Auto_denials: (non-Horn, no changes).
% 0.44/1.00
% 0.44/1.00 Term ordering decisions:
% 0.44/1.00 Function symbol KB weights: a=1. b=1. eptset=1. sk2=1. pair=1. cons=1. un=1. unionE_sk1=1. converse=1. union=1. converseE_sk1=1. converseE_sk2=1. converse_sk1=1. converse_sk2=1.
% 0.44/1.00
% 0.44/1.00 ============================== end of process initial clauses ========
% 0.44/1.00
% 0.44/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.00
% 0.44/1.00 ============================== end of clauses for search =============
% 0.44/1.00
% 0.44/1.00 ============================== SEARCH ================================
% 0.44/1.00
% 0.44/1.00 % Starting search at 0.01 seconds.
% 0.44/1.00
% 0.44/1.00 ============================== PROOF =================================
% 0.44/1.00 % SZS status Unsatisfiable
% 0.44/1.00 % SZS output start Refutation
% 0.44/1.00
% 0.44/1.00 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.44/1.00 % Length of proof is 17.
% 0.44/1.00 % Level of proof is 6.
% 0.44/1.00 % Maximum clause weight is 20.000.
% 0.44/1.00 % Given clauses 76.
% 0.44/1.00
% 0.44/1.00 1 member(sk2,union(cons(a,cons(b,eptset)))) # label(un_eq_Union_2_c1) # label(negated_conjecture). [assumption].
% 0.44/1.00 2 -member(A,eptset) # label(clause158) # label(axiom). [assumption].
% 0.44/1.00 3 -member(sk2,un(a,b)) # label(un_eq_Union_2_c2) # label(negated_conjecture). [assumption].
% 0.44/1.00 4 -member(A,B) | member(A,un(B,C)) # label(unI1) # label(axiom). [assumption].
% 0.44/1.00 5 -member(A,B) | member(A,un(C,B)) # label(unI2) # label(axiom). [assumption].
% 0.44/1.00 6 -member(A,union(B)) | member(A,unionE_sk1(A,B)) # label(clause119) # label(axiom). [assumption].
% 0.44/1.00 7 -member(A,union(B)) | member(unionE_sk1(A,B),B) # label(clause120) # label(axiom). [assumption].
% 0.44/1.00 8 -member(A,cons(B,C)) | A = B | member(A,C) # label(clause112) # label(axiom). [assumption].
% 0.44/1.00 17 -member(sk2,b). [ur(5,b,3,a)].
% 0.44/1.00 18 member(sk2,unionE_sk1(sk2,cons(a,cons(b,eptset)))). [resolve(6,a,1,a)].
% 0.44/1.00 19 member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(a,cons(b,eptset))). [resolve(7,a,1,a)].
% 0.44/1.00 30 member(sk2,un(unionE_sk1(sk2,cons(a,cons(b,eptset))),A)). [resolve(18,a,4,a)].
% 0.44/1.00 37 unionE_sk1(sk2,cons(a,cons(b,eptset))) = a | member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(b,eptset)). [resolve(19,a,8,a)].
% 0.44/1.00 74 unionE_sk1(sk2,cons(a,cons(b,eptset))) = a | unionE_sk1(sk2,cons(a,cons(b,eptset))) = b. [resolve(37,b,8,a),unit_del(c,2)].
% 0.44/1.00 147 unionE_sk1(sk2,cons(a,cons(b,eptset))) = a. [para(74(b,1),18(a,2)),unit_del(b,17)].
% 0.44/1.00 182 member(sk2,un(a,A)). [back_rewrite(30),rewrite([147(8)])].
% 0.44/1.00 183 $F. [resolve(182,a,3,a)].
% 0.44/1.00
% 0.44/1.00 % SZS output end Refutation
% 0.44/1.00 ============================== end of proof ==========================
% 0.44/1.00
% 0.44/1.00 ============================== STATISTICS ============================
% 0.44/1.00
% 0.44/1.00 Given=76. Generated=239. Kept=181. proofs=1.
% 0.44/1.00 Usable=59. Sos=46. Demods=1. Limbo=35, Disabled=54. Hints=0.
% 0.44/1.00 Megabytes=0.23.
% 0.44/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.44/1.00
% 0.44/1.00 ============================== end of statistics =====================
% 0.44/1.00
% 0.44/1.00 ============================== end of search =========================
% 0.44/1.00
% 0.44/1.00 THEOREM PROVED
% 0.44/1.00 % SZS status Unsatisfiable
% 0.44/1.00
% 0.44/1.00 Exiting with 1 proof.
% 0.44/1.00
% 0.44/1.00 Process 12343 exit (max_proofs) Sun Jul 10 02:39:09 2022
% 0.44/1.00 Prover9 interrupted
%------------------------------------------------------------------------------