TSTP Solution File: LAT097-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT097-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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 : Sun Jul 17 06:25:33 EDT 2022
% Result : Unsatisfiable 1.10s 1.38s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT097-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n003.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 29 04:40:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.10/1.38 ============================== Prover9 ===============================
% 1.10/1.38 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.38 Process 32084 was started by sandbox on n003.cluster.edu,
% 1.10/1.38 Wed Jun 29 04:40:36 2022
% 1.10/1.38 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31931_n003.cluster.edu".
% 1.10/1.38 ============================== end of head ===========================
% 1.10/1.38
% 1.10/1.38 ============================== INPUT =================================
% 1.10/1.38
% 1.10/1.38 % Reading from file /tmp/Prover9_31931_n003.cluster.edu
% 1.10/1.38
% 1.10/1.38 set(prolog_style_variables).
% 1.10/1.38 set(auto2).
% 1.10/1.38 % set(auto2) -> set(auto).
% 1.10/1.38 % set(auto) -> set(auto_inference).
% 1.10/1.38 % set(auto) -> set(auto_setup).
% 1.10/1.38 % set(auto_setup) -> set(predicate_elim).
% 1.10/1.38 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.10/1.38 % set(auto) -> set(auto_limits).
% 1.10/1.38 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.10/1.38 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.10/1.38 % set(auto) -> set(auto_denials).
% 1.10/1.38 % set(auto) -> set(auto_process).
% 1.10/1.38 % set(auto2) -> assign(new_constants, 1).
% 1.10/1.38 % set(auto2) -> assign(fold_denial_max, 3).
% 1.10/1.38 % set(auto2) -> assign(max_weight, "200.000").
% 1.10/1.38 % set(auto2) -> assign(max_hours, 1).
% 1.10/1.38 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.10/1.38 % set(auto2) -> assign(max_seconds, 0).
% 1.10/1.38 % set(auto2) -> assign(max_minutes, 5).
% 1.10/1.38 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.10/1.38 % set(auto2) -> set(sort_initial_sos).
% 1.10/1.38 % set(auto2) -> assign(sos_limit, -1).
% 1.10/1.38 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.10/1.38 % set(auto2) -> assign(max_megs, 400).
% 1.10/1.38 % set(auto2) -> assign(stats, some).
% 1.10/1.38 % set(auto2) -> clear(echo_input).
% 1.10/1.38 % set(auto2) -> set(quiet).
% 1.10/1.38 % set(auto2) -> clear(print_initial_clauses).
% 1.10/1.38 % set(auto2) -> clear(print_given).
% 1.10/1.38 assign(lrs_ticks,-1).
% 1.10/1.38 assign(sos_limit,10000).
% 1.10/1.38 assign(order,kbo).
% 1.10/1.38 set(lex_order_vars).
% 1.10/1.38 clear(print_given).
% 1.10/1.38
% 1.10/1.38 % formulas(sos). % not echoed (2 formulas)
% 1.10/1.38
% 1.10/1.38 ============================== end of input ==========================
% 1.10/1.38
% 1.10/1.38 % From the command line: assign(max_seconds, 300).
% 1.10/1.38
% 1.10/1.38 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.10/1.38
% 1.10/1.38 % Formulas that are not ordinary clauses:
% 1.10/1.38
% 1.10/1.38 ============================== end of process non-clausal formulas ===
% 1.10/1.38
% 1.10/1.38 ============================== PROCESS INITIAL CLAUSES ===============
% 1.10/1.38
% 1.10/1.38 ============================== PREDICATE ELIMINATION =================
% 1.10/1.38
% 1.10/1.38 ============================== end predicate elimination =============
% 1.10/1.38
% 1.10/1.38 Auto_denials:
% 1.10/1.38 % copying label prove_wal_axioms_6 to answer in negative clause
% 1.10/1.38
% 1.10/1.38 Term ordering decisions:
% 1.10/1.38 Function symbol KB weights: a=1. b=1. c=1. join=1. meet=1.
% 1.10/1.38
% 1.10/1.38 ============================== end of process initial clauses ========
% 1.10/1.38
% 1.10/1.38 ============================== CLAUSES FOR SEARCH ====================
% 1.10/1.38
% 1.10/1.38 ============================== end of clauses for search =============
% 1.10/1.38
% 1.10/1.38 ============================== SEARCH ================================
% 1.10/1.38
% 1.10/1.38 % Starting search at 0.01 seconds.
% 1.10/1.38
% 1.10/1.38 ============================== PROOF =================================
% 1.10/1.38 % SZS status Unsatisfiable
% 1.10/1.38 % SZS output start Refutation
% 1.10/1.38
% 1.10/1.38 % Proof 1 at 0.42 (+ 0.00) seconds: prove_wal_axioms_6.
% 1.10/1.39 % Length of proof is 34.
% 1.10/1.39 % Level of proof is 20.
% 1.10/1.39 % Maximum clause weight is 155.000.
% 1.10/1.39 % Given clauses 42.
% 1.10/1.39
% 1.10/1.39 1 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(B,D),meet(E,B)),B)),meet(join(meet(B,meet(meet(join(B,D),join(E,B)),B)),meet(F,join(B,meet(meet(join(B,D),join(E,B)),B)))),join(A,join(join(meet(B,D),meet(E,B)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B # label(single_axiom) # label(axiom). [assumption].
% 1.10/1.39 2 join(join(meet(a,b),meet(c,b)),b) != b # label(prove_wal_axioms_6) # label(negated_conjecture) # answer(prove_wal_axioms_6). [assumption].
% 1.10/1.39 3 join(meet(join(meet(A,join(meet(B,C),meet(C,join(B,C)))),meet(join(meet(B,C),meet(C,join(B,C))),join(A,join(meet(B,C),meet(C,join(B,C)))))),D),meet(join(meet(A,join(join(meet(join(meet(B,C),meet(C,join(B,C))),E),meet(F,join(meet(B,C),meet(C,join(B,C))))),join(meet(B,C),meet(C,join(B,C))))),meet(C,join(A,join(join(meet(join(meet(B,C),meet(C,join(B,C))),E),meet(F,join(meet(B,C),meet(C,join(B,C))))),join(meet(B,C),meet(C,join(B,C))))))),join(join(meet(A,join(meet(B,C),meet(C,join(B,C)))),meet(join(meet(B,C),meet(C,join(B,C))),join(A,join(meet(B,C),meet(C,join(B,C)))))),D))) = join(meet(B,C),meet(C,join(B,C))). [para(1(a,1),1(a,1,2,1,2,1))].
% 1.10/1.39 4 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(B,D),meet(E,B)),B)),meet(join(meet(F,join(join(meet(B,V6),meet(V7,B)),B)),meet(join(meet(B,meet(meet(join(B,V6),join(V7,B)),B)),meet(V8,join(B,meet(meet(join(B,V6),join(V7,B)),B)))),join(F,join(join(meet(B,V6),meet(V7,B)),B)))),join(A,join(join(meet(B,D),meet(E,B)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B. [para(1(a,1),3(a,1,1,1,1,2)),rewrite([1(85),1(85),1(89),1(90),1(92),1(118),1(119),1(121),1(125),1(126),1(126),1(132)])].
% 1.10/1.39 5 join(meet(join(meet(join(meet(A,B),meet(B,join(A,B))),B),meet(B,join(join(meet(A,B),meet(B,join(A,B))),B))),C),meet(B,join(join(meet(join(meet(A,B),meet(B,join(A,B))),B),meet(B,join(join(meet(A,B),meet(B,join(A,B))),B))),C))) = B. [para(1(a,1),4(a,1,2,1))].
% 1.10/1.39 8 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(B,D),meet(E,B)),B)),meet(B,join(A,join(join(meet(B,D),meet(E,B)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B. [para(5(a,1),3(a,1,1,1,1,2)),rewrite([5(29),5(29),5(33),5(34),5(36),5(38),5(39),5(41),5(45),5(46),5(46),5(52)])].
% 1.10/1.39 11 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(B,D),meet(E,B)),B)),meet(join(meet(B,meet(meet(join(B,F),join(V6,B)),B)),meet(V7,join(B,meet(meet(join(B,F),join(V6,B)),B)))),join(A,join(join(meet(B,D),meet(E,B)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B. [para(5(a,1),4(a,1,2,1,2,1))].
% 1.10/1.39 13 join(meet(A,B),meet(A,join(A,B))) = A. [para(5(a,1),5(a,1,1,1)),rewrite([5(29)])].
% 1.10/1.39 15 join(meet(join(meet(A,join(meet(B,A),meet(A,join(B,A)))),meet(join(meet(B,A),meet(A,join(B,A))),join(A,join(meet(B,A),meet(A,join(B,A)))))),C),meet(A,join(join(meet(A,join(meet(B,A),meet(A,join(B,A)))),meet(join(meet(B,A),meet(A,join(B,A))),join(A,join(meet(B,A),meet(A,join(B,A)))))),C))) = join(meet(B,A),meet(A,join(B,A))). [para(13(a,1),3(a,1,2,1))].
% 1.10/1.39 42 join(meet(A,join(join(meet(B,C),meet(D,B)),B)),meet(B,join(A,join(join(meet(B,C),meet(D,B)),B)))) = B. [para(8(a,1),8(a,1,1,1)),rewrite([8(105),8(49),13(4)]),flip(a)].
% 1.10/1.39 69 join(meet(A,join(join(meet(B,C),meet(D,B)),B)),meet(join(meet(B,meet(meet(join(B,E),join(F,B)),B)),meet(V6,join(B,meet(meet(join(B,E),join(F,B)),B)))),join(A,join(join(meet(B,C),meet(D,B)),B)))) = B. [para(11(a,1),42(a,1)),flip(a)].
% 1.10/1.39 76 join(meet(A,meet(meet(join(A,B),join(C,A)),A)),meet(D,join(A,meet(meet(join(A,B),join(C,A)),A)))) = A. [para(69(a,1),13(a,1)),flip(a)].
% 1.10/1.39 85 join(meet(A,B),meet(B,join(A,B))) = B. [para(15(a,1),42(a,1))].
% 1.10/1.39 134 meet(meet(join(A,B),join(C,A)),A) = A. [para(76(a,1),85(a,1)),flip(a)].
% 1.10/1.39 154 join(meet(A,A),meet(B,join(A,A))) = A. [back_rewrite(76),rewrite([134(4),134(5)])].
% 1.10/1.39 181 join(join(meet(A,B),meet(C,A)),A) = A. [para(154(a,1),42(a,1))].
% 1.10/1.39 183 join(meet(A,A),join(A,A)) = A. [para(134(a,1),154(a,1,2))].
% 1.10/1.39 185 join(meet(meet(A,A),join(A,A)),meet(meet(A,A),A)) = meet(A,A). [para(183(a,1),13(a,1,2,2))].
% 1.10/1.39 188 join(meet(meet(A,A),join(A,A)),meet(join(A,A),A)) = join(A,A). [para(183(a,1),85(a,1,2,2))].
% 1.10/1.39 202 meet(meet(join(A,B),A),A) = A. [para(181(a,1),134(a,1,1,2))].
% 1.10/1.39 204 join(join(meet(A,B),A),A) = A. [para(134(a,1),181(a,1,1,2))].
% 1.10/1.39 206 meet(meet(A,meet(A,B)),meet(A,B)) = meet(A,B). [para(13(a,1),202(a,1,1,1))].
% 1.10/1.39 228 join(join(A,meet(join(A,B),A)),meet(join(A,B),A)) = meet(join(A,B),A). [para(202(a,1),204(a,1,1,1))].
% 1.10/1.39 238 meet(A,A) = A. [para(134(a,1),206(a,1,1,2)),rewrite([134(4),134(4),134(5)])].
% 1.10/1.39 259 join(meet(A,join(A,A)),meet(join(A,A),A)) = join(A,A). [back_rewrite(188),rewrite([238(1)])].
% 1.10/1.39 262 join(meet(A,join(A,A)),A) = A. [back_rewrite(185),rewrite([238(1),238(3),238(3),238(4)])].
% 1.10/1.39 267 join(A,meet(B,join(A,A))) = A. [back_rewrite(154),rewrite([238(1)])].
% 1.10/1.39 287 meet(join(A,A),A) = A. [para(238(a,1),134(a,1,1))].
% 1.10/1.39 290 join(A,A) = A. [back_rewrite(259),rewrite([287(4),262(3)]),flip(a)].
% 1.10/1.39 297 join(A,meet(B,A)) = A. [back_rewrite(267),rewrite([290(1)])].
% 1.10/1.39 309 meet(join(A,B),A) = A. [back_rewrite(228),rewrite([297(3),297(3)]),flip(a)].
% 1.10/1.39 329 meet(A,meet(B,A)) = meet(B,A). [para(85(a,1),309(a,1,1))].
% 1.10/1.39 396 join(join(meet(A,B),meet(C,B)),B) = B. [para(329(a,1),181(a,1,1,1))].
% 1.10/1.39 397 $F # answer(prove_wal_axioms_6). [resolve(396,a,2,a)].
% 1.10/1.39
% 1.10/1.39 % SZS output end Refutation
% 1.10/1.39 ============================== end of proof ==========================
% 1.10/1.39
% 1.10/1.39 ============================== STATISTICS ============================
% 1.10/1.39
% 1.10/1.39 Given=42. Generated=2590. Kept=396. proofs=1.
% 1.10/1.39 Usable=21. Sos=86. Demods=106. Limbo=0, Disabled=290. Hints=0.
% 1.10/1.39 Megabytes=1.33.
% 1.10/1.39 User_CPU=0.42, System_CPU=0.00, Wall_clock=1.
% 1.10/1.39
% 1.10/1.39 ============================== end of statistics =====================
% 1.10/1.39
% 1.10/1.39 ============================== end of search =========================
% 1.10/1.39
% 1.10/1.39 THEOREM PROVED
% 1.10/1.39 % SZS status Unsatisfiable
% 1.10/1.39
% 1.10/1.39 Exiting with 1 proof.
% 1.10/1.39
% 1.10/1.39 Process 32084 exit (max_proofs) Wed Jun 29 04:40:37 2022
% 1.10/1.39 Prover9 interrupted
%------------------------------------------------------------------------------