TSTP Solution File: COM001-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : COM001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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 : Fri Jul 15 01:38:15 EDT 2022
% Result : Unsatisfiable 0.41s 0.98s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n026.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 : Thu Jun 16 17:11:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.98 ============================== Prover9 ===============================
% 0.41/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.98 Process 24919 was started by sandbox on n026.cluster.edu,
% 0.41/0.98 Thu Jun 16 17:11:54 2022
% 0.41/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24765_n026.cluster.edu".
% 0.41/0.98 ============================== end of head ===========================
% 0.41/0.98
% 0.41/0.98 ============================== INPUT =================================
% 0.41/0.98
% 0.41/0.98 % Reading from file /tmp/Prover9_24765_n026.cluster.edu
% 0.41/0.98
% 0.41/0.98 set(prolog_style_variables).
% 0.41/0.98 set(auto2).
% 0.41/0.98 % set(auto2) -> set(auto).
% 0.41/0.98 % set(auto) -> set(auto_inference).
% 0.41/0.98 % set(auto) -> set(auto_setup).
% 0.41/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.98 % set(auto) -> set(auto_limits).
% 0.41/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.98 % set(auto) -> set(auto_denials).
% 0.41/0.98 % set(auto) -> set(auto_process).
% 0.41/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.98 % set(auto2) -> assign(stats, some).
% 0.41/0.98 % set(auto2) -> clear(echo_input).
% 0.41/0.98 % set(auto2) -> set(quiet).
% 0.41/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.98 % set(auto2) -> clear(print_given).
% 0.41/0.98 assign(lrs_ticks,-1).
% 0.41/0.98 assign(sos_limit,10000).
% 0.41/0.98 assign(order,kbo).
% 0.41/0.98 set(lex_order_vars).
% 0.41/0.98 clear(print_given).
% 0.41/0.98
% 0.41/0.98 % formulas(sos). % not echoed (11 formulas)
% 0.41/0.98
% 0.41/0.98 ============================== end of input ==========================
% 0.41/0.98
% 0.41/0.98 % From the command line: assign(max_seconds, 300).
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.98
% 0.41/0.98 % Formulas that are not ordinary clauses:
% 0.41/0.98
% 0.41/0.98 ============================== end of process non-clausal formulas ===
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.98
% 0.41/0.98 ============================== PREDICATE ELIMINATION =================
% 0.41/0.98 1 succeeds(A,B) | -has(B,goto(C)) | -labels(C,A) # label(goto_success) # label(axiom). [assumption].
% 0.41/0.98 2 labels(loop,p3) # label(label_state_3) # label(hypothesis). [assumption].
% 0.41/0.98 Derived: succeeds(p3,A) | -has(A,goto(loop)). [resolve(1,c,2,a)].
% 0.41/0.98 3 succeeds(A,B) | -follows(A,B) # label(direct_success) # label(axiom). [assumption].
% 0.41/0.98 4 follows(p5,p4) # label(transition_4_to_5) # label(hypothesis). [assumption].
% 0.41/0.98 5 follows(p8,p3) # label(transition_3_to_8) # label(hypothesis). [assumption].
% 0.41/0.98 Derived: succeeds(p5,p4). [resolve(3,b,4,a)].
% 0.41/0.98 Derived: succeeds(p8,p3). [resolve(3,b,5,a)].
% 0.41/0.98 6 succeeds(A,B) | -has(B,ifthen(C,A)) # label(conditional_success) # label(axiom). [assumption].
% 0.41/0.98 7 has(p4,goto(out)) # label(state_4) # label(hypothesis). [assumption].
% 0.41/0.98 8 has(p8,goto(loop)) # label(state_8) # label(hypothesis). [assumption].
% 0.41/0.98 9 has(p3,ifthen(equal_function(register_j,n),p4)) # label(state_3) # label(hypothesis). [assumption].
% 0.41/0.98 Derived: succeeds(p4,p3). [resolve(6,b,9,a)].
% 0.41/0.98 10 succeeds(p3,A) | -has(A,goto(loop)). [resolve(1,c,2,a)].
% 0.41/0.98 Derived: succeeds(p3,p8). [resolve(10,b,8,a)].
% 0.41/0.98
% 0.41/0.98 ============================== end predicate elimination =============
% 0.41/0.98
% 0.41/0.98 Auto_denials:
% 0.41/0.98 % copying label prove_there_is_a_loop_through_p3 to answer in negative clause
% 0.41/0.98
% 0.41/0.98 Term ordering decisions:
% 0.41/0.98 Function symbol KB weights: p3=1. p4=1. p8=1. p5=1.
% 0.41/0.98
% 0.41/0.98 ============================== end of process initial clauses ========
% 0.41/0.98
% 0.41/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.98
% 0.41/0.98 ============================== end of clauses for search =============
% 0.41/0.98
% 0.41/0.98 ============================== SEARCH ================================
% 0.41/0.98
% 0.41/0.98 % Starting search at 0.01 seconds.
% 0.41/0.98
% 0.41/0.98 ============================== PROOF =================================
% 0.41/0.98 % SZS status Unsatisfiable
% 0.41/0.98 % SZS output start Refutation
% 0.41/0.98
% 0.41/0.98 % Proof 1 at 0.01 (+ 0.00) seconds: prove_there_is_a_loop_through_p3.
% 0.41/0.98 % Length of proof is 12.
% 0.41/0.98 % Level of proof is 3.
% 0.41/0.98 % Maximum clause weight is 9.000.
% 0.41/0.98 % Given clauses 4.
% 0.41/0.98
% 0.41/0.98 1 succeeds(A,B) | -has(B,goto(C)) | -labels(C,A) # label(goto_success) # label(axiom). [assumption].
% 0.41/0.98 2 labels(loop,p3) # label(label_state_3) # label(hypothesis). [assumption].
% 0.41/0.98 3 succeeds(A,B) | -follows(A,B) # label(direct_success) # label(axiom). [assumption].
% 0.41/0.98 5 follows(p8,p3) # label(transition_3_to_8) # label(hypothesis). [assumption].
% 0.41/0.98 8 has(p8,goto(loop)) # label(state_8) # label(hypothesis). [assumption].
% 0.41/0.98 10 succeeds(p3,A) | -has(A,goto(loop)). [resolve(1,c,2,a)].
% 0.41/0.98 11 -succeeds(p3,p3) # label(prove_there_is_a_loop_through_p3) # label(negated_conjecture) # answer(prove_there_is_a_loop_through_p3). [assumption].
% 0.41/0.98 12 succeeds(A,B) | -succeeds(A,C) | -succeeds(C,B) # label(transitivity_of_success) # label(axiom). [assumption].
% 0.41/0.98 14 succeeds(p8,p3). [resolve(3,b,5,a)].
% 0.41/0.98 16 succeeds(p3,p8). [resolve(10,b,8,a)].
% 0.41/0.98 18 -succeeds(p3,p8) # answer(prove_there_is_a_loop_through_p3). [ur(12,a,11,a,c,14,a)].
% 0.41/0.98 19 $F # answer(prove_there_is_a_loop_through_p3). [resolve(18,a,16,a)].
% 0.41/0.98
% 0.41/0.98 % SZS output end Refutation
% 0.41/0.98 ============================== end of proof ==========================
% 0.41/0.98
% 0.41/0.98 ============================== STATISTICS ============================
% 0.41/0.98
% 0.41/0.98 Given=4. Generated=8. Kept=8. proofs=1.
% 0.41/0.98 Usable=4. Sos=3. Demods=0. Limbo=0, Disabled=16. Hints=0.
% 0.41/0.98 Megabytes=0.03.
% 0.41/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.98
% 0.41/0.98 ============================== end of statistics =====================
% 0.41/0.98
% 0.41/0.98 ============================== end of search =========================
% 0.41/0.98
% 0.41/0.98 THEOREM PROVED
% 0.41/0.98 % SZS status Unsatisfiable
% 0.41/0.98
% 0.41/0.98 Exiting with 1 proof.
% 0.41/0.98
% 0.41/0.98 Process 24919 exit (max_proofs) Thu Jun 16 17:11:54 2022
% 0.41/0.98 Prover9 interrupted
%------------------------------------------------------------------------------