TSTP Solution File: MSC015-1.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MSC015-1.005 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Sun Jul 17 22:56:37 EDT 2022
% Result : Unsatisfiable 0.45s 1.00s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MSC015-1.005 : TPTP v8.1.0. Released v3.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 16:03:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 2970 was started by sandbox on n021.cluster.edu,
% 0.45/1.00 Fri Jul 1 16:03:44 2022
% 0.45/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2595_n021.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_2595_n021.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (7 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00
% 0.45/1.00 ============================== end predicate elimination =============
% 0.45/1.00
% 0.45/1.00 Auto_denials:
% 0.45/1.00 % copying label goal to answer in negative clause
% 0.45/1.00
% 0.45/1.00 Term ordering decisions:
% 0.45/1.00 Function symbol KB weights: s0=1. s1=1.
% 0.45/1.00
% 0.45/1.00 ============================== end of process initial clauses ========
% 0.45/1.00
% 0.45/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.00
% 0.45/1.00 ============================== end of clauses for search =============
% 0.45/1.00
% 0.45/1.00 ============================== SEARCH ================================
% 0.45/1.00
% 0.45/1.00 % Starting search at 0.01 seconds.
% 0.45/1.00
% 0.45/1.00 ============================== PROOF =================================
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00 % SZS output start Refutation
% 0.45/1.00
% 0.45/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: goal.
% 0.45/1.00 % Length of proof is 39.
% 0.45/1.00 % Level of proof is 19.
% 0.45/1.00 % Maximum clause weight is 12.000.
% 0.45/1.00 % Given clauses 36.
% 0.45/1.00
% 0.45/1.00 1 p(s0,s0,s0,s0,s0) # label(init) # label(axiom). [assumption].
% 0.45/1.00 2 -p(s1,s1,s1,s1,s1) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.45/1.00 3 -p(A,B,C,D,s0) | p(A,B,C,D,s1) # label(rule1) # label(axiom). [assumption].
% 0.45/1.00 4 -p(A,B,C,s0,s1) | p(A,B,C,s1,s0) # label(rule2) # label(axiom). [assumption].
% 0.45/1.00 5 -p(A,B,s0,s1,s1) | p(A,B,s1,s0,s0) # label(rule3) # label(axiom). [assumption].
% 0.45/1.00 6 -p(A,s0,s1,s1,s1) | p(A,s1,s0,s0,s0) # label(rule4) # label(axiom). [assumption].
% 0.45/1.00 7 -p(s0,s1,s1,s1,s1) | p(s1,s0,s0,s0,s0) # label(rule5) # label(axiom). [assumption].
% 0.45/1.00 8 -p(s1,s1,s1,s1,s0) # answer(goal). [resolve(3,b,2,a)].
% 0.45/1.00 9 p(s0,s0,s0,s0,s1). [ur(3,a,1,a)].
% 0.45/1.00 10 -p(s1,s1,s1,s0,s1) # answer(goal). [resolve(8,a,4,b)].
% 0.45/1.00 11 -p(s1,s1,s1,s0,s0) # answer(goal). [resolve(10,a,3,b)].
% 0.45/1.00 12 -p(s1,s1,s0,s1,s1) # answer(goal). [resolve(11,a,5,b)].
% 0.45/1.00 13 -p(s1,s1,s0,s1,s0) # answer(goal). [resolve(12,a,3,b)].
% 0.45/1.00 14 -p(s1,s1,s0,s0,s1) # answer(goal). [resolve(13,a,4,b)].
% 0.45/1.00 15 p(s0,s0,s0,s1,s0). [ur(4,a,9,a)].
% 0.45/1.00 16 p(s0,s0,s0,s1,s1). [ur(3,a,15,a)].
% 0.45/1.00 17 p(s0,s0,s1,s0,s0). [ur(5,a,16,a)].
% 0.45/1.00 18 p(s0,s0,s1,s0,s1). [ur(3,a,17,a)].
% 0.45/1.00 19 -p(s1,s1,s0,s0,s0) # answer(goal). [resolve(14,a,3,b)].
% 0.45/1.00 20 -p(s1,s0,s1,s1,s1) # answer(goal). [resolve(19,a,6,b)].
% 0.45/1.00 21 -p(s1,s0,s1,s1,s0) # answer(goal). [resolve(20,a,3,b)].
% 0.45/1.00 22 -p(s1,s0,s1,s0,s1) # answer(goal). [resolve(21,a,4,b)].
% 0.45/1.00 23 -p(s1,s0,s1,s0,s0) # answer(goal). [resolve(22,a,3,b)].
% 0.45/1.00 24 p(s0,s0,s1,s1,s0). [ur(4,a,18,a)].
% 0.45/1.00 25 p(s0,s0,s1,s1,s1). [ur(3,a,24,a)].
% 0.45/1.00 26 p(s0,s1,s0,s0,s0). [ur(6,a,25,a)].
% 0.45/1.00 27 p(s0,s1,s0,s0,s1). [ur(3,a,26,a)].
% 0.45/1.00 28 -p(s1,s0,s0,s1,s1) # answer(goal). [resolve(23,a,5,b)].
% 0.45/1.00 29 -p(s1,s0,s0,s1,s0) # answer(goal). [resolve(28,a,3,b)].
% 0.45/1.00 30 -p(s1,s0,s0,s0,s1) # answer(goal). [resolve(29,a,4,b)].
% 0.45/1.00 31 -p(s1,s0,s0,s0,s0) # answer(goal). [resolve(30,a,3,b)].
% 0.45/1.00 32 -p(s0,s1,s1,s1,s1) # answer(goal). [resolve(31,a,7,b)].
% 0.45/1.00 33 p(s0,s1,s0,s1,s0). [ur(4,a,27,a)].
% 0.45/1.00 34 p(s0,s1,s0,s1,s1). [ur(3,a,33,a)].
% 0.45/1.00 35 p(s0,s1,s1,s0,s0). [ur(5,a,34,a)].
% 0.45/1.00 36 p(s0,s1,s1,s0,s1). [ur(3,a,35,a)].
% 0.45/1.00 37 -p(s0,s1,s1,s1,s0) # answer(goal). [resolve(32,a,3,b)].
% 0.45/1.00 38 -p(s0,s1,s1,s0,s1) # answer(goal). [resolve(37,a,4,b)].
% 0.45/1.00 39 $F # answer(goal). [resolve(38,a,36,a)].
% 0.45/1.00
% 0.45/1.00 % SZS output end Refutation
% 0.45/1.00 ============================== end of proof ==========================
% 0.45/1.00
% 0.45/1.00 ============================== STATISTICS ============================
% 0.45/1.00
% 0.45/1.00 Given=36. Generated=55. Kept=38. proofs=1.
% 0.45/1.00 Usable=35. Sos=1. Demods=0. Limbo=0, Disabled=8. Hints=0.
% 0.45/1.00 Megabytes=0.04.
% 0.45/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of statistics =====================
% 0.45/1.00
% 0.45/1.00 ============================== end of search =========================
% 0.45/1.00
% 0.45/1.00 THEOREM PROVED
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00
% 0.45/1.00 Exiting with 1 proof.
% 0.45/1.00
% 0.45/1.00 Process 2970 exit (max_proofs) Fri Jul 1 16:03:44 2022
% 0.45/1.00 Prover9 interrupted
%------------------------------------------------------------------------------