TSTP Solution File: LCL192-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL192-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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 13:44:46 EDT 2022
% Result : Unsatisfiable 135.12s 135.44s
% Output : Refutation 135.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL192-10 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n015.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 02:12:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 135.12/135.44 ============================== Prover9 ===============================
% 135.12/135.44 Prover9 (32) version 2009-11A, November 2009.
% 135.12/135.44 Process 20981 was started by sandbox on n015.cluster.edu,
% 135.12/135.44 Sun Jul 3 02:12:45 2022
% 135.12/135.44 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20827_n015.cluster.edu".
% 135.12/135.44 ============================== end of head ===========================
% 135.12/135.44
% 135.12/135.44 ============================== INPUT =================================
% 135.12/135.44
% 135.12/135.44 % Reading from file /tmp/Prover9_20827_n015.cluster.edu
% 135.12/135.44
% 135.12/135.44 set(prolog_style_variables).
% 135.12/135.44 set(auto2).
% 135.12/135.44 % set(auto2) -> set(auto).
% 135.12/135.44 % set(auto) -> set(auto_inference).
% 135.12/135.44 % set(auto) -> set(auto_setup).
% 135.12/135.44 % set(auto_setup) -> set(predicate_elim).
% 135.12/135.44 % set(auto_setup) -> assign(eq_defs, unfold).
% 135.12/135.44 % set(auto) -> set(auto_limits).
% 135.12/135.44 % set(auto_limits) -> assign(max_weight, "100.000").
% 135.12/135.44 % set(auto_limits) -> assign(sos_limit, 20000).
% 135.12/135.44 % set(auto) -> set(auto_denials).
% 135.12/135.44 % set(auto) -> set(auto_process).
% 135.12/135.44 % set(auto2) -> assign(new_constants, 1).
% 135.12/135.44 % set(auto2) -> assign(fold_denial_max, 3).
% 135.12/135.44 % set(auto2) -> assign(max_weight, "200.000").
% 135.12/135.44 % set(auto2) -> assign(max_hours, 1).
% 135.12/135.44 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 135.12/135.44 % set(auto2) -> assign(max_seconds, 0).
% 135.12/135.44 % set(auto2) -> assign(max_minutes, 5).
% 135.12/135.44 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 135.12/135.44 % set(auto2) -> set(sort_initial_sos).
% 135.12/135.44 % set(auto2) -> assign(sos_limit, -1).
% 135.12/135.44 % set(auto2) -> assign(lrs_ticks, 3000).
% 135.12/135.44 % set(auto2) -> assign(max_megs, 400).
% 135.12/135.44 % set(auto2) -> assign(stats, some).
% 135.12/135.44 % set(auto2) -> clear(echo_input).
% 135.12/135.44 % set(auto2) -> set(quiet).
% 135.12/135.44 % set(auto2) -> clear(print_initial_clauses).
% 135.12/135.44 % set(auto2) -> clear(print_given).
% 135.12/135.44 assign(lrs_ticks,-1).
% 135.12/135.44 assign(sos_limit,10000).
% 135.12/135.44 assign(order,kbo).
% 135.12/135.44 set(lex_order_vars).
% 135.12/135.44 clear(print_given).
% 135.12/135.44
% 135.12/135.44 % formulas(sos). % not echoed (10 formulas)
% 135.12/135.44
% 135.12/135.44 ============================== end of input ==========================
% 135.12/135.44
% 135.12/135.44 % From the command line: assign(max_seconds, 300).
% 135.12/135.44
% 135.12/135.44 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 135.12/135.44
% 135.12/135.44 % Formulas that are not ordinary clauses:
% 135.12/135.44
% 135.12/135.44 ============================== end of process non-clausal formulas ===
% 135.12/135.44
% 135.12/135.44 ============================== PROCESS INITIAL CLAUSES ===============
% 135.12/135.44
% 135.12/135.44 ============================== PREDICATE ELIMINATION =================
% 135.12/135.44
% 135.12/135.44 ============================== end predicate elimination =============
% 135.12/135.44
% 135.12/135.44 Auto_denials:
% 135.12/135.44 % copying label prove_this to answer in negative clause
% 135.12/135.44
% 135.12/135.44 Term ordering decisions:
% 135.12/135.44 Function symbol KB weights: true=1. p=1. q=1. r=1. or=1. implies=1. axiom=1. theorem=1. not=1. ifeq=1.
% 135.12/135.44
% 135.12/135.44 ============================== end of process initial clauses ========
% 135.12/135.44
% 135.12/135.44 ============================== CLAUSES FOR SEARCH ====================
% 135.12/135.44
% 135.12/135.44 ============================== end of clauses for search =============
% 135.12/135.44
% 135.12/135.44 ============================== SEARCH ================================
% 135.12/135.44
% 135.12/135.44 % Starting search at 0.01 seconds.
% 135.12/135.44
% 135.12/135.44 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 5111 (0.00 of 0.66 sec).
% 135.12/135.44
% 135.12/135.44 Low Water (keep): wt=29.000, iters=3337
% 135.12/135.44
% 135.12/135.44 Low Water (keep): wt=27.000, iters=3353
% 135.12/135.44
% 135.12/135.44 Low Water (keep): wt=25.000, iters=3402
% 135.12/135.44
% 135.12/135.44 Low Water (keep): wt=23.000, iters=3511
% 135.12/135.44
% 135.12/135.44 Low Water (keep): wt=21.000, iters=3374
% 135.12/135.44
% 135.12/135.44 Low Water (keep): wt=19.000, iters=3401
% 135.12/135.44
% 135.12/135.44 Low Water (keep): wt=17.000, iters=3340
% 135.12/135.44
% 135.12/135.44 Low Water (displace): id=5587, wt=65.000
% 135.12/135.44
% 135.12/135.44 Low Water (displace): id=3341, wt=63.000
% 135.12/135.44
% 135.12/135.44 Low Water (displace): id=5412, wt=49.000
% 135.12/135.44
% 135.12/135.44 Low Water (displace): id=12082, wt=15.000
% 135.12/135.44
% 135.12/135.44 Low Water (displace): id=12422, wt=13.000
% 135.12/135.44
% 135.12/135.44 ============================== PROOF =================================
% 135.12/135.44 % SZS status Unsatisfiable
% 135.12/135.44 % SZS output start Refutation
% 135.12/135.44
% 135.12/135.44 % Proof 1 at 125.83 (+ 8.62) seconds: prove_this.
% 135.12/135.44 % Length of proof is 41.
% 135.12/135.44 % Level of proof is 12.
% 135.12/135.44 % Maximum clause weight is 23.000.
% 135.12/135.44 % Given clauses 10510.
% 135.12/135.44
% 135.12/135.44 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 135.12/135.44 2 axiom(implies(or(A,A),A)) = true # label(axiom_1_2) # label(axiom). [assumption].
% 135.12/135.44 3 axiom(implies(A,or(B,A))) = true # label(axiom_1_3) # label(axiom). [assumption].
% 135.12/135.44 4 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 135.12/135.44 5 ifeq(axiom(A),true,theorem(A),true) = true # label(rule_1) # label(axiom). [assumption].
% 135.12/135.44 6 axiom(implies(or(A,B),or(B,A))) = true # label(axiom_1_4) # label(axiom). [assumption].
% 135.12/135.44 7 axiom(or(not(or(A,B)),or(B,A))) = true. [copy(6),rewrite([4(3)])].
% 135.12/135.44 8 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true # label(axiom_1_5) # label(axiom). [assumption].
% 135.12/135.44 9 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true. [copy(8),rewrite([4(5)])].
% 135.12/135.44 10 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true # label(axiom_1_6) # label(axiom). [assumption].
% 135.12/135.44 11 axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true. [copy(10),rewrite([4(1),4(5),4(7)])].
% 135.12/135.44 12 ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true # label(rule_2) # label(axiom). [assumption].
% 135.12/135.44 13 ifeq(theorem(or(not(A),B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true. [copy(12),rewrite([4(1)])].
% 135.12/135.44 14 theorem(implies(or(or(p,q),r),or(p,or(q,r)))) != true # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 135.12/135.44 15 theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))) != true # answer(prove_this). [copy(14),rewrite([4(11)])].
% 135.12/135.44 16 axiom(or(not(A),or(B,A))) = true. [back_rewrite(3),rewrite([4(2)])].
% 135.12/135.44 17 axiom(or(not(or(A,A)),A)) = true. [back_rewrite(2),rewrite([4(2)])].
% 135.12/135.44 18 theorem(or(not(or(A,B)),or(B,A))) = true. [para(7(a,1),5(a,1,1)),rewrite([1(9)])].
% 135.12/135.44 19 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true. [para(9(a,1),5(a,1,1)),rewrite([1(11)])].
% 135.12/135.44 20 theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true. [para(11(a,1),5(a,1,1)),rewrite([1(13)])].
% 135.12/135.44 21 theorem(or(not(A),or(B,A))) = true. [para(16(a,1),5(a,1,1)),rewrite([1(8)])].
% 135.12/135.44 22 theorem(or(not(or(A,A)),A)) = true. [para(17(a,1),5(a,1,1)),rewrite([1(8)])].
% 135.12/135.44 23 ifeq(theorem(or(A,B)),true,theorem(or(B,A)),true) = true. [para(18(a,1),13(a,1,1)),rewrite([1(11)])].
% 135.12/135.44 24 ifeq(theorem(or(not(or(not(or(A,B)),or(B,A))),C)),true,theorem(C),true) = true. [para(18(a,1),13(a,1,3,1)),rewrite([1(13)])].
% 135.12/135.44 27 ifeq(theorem(or(not(or(not(A),or(B,A))),C)),true,theorem(C),true) = true. [para(21(a,1),13(a,1,3,1)),rewrite([1(12)])].
% 135.12/135.44 29 ifeq(theorem(or(A,A)),true,theorem(A),true) = true. [para(22(a,1),13(a,1,1)),rewrite([1(10)])].
% 135.12/135.44 37 ifeq(theorem(or(A,or(B,C))),true,theorem(or(B,or(A,C))),true) = true. [para(19(a,1),13(a,1,1)),rewrite([1(13)])].
% 135.12/135.44 38 ifeq(theorem(or(not(or(not(or(A,or(B,C))),or(B,or(A,C)))),D)),true,theorem(D),true) = true. [para(19(a,1),13(a,1,3,1)),rewrite([1(15)])].
% 135.12/135.44 70 theorem(or(not(or(A,or(B,C))),or(A,or(C,B)))) = true. [para(20(a,1),24(a,1,1)),rewrite([1(11)])].
% 135.12/135.44 89 theorem(or(A,or(not(B),B))) = true. [para(19(a,1),27(a,1,1)),rewrite([1(8)])].
% 135.12/135.44 97 theorem(or(not(A),A)) = true. [para(89(a,1),29(a,1,1)),rewrite([1(7)])].
% 135.12/135.44 147 theorem(or(A,or(not(or(A,B)),B))) = true. [para(97(a,1),37(a,1,1)),rewrite([1(9)])].
% 135.12/135.44 188 theorem(or(not(or(A,or(B,or(C,D)))),or(A,or(C,or(B,D))))) = true. [para(20(a,1),38(a,1,1)),rewrite([1(13)])].
% 135.12/135.44 267 theorem(or(or(not(or(A,B)),B),A)) = true. [para(147(a,1),23(a,1,1)),rewrite([1(9)])].
% 135.12/135.44 385 theorem(or(A,or(or(not(or(or(A,B),C)),C),B))) = true. [para(267(a,1),37(a,1,1)),rewrite([1(11)])].
% 135.12/135.44 798 ifeq(theorem(or(A,or(B,C))),true,theorem(or(A,or(C,B))),true) = true. [para(70(a,1),13(a,1,1)),rewrite([1(13)])].
% 135.12/135.44 3289 ifeq(theorem(or(A,or(B,or(C,D)))),true,theorem(or(A,or(C,or(B,D)))),true) = true. [para(188(a,1),13(a,1,1)),rewrite([1(15)])].
% 135.12/135.44 12335 theorem(or(A,or(B,or(not(or(or(A,B),C)),C)))) = true. [para(385(a,1),798(a,1,1)),rewrite([1(11)])].
% 135.12/135.44 17345 theorem(or(A,or(not(or(or(A,B),C)),or(B,C)))) = true. [para(12335(a,1),3289(a,1,1)),rewrite([1(11)])].
% 135.12/135.44 17839 theorem(or(not(or(or(A,B),C)),or(A,or(B,C)))) = true. [para(17345(a,1),37(a,1,1)),rewrite([1(11)])].
% 135.12/135.44 17840 $F # answer(prove_this). [resolve(17839,a,15,a)].
% 135.12/135.44
% 135.12/135.44 % SZS output end Refutation
% 135.12/135.44 ============================== end of proof ==========================
% 135.12/135.44
% 135.12/135.44 ============================== STATISTICS ============================
% 135.12/135.44
% 135.12/135.44 Given=10510. Generated=17321830. Kept=17834. proofs=1.
% 135.12/135.44 Usable=10510. Sos=6711. Demods=17221. Limbo=1, Disabled=621. Hints=0.
% 135.12/135.44 Megabytes=16.86.
% 135.12/135.44 User_CPU=125.83, System_CPU=8.62, Wall_clock=135.
% 135.12/135.44
% 135.12/135.44 ============================== end of statistics =====================
% 135.12/135.44
% 135.12/135.44 ============================== end of search =========================
% 135.12/135.44
% 135.12/135.44 THEOREM PROVED
% 135.12/135.44 % SZS status Unsatisfiable
% 135.12/135.44
% 135.12/135.44 Exiting with 1 proof.
% 135.12/135.44
% 135.12/135.44 Process 20981 exit (max_proofs) Sun Jul 3 02:15:00 2022
% 135.12/135.44 Prover9 interrupted
%------------------------------------------------------------------------------