TSTP Solution File: PUZ012-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ012-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:50 EDT 2022
% Result : Unsatisfiable 0.42s 1.01s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PUZ012-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun May 29 03:29:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.01 ============================== Prover9 ===============================
% 0.42/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.01 Process 20165 was started by sandbox2 on n023.cluster.edu,
% 0.42/1.01 Sun May 29 03:29:58 2022
% 0.42/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19899_n023.cluster.edu".
% 0.42/1.01 ============================== end of head ===========================
% 0.42/1.01
% 0.42/1.01 ============================== INPUT =================================
% 0.42/1.01
% 0.42/1.01 % Reading from file /tmp/Prover9_19899_n023.cluster.edu
% 0.42/1.01
% 0.42/1.01 set(prolog_style_variables).
% 0.42/1.01 set(auto2).
% 0.42/1.01 % set(auto2) -> set(auto).
% 0.42/1.01 % set(auto) -> set(auto_inference).
% 0.42/1.01 % set(auto) -> set(auto_setup).
% 0.42/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.01 % set(auto) -> set(auto_limits).
% 0.42/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.01 % set(auto) -> set(auto_denials).
% 0.42/1.01 % set(auto) -> set(auto_process).
% 0.42/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.01 % set(auto2) -> assign(stats, some).
% 0.42/1.01 % set(auto2) -> clear(echo_input).
% 0.42/1.01 % set(auto2) -> set(quiet).
% 0.42/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.01 % set(auto2) -> clear(print_given).
% 0.42/1.01 assign(lrs_ticks,-1).
% 0.42/1.01 assign(sos_limit,10000).
% 0.42/1.01 assign(order,kbo).
% 0.42/1.01 set(lex_order_vars).
% 0.42/1.01 clear(print_given).
% 0.42/1.01
% 0.42/1.01 % formulas(sos). % not echoed (18 formulas)
% 0.42/1.01
% 0.42/1.01 ============================== end of input ==========================
% 0.42/1.01
% 0.42/1.01 % From the command line: assign(max_seconds, 300).
% 0.42/1.01
% 0.42/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.01
% 0.42/1.01 % Formulas that are not ordinary clauses:
% 0.42/1.01
% 0.42/1.01 ============================== end of process non-clausal formulas ===
% 0.42/1.01
% 0.42/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.01
% 0.42/1.01 ============================== PREDICATE ELIMINATION =================
% 0.42/1.01 1 -equal_fruits(apples,bananas) # label(apples_not_bananas) # label(axiom). [assumption].
% 0.42/1.01 2 equal_fruits(A,A) # label(reflexivity_for_fruits) # label(axiom). [assumption].
% 0.42/1.01 3 -equal_fruits(bananas,oranges) # label(bananas_not_oranges) # label(axiom). [assumption].
% 0.42/1.01 4 -equal_fruits(apples,oranges) # label(apples_not_oranges) # label(axiom). [assumption].
% 0.42/1.01 5 -contains(A,B) | -contains(A,C) | equal_fruits(B,C) # label(contains_is_well_defined1) # label(axiom). [assumption].
% 0.42/1.01 Derived: -contains(A,apples) | -contains(A,bananas). [resolve(5,c,1,a)].
% 0.42/1.01 Derived: -contains(A,bananas) | -contains(A,oranges). [resolve(5,c,3,a)].
% 0.42/1.01 Derived: -contains(A,apples) | -contains(A,oranges). [resolve(5,c,4,a)].
% 0.42/1.01 6 -equal_boxes(boxa,boxb) # label(boxa_not_boxb) # label(axiom). [assumption].
% 0.42/1.01 7 equal_boxes(A,A) # label(reflexivity_for_boxes) # label(axiom). [assumption].
% 0.42/1.01 8 -equal_boxes(boxb,boxc) # label(boxb_not_boxc) # label(axiom). [assumption].
% 0.42/1.01 9 -equal_boxes(boxa,boxc) # label(boxa_not_boxc) # label(axiom). [assumption].
% 0.42/1.01 10 -contains(A,B) | -contains(C,B) | equal_boxes(A,C) # label(contains_is_well_defined2) # label(axiom). [assumption].
% 0.42/1.01 Derived: -contains(boxa,A) | -contains(boxb,A). [resolve(10,c,6,a)].
% 0.42/1.01 Derived: -contains(boxb,A) | -contains(boxc,A). [resolve(10,c,8,a)].
% 0.42/1.01 Derived: -contains(boxa,A) | -contains(boxc,A). [resolve(10,c,9,a)].
% 0.42/1.01 11 -label(A,B) | -contains(A,B) # label(label_is_wrong) # label(axiom). [assumption].
% 0.42/1.01 12 label(boxa,apples) # label(boxa_labelled_apples) # label(hypothesis). [assumption].
% 0.42/1.01 13 label(boxb,oranges) # label(boxb_labelled_oranges) # label(hypothesis). [assumption].
% 0.42/1.01 14 label(boxc,bananas) # label(boxc_labelled_bananas) # label(hypothesis). [assumption].
% 0.42/1.01 Derived: -contains(boxa,apples). [resolve(11,a,12,a)].
% 0.42/1.01 Derived: -contains(boxb,oranges). [resolve(11,a,13,a)].
% 0.42/1.01 Derived: -contains(boxc,bananas). [resolve(11,a,14,a)].
% 0.42/1.01
% 0.42/1.01 ============================== end predicate elimination =============
% 0.42/1.01
% 0.42/1.01 Auto_denials: (non-Horn, no changes).
% 0.42/1.01
% 0.42/1.01 Term ordering decisions:
% 0.42/1.01 Function symbol KB weights: apples=1. boxb=1. bananas=1. boxa=1. boxc=1. oranges=1.
% 0.42/1.01
% 0.42/1.01 ============================== end of process initial clauses ========
% 0.42/1.01
% 0.42/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.01
% 0.42/1.01 ============================== end of clauses for search =============
% 0.42/1.01
% 0.42/1.01 ============================== SEARCH ================================
% 0.42/1.01
% 0.42/1.01 % Starting search at 0.01 seconds.
% 0.42/1.01
% 0.42/1.01 ============================== PROOF =================================
% 0.42/1.01 % SZS status Unsatisfiable
% 0.42/1.01 % SZS output start Refutation
% 0.42/1.01
% 0.42/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.42/1.01 % Length of proof is 18.
% 0.42/1.01 % Level of proof is 4.
% 0.42/1.01 % Maximum clause weight is 9.000.
% 0.42/1.01 % Given clauses 13.
% 0.42/1.01
% 0.42/1.01 1 -equal_fruits(apples,bananas) # label(apples_not_bananas) # label(axiom). [assumption].
% 0.42/1.01 5 -contains(A,B) | -contains(A,C) | equal_fruits(B,C) # label(contains_is_well_defined1) # label(axiom). [assumption].
% 0.42/1.01 8 -equal_boxes(boxb,boxc) # label(boxb_not_boxc) # label(axiom). [assumption].
% 0.42/1.01 10 -contains(A,B) | -contains(C,B) | equal_boxes(A,C) # label(contains_is_well_defined2) # label(axiom). [assumption].
% 0.42/1.01 11 -label(A,B) | -contains(A,B) # label(label_is_wrong) # label(axiom). [assumption].
% 0.42/1.01 14 label(boxc,bananas) # label(boxc_labelled_bananas) # label(hypothesis). [assumption].
% 0.42/1.01 15 contains(boxb,apples) # label(boxb_contains_apples) # label(hypothesis). [assumption].
% 0.42/1.01 16 contains(boxa,A) | contains(boxb,A) | contains(boxc,A) # label(each_thing_is_in_a_box) # label(axiom). [assumption].
% 0.42/1.01 17 contains(A,apples) | contains(A,bananas) | contains(A,oranges) # label(each_box_contains_something) # label(axiom). [assumption].
% 0.42/1.01 18 -contains(boxa,bananas) | -contains(boxc,oranges) # label(prove_boxa_contains_bananas_and_boxc_oranges) # label(negated_conjecture). [assumption].
% 0.42/1.01 19 -contains(A,apples) | -contains(A,bananas). [resolve(5,c,1,a)].
% 0.42/1.01 23 -contains(boxb,A) | -contains(boxc,A). [resolve(10,c,8,a)].
% 0.42/1.01 27 -contains(boxc,bananas). [resolve(11,a,14,a)].
% 0.42/1.01 28 -contains(boxa,bananas) | contains(boxc,apples). [resolve(18,b,17,c),unit_del(c,27)].
% 0.42/1.01 31 -contains(boxb,bananas). [ur(19,a,15,a)].
% 0.42/1.01 34 -contains(boxc,apples). [ur(23,a,15,a)].
% 0.42/1.01 35 -contains(boxa,bananas). [back_unit_del(28),unit_del(b,34)].
% 0.42/1.01 37 $F. [resolve(27,a,16,c),unit_del(a,35),unit_del(b,31)].
% 0.42/1.01
% 0.42/1.01 % SZS output end Refutation
% 0.42/1.01 ============================== end of proof ==========================
% 0.42/1.01
% 0.42/1.01 ============================== STATISTICS ============================
% 0.42/1.01
% 0.42/1.01 Given=13. Generated=33. Kept=22. proofs=1.
% 0.42/1.01 Usable=12. Sos=4. Demods=0. Limbo=0, Disabled=33. Hints=0.
% 0.42/1.01 Megabytes=0.04.
% 0.42/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/1.01
% 0.42/1.01 ============================== end of statistics =====================
% 0.42/1.01
% 0.42/1.01 ============================== end of search =========================
% 0.42/1.01
% 0.42/1.01 THEOREM PROVED
% 0.42/1.01 % SZS status Unsatisfiable
% 0.42/1.01
% 0.42/1.01 Exiting with 1 proof.
% 0.42/1.01
% 0.42/1.01 Process 20165 exit (max_proofs) Sun May 29 03:29:58 2022
% 0.42/1.01 Prover9 interrupted
%------------------------------------------------------------------------------