TSTP Solution File: SET018-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET018-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:25:48 EDT 2022
% Result : Unsatisfiable 0.75s 1.01s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET018-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n016.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 Jul 11 08:34:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.01 ============================== Prover9 ===============================
% 0.75/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.01 Process 4573 was started by sandbox on n016.cluster.edu,
% 0.75/1.01 Mon Jul 11 08:34:43 2022
% 0.75/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4419_n016.cluster.edu".
% 0.75/1.01 ============================== end of head ===========================
% 0.75/1.01
% 0.75/1.01 ============================== INPUT =================================
% 0.75/1.01
% 0.75/1.01 % Reading from file /tmp/Prover9_4419_n016.cluster.edu
% 0.75/1.01
% 0.75/1.01 set(prolog_style_variables).
% 0.75/1.01 set(auto2).
% 0.75/1.01 % set(auto2) -> set(auto).
% 0.75/1.01 % set(auto) -> set(auto_inference).
% 0.75/1.01 % set(auto) -> set(auto_setup).
% 0.75/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.01 % set(auto) -> set(auto_limits).
% 0.75/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.01 % set(auto) -> set(auto_denials).
% 0.75/1.01 % set(auto) -> set(auto_process).
% 0.75/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.01 % set(auto2) -> assign(stats, some).
% 0.75/1.01 % set(auto2) -> clear(echo_input).
% 0.75/1.01 % set(auto2) -> set(quiet).
% 0.75/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.01 % set(auto2) -> clear(print_given).
% 0.75/1.01 assign(lrs_ticks,-1).
% 0.75/1.01 assign(sos_limit,10000).
% 0.75/1.01 assign(order,kbo).
% 0.75/1.01 set(lex_order_vars).
% 0.75/1.01 clear(print_given).
% 0.75/1.01
% 0.75/1.01 % formulas(sos). % not echoed (8 formulas)
% 0.75/1.01
% 0.75/1.01 ============================== end of input ==========================
% 0.75/1.01
% 0.75/1.01 % From the command line: assign(max_seconds, 300).
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.01
% 0.75/1.01 % Formulas that are not ordinary clauses:
% 0.75/1.01
% 0.75/1.01 ============================== end of process non-clausal formulas ===
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.01
% 0.75/1.01 ============================== PREDICATE ELIMINATION =================
% 0.75/1.01
% 0.75/1.01 ============================== end predicate elimination =============
% 0.75/1.01
% 0.75/1.01 Auto_denials: (non-Horn, no changes).
% 0.75/1.01
% 0.75/1.01 Term ordering decisions:
% 0.75/1.01
% 0.75/1.01 % Assigning unary symbol singleton_set kb_weight 0 and highest precedence (9).
% 0.75/1.01 Function symbol KB weights: m1=1. m2=1. r1=1. r2=1. unordered_pair=1. ordered_pair=1. singleton_set=0.
% 0.75/1.01
% 0.75/1.01 ============================== end of process initial clauses ========
% 0.75/1.01
% 0.75/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.01
% 0.75/1.01 ============================== end of clauses for search =============
% 0.75/1.01
% 0.75/1.01 ============================== SEARCH ================================
% 0.75/1.01
% 0.75/1.01 % Starting search at 0.01 seconds.
% 0.75/1.01
% 0.75/1.01 ============================== PROOF =================================
% 0.75/1.01 % SZS status Unsatisfiable
% 0.75/1.01 % SZS output start Refutation
% 0.75/1.01
% 0.75/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.75/1.01 % Length of proof is 38.
% 0.75/1.01 % Level of proof is 17.
% 0.75/1.01 % Maximum clause weight is 17.000.
% 0.75/1.01 % Given clauses 42.
% 0.75/1.01
% 0.75/1.01 1 member(A,singleton_set(A)) # label(singleton_1) # label(axiom). [assumption].
% 0.75/1.01 2 member(A,unordered_pair(A,B)) # label(unordered_pair_1) # label(axiom). [assumption].
% 0.75/1.01 3 member(A,unordered_pair(B,A)) # label(unordered_pair_2) # label(axiom). [assumption].
% 0.75/1.01 4 ordered_pair(m1,r1) = ordered_pair(m2,r2) # label(equal_ordered_pairs) # label(hypothesis). [assumption].
% 0.75/1.01 5 ordered_pair(m2,r2) = ordered_pair(m1,r1). [copy(4),flip(a)].
% 0.75/1.01 6 ordered_pair(A,B) = unordered_pair(singleton_set(A),unordered_pair(A,B)) # label(ordered_pair) # label(axiom). [assumption].
% 0.75/1.01 7 r1 != r2 # label(prove_second_components_equal) # label(negated_conjecture). [assumption].
% 0.75/1.01 8 r2 != r1. [copy(7),flip(a)].
% 0.75/1.01 9 -member(A,singleton_set(B)) | A = B # label(singleton_2) # label(axiom). [assumption].
% 0.75/1.01 10 -member(A,unordered_pair(B,C)) | A = B | A = C # label(unordered_pair_3) # label(axiom). [assumption].
% 0.75/1.01 11 unordered_pair(singleton_set(m2),unordered_pair(m2,r2)) = unordered_pair(singleton_set(m1),unordered_pair(m1,r1)). [back_rewrite(5),rewrite([6(3),6(9)])].
% 0.75/1.01 14 -member(r1,singleton_set(r2)). [ur(9,b,8,a(flip))].
% 0.75/1.01 16 -member(r1,unordered_pair(r2,r2)). [ur(10,b,8,a(flip),c,8,a(flip))].
% 0.75/1.01 17 member(singleton_set(m2),unordered_pair(singleton_set(m1),unordered_pair(m1,r1))). [para(11(a,1),2(a,2))].
% 0.75/1.01 18 member(unordered_pair(m2,r2),unordered_pair(singleton_set(m1),unordered_pair(m1,r1))). [para(11(a,1),3(a,2))].
% 0.75/1.01 19 -member(A,unordered_pair(singleton_set(m1),unordered_pair(m1,r1))) | singleton_set(m2) = A | unordered_pair(m2,r2) = A. [para(11(a,1),10(a,2)),flip(b),flip(c)].
% 0.75/1.01 20 singleton_set(m2) = singleton_set(m1) | unordered_pair(m1,r1) = singleton_set(m2). [resolve(17,a,10,a),flip(b)].
% 0.75/1.01 21 unordered_pair(m2,r2) = singleton_set(m1) | unordered_pair(m2,r2) = unordered_pair(m1,r1). [resolve(18,a,10,a)].
% 0.75/1.01 22 singleton_set(m2) = singleton_set(m1) | member(m1,singleton_set(m2)). [para(20(b,1),2(a,2))].
% 0.75/1.01 27 singleton_set(m2) = singleton_set(m1) | m2 = m1. [resolve(22,b,9,a),flip(b)].
% 0.75/1.01 28 unordered_pair(m1,r1) = singleton_set(m2) | unordered_pair(m2,r2) = unordered_pair(m1,r1). [resolve(19,a,3,a),flip(a)].
% 0.75/1.01 33 m2 = m1 | -member(A,singleton_set(m1)) | m2 = A. [para(27(a,1),9(a,2)),flip(c)].
% 0.75/1.01 35 m2 = m1. [factor(33,a,c),unit_del(b,1)].
% 0.75/1.01 36 unordered_pair(m1,r1) = singleton_set(m1) | unordered_pair(m1,r2) = unordered_pair(m1,r1). [back_rewrite(28),rewrite([35(4),35(7)])].
% 0.75/1.01 37 unordered_pair(m1,r2) = singleton_set(m1) | unordered_pair(m1,r2) = unordered_pair(m1,r1). [back_rewrite(21),rewrite([35(1),35(7)])].
% 0.75/1.01 41 unordered_pair(m1,r1) = singleton_set(m1) | member(r2,unordered_pair(m1,r1)). [para(36(b,1),3(a,2))].
% 0.75/1.01 45 unordered_pair(m1,r1) = singleton_set(m1) | r2 = m1. [resolve(41,b,10,a),unit_del(c,8)].
% 0.75/1.01 46 r2 = m1 | member(r1,singleton_set(m1)). [para(45(a,1),3(a,2))].
% 0.75/1.01 50 r2 = m1 | unordered_pair(m1,r2) = singleton_set(m1). [para(45(a,1),37(b,2)),merge(c)].
% 0.75/1.01 51 r2 = m1 | r1 = m1. [resolve(46,b,9,a)].
% 0.75/1.01 54 r1 = m1 | -member(r1,unordered_pair(m1,r2)). [para(51(a,1),16(a,2,1))].
% 0.75/1.01 60 unordered_pair(m1,r1) = singleton_set(m1) | r1 = m1. [para(36(b,1),54(b,2)),unit_del(c,3)].
% 0.75/1.01 63 r2 = m1 | member(r2,singleton_set(m1)). [para(50(b,1),3(a,2))].
% 0.75/1.01 65 r2 = m1. [resolve(63,b,9,a),merge(b)].
% 0.75/1.01 75 -member(r1,singleton_set(m1)). [back_rewrite(14),rewrite([65(2)])].
% 0.75/1.01 77 r1 != m1. [back_rewrite(8),rewrite([65(1)]),flip(a)].
% 0.75/1.01 79 unordered_pair(m1,r1) = singleton_set(m1). [back_unit_del(60),unit_del(b,77)].
% 0.75/1.01 82 $F. [para(79(a,1),3(a,2)),unit_del(a,75)].
% 0.75/1.01
% 0.75/1.01 % SZS output end Refutation
% 0.75/1.01 ============================== end of proof ==========================
% 0.75/1.01
% 0.75/1.01 ============================== STATISTICS ============================
% 0.75/1.01
% 0.75/1.01 Given=42. Generated=178. Kept=79. proofs=1.
% 0.75/1.01 Usable=15. Sos=2. Demods=5. Limbo=0, Disabled=70. Hints=0.
% 0.75/1.01 Megabytes=0.08.
% 0.75/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.75/1.01
% 0.75/1.01 ============================== end of statistics =====================
% 0.75/1.01
% 0.75/1.01 ============================== end of search =========================
% 0.75/1.01
% 0.75/1.01 THEOREM PROVED
% 0.75/1.01 % SZS status Unsatisfiable
% 0.75/1.01
% 0.75/1.01 Exiting with 1 proof.
% 0.75/1.01
% 0.75/1.01 Process 4573 exit (max_proofs) Mon Jul 11 08:34:43 2022
% 0.75/1.01 Prover9 interrupted
%------------------------------------------------------------------------------