TSTP Solution File: GRP495-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP495-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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 : Sat Jul 16 11:19:20 EDT 2022
% Result : Unsatisfiable 0.45s 1.02s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP495-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n007.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 : Tue Jun 14 13:33:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.02 ============================== Prover9 ===============================
% 0.45/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.02 Process 20394 was started by sandbox on n007.cluster.edu,
% 0.45/1.02 Tue Jun 14 13:33:40 2022
% 0.45/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20241_n007.cluster.edu".
% 0.45/1.02 ============================== end of head ===========================
% 0.45/1.02
% 0.45/1.02 ============================== INPUT =================================
% 0.45/1.02
% 0.45/1.02 % Reading from file /tmp/Prover9_20241_n007.cluster.edu
% 0.45/1.02
% 0.45/1.02 set(prolog_style_variables).
% 0.45/1.02 set(auto2).
% 0.45/1.02 % set(auto2) -> set(auto).
% 0.45/1.02 % set(auto) -> set(auto_inference).
% 0.45/1.02 % set(auto) -> set(auto_setup).
% 0.45/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.02 % set(auto) -> set(auto_limits).
% 0.45/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.02 % set(auto) -> set(auto_denials).
% 0.45/1.02 % set(auto) -> set(auto_process).
% 0.45/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.02 % set(auto2) -> assign(stats, some).
% 0.45/1.02 % set(auto2) -> clear(echo_input).
% 0.45/1.02 % set(auto2) -> set(quiet).
% 0.45/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.02 % set(auto2) -> clear(print_given).
% 0.45/1.02 assign(lrs_ticks,-1).
% 0.45/1.02 assign(sos_limit,10000).
% 0.45/1.02 assign(order,kbo).
% 0.45/1.02 set(lex_order_vars).
% 0.45/1.02 clear(print_given).
% 0.45/1.02
% 0.45/1.02 % formulas(sos). % not echoed (5 formulas)
% 0.45/1.02
% 0.45/1.02 ============================== end of input ==========================
% 0.45/1.02
% 0.45/1.02 % From the command line: assign(max_seconds, 300).
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.02
% 0.45/1.02 % Formulas that are not ordinary clauses:
% 0.45/1.02
% 0.45/1.02 ============================== end of process non-clausal formulas ===
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.02
% 0.45/1.02 ============================== PREDICATE ELIMINATION =================
% 0.45/1.02
% 0.45/1.02 ============================== end predicate elimination =============
% 0.45/1.02
% 0.45/1.02 Auto_denials:
% 0.45/1.02 % copying label prove_these_axioms_3 to answer in negative clause
% 0.45/1.02
% 0.45/1.02 Term ordering decisions:
% 0.45/1.02
% 0.45/1.02 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.45/1.02 Function symbol KB weights: identity=1. a3=1. b3=1. c3=1. double_divide=1. multiply=1. inverse=0.
% 0.45/1.02
% 0.45/1.02 ============================== end of process initial clauses ========
% 0.45/1.02
% 0.45/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.02
% 0.45/1.02 ============================== end of clauses for search =============
% 0.45/1.02
% 0.45/1.02 ============================== SEARCH ================================
% 0.45/1.02
% 0.45/1.02 % Starting search at 0.01 seconds.
% 0.45/1.02
% 0.45/1.02 ============================== PROOF =================================
% 0.45/1.02 % SZS status Unsatisfiable
% 0.45/1.02 % SZS output start Refutation
% 0.45/1.02
% 0.45/1.02 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_3.
% 0.45/1.02 % Length of proof is 35.
% 0.45/1.02 % Level of proof is 13.
% 0.45/1.02 % Maximum clause weight is 23.000.
% 0.45/1.02 % Given clauses 27.
% 0.45/1.02
% 0.45/1.02 1 inverse(A) = double_divide(A,identity) # label(inverse) # label(axiom). [assumption].
% 0.45/1.02 2 identity = double_divide(A,inverse(A)) # label(identity) # label(axiom). [assumption].
% 0.45/1.02 3 double_divide(A,double_divide(A,identity)) = identity. [copy(2),rewrite([1(2)]),flip(a)].
% 0.45/1.02 4 multiply(A,B) = double_divide(double_divide(B,A),identity) # label(multiply) # label(axiom). [assumption].
% 0.45/1.02 5 double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B # label(single_axiom) # label(axiom). [assumption].
% 0.45/1.02 6 multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) # label(prove_these_axioms_3) # label(negated_conjecture) # answer(prove_these_axioms_3). [assumption].
% 0.45/1.02 7 double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity) # answer(prove_these_axioms_3). [copy(6),rewrite([4(3),4(7),4(13),4(16)]),flip(a)].
% 0.45/1.02 8 double_divide(identity,double_divide(double_divide(double_divide(A,B),double_divide(identity,identity)),double_divide(double_divide(identity,identity),B))) = A. [para(3(a,1),5(a,1,1))].
% 0.45/1.02 9 double_divide(double_divide(identity,A),double_divide(identity,double_divide(A,double_divide(B,identity)))) = B. [para(3(a,1),5(a,1,2,1,1)),rewrite([3(7)])].
% 0.45/1.02 10 double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,double_divide(A,identity)),double_divide(identity,identity)),identity)) = B. [para(3(a,1),5(a,1,2,2))].
% 0.45/1.02 14 double_divide(identity,double_divide(identity,double_divide(double_divide(identity,identity),double_divide(A,identity)))) = A. [para(3(a,1),8(a,1,2,1,1)),rewrite([3(6)])].
% 0.45/1.02 15 double_divide(identity,double_divide(double_divide(double_divide(A,double_divide(double_divide(identity,identity),identity)),double_divide(identity,identity)),identity)) = A. [para(3(a,1),8(a,1,2,2))].
% 0.45/1.02 20 double_divide(double_divide(identity,A),double_divide(identity,identity)) = A. [para(3(a,1),9(a,1,2,2))].
% 0.45/1.02 22 double_divide(double_divide(identity,double_divide(identity,A)),double_divide(double_divide(double_divide(B,double_divide(identity,double_divide(A,double_divide(C,identity)))),double_divide(identity,identity)),C)) = B. [para(9(a,1),5(a,1,2,2))].
% 0.45/1.02 27 double_divide(identity,identity) = identity. [para(3(a,1),20(a,1,1)),rewrite([3(5)]),flip(a)].
% 0.45/1.02 29 double_divide(double_divide(identity,A),double_divide(double_divide(B,identity),double_divide(A,identity))) = double_divide(identity,B). [para(20(a,1),5(a,1,2,1,1)),rewrite([27(5),27(7)])].
% 0.45/1.02 31 double_divide(double_divide(identity,double_divide(identity,A)),double_divide(double_divide(double_divide(B,identity),identity),A)) = B. [para(20(a,1),5(a,1,2,2)),rewrite([27(7),27(9)])].
% 0.45/1.02 32 double_divide(identity,double_divide(double_divide(A,identity),identity)) = double_divide(identity,A). [para(20(a,1),8(a,1,2,1,1)),rewrite([27(4),27(6),27(7),27(6)])].
% 0.45/1.02 34 double_divide(identity,double_divide(A,identity)) = A. [para(20(a,1),8(a,1,2,2)),rewrite([27(4),27(6),32(8)])].
% 0.45/1.02 35 double_divide(double_divide(double_divide(A,B),identity),double_divide(identity,B)) = double_divide(A,identity). [para(8(a,1),20(a,1,1)),rewrite([27(3),27(6),27(8)]),flip(a)].
% 0.45/1.02 41 double_divide(double_divide(identity,double_divide(identity,A)),double_divide(double_divide(double_divide(B,double_divide(identity,double_divide(A,double_divide(C,identity)))),identity),C)) = B. [back_rewrite(22),rewrite([27(13)])].
% 0.45/1.02 47 double_divide(double_divide(A,identity),identity) = A. [back_rewrite(15),rewrite([27(4),27(4),27(6),34(8)])].
% 0.45/1.02 48 double_divide(identity,double_divide(identity,A)) = A. [back_rewrite(14),rewrite([27(5),34(6)])].
% 0.45/1.02 51 double_divide(double_divide(identity,A),double_divide(B,double_divide(A,identity))) = B. [back_rewrite(10),rewrite([27(8),47(9)])].
% 0.45/1.02 53 double_divide(A,double_divide(B,A)) = B. [back_rewrite(31),rewrite([48(4),47(4)])].
% 0.45/1.02 54 double_divide(A,double_divide(double_divide(double_divide(B,double_divide(identity,double_divide(A,double_divide(C,identity)))),identity),C)) = B. [back_rewrite(41),rewrite([48(4)])].
% 0.45/1.02 55 double_divide(identity,A) = double_divide(A,identity). [back_rewrite(29),rewrite([51(8)]),flip(a)].
% 0.45/1.02 56 double_divide(A,double_divide(double_divide(identity,double_divide(B,double_divide(identity,double_divide(A,double_divide(C,identity))))),C)) = B. [back_rewrite(54),rewrite([55(8,R)])].
% 0.45/1.02 64 double_divide(double_divide(identity,double_divide(A,B)),double_divide(B,identity)) = double_divide(A,identity). [back_rewrite(35),rewrite([55(3,R),55(5)])].
% 0.45/1.02 66 double_divide(identity,double_divide(double_divide(identity,double_divide(c3,b3)),a3)) != double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3)))) # answer(prove_these_axioms_3). [back_rewrite(7),rewrite([55(5,R),55(9,R),55(15,R),55(18,R)])].
% 0.45/1.02 69 double_divide(double_divide(A,B),A) = B. [para(53(a,1),53(a,1,2))].
% 0.45/1.02 75 double_divide(A,double_divide(double_divide(identity,double_divide(B,double_divide(identity,double_divide(A,C)))),double_divide(C,identity))) = B. [para(69(a,1),56(a,1,2,1,2,2,2,2)),rewrite([55(8)])].
% 0.45/1.02 85 double_divide(double_divide(A,identity),double_divide(B,identity)) = double_divide(identity,double_divide(B,A)). [para(64(a,1),53(a,1,2))].
% 0.45/1.02 98 double_divide(double_divide(identity,double_divide(A,B)),C) = double_divide(A,double_divide(identity,double_divide(B,C))). [para(69(a,1),75(a,1,2,1,2)),rewrite([55(2),85(5)]),flip(a)].
% 0.45/1.02 99 $F # answer(prove_these_axioms_3). [back_rewrite(66),rewrite([98(8)]),xx(a)].
% 0.45/1.02
% 0.45/1.02 % SZS output end Refutation
% 0.45/1.02 ============================== end of proof ==========================
% 0.45/1.02
% 0.45/1.02 ============================== STATISTICS ============================
% 0.45/1.02
% 0.45/1.02 Given=27. Generated=556. Kept=96. proofs=1.
% 0.45/1.02 Usable=12. Sos=5. Demods=18. Limbo=1, Disabled=83. Hints=0.
% 0.45/1.02 Megabytes=0.10.
% 0.45/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.02
% 0.45/1.02 ============================== end of statistics =====================
% 0.45/1.02
% 0.45/1.02 ============================== end of search =========================
% 0.45/1.02
% 0.45/1.02 THEOREM PROVED
% 0.45/1.02 % SZS status Unsatisfiable
% 0.45/1.02
% 0.45/1.02 Exiting with 1 proof.
% 0.45/1.02
% 0.45/1.02 Process 20394 exit (max_proofs) Tue Jun 14 13:33:40 2022
% 0.45/1.02 Prover9 interrupted
%------------------------------------------------------------------------------