TSTP Solution File: PUZ028-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ028-2 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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.50s 1.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : PUZ028-2 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.13/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sat May 28 22:35:41 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.50/1.03 ============================== Prover9 ===============================
% 0.50/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.50/1.03 Process 18026 was started by sandbox2 on n019.cluster.edu,
% 0.50/1.03 Sat May 28 22:35:41 2022
% 0.50/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17873_n019.cluster.edu".
% 0.50/1.03 ============================== end of head ===========================
% 0.50/1.03
% 0.50/1.03 ============================== INPUT =================================
% 0.50/1.03
% 0.50/1.03 % Reading from file /tmp/Prover9_17873_n019.cluster.edu
% 0.50/1.03
% 0.50/1.03 set(prolog_style_variables).
% 0.50/1.03 set(auto2).
% 0.50/1.03 % set(auto2) -> set(auto).
% 0.50/1.03 % set(auto) -> set(auto_inference).
% 0.50/1.03 % set(auto) -> set(auto_setup).
% 0.50/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.50/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/1.03 % set(auto) -> set(auto_limits).
% 0.50/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/1.03 % set(auto) -> set(auto_denials).
% 0.50/1.03 % set(auto) -> set(auto_process).
% 0.50/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.50/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.50/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.50/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.50/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.50/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.50/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.50/1.03 % set(auto2) -> assign(stats, some).
% 0.50/1.03 % set(auto2) -> clear(echo_input).
% 0.50/1.03 % set(auto2) -> set(quiet).
% 0.50/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.50/1.03 % set(auto2) -> clear(print_given).
% 0.50/1.03 assign(lrs_ticks,-1).
% 0.50/1.03 assign(sos_limit,10000).
% 0.50/1.03 assign(order,kbo).
% 0.50/1.03 set(lex_order_vars).
% 0.50/1.03 clear(print_given).
% 0.50/1.03
% 0.50/1.03 % formulas(sos). % not echoed (39 formulas)
% 0.50/1.03
% 0.50/1.03 ============================== end of input ==========================
% 0.50/1.03
% 0.50/1.03 % From the command line: assign(max_seconds, 300).
% 0.50/1.03
% 0.50/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/1.03
% 0.50/1.03 % Formulas that are not ordinary clauses:
% 0.50/1.03
% 0.50/1.03 ============================== end of process non-clausal formulas ===
% 0.50/1.03
% 0.50/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/1.03
% 0.50/1.03 ============================== PREDICATE ELIMINATION =================
% 0.50/1.03 1 familiar(A,B) | not_familiar(A,B) | -person(A) | -person(B) | -not_equal(A,B) # label(familiar_or_not) # label(axiom). [assumption].
% 0.50/1.03 2 not_equal(n1,n2) # label(not_equal_1_2) # label(axiom). [assumption].
% 0.50/1.03 3 not_equal(n1,n3) # label(not_equal_1_3) # label(axiom). [assumption].
% 0.50/1.03 4 not_equal(n1,n4) # label(not_equal_1_4) # label(axiom). [assumption].
% 0.50/1.03 5 not_equal(n1,n5) # label(not_equal_1_5) # label(axiom). [assumption].
% 0.50/1.03 6 not_equal(n1,n6) # label(not_equal_1_6) # label(axiom). [assumption].
% 0.50/1.03 7 not_equal(n2,n1) # label(not_equal_2_1) # label(axiom). [assumption].
% 0.50/1.03 8 not_equal(n2,n3) # label(not_equal_2_3) # label(axiom). [assumption].
% 0.50/1.03 9 not_equal(n2,n4) # label(not_equal_2_4) # label(axiom). [assumption].
% 0.50/1.03 10 not_equal(n2,n5) # label(not_equal_2_5) # label(axiom). [assumption].
% 0.50/1.03 11 not_equal(n2,n6) # label(not_equal_2_6) # label(axiom). [assumption].
% 0.50/1.03 12 not_equal(n3,n1) # label(not_equal_3_1) # label(axiom). [assumption].
% 0.50/1.03 13 not_equal(n3,n2) # label(not_equal_3_2) # label(axiom). [assumption].
% 0.50/1.03 14 not_equal(n3,n4) # label(not_equal_3_4) # label(axiom). [assumption].
% 0.50/1.03 15 not_equal(n3,n5) # label(not_equal_3_5) # label(axiom). [assumption].
% 0.50/1.03 16 not_equal(n3,n6) # label(not_equal_3_6) # label(axiom). [assumption].
% 0.50/1.03 17 not_equal(n4,n1) # label(not_equal_4_1) # label(axiom). [assumption].
% 0.50/1.03 18 not_equal(n4,n2) # label(not_equal_4_2) # label(axiom). [assumption].
% 0.50/1.03 19 not_equal(n4,n3) # label(not_equal_4_3) # label(axiom). [assumption].
% 0.50/1.03 20 not_equal(n4,n5) # label(not_equal_4_5) # label(axiom). [assumption].
% 0.50/1.03 21 not_equal(n4,n6) # label(not_equal_4_6) # label(axiom). [assumption].
% 0.50/1.03 22 not_equal(n5,n1) # label(not_equal_5_1) # label(axiom). [assumption].
% 0.50/1.03 23 not_equal(n5,n2) # label(not_equal_5_2) # label(axiom). [assumption].
% 0.50/1.05 24 not_equal(n5,n3) # label(not_equal_5_3) # label(axiom). [assumption].
% 0.50/1.05 25 not_equal(n5,n4) # label(not_equal_5_4) # label(axiom). [assumption].
% 0.50/1.05 26 not_equal(n5,n6) # label(not_equal_5_6) # label(axiom). [assumption].
% 0.50/1.05 27 not_equal(n6,n1) # label(not_equal_6_1) # label(axiom). [assumption].
% 0.50/1.05 28 not_equal(n6,n2) # label(not_equal_6_2) # label(axiom). [assumption].
% 0.50/1.05 29 not_equal(n6,n3) # label(not_equal_6_3) # label(axiom). [assumption].
% 0.50/1.05 30 not_equal(n6,n4) # label(not_equal_6_4) # label(axiom). [assumption].
% 0.50/1.05 31 not_equal(n6,n5) # label(not_equal_6_5) # label(axiom). [assumption].
% 0.50/1.05 Derived: familiar(n1,n2) | not_familiar(n1,n2) | -person(n1) | -person(n2). [resolve(1,e,2,a)].
% 0.50/1.05 Derived: familiar(n1,n3) | not_familiar(n1,n3) | -person(n1) | -person(n3). [resolve(1,e,3,a)].
% 0.50/1.05 Derived: familiar(n1,n4) | not_familiar(n1,n4) | -person(n1) | -person(n4). [resolve(1,e,4,a)].
% 0.50/1.05 Derived: familiar(n1,n5) | not_familiar(n1,n5) | -person(n1) | -person(n5). [resolve(1,e,5,a)].
% 0.50/1.05 Derived: familiar(n1,n6) | not_familiar(n1,n6) | -person(n1) | -person(n6). [resolve(1,e,6,a)].
% 0.50/1.05 Derived: familiar(n2,n1) | not_familiar(n2,n1) | -person(n2) | -person(n1). [resolve(1,e,7,a)].
% 0.50/1.05 Derived: familiar(n2,n3) | not_familiar(n2,n3) | -person(n2) | -person(n3). [resolve(1,e,8,a)].
% 0.50/1.05 Derived: familiar(n2,n4) | not_familiar(n2,n4) | -person(n2) | -person(n4). [resolve(1,e,9,a)].
% 0.50/1.05 Derived: familiar(n2,n5) | not_familiar(n2,n5) | -person(n2) | -person(n5). [resolve(1,e,10,a)].
% 0.50/1.05 Derived: familiar(n2,n6) | not_familiar(n2,n6) | -person(n2) | -person(n6). [resolve(1,e,11,a)].
% 0.50/1.05 Derived: familiar(n3,n1) | not_familiar(n3,n1) | -person(n3) | -person(n1). [resolve(1,e,12,a)].
% 0.50/1.05 Derived: familiar(n3,n2) | not_familiar(n3,n2) | -person(n3) | -person(n2). [resolve(1,e,13,a)].
% 0.50/1.05 Derived: familiar(n3,n4) | not_familiar(n3,n4) | -person(n3) | -person(n4). [resolve(1,e,14,a)].
% 0.50/1.05 Derived: familiar(n3,n5) | not_familiar(n3,n5) | -person(n3) | -person(n5). [resolve(1,e,15,a)].
% 0.50/1.05 Derived: familiar(n3,n6) | not_familiar(n3,n6) | -person(n3) | -person(n6). [resolve(1,e,16,a)].
% 0.50/1.05 Derived: familiar(n4,n1) | not_familiar(n4,n1) | -person(n4) | -person(n1). [resolve(1,e,17,a)].
% 0.50/1.05 Derived: familiar(n4,n2) | not_familiar(n4,n2) | -person(n4) | -person(n2). [resolve(1,e,18,a)].
% 0.50/1.05 Derived: familiar(n4,n3) | not_familiar(n4,n3) | -person(n4) | -person(n3). [resolve(1,e,19,a)].
% 0.50/1.05 Derived: familiar(n4,n5) | not_familiar(n4,n5) | -person(n4) | -person(n5). [resolve(1,e,20,a)].
% 0.50/1.05 Derived: familiar(n4,n6) | not_familiar(n4,n6) | -person(n4) | -person(n6). [resolve(1,e,21,a)].
% 0.50/1.05 Derived: familiar(n5,n1) | not_familiar(n5,n1) | -person(n5) | -person(n1). [resolve(1,e,22,a)].
% 0.50/1.05 Derived: familiar(n5,n2) | not_familiar(n5,n2) | -person(n5) | -person(n2). [resolve(1,e,23,a)].
% 0.50/1.05 Derived: familiar(n5,n3) | not_familiar(n5,n3) | -person(n5) | -person(n3). [resolve(1,e,24,a)].
% 0.50/1.05 Derived: familiar(n5,n4) | not_familiar(n5,n4) | -person(n5) | -person(n4). [resolve(1,e,25,a)].
% 0.50/1.05 Derived: familiar(n5,n6) | not_familiar(n5,n6) | -person(n5) | -person(n6). [resolve(1,e,26,a)].
% 0.50/1.05 Derived: familiar(n6,n1) | not_familiar(n6,n1) | -person(n6) | -person(n1). [resolve(1,e,27,a)].
% 0.50/1.05 Derived: familiar(n6,n2) | not_familiar(n6,n2) | -person(n6) | -person(n2). [resolve(1,e,28,a)].
% 0.50/1.05 Derived: familiar(n6,n3) | not_familiar(n6,n3) | -person(n6) | -person(n3). [resolve(1,e,29,a)].
% 0.50/1.05 Derived: familiar(n6,n4) | not_familiar(n6,n4) | -person(n6) | -person(n4). [resolve(1,e,30,a)].
% 0.50/1.05 Derived: familiar(n6,n5) | not_familiar(n6,n5) | -person(n6) | -person(n5). [resolve(1,e,31,a)].
% 0.50/1.05
% 0.50/1.05 ============================== end predicate elimination =============
% 0.50/1.05
% 0.50/1.05 Auto_denials: (non-Horn, no changes).
% 0.50/1.05
% 0.50/1.05 Term ordering decisions:
% 0.50/1.05 Function symbol KB weights: n1=1. n2=1. n3=1. n4=1. n5=1. n6=1.
% 0.50/1.05
% 0.50/1.05 ============================== end of process initial clauses ========
% 0.50/1.05
% 0.50/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.50/1.05
% 0.50/1.05 ============================== end of clauses for search =============
% 0.50/1.05
% 0.50/1.05 ============================== SEARCH ================================
% 0.50/1.05
% 0.50/1.05 % Starting search at 0.01 seconds.
% 0.50/1.05
% 0.50/1.05 ============================== STATISTICS ============================
% 0.50/1.05
% 0.50/1.05 Given=348. Generated=890. Kept=348. proofs=0.
% 0.50/1.05 Usable=348. Sos=0. Demods=0. Limbo=0, Disabled=69. Hints=0.
% 0.50/1.05 Megabytes=0.26.
% 0.50/1.05 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.50/1.05
% 0.50/1.05 ============================== end of statistics =====================
% 0.50/1.05
% 0.50/1.05 ============================== end of search =========================
% 0.50/1.05
% 0.50/1.05 SEARCH FAILED
% 0.50/1.05
% 0.50/1.05 Exiting with failure.
% 0.50/1.05
% 0.50/1.05 Process 18026 exit (sos_empty) Sat May 28 22:35:41 2022
% 0.50/1.05 Prover9 interrupted
%------------------------------------------------------------------------------