TSTP Solution File: ROB004-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ROB004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:27 EDT 2022
% Result : Unsatisfiable 0.75s 1.34s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.17 % Problem : ROB004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.14/0.18 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.39 % Computer : n017.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8042.1875MB
% 0.14/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 600
% 0.14/0.39 % DateTime : Thu Jun 9 14:46:04 EDT 2022
% 0.14/0.39 % CPUTime :
% 0.75/1.34 ============================== Prover9 ===============================
% 0.75/1.34 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.34 Process 25127 was started by sandbox on n017.cluster.edu,
% 0.75/1.34 Thu Jun 9 14:46:05 2022
% 0.75/1.34 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24974_n017.cluster.edu".
% 0.75/1.34 ============================== end of head ===========================
% 0.75/1.34
% 0.75/1.34 ============================== INPUT =================================
% 0.75/1.34
% 0.75/1.34 % Reading from file /tmp/Prover9_24974_n017.cluster.edu
% 0.75/1.34
% 0.75/1.34 set(prolog_style_variables).
% 0.75/1.34 set(auto2).
% 0.75/1.34 % set(auto2) -> set(auto).
% 0.75/1.34 % set(auto) -> set(auto_inference).
% 0.75/1.34 % set(auto) -> set(auto_setup).
% 0.75/1.34 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.34 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.34 % set(auto) -> set(auto_limits).
% 0.75/1.34 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.34 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.34 % set(auto) -> set(auto_denials).
% 0.75/1.34 % set(auto) -> set(auto_process).
% 0.75/1.34 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.34 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.34 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.34 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.34 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.34 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.34 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.34 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.34 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.34 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.34 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.34 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.34 % set(auto2) -> assign(stats, some).
% 0.75/1.34 % set(auto2) -> clear(echo_input).
% 0.75/1.34 % set(auto2) -> set(quiet).
% 0.75/1.34 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.34 % set(auto2) -> clear(print_given).
% 0.75/1.34 assign(lrs_ticks,-1).
% 0.75/1.34 assign(sos_limit,10000).
% 0.75/1.34 assign(order,kbo).
% 0.75/1.34 set(lex_order_vars).
% 0.75/1.34 clear(print_given).
% 0.75/1.34
% 0.75/1.34 % formulas(sos). % not echoed (7 formulas)
% 0.75/1.34
% 0.75/1.34 ============================== end of input ==========================
% 0.75/1.34
% 0.75/1.34 % From the command line: assign(max_seconds, 300).
% 0.75/1.34
% 0.75/1.34 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.34
% 0.75/1.34 % Formulas that are not ordinary clauses:
% 0.75/1.34
% 0.75/1.34 ============================== end of process non-clausal formulas ===
% 0.75/1.34
% 0.75/1.34 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.34
% 0.75/1.34 ============================== PREDICATE ELIMINATION =================
% 0.75/1.34
% 0.75/1.34 ============================== end predicate elimination =============
% 0.75/1.34
% 0.75/1.34 Auto_denials:
% 0.75/1.34 % copying label prove_huntingtons_axiom to answer in negative clause
% 0.75/1.34
% 0.75/1.34 Term ordering decisions:
% 0.75/1.34
% 0.75/1.34 % Assigning unary symbol negate kb_weight 0 and highest precedence (7).
% 0.75/1.34 Function symbol KB weights: c=1. d=1. a=1. b=1. add=1. negate=0.
% 0.75/1.34
% 0.75/1.34 ============================== end of process initial clauses ========
% 0.75/1.34
% 0.75/1.34 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.34
% 0.75/1.34 ============================== end of clauses for search =============
% 0.75/1.34
% 0.75/1.34 ============================== SEARCH ================================
% 0.75/1.34
% 0.75/1.34 % Starting search at 0.01 seconds.
% 0.75/1.34
% 0.75/1.34 ============================== PROOF =================================
% 0.75/1.34 % SZS status Unsatisfiable
% 0.75/1.34 % SZS output start Refutation
% 0.75/1.34
% 0.75/1.34 % Proof 1 at 0.25 (+ 0.00) seconds: prove_huntingtons_axiom.
% 0.75/1.34 % Length of proof is 33.
% 0.75/1.34 % Level of proof is 17.
% 0.75/1.34 % Maximum clause weight is 21.000.
% 0.75/1.34 % Given clauses 97.
% 0.75/1.34
% 0.75/1.34 1 negate(d) = c # label(negate_d_is_c) # label(hypothesis). [assumption].
% 0.75/1.34 2 add(c,d) = d # label(c_plus_d_is_d) # label(hypothesis). [assumption].
% 0.75/1.34 3 add(c,c) = c # label(c_plus_c_is_c) # label(hypothesis). [assumption].
% 0.75/1.34 4 add(A,B) = add(B,A) # label(commutativity_of_add) # label(axiom). [assumption].
% 0.75/1.34 5 add(add(A,B),C) = add(A,add(B,C)) # label(associativity_of_add) # label(axiom). [assumption].
% 0.75/1.34 6 add(A,add(B,C)) = add(C,add(A,B)). [copy(5),rewrite([4(2)]),flip(a)].
% 0.75/1.34 7 negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A # label(robbins_axiom) # label(axiom). [assumption].
% 0.75/1.34 8 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.75/1.34 9 negate(add(negate(add(A,c)),negate(add(A,d)))) = A. [para(1(a,1),7(a,1,1,2,1,2)),rewrite([4(7)])].
% 0.75/1.34 11 negate(add(negate(add(A,B)),negate(add(B,negate(A))))) = B. [para(4(a,1),7(a,1,1,1,1))].
% 0.75/1.34 12 negate(add(negate(add(A,add(B,C))),negate(add(B,negate(add(A,C)))))) = B. [para(6(a,1),7(a,1,1,1,1)),rewrite([4(4)])].
% 0.75/1.34 25 negate(add(c,negate(add(d,negate(c))))) = d. [para(2(a,1),11(a,1,1,1,1)),rewrite([1(2)])].
% 0.75/1.34 26 negate(add(negate(add(A,add(B,C))),negate(add(add(A,C),negate(B))))) = add(A,C). [para(6(a,1),11(a,1,1,1,1)),rewrite([4(4),4(10)])].
% 0.75/1.34 28 negate(add(negate(add(A,B)),negate(add(A,add(negate(add(C,B)),negate(add(B,negate(C)))))))) = A. [para(11(a,1),7(a,1,1,2,1,2)),rewrite([4(11)])].
% 0.75/1.34 39 negate(add(d,negate(add(c,add(d,negate(c)))))) = c. [para(25(a,1),7(a,1,1,2)),rewrite([4(9)])].
% 0.75/1.34 54 negate(add(d,negate(add(d,negate(c))))) = c. [para(6(a,1),39(a,1,1,2,1)),rewrite([2(6),4(5)])].
% 0.75/1.34 59 negate(add(c,negate(add(d,negate(negate(add(d,negate(c)))))))) = d. [para(54(a,1),7(a,1,1,1))].
% 0.75/1.34 62 negate(add(d,negate(c))) = c. [para(54(a,1),11(a,1,1,1)),rewrite([1(8),4(8),25(9),2(3),1(2)]),flip(a)].
% 0.75/1.34 63 negate(c) = d. [back_rewrite(59),rewrite([62(7),62(6),3(3)])].
% 0.75/1.34 576 add(A,c) = A. [para(3(a,1),26(a,1,1,1,1,2)),rewrite([63(7),4(7),6(7),4(6),6(7,R),4(6),2(6),9(8)]),flip(a)].
% 0.75/1.34 577 negate(add(negate(A),negate(add(c,negate(A))))) = c. [para(3(a,1),26(a,1,1,2,1,1)),rewrite([576(3),4(2),576(2),576(10)])].
% 0.75/1.34 855 negate(add(A,negate(A))) = c. [para(7(a,1),577(a,1,1,1)),rewrite([7(8),4(2),576(2)])].
% 0.75/1.34 869 negate(add(c,negate(add(A,A)))) = A. [para(855(a,1),7(a,1,1,2)),rewrite([4(4)])].
% 0.75/1.34 872 negate(add(A,add(negate(add(B,A)),negate(add(A,negate(B)))))) = c. [para(11(a,1),855(a,1,1,2)),rewrite([4(7)])].
% 0.75/1.34 873 negate(add(c,negate(add(A,add(A,add(B,B)))))) = add(A,B). [para(855(a,1),12(a,1,1,2)),rewrite([4(2),6(2,R),4(6)])].
% 0.75/1.34 929 negate(add(A,negate(add(A,A)))) = c. [para(869(a,1),7(a,1,1,2)),rewrite([6(3),4(2),576(2),4(3)])].
% 0.75/1.34 949 negate(add(c,negate(add(A,add(A,A))))) = A. [para(929(a,1),7(a,1,1,2)),rewrite([4(5)])].
% 0.75/1.34 1072 negate(add(A,negate(add(A,add(A,A))))) = c. [para(949(a,1),7(a,1,1,2)),rewrite([6(4,R),4(3),6(3),4(2),576(2),4(4)])].
% 0.75/1.34 1095 add(A,A) = A. [para(1072(a,1),7(a,1,1,2)),rewrite([4(6),873(7)])].
% 0.75/1.34 1097 negate(negate(A)) = A. [para(1072(a,1),11(a,1,1,2)),rewrite([1095(1),1095(1),1095(1),576(3)])].
% 0.75/1.34 1225 add(negate(add(A,B)),negate(add(B,negate(A)))) = negate(B). [para(1095(a,1),28(a,1,1,2,1)),rewrite([4(7),872(8),11(8),4(2),576(2)]),flip(a)].
% 0.75/1.34 1557 add(negate(add(A,negate(B))),negate(add(negate(A),negate(B)))) = B. [para(1097(a,1),1225(a,2)),rewrite([4(6)])].
% 0.75/1.34 1558 $F # answer(prove_huntingtons_axiom). [resolve(1557,a,8,a)].
% 0.75/1.34
% 0.75/1.34 % SZS output end Refutation
% 0.75/1.34 ============================== end of proof ==========================
% 0.75/1.34
% 0.75/1.34 ============================== STATISTICS ============================
% 0.75/1.34
% 0.75/1.34 Given=97. Generated=6058. Kept=1556. proofs=1.
% 0.75/1.34 Usable=36. Sos=232. Demods=271. Limbo=4, Disabled=1290. Hints=0.
% 0.75/1.34 Megabytes=1.90.
% 0.75/1.34 User_CPU=0.25, System_CPU=0.00, Wall_clock=0.
% 0.75/1.34
% 0.75/1.34 ============================== end of statistics =====================
% 0.75/1.34
% 0.75/1.34 ============================== end of search =========================
% 0.75/1.34
% 0.75/1.34 THEOREM PROVED
% 0.75/1.34 % SZS status Unsatisfiable
% 0.75/1.34
% 0.75/1.34 Exiting with 1 proof.
% 0.75/1.34
% 0.75/1.34 Process 25127 exit (max_proofs) Thu Jun 9 14:46:05 2022
% 0.75/1.34 Prover9 interrupted
%------------------------------------------------------------------------------