TSTP Solution File: ALG440-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ALG440-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 : Thu Jul 14 17:54:52 EDT 2022
% Result : Unsatisfiable 1.64s 1.91s
% Output : Refutation 1.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : ALG440-1 : TPTP v8.1.0. Released v5.4.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 8 13:28:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.91 ============================== Prover9 ===============================
% 1.64/1.91 Prover9 (32) version 2009-11A, November 2009.
% 1.64/1.91 Process 22916 was started by sandbox on n023.cluster.edu,
% 1.64/1.91 Wed Jun 8 13:28:38 2022
% 1.64/1.91 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22763_n023.cluster.edu".
% 1.64/1.91 ============================== end of head ===========================
% 1.64/1.91
% 1.64/1.91 ============================== INPUT =================================
% 1.64/1.91
% 1.64/1.91 % Reading from file /tmp/Prover9_22763_n023.cluster.edu
% 1.64/1.91
% 1.64/1.91 set(prolog_style_variables).
% 1.64/1.91 set(auto2).
% 1.64/1.91 % set(auto2) -> set(auto).
% 1.64/1.91 % set(auto) -> set(auto_inference).
% 1.64/1.91 % set(auto) -> set(auto_setup).
% 1.64/1.91 % set(auto_setup) -> set(predicate_elim).
% 1.64/1.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.64/1.91 % set(auto) -> set(auto_limits).
% 1.64/1.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.64/1.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.64/1.91 % set(auto) -> set(auto_denials).
% 1.64/1.91 % set(auto) -> set(auto_process).
% 1.64/1.91 % set(auto2) -> assign(new_constants, 1).
% 1.64/1.91 % set(auto2) -> assign(fold_denial_max, 3).
% 1.64/1.91 % set(auto2) -> assign(max_weight, "200.000").
% 1.64/1.91 % set(auto2) -> assign(max_hours, 1).
% 1.64/1.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.64/1.91 % set(auto2) -> assign(max_seconds, 0).
% 1.64/1.91 % set(auto2) -> assign(max_minutes, 5).
% 1.64/1.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.64/1.91 % set(auto2) -> set(sort_initial_sos).
% 1.64/1.91 % set(auto2) -> assign(sos_limit, -1).
% 1.64/1.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.64/1.91 % set(auto2) -> assign(max_megs, 400).
% 1.64/1.91 % set(auto2) -> assign(stats, some).
% 1.64/1.91 % set(auto2) -> clear(echo_input).
% 1.64/1.91 % set(auto2) -> set(quiet).
% 1.64/1.91 % set(auto2) -> clear(print_initial_clauses).
% 1.64/1.91 % set(auto2) -> clear(print_given).
% 1.64/1.91 assign(lrs_ticks,-1).
% 1.64/1.91 assign(sos_limit,10000).
% 1.64/1.91 assign(order,kbo).
% 1.64/1.91 set(lex_order_vars).
% 1.64/1.91 clear(print_given).
% 1.64/1.91
% 1.64/1.91 % formulas(sos). % not echoed (15 formulas)
% 1.64/1.91
% 1.64/1.91 ============================== end of input ==========================
% 1.64/1.91
% 1.64/1.91 % From the command line: assign(max_seconds, 300).
% 1.64/1.91
% 1.64/1.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.64/1.91
% 1.64/1.91 % Formulas that are not ordinary clauses:
% 1.64/1.91
% 1.64/1.91 ============================== end of process non-clausal formulas ===
% 1.64/1.91
% 1.64/1.91 ============================== PROCESS INITIAL CLAUSES ===============
% 1.64/1.91
% 1.64/1.91 ============================== PREDICATE ELIMINATION =================
% 1.64/1.91
% 1.64/1.91 ============================== end predicate elimination =============
% 1.64/1.91
% 1.64/1.91 Auto_denials:
% 1.64/1.91 % copying label goals to answer in negative clause
% 1.64/1.91
% 1.64/1.91 Term ordering decisions:
% 1.64/1.91 Function symbol KB weights: a=1. b=1. v=1. u=1. m=1.
% 1.64/1.91
% 1.64/1.91 ============================== end of process initial clauses ========
% 1.64/1.91
% 1.64/1.91 ============================== CLAUSES FOR SEARCH ====================
% 1.64/1.91
% 1.64/1.91 ============================== end of clauses for search =============
% 1.64/1.91
% 1.64/1.91 ============================== SEARCH ================================
% 1.64/1.91
% 1.64/1.91 % Starting search at 0.01 seconds.
% 1.64/1.91
% 1.64/1.91 Low Water (keep): wt=28.000, iters=3539
% 1.64/1.91
% 1.64/1.91 Low Water (keep): wt=25.000, iters=3396
% 1.64/1.91
% 1.64/1.91 Low Water (keep): wt=22.000, iters=3478
% 1.64/1.91
% 1.64/1.91 ============================== PROOF =================================
% 1.64/1.91 % SZS status Unsatisfiable
% 1.64/1.91 % SZS output start Refutation
% 1.64/1.91
% 1.64/1.91 % Proof 1 at 0.93 (+ 0.02) seconds: goals.
% 1.64/1.91 % Length of proof is 28.
% 1.64/1.91 % Level of proof is 8.
% 1.64/1.91 % Maximum clause weight is 25.000.
% 1.64/1.91 % Given clauses 34.
% 1.64/1.91
% 1.64/1.91 1 r(a,a,b) # label(sos_011) # label(axiom). [assumption].
% 1.64/1.91 2 r(a,b,a) # label(sos_012) # label(axiom). [assumption].
% 1.64/1.91 3 r(b,a,a) # label(sos_013) # label(axiom). [assumption].
% 1.64/1.91 5 m(A,A,B) = B # label(sos) # label(axiom). [assumption].
% 1.64/1.91 6 m(A,B,B) = A # label(sos_001) # label(axiom). [assumption].
% 1.64/1.91 7 u(A,A,A) = A # label(sos_002) # label(axiom). [assumption].
% 1.64/1.91 8 A v B = B v A # label(sos_006) # label(axiom). [assumption].
% 1.64/1.91 9 u(A,A,B) = A v B # label(sos_007) # label(axiom). [assumption].
% 1.64/1.91 10 A v B = u(A,A,B). [copy(9),flip(a)].
% 1.64/1.91 11 u(A,A,B) = u(A,B,A) # label(sos_004) # label(axiom). [assumption].
% 1.64/1.91 12 u(A,B,A) = u(A,A,B). [copy(11),flip(a)].
% 1.64/1.91 13 u(A,A,B) = u(B,A,A) # label(sos_005) # label(axiom). [assumption].
% 1.64/1.91 14 u(A,B,B) = u(B,A,B). [copy(13),flip(a),rewrite([12(2,R)])].
% 1.64/1.91 15 -r(a,a,a) # label(goals) # label(negated_conjecture) # answer(goals). [assumption].
% 1.64/1.91 16 -r(A,B,C) | -r(D,E,F) | r(A v D,B v E,C v F) # label(sos_010) # label(axiom). [assumption].
% 1.64/1.91 17 -r(A,B,C) | -r(D,E,F) | r(u(A,A,D),u(B,B,E),u(C,C,F)). [copy(16),rewrite([10(3),10(4),10(5)])].
% 1.64/1.91 18 -r(A,B,C) | -r(D,E,F) | -r(V6,V7,V8) | r(m(A,D,V6),m(B,E,V7),m(C,F,V8)) # label(sos_008) # label(axiom). [assumption].
% 1.64/1.91 19 -r(A,B,C) | -r(D,E,F) | -r(V6,V7,V8) | r(u(A,D,V6),u(B,E,V7),u(C,F,V8)) # label(sos_009) # label(axiom). [assumption].
% 1.64/1.91 20 u(A,B,B) = u(A,A,B). [back_rewrite(8),rewrite([10(1),10(2),12(2,R),14(2,R)]),flip(a)].
% 1.64/1.91 21 r(u(a,a,b),u(a,a,b),a). [hyper(17,a,3,a,b,2,a),rewrite([12(4,R),14(4,R),20(4),7(12)])].
% 1.64/1.91 22 r(u(a,a,b),a,u(a,a,b)). [hyper(17,a,3,a,b,1,a),rewrite([12(4,R),14(4,R),20(4),7(8)])].
% 1.64/1.91 23 r(a,u(a,a,b),u(a,a,b)). [hyper(17,a,2,a,b,1,a),rewrite([7(4),12(5,R),14(5,R),20(5)])].
% 1.64/1.91 33 r(u(a,a,b),u(a,a,b),u(a,a,b)). [hyper(19,a,3,a,b,2,a,c,1,a),rewrite([14(4),12(4),12(8)])].
% 1.64/1.91 7747 r(b,a,u(a,a,b)). [hyper(18,a,3,a,b,21,a,c,33,a),rewrite([6(10),6(11),5(9)])].
% 1.64/1.91 7752 r(u(a,a,b),b,a). [hyper(18,a,2,a,b,23,a,c,33,a),rewrite([5(7),6(14),6(15)])].
% 1.64/1.91 9589 r(b,b,a). [hyper(18,a,7747,a,b,22,a,c,7752,a),rewrite([6(10),5(5),5(12)])].
% 1.64/1.91 10537 r(a,a,a). [hyper(18,a,3,a,b,9589,a,c,2,a),rewrite([5(4),6(5),5(6)])].
% 1.64/1.91 10538 $F # answer(goals). [resolve(10537,a,15,a)].
% 1.64/1.91
% 1.64/1.91 % SZS output end Refutation
% 1.64/1.91 ============================== end of proof ==========================
% 1.64/1.91
% 1.64/1.91 ============================== STATISTICS ============================
% 1.64/1.91
% 1.64/1.91 Given=34. Generated=25924. Kept=10533. proofs=1.
% 1.64/1.91 Usable=34. Sos=9927. Demods=7. Limbo=569, Disabled=17. Hints=0.
% 1.64/1.91 Megabytes=11.78.
% 1.64/1.91 User_CPU=0.93, System_CPU=0.02, Wall_clock=1.
% 1.64/1.91
% 1.64/1.91 ============================== end of statistics =====================
% 1.64/1.91
% 1.64/1.91 ============================== end of search =========================
% 1.64/1.91
% 1.64/1.91 THEOREM PROVED
% 1.64/1.91 % SZS status Unsatisfiable
% 1.64/1.91
% 1.64/1.91 Exiting with 1 proof.
% 1.64/1.91
% 1.64/1.91 Process 22916 exit (max_proofs) Wed Jun 8 13:28:39 2022
% 1.64/1.91 Prover9 interrupted
%------------------------------------------------------------------------------