TSTP Solution File: PUZ028-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ028-3 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 : Mon Jul 18 18:23:52 EDT 2022
% Result : Unknown 0.58s 0.93s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : PUZ028-3 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Sat May 28 22:36:55 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.53/0.90 ============================== Prover9 ===============================
% 0.53/0.90 Prover9 (32) version 2009-11A, November 2009.
% 0.53/0.90 Process 8314 was started by sandbox on n032.cluster.edu,
% 0.53/0.90 Sat May 28 22:36:56 2022
% 0.53/0.90 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7930_n032.cluster.edu".
% 0.53/0.90 ============================== end of head ===========================
% 0.53/0.90
% 0.53/0.90 ============================== INPUT =================================
% 0.53/0.90
% 0.53/0.90 % Reading from file /tmp/Prover9_7930_n032.cluster.edu
% 0.53/0.90
% 0.53/0.90 set(prolog_style_variables).
% 0.53/0.90 set(auto2).
% 0.53/0.90 % set(auto2) -> set(auto).
% 0.53/0.90 % set(auto) -> set(auto_inference).
% 0.53/0.90 % set(auto) -> set(auto_setup).
% 0.53/0.90 % set(auto_setup) -> set(predicate_elim).
% 0.53/0.90 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.53/0.90 % set(auto) -> set(auto_limits).
% 0.53/0.90 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.53/0.90 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.53/0.90 % set(auto) -> set(auto_denials).
% 0.53/0.90 % set(auto) -> set(auto_process).
% 0.53/0.90 % set(auto2) -> assign(new_constants, 1).
% 0.53/0.90 % set(auto2) -> assign(fold_denial_max, 3).
% 0.53/0.90 % set(auto2) -> assign(max_weight, "200.000").
% 0.53/0.90 % set(auto2) -> assign(max_hours, 1).
% 0.53/0.90 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.53/0.90 % set(auto2) -> assign(max_seconds, 0).
% 0.53/0.90 % set(auto2) -> assign(max_minutes, 5).
% 0.53/0.90 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.53/0.90 % set(auto2) -> set(sort_initial_sos).
% 0.53/0.90 % set(auto2) -> assign(sos_limit, -1).
% 0.53/0.90 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.53/0.90 % set(auto2) -> assign(max_megs, 400).
% 0.53/0.90 % set(auto2) -> assign(stats, some).
% 0.53/0.90 % set(auto2) -> clear(echo_input).
% 0.53/0.90 % set(auto2) -> set(quiet).
% 0.53/0.90 % set(auto2) -> clear(print_initial_clauses).
% 0.53/0.90 % set(auto2) -> clear(print_given).
% 0.53/0.90 assign(lrs_ticks,-1).
% 0.53/0.90 assign(sos_limit,10000).
% 0.53/0.90 assign(order,kbo).
% 0.53/0.90 set(lex_order_vars).
% 0.53/0.90 clear(print_given).
% 0.53/0.90
% 0.53/0.90 % formulas(sos). % not echoed (504 formulas)
% 0.53/0.90
% 0.53/0.90 ============================== end of input ==========================
% 0.53/0.90
% 0.53/0.90 % From the command line: assign(max_seconds, 300).
% 0.53/0.90
% 0.53/0.90 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.53/0.90
% 0.53/0.90 % Formulas that are not ordinary clauses:
% 0.53/0.90
% 0.53/0.90 ============================== end of process non-clausal formulas ===
% 0.53/0.90
% 0.53/0.90 ============================== PROCESS INITIAL CLAUSES ===============
% 0.53/0.90
% 0.53/0.90 ============================== PREDICATE ELIMINATION =================
% 0.53/0.90 1 familiar(n1,n1) | not_familiar(n1,n1) | -person(n1) | -person(n1) | -not_equal(n1,n1) # label(familiar_or_not_1_1) # label(axiom). [assumption].
% 0.53/0.90 2 not_equal(n1,n2) # label(not_equal_1_2) # label(axiom). [assumption].
% 0.53/0.90 3 not_equal(n1,n3) # label(not_equal_1_3) # label(axiom). [assumption].
% 0.53/0.90 4 not_equal(n1,n4) # label(not_equal_1_4) # label(axiom). [assumption].
% 0.53/0.90 5 not_equal(n1,n5) # label(not_equal_1_5) # label(axiom). [assumption].
% 0.53/0.90 6 not_equal(n1,n6) # label(not_equal_1_6) # label(axiom). [assumption].
% 0.53/0.90 7 not_equal(n2,n1) # label(not_equal_2_1) # label(axiom). [assumption].
% 0.53/0.90 8 not_equal(n2,n3) # label(not_equal_2_3) # label(axiom). [assumption].
% 0.53/0.90 9 not_equal(n2,n4) # label(not_equal_2_4) # label(axiom). [assumption].
% 0.53/0.90 10 not_equal(n2,n5) # label(not_equal_2_5) # label(axiom). [assumption].
% 0.53/0.90 11 not_equal(n2,n6) # label(not_equal_2_6) # label(axiom). [assumption].
% 0.53/0.90 12 not_equal(n3,n1) # label(not_equal_3_1) # label(axiom). [assumption].
% 0.53/0.90 13 not_equal(n3,n2) # label(not_equal_3_2) # label(axiom). [assumption].
% 0.53/0.90 14 not_equal(n3,n4) # label(not_equal_3_4) # label(axiom). [assumption].
% 0.53/0.90 15 not_equal(n3,n5) # label(not_equal_3_5) # label(axiom). [assumption].
% 0.53/0.90 16 not_equal(n3,n6) # label(not_equal_3_6) # label(axiom). [assumption].
% 0.53/0.90 17 not_equal(n4,n1) # label(not_equal_4_1) # label(axiom). [assumption].
% 0.53/0.90 18 not_equal(n4,n2) # label(not_equal_4_2) # label(axiom). [assumption].
% 0.53/0.90 19 not_equal(n4,n3) # label(not_equal_4_3) # label(axiom). [assumption].
% 0.53/0.90 20 not_equal(n4,n5) # label(not_equal_4_5) # label(axiom). [assumption].
% 0.53/0.90 21 not_equal(n4,n6) # label(not_equal_4_6) # label(axiom). [assumption].
% 0.53/0.90 22 not_equal(n5,n1) # label(not_equal_5_1) # label(axiom). [assumption].
% 0.53/0.90 23 not_equal(n5,n2) # label(not_equal_5_2) # label(axiom). [assumption].
% 0.53/0.90 24 not_equal(n5,n3) # label(not_equal_5_3) # label(axiom). [assumption].
% 0.53/0.90 25 not_equal(n5,n4) # label(not_equal_5_4) # label(axiom). [assumption].
% 0.53/0.90 26 not_equal(n5,n6) # label(not_equal_5_6) # label(axiom). [assumption].
% 0.53/0.90 27 not_equal(n6,n1) # label(not_equal_6_1) # label(axiom). [assumption].
% 0.53/0.90 28 not_equal(n6,n2) # label(not_equal_6_2) # label(axiom). [assumption].
% 0.53/0.90 29 not_equal(n6,n3) # label(not_equal_6_3) # label(axiom). [assumption].
% 0.53/0.90 30 not_equal(n6,n4) # label(not_equal_6_4) # label(axiom). [assumption].
% 0.53/0.90 31 not_equal(n6,n5) # label(not_equal_6_5) # label(axiom). [assumption].
% 0.53/0.90 32 familiar(n1,n2) | not_familiar(n1,n2) | -person(n1) | -person(n2) | -not_equal(n1,n2) # label(familiar_or_not_1_2) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n1,n2) | not_familiar(n1,n2) | -person(n1) | -person(n2). [resolve(32,e,2,a)].
% 0.53/0.90 33 familiar(n1,n3) | not_familiar(n1,n3) | -person(n1) | -person(n3) | -not_equal(n1,n3) # label(familiar_or_not_1_3) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n1,n3) | not_familiar(n1,n3) | -person(n1) | -person(n3). [resolve(33,e,3,a)].
% 0.53/0.90 34 familiar(n1,n4) | not_familiar(n1,n4) | -person(n1) | -person(n4) | -not_equal(n1,n4) # label(familiar_or_not_1_4) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n1,n4) | not_familiar(n1,n4) | -person(n1) | -person(n4). [resolve(34,e,4,a)].
% 0.53/0.90 35 familiar(n1,n5) | not_familiar(n1,n5) | -person(n1) | -person(n5) | -not_equal(n1,n5) # label(familiar_or_not_1_5) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n1,n5) | not_familiar(n1,n5) | -person(n1) | -person(n5). [resolve(35,e,5,a)].
% 0.53/0.90 36 familiar(n1,n6) | not_familiar(n1,n6) | -person(n1) | -person(n6) | -not_equal(n1,n6) # label(familiar_or_not_1_6) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n1,n6) | not_familiar(n1,n6) | -person(n1) | -person(n6). [resolve(36,e,6,a)].
% 0.53/0.90 37 familiar(n2,n1) | not_familiar(n2,n1) | -person(n2) | -person(n1) | -not_equal(n2,n1) # label(familiar_or_not_2_1) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n2,n1) | not_familiar(n2,n1) | -person(n2) | -person(n1). [resolve(37,e,7,a)].
% 0.53/0.90 38 familiar(n2,n2) | not_familiar(n2,n2) | -person(n2) | -person(n2) | -not_equal(n2,n2) # label(familiar_or_not_2_2) # label(axiom). [assumption].
% 0.53/0.90 39 familiar(n2,n3) | not_familiar(n2,n3) | -person(n2) | -person(n3) | -not_equal(n2,n3) # label(familiar_or_not_2_3) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n2,n3) | not_familiar(n2,n3) | -person(n2) | -person(n3). [resolve(39,e,8,a)].
% 0.53/0.90 40 familiar(n2,n4) | not_familiar(n2,n4) | -person(n2) | -person(n4) | -not_equal(n2,n4) # label(familiar_or_not_2_4) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n2,n4) | not_familiar(n2,n4) | -person(n2) | -person(n4). [resolve(40,e,9,a)].
% 0.53/0.90 41 familiar(n2,n5) | not_familiar(n2,n5) | -person(n2) | -person(n5) | -not_equal(n2,n5) # label(familiar_or_not_2_5) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n2,n5) | not_familiar(n2,n5) | -person(n2) | -person(n5). [resolve(41,e,10,a)].
% 0.53/0.90 42 familiar(n2,n6) | not_familiar(n2,n6) | -person(n2) | -person(n6) | -not_equal(n2,n6) # label(familiar_or_not_2_6) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n2,n6) | not_familiar(n2,n6) | -person(n2) | -person(n6). [resolve(42,e,11,a)].
% 0.53/0.90 43 familiar(n3,n1) | not_familiar(n3,n1) | -person(n3) | -person(n1) | -not_equal(n3,n1) # label(familiar_or_not_3_1) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n3,n1) | not_familiar(n3,n1) | -person(n3) | -person(n1). [resolve(43,e,12,a)].
% 0.53/0.90 44 familiar(n3,n2) | not_familiar(n3,n2) | -person(n3) | -person(n2) | -not_equal(n3,n2) # label(familiar_or_not_3_2) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n3,n2) | not_familiar(n3,n2) | -person(n3) | -person(n2). [resolve(44,e,13,a)].
% 0.53/0.90 45 familiar(n3,n3) | not_familiar(n3,n3) | -person(n3) | -person(n3) | -not_equal(n3,n3) # label(familiar_or_not_3_3) # label(axiom). [assumption].
% 0.53/0.90 46 familiar(n3,n4) | not_familiar(n3,n4) | -person(n3) | -person(n4) | -not_equal(n3,n4) # label(familiar_or_not_3_4) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n3,n4) | not_familiar(n3,n4) | -person(n3) | -person(n4). [resolve(46,e,14,a)].
% 0.53/0.90 47 familiar(n3,n5) | not_familiar(n3,n5) | -person(n3) | -person(n5) | -not_equal(n3,n5) # label(familiar_or_not_3_5) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n3,n5) | not_familiar(n3,n5) | -person(n3) | -person(n5). [resolve(47,e,15,a)].
% 0.53/0.90 48 familiar(n3,n6) | not_familiar(n3,n6) | -person(n3) | -person(n6) | -not_equal(n3,n6) # label(familiar_or_not_3_6) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n3,n6) | not_familiar(n3,n6) | -person(n3) | -person(n6). [resolve(48,e,16,a)].
% 0.53/0.90 49 familiar(n4,n1) | not_familiar(n4,n1) | -person(n4) | -person(n1) | -not_equal(n4,n1) # label(familiar_or_not_4_1) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n4,n1) | not_familiar(n4,n1) | -person(n4) | -person(n1). [resolve(49,e,17,a)].
% 0.53/0.90 50 familiar(n4,n2) | not_familiar(n4,n2) | -person(n4) | -person(n2) | -not_equal(n4,n2) # label(familiar_or_not_4_2) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n4,n2) | not_familiar(n4,n2) | -person(n4) | -person(n2). [resolve(50,e,18,a)].
% 0.53/0.90 51 familiar(n4,n3) | not_familiar(n4,n3) | -person(n4) | -person(n3) | -not_equal(n4,n3) # label(familiar_or_not_4_3) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n4,n3) | not_familiar(n4,n3) | -person(n4) | -person(n3). [resolve(51,e,19,a)].
% 0.53/0.90 52 familiar(n4,n4) | not_familiar(n4,n4) | -person(n4) | -person(n4) | -not_equal(n4,n4) # label(familiar_or_not_4_4) # label(axiom). [assumption].
% 0.53/0.90 53 familiar(n4,n5) | not_familiar(n4,n5) | -person(n4) | -person(n5) | -not_equal(n4,n5) # label(familiar_or_not_4_5) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n4,n5) | not_familiar(n4,n5) | -person(n4) | -person(n5). [resolve(53,e,20,a)].
% 0.53/0.90 54 familiar(n4,n6) | not_familiar(n4,n6) | -person(n4) | -person(n6) | -not_equal(n4,n6) # label(familiar_or_not_4_6) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n4,n6) | not_familiar(n4,n6) | -person(n4) | -person(n6). [resolve(54,e,21,a)].
% 0.53/0.90 55 familiar(n5,n1) | not_familiar(n5,n1) | -person(n5) | -person(n1) | -not_equal(n5,n1) # label(familiar_or_not_5_1) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n5,n1) | not_familiar(n5,n1) | -person(n5) | -person(n1). [resolve(55,e,22,a)].
% 0.53/0.90 56 familiar(n5,n2) | not_familiar(n5,n2) | -person(n5) | -person(n2) | -not_equal(n5,n2) # label(familiar_or_not_5_2) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n5,n2) | not_familiar(n5,n2) | -person(n5) | -person(n2). [resolve(56,e,23,a)].
% 0.53/0.90 57 familiar(n5,n3) | not_familiar(n5,n3) | -person(n5) | -person(n3) | -not_equal(n5,n3) # label(familiar_or_not_5_3) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n5,n3) | not_familiar(n5,n3) | -person(n5) | -person(n3). [resolve(57,e,24,a)].
% 0.53/0.90 58 familiar(n5,n4) | not_familiar(n5,n4) | -person(n5) | -person(n4) | -not_equal(n5,n4) # label(familiar_or_not_5_4) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n5,n4) | not_familiar(n5,n4) | -person(n5) | -person(n4). [resolve(58,e,25,a)].
% 0.53/0.90 59 familiar(n5,n5) | not_familiar(n5,n5) | -person(n5) | -person(n5) | -not_equal(n5,n5) # label(familiar_or_not_5_5) # label(axiom). [assumption].
% 0.53/0.90 60 familiar(n5,n6) | not_familiar(n5,n6) | -person(n5) | -person(n6) | -not_equal(n5,n6) # label(familiar_or_not_5_6) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n5,n6) | not_familiar(n5,n6) | -person(n5) | -person(n6). [resolve(60,e,26,a)].
% 0.53/0.90 61 familiar(n6,n1) | not_familiar(n6,n1) | -person(n6) | -person(n1) | -not_equal(n6,n1) # label(familiar_or_not_6_1) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n6,n1) | not_familiar(n6,n1) | -person(n6) | -person(n1). [resolve(61,e,27,a)].
% 0.53/0.90 62 familiar(n6,n2) | not_familiar(n6,n2) | -person(n6) | -person(n2) | -not_equal(n6,n2) # label(familiar_or_not_6_2) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n6,n2) | not_familiar(n6,n2) | -person(n6) | -person(n2). [resolve(62,e,28,a)].
% 0.53/0.90 63 familiar(n6,n3) | not_familiar(n6,n3) | -person(n6) | -person(n3) | -not_equal(n6,n3) # label(familiar_or_not_6_3) # label(axiom). [assumption].
% 0.53/0.90 Derived: familiar(n6,n3) | not_familiar(n6,n3) | -person(n6) | -person(n3). [resolve(63,e,29,a)].
% 0.53/0.90 64 familiar(n6,n4) | not_familiar(n6,n4) | -person(n6) | -person(n4) | -not_equal(n6,n4) # label(familiar_or_not_6_4) # label(axiom). [assumption].
% 0.58/0.93 Derived: familiar(n6,n4) | not_familiar(n6,n4) | -person(n6) | -person(n4). [resolve(64,e,30,a)].
% 0.58/0.93 65 familiar(n6,n5) | not_familiar(n6,n5) | -person(n6) | -person(n5) | -not_equal(n6,n5) # label(familiar_or_not_6_5) # label(axiom). [assumption].
% 0.58/0.93 Derived: familiar(n6,n5) | not_familiar(n6,n5) | -person(n6) | -person(n5). [resolve(65,e,31,a)].
% 0.58/0.93 66 familiar(n6,n6) | not_familiar(n6,n6) | -person(n6) | -person(n6) | -not_equal(n6,n6) # label(familiar_or_not_6_6) # label(axiom). [assumption].
% 0.58/0.93
% 0.58/0.93 ============================== end predicate elimination =============
% 0.58/0.93
% 0.58/0.93 Auto_denials: (non-Horn, no changes).
% 0.58/0.93
% 0.58/0.93 Term ordering decisions:
% 0.58/0.93 Function symbol KB weights: n1=1. n2=1. n3=1. n4=1. n5=1. n6=1.
% 0.58/0.93
% 0.58/0.93 ============================== end of process initial clauses ========
% 0.58/0.93
% 0.58/0.93 ============================== CLAUSES FOR SEARCH ====================
% 0.58/0.93
% 0.58/0.93 ============================== end of clauses for search =============
% 0.58/0.93
% 0.58/0.93 ============================== SEARCH ================================
% 0.58/0.93
% 0.58/0.93 % Starting search at 0.05 seconds.
% 0.58/0.93
% 0.58/0.93 ============================== STATISTICS ============================
% 0.58/0.93
% 0.58/0.93 Given=416. Generated=796. Kept=446. proofs=0.
% 0.58/0.93 Usable=416. Sos=0. Demods=0. Limbo=0, Disabled=564. Hints=0.
% 0.58/0.93 Megabytes=0.62.
% 0.58/0.93 User_CPU=0.06, System_CPU=0.01, Wall_clock=0.
% 0.58/0.93
% 0.58/0.93 ============================== end of statistics =====================
% 0.58/0.93
% 0.58/0.93 ============================== end of search =========================
% 0.58/0.93
% 0.58/0.93 SEARCH FAILED
% 0.58/0.93
% 0.58/0.93 Exiting with failure.
% 0.58/0.93
% 0.58/0.93 Process 8314 exit (sos_empty) Sat May 28 22:36:56 2022
% 0.58/0.93 Prover9 interrupted
%------------------------------------------------------------------------------