TSTP Solution File: ROB023-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ROB023-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 20:55:31 EDT 2022
% Result : Unsatisfiable 0.73s 1.01s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ROB023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 15:10:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.01 ============================== Prover9 ===============================
% 0.73/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.01 Process 20277 was started by sandbox on n024.cluster.edu,
% 0.73/1.01 Thu Jun 9 15:10:50 2022
% 0.73/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20124_n024.cluster.edu".
% 0.73/1.01 ============================== end of head ===========================
% 0.73/1.01
% 0.73/1.01 ============================== INPUT =================================
% 0.73/1.01
% 0.73/1.01 % Reading from file /tmp/Prover9_20124_n024.cluster.edu
% 0.73/1.01
% 0.73/1.01 set(prolog_style_variables).
% 0.73/1.01 set(auto2).
% 0.73/1.01 % set(auto2) -> set(auto).
% 0.73/1.01 % set(auto) -> set(auto_inference).
% 0.73/1.01 % set(auto) -> set(auto_setup).
% 0.73/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.01 % set(auto) -> set(auto_limits).
% 0.73/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.01 % set(auto) -> set(auto_denials).
% 0.73/1.01 % set(auto) -> set(auto_process).
% 0.73/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.01 % set(auto2) -> assign(stats, some).
% 0.73/1.01 % set(auto2) -> clear(echo_input).
% 0.73/1.01 % set(auto2) -> set(quiet).
% 0.73/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.01 % set(auto2) -> clear(print_given).
% 0.73/1.01 assign(lrs_ticks,-1).
% 0.73/1.01 assign(sos_limit,10000).
% 0.73/1.01 assign(order,kbo).
% 0.73/1.01 set(lex_order_vars).
% 0.73/1.01 clear(print_given).
% 0.73/1.01
% 0.73/1.01 % formulas(sos). % not echoed (5 formulas)
% 0.73/1.01
% 0.73/1.01 ============================== end of input ==========================
% 0.73/1.01
% 0.73/1.01 % From the command line: assign(max_seconds, 300).
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.01
% 0.73/1.01 % Formulas that are not ordinary clauses:
% 0.73/1.01
% 0.73/1.01 ============================== end of process non-clausal formulas ===
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.01
% 0.73/1.01 ============================== PREDICATE ELIMINATION =================
% 0.73/1.01
% 0.73/1.01 ============================== end predicate elimination =============
% 0.73/1.01
% 0.73/1.01 Auto_denials:
% 0.73/1.01 % copying label prove_huntingtons_axiom to answer in negative clause
% 0.73/1.01
% 0.73/1.01 Term ordering decisions:
% 0.73/1.01
% 0.73/1.01 % Assigning unary symbol negate kb_weight 0 and highest precedence (5).
% 0.73/1.01 Function symbol KB weights: a=1. b=1. add=1. negate=0.
% 0.73/1.01
% 0.73/1.01 ============================== end of process initial clauses ========
% 0.73/1.01
% 0.73/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.01
% 0.73/1.01 ============================== end of clauses for search =============
% 0.73/1.01
% 0.73/1.01 ============================== SEARCH ================================
% 0.73/1.01
% 0.73/1.01 % Starting search at 0.01 seconds.
% 0.73/1.01
% 0.73/1.01 ============================== PROOF =================================
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01 % SZS output start Refutation
% 0.73/1.01
% 0.73/1.01 % Proof 1 at 0.04 (+ 0.00) seconds: prove_huntingtons_axiom.
% 0.73/1.01 % Length of proof is 19.
% 0.73/1.01 % Level of proof is 10.
% 0.73/1.01 % Maximum clause weight is 23.000.
% 0.73/1.01 % Given clauses 26.
% 0.73/1.01
% 0.73/1.01 1 add(A,A) = A # label(x_plus_x_is_x) # label(hypothesis). [assumption].
% 0.73/1.01 2 add(A,B) = add(B,A) # label(commutativity_of_add) # label(axiom). [assumption].
% 0.73/1.01 3 add(add(A,B),C) = add(A,add(B,C)) # label(associativity_of_add) # label(axiom). [assumption].
% 0.73/1.01 4 add(A,add(B,C)) = add(C,add(A,B)). [copy(3),rewrite([2(2)]),flip(a)].
% 0.73/1.01 5 negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A # label(robbins_axiom) # label(axiom). [assumption].
% 0.73/1.01 6 add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b # label(prove_huntingtons_axiom) # label(negated_conjecture) # answer(prove_huntingtons_axiom). [assumption].
% 0.73/1.01 8 negate(add(negate(A),negate(add(A,negate(A))))) = A. [para(1(a,1),5(a,1,1,1,1))].
% 0.73/1.01 9 negate(add(negate(negate(A)),negate(add(A,negate(A))))) = negate(A). [para(1(a,1),5(a,1,1,2,1)),rewrite([2(2),2(6)])].
% 0.73/1.01 19 negate(add(A,negate(add(A,negate(A))))) = negate(A). [para(8(a,1),5(a,1,1,2)),rewrite([4(4,R),1(3),2(4)])].
% 0.73/1.01 21 negate(add(A,negate(add(A,add(negate(A),negate(add(A,negate(A)))))))) = add(negate(A),negate(add(A,negate(A)))). [para(8(a,1),8(a,1,1,1)),rewrite([8(11),2(6)])].
% 0.73/1.01 25 negate(add(negate(A),negate(add(A,add(negate(A),negate(add(A,negate(A)))))))) = add(A,negate(add(A,negate(A)))). [para(19(a,1),8(a,1,1,1)),rewrite([19(10),2(7),4(7,R),2(6)])].
% 0.73/1.01 27 negate(add(add(A,negate(add(A,negate(A)))),negate(add(A,add(negate(A),negate(add(A,negate(A)))))))) = negate(A). [para(19(a,1),19(a,1,1,2,1,2)),rewrite([2(10),4(10,R),2(9),19(18)])].
% 0.73/1.01 33 add(A,negate(add(A,negate(A)))) = A. [para(8(a,1),9(a,1,1,1,1)),rewrite([8(12),2(7),25(10),8(10)])].
% 0.73/1.01 36 add(negate(A),negate(add(A,negate(A)))) = negate(A). [back_rewrite(27),rewrite([33(4),21(9)])].
% 0.73/1.01 37 negate(negate(A)) = A. [back_rewrite(25),rewrite([36(6),36(5),33(6)])].
% 0.73/1.01 38 add(negate(add(A,B)),negate(add(A,negate(B)))) = negate(A). [para(5(a,1),37(a,1,1)),flip(a)].
% 0.73/1.01 47 add(negate(add(A,B)),negate(add(B,negate(A)))) = negate(B). [para(2(a,1),38(a,1,1,1))].
% 0.73/1.01 139 add(negate(add(A,negate(B))),negate(add(negate(A),negate(B)))) = B. [para(37(a,1),47(a,2)),rewrite([2(6)])].
% 0.73/1.01 140 $F # answer(prove_huntingtons_axiom). [resolve(139,a,6,a)].
% 0.73/1.01
% 0.73/1.01 % SZS output end Refutation
% 0.73/1.01 ============================== end of proof ==========================
% 0.73/1.01
% 0.73/1.01 ============================== STATISTICS ============================
% 0.73/1.01
% 0.73/1.01 Given=26. Generated=647. Kept=138. proofs=1.
% 0.73/1.01 Usable=11. Sos=47. Demods=60. Limbo=3, Disabled=81. Hints=0.
% 0.73/1.01 Megabytes=0.18.
% 0.73/1.01 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.73/1.01
% 0.73/1.01 ============================== end of statistics =====================
% 0.73/1.01
% 0.73/1.01 ============================== end of search =========================
% 0.73/1.01
% 0.73/1.01 THEOREM PROVED
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01
% 0.73/1.01 Exiting with 1 proof.
% 0.73/1.01
% 0.73/1.01 Process 20277 exit (max_proofs) Thu Jun 9 15:10:50 2022
% 0.73/1.02 Prover9 interrupted
%------------------------------------------------------------------------------