TSTP Solution File: GRP659-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP659-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:20:22 EDT 2022
% Result : Unsatisfiable 1.01s 1.26s
% Output : Refutation 1.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP659-10 : TPTP v8.1.0. Released v8.1.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 22:24:09 EDT 2022
% 0.14/0.36 % CPUTime :
% 1.01/1.26 ============================== Prover9 ===============================
% 1.01/1.26 Prover9 (32) version 2009-11A, November 2009.
% 1.01/1.26 Process 7233 was started by sandbox2 on n019.cluster.edu,
% 1.01/1.26 Mon Jun 13 22:24:10 2022
% 1.01/1.26 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7080_n019.cluster.edu".
% 1.01/1.26 ============================== end of head ===========================
% 1.01/1.26
% 1.01/1.26 ============================== INPUT =================================
% 1.01/1.26
% 1.01/1.26 % Reading from file /tmp/Prover9_7080_n019.cluster.edu
% 1.01/1.26
% 1.01/1.26 set(prolog_style_variables).
% 1.01/1.26 set(auto2).
% 1.01/1.26 % set(auto2) -> set(auto).
% 1.01/1.26 % set(auto) -> set(auto_inference).
% 1.01/1.26 % set(auto) -> set(auto_setup).
% 1.01/1.26 % set(auto_setup) -> set(predicate_elim).
% 1.01/1.26 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.01/1.26 % set(auto) -> set(auto_limits).
% 1.01/1.26 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.01/1.26 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.01/1.26 % set(auto) -> set(auto_denials).
% 1.01/1.26 % set(auto) -> set(auto_process).
% 1.01/1.26 % set(auto2) -> assign(new_constants, 1).
% 1.01/1.26 % set(auto2) -> assign(fold_denial_max, 3).
% 1.01/1.26 % set(auto2) -> assign(max_weight, "200.000").
% 1.01/1.26 % set(auto2) -> assign(max_hours, 1).
% 1.01/1.26 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.01/1.26 % set(auto2) -> assign(max_seconds, 0).
% 1.01/1.26 % set(auto2) -> assign(max_minutes, 5).
% 1.01/1.26 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.01/1.26 % set(auto2) -> set(sort_initial_sos).
% 1.01/1.26 % set(auto2) -> assign(sos_limit, -1).
% 1.01/1.26 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.01/1.26 % set(auto2) -> assign(max_megs, 400).
% 1.01/1.26 % set(auto2) -> assign(stats, some).
% 1.01/1.26 % set(auto2) -> clear(echo_input).
% 1.01/1.26 % set(auto2) -> set(quiet).
% 1.01/1.26 % set(auto2) -> clear(print_initial_clauses).
% 1.01/1.26 % set(auto2) -> clear(print_given).
% 1.01/1.26 assign(lrs_ticks,-1).
% 1.01/1.26 assign(sos_limit,10000).
% 1.01/1.26 assign(order,kbo).
% 1.01/1.26 set(lex_order_vars).
% 1.01/1.26 clear(print_given).
% 1.01/1.26
% 1.01/1.26 % formulas(sos). % not echoed (6 formulas)
% 1.01/1.26
% 1.01/1.26 ============================== end of input ==========================
% 1.01/1.26
% 1.01/1.26 % From the command line: assign(max_seconds, 300).
% 1.01/1.26
% 1.01/1.26 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.01/1.26
% 1.01/1.26 % Formulas that are not ordinary clauses:
% 1.01/1.26
% 1.01/1.26 ============================== end of process non-clausal formulas ===
% 1.01/1.26
% 1.01/1.26 ============================== PROCESS INITIAL CLAUSES ===============
% 1.01/1.26
% 1.01/1.26 ============================== PREDICATE ELIMINATION =================
% 1.01/1.26
% 1.01/1.26 ============================== end predicate elimination =============
% 1.01/1.26
% 1.01/1.26 Auto_denials:
% 1.01/1.26 % copying label goal to answer in negative clause
% 1.01/1.26
% 1.01/1.26 Term ordering decisions:
% 1.01/1.26 Function symbol KB weights: mult=1. ld=1. rd=1. tuple=1. x1=1. x1_2=1.
% 1.01/1.26
% 1.01/1.26 ============================== end of process initial clauses ========
% 1.01/1.26
% 1.01/1.26 ============================== CLAUSES FOR SEARCH ====================
% 1.01/1.26
% 1.01/1.26 ============================== end of clauses for search =============
% 1.01/1.26
% 1.01/1.26 ============================== SEARCH ================================
% 1.01/1.26
% 1.01/1.26 % Starting search at 0.01 seconds.
% 1.01/1.26
% 1.01/1.26 ============================== PROOF =================================
% 1.01/1.26 % SZS status Unsatisfiable
% 1.01/1.26 % SZS output start Refutation
% 1.01/1.26
% 1.01/1.26 % Proof 1 at 0.22 (+ 0.00) seconds: goal.
% 1.01/1.26 % Length of proof is 47.
% 1.01/1.26 % Level of proof is 16.
% 1.01/1.26 % Maximum clause weight is 23.000.
% 1.01/1.26 % Given clauses 68.
% 1.01/1.26
% 1.01/1.26 1 mult(A,ld(A,B)) = B # label(f01) # label(axiom). [assumption].
% 1.01/1.26 2 ld(A,mult(A,B)) = B # label(f02) # label(axiom). [assumption].
% 1.01/1.26 3 mult(rd(A,B),B) = A # label(f03) # label(axiom). [assumption].
% 1.01/1.26 4 rd(mult(A,B),B) = A # label(f04) # label(axiom). [assumption].
% 1.01/1.26 5 mult(mult(A,mult(B,C)),B) = mult(mult(A,B),mult(C,B)) # label(f05) # label(axiom). [assumption].
% 1.01/1.26 6 tuple(mult(A,x1(A)),mult(x1_2(A),A)) != tuple(x1(A),x1_2(A)) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 1.01/1.26 7 ld(rd(A,B),A) = B. [para(3(a,1),2(a,1,2))].
% 1.01/1.26 8 rd(A,ld(B,A)) = B. [para(1(a,1),4(a,1,1))].
% 1.01/1.26 9 mult(mult(A,B),mult(ld(B,C),B)) = mult(mult(A,C),B). [para(1(a,1),5(a,1,1,2)),flip(a)].
% 1.01/1.26 12 mult(mult(rd(A,mult(B,C)),B),mult(C,B)) = mult(A,B). [para(3(a,1),5(a,1,1)),flip(a)].
% 1.01/1.26 13 rd(mult(mult(A,B),mult(C,B)),B) = mult(A,mult(B,C)). [para(5(a,1),4(a,1,1))].
% 1.01/1.26 17 ld(mult(A,B),mult(mult(A,C),B)) = mult(ld(B,C),B). [para(9(a,1),2(a,1,2))].
% 1.01/1.26 37 rd(mult(A,B),mult(C,B)) = mult(rd(A,mult(B,C)),B). [para(12(a,1),4(a,1,1))].
% 1.01/1.26 57 rd(mult(A,mult(B,C)),C) = mult(rd(A,C),mult(C,B)). [para(3(a,1),13(a,1,1,1))].
% 1.01/1.26 60 ld(mult(A,B),mult(C,B)) = mult(ld(B,ld(A,C)),B). [para(1(a,1),17(a,1,2,1))].
% 1.01/1.26 62 mult(ld(A,A),A) = A. [para(17(a,1),2(a,1))].
% 1.01/1.26 71 rd(A,A) = ld(A,A). [para(62(a,1),4(a,1,1))].
% 1.01/1.26 350 mult(rd(ld(A,A),mult(A,B)),A) = rd(A,mult(B,A)). [para(62(a,1),37(a,1,1)),flip(a)].
% 1.01/1.26 604 mult(ld(A,ld(B,B)),mult(A,B)) = B. [para(62(a,1),57(a,1,1)),rewrite([4(2),60(3),4(4)]),flip(a)].
% 1.01/1.26 633 ld(ld(A,ld(B,B)),B) = mult(A,B). [para(604(a,1),2(a,1,2))].
% 1.01/1.26 634 mult(ld(rd(A,B),ld(B,B)),A) = B. [para(3(a,1),604(a,1,2))].
% 1.01/1.26 635 rd(A,mult(B,A)) = ld(B,ld(A,A)). [para(604(a,1),4(a,1,1))].
% 1.01/1.26 678 mult(rd(ld(A,A),mult(A,B)),A) = ld(B,ld(A,A)). [back_rewrite(350),rewrite([635(6)])].
% 1.01/1.26 679 mult(rd(ld(A,A),B),A) = ld(B,A). [para(7(a,1),633(a,1,1)),flip(a)].
% 1.01/1.26 696 ld(mult(A,B),A) = ld(B,ld(A,A)). [back_rewrite(678),rewrite([679(4)])].
% 1.01/1.26 714 ld(rd(A,B),ld(B,B)) = rd(B,A). [para(634(a,1),4(a,1,1)),flip(a)].
% 1.01/1.26 780 ld(rd(ld(A,A),B),ld(B,A)) = A. [para(679(a,1),2(a,1,2))].
% 1.01/1.26 782 rd(ld(A,B),B) = rd(ld(B,B),A). [para(679(a,1),4(a,1,1))].
% 1.01/1.26 826 ld(ld(A,B),ld(A,A)) = ld(B,A). [para(1(a,1),696(a,1,1)),flip(a)].
% 1.01/1.26 829 rd(A,ld(B,ld(A,A))) = mult(A,B). [para(696(a,1),8(a,1,2))].
% 1.01/1.26 970 ld(rd(ld(A,B),B),ld(A,A)) = rd(A,ld(B,B)). [para(782(a,2),714(a,1,1))].
% 1.01/1.26 971 ld(rd(A,ld(B,B)),ld(B,B)) = rd(ld(A,B),B). [para(782(a,2),714(a,2)),rewrite([826(5)])].
% 1.01/1.26 973 rd(ld(ld(A,B),ld(A,B)),rd(ld(B,B),A)) = A. [para(780(a,1),782(a,1,1)),rewrite([8(2)]),flip(a)].
% 1.01/1.26 1031 ld(ld(A,B),B) = mult(ld(B,A),B). [para(826(a,1),633(a,1,1))].
% 1.01/1.26 1064 rd(A,rd(A,B)) = mult(A,rd(B,A)). [para(714(a,1),829(a,1,2))].
% 1.01/1.26 1066 mult(ld(A,A),B) = B. [para(829(a,1),782(a,2)),rewrite([826(3),633(3),4(2)]),flip(a)].
% 1.01/1.26 1211 ld(ld(A,A),B) = B. [para(1066(a,1),1(a,1))].
% 1.01/1.26 1212 ld(A,A) = ld(B,B). [para(1066(a,1),4(a,1,1)),rewrite([71(1)])].
% 1.01/1.26 1214 tuple(x1(ld(A,A)),mult(x1_2(ld(A,A)),ld(A,A))) != tuple(x1(ld(A,A)),x1_2(ld(A,A))) # answer(goal). [para(1066(a,1),6(a,1,1))].
% 1.01/1.26 1247 ld(A,A) = c_0. [new_symbol(1212)].
% 1.01/1.26 1293 tuple(x1(c_0),mult(x1_2(c_0),c_0)) != tuple(x1(c_0),x1_2(c_0)) # answer(goal). [back_rewrite(1214),rewrite([1247(1),1247(3),1247(5),1247(8),1247(10)])].
% 1.01/1.26 1294 ld(c_0,A) = A. [back_rewrite(1211),rewrite([1247(1)])].
% 1.01/1.26 1328 mult(c_0,A) = A. [back_rewrite(1066),rewrite([1247(1)])].
% 1.01/1.26 1383 rd(A,c_0) = A. [back_rewrite(973),rewrite([1247(3),1247(2),1064(4),1328(4)])].
% 1.01/1.26 1385 rd(ld(A,B),B) = ld(A,c_0). [back_rewrite(971),rewrite([1247(1),1383(2),1247(1)]),flip(a)].
% 1.01/1.26 1386 mult(A,c_0) = A. [back_rewrite(970),rewrite([1385(2),1247(3),1031(4),1294(2),1247(3),1383(4)])].
% 1.01/1.26 1513 $F # answer(goal). [back_rewrite(1293),rewrite([1386(6)]),xx(a)].
% 1.01/1.26
% 1.01/1.26 % SZS output end Refutation
% 1.01/1.26 ============================== end of proof ==========================
% 1.01/1.26
% 1.01/1.26 ============================== STATISTICS ============================
% 1.01/1.26
% 1.01/1.26 Given=68. Generated=4361. Kept=1512. proofs=1.
% 1.01/1.26 Usable=26. Sos=589. Demods=730. Limbo=127, Disabled=776. Hints=0.
% 1.01/1.26 Megabytes=2.62.
% 1.01/1.26 User_CPU=0.22, System_CPU=0.00, Wall_clock=0.
% 1.01/1.26
% 1.01/1.26 ============================== end of statistics =====================
% 1.01/1.26
% 1.01/1.26 ============================== end of search =========================
% 1.01/1.26
% 1.01/1.26 THEOREM PROVED
% 1.01/1.26 % SZS status Unsatisfiable
% 1.01/1.26
% 1.01/1.26 Exiting with 1 proof.
% 1.01/1.26
% 1.01/1.26 Process 7233 exit (max_proofs) Mon Jun 13 22:24:10 2022
% 1.01/1.26 Prover9 interrupted
%------------------------------------------------------------------------------