TSTP Solution File: GRP012+5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:16:42 EDT 2022
% Result : Theorem 0.42s 0.99s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 14:01:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 25607 was started by sandbox2 on n027.cluster.edu,
% 0.42/0.99 Tue Jun 14 14:01:04 2022
% 0.42/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25454_n027.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_25454_n027.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (1 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99 1 -(all E ((all X all Y exists Z product(X,Y,Z)) & (all X all Y all Z all U all V all W (product(X,Y,U) & product(Y,Z,V) & product(U,Z,W) -> product(X,V,W))) & (all X all Y all Z all U all V all W (product(X,Y,U) & product(Y,Z,V) & product(X,V,W) -> product(U,Z,W))) & (all X product(X,E,X)) & (all X product(E,X,X)) & (all X product(X,inverse(X),E)) & (all X product(inverse(X),X,E)) -> (all U all V all W all X (product(inverse(U),inverse(V),W) & product(V,U,X) -> product(inverse(W),inverse(X),E))))) # label(prove_distribution) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials:
% 0.42/0.99 % copying label prove_distribution to answer in negative clause
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99
% 0.42/0.99 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.42/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. f1=1. inverse=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.01 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== PROOF =================================
% 0.42/0.99 % SZS status Theorem
% 0.42/0.99 % SZS output start Refutation
% 0.42/0.99
% 0.42/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: prove_distribution.
% 0.42/0.99 % Length of proof is 14.
% 0.42/0.99 % Level of proof is 5.
% 0.42/0.99 % Maximum clause weight is 16.000.
% 0.42/0.99 % Given clauses 13.
% 0.42/0.99
% 0.42/0.99 1 -(all E ((all X all Y exists Z product(X,Y,Z)) & (all X all Y all Z all U all V all W (product(X,Y,U) & product(Y,Z,V) & product(U,Z,W) -> product(X,V,W))) & (all X all Y all Z all U all V all W (product(X,Y,U) & product(Y,Z,V) & product(X,V,W) -> product(U,Z,W))) & (all X product(X,E,X)) & (all X product(E,X,X)) & (all X product(X,inverse(X),E)) & (all X product(inverse(X),X,E)) -> (all U all V all W all X (product(inverse(U),inverse(V),W) & product(V,U,X) -> product(inverse(W),inverse(X),E))))) # label(prove_distribution) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.99 3 product(c1,A,A) # label(prove_distribution) # label(negated_conjecture). [clausify(1)].
% 0.42/0.99 4 product(c3,c2,c5) # label(prove_distribution) # label(negated_conjecture). [clausify(1)].
% 0.42/0.99 5 product(A,inverse(A),c1) # label(prove_distribution) # label(negated_conjecture). [clausify(1)].
% 0.42/0.99 6 product(inverse(A),A,c1) # label(prove_distribution) # label(negated_conjecture). [clausify(1)].
% 0.42/0.99 8 product(inverse(c2),inverse(c3),c4) # label(prove_distribution) # label(negated_conjecture). [clausify(1)].
% 0.42/0.99 9 -product(inverse(c4),inverse(c5),c1) # label(prove_distribution) # label(negated_conjecture) # answer(prove_distribution). [clausify(1)].
% 0.42/0.99 10 -product(A,B,C) | -product(B,D,E) | -product(C,D,F) | product(A,E,F) # label(prove_distribution) # label(negated_conjecture). [clausify(1)].
% 0.42/0.99 11 -product(A,B,C) | -product(B,D,E) | -product(A,E,F) | product(C,D,F) # label(prove_distribution) # label(negated_conjecture). [clausify(1)].
% 0.42/0.99 40 product(inverse(c3),c5,c2). [ur(10,a,6,a,b,4,a,c,3,a)].
% 0.42/0.99 78 -product(inverse(c4),c1,c5) # answer(prove_distribution). [ur(10,b,3,a,c,5,a,d,9,a)].
% 0.42/0.99 183 -product(c4,c5,c1) # answer(prove_distribution). [ur(10,a,6,a,c,3,a,d,78,a)].
% 0.42/0.99 194 -product(inverse(c3),c5,c2) # answer(prove_distribution). [ur(11,a,8,a,c,6,a,d,183,a)].
% 0.42/0.99 195 $F # answer(prove_distribution). [resolve(194,a,40,a)].
% 0.42/0.99
% 0.42/0.99 % SZS output end Refutation
% 0.42/0.99 ============================== end of proof ==========================
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=13. Generated=337. Kept=193. proofs=1.
% 0.42/0.99 Usable=13. Sos=170. Demods=0. Limbo=5, Disabled=14. Hints=0.
% 0.42/0.99 Megabytes=0.17.
% 0.42/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 THEOREM PROVED
% 0.42/0.99 % SZS status Theorem
% 0.42/0.99
% 0.42/0.99 Exiting with 1 proof.
% 0.42/0.99
% 0.42/0.99 Process 25607 exit (max_proofs) Tue Jun 14 14:01:04 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------