TSTP Solution File: LCL250-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL250-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:45:27 EDT 2022
% Result : Unsatisfiable 81.68s 81.94s
% Output : Refutation 81.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL250-10 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 02:09:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 81.68/81.94 ============================== Prover9 ===============================
% 81.68/81.94 Prover9 (32) version 2009-11A, November 2009.
% 81.68/81.94 Process 18568 was started by sandbox2 on n020.cluster.edu,
% 81.68/81.94 Sun Jul 3 02:09:46 2022
% 81.68/81.94 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18372_n020.cluster.edu".
% 81.68/81.94 ============================== end of head ===========================
% 81.68/81.94
% 81.68/81.94 ============================== INPUT =================================
% 81.68/81.94
% 81.68/81.94 % Reading from file /tmp/Prover9_18372_n020.cluster.edu
% 81.68/81.94
% 81.68/81.94 set(prolog_style_variables).
% 81.68/81.94 set(auto2).
% 81.68/81.94 % set(auto2) -> set(auto).
% 81.68/81.94 % set(auto) -> set(auto_inference).
% 81.68/81.94 % set(auto) -> set(auto_setup).
% 81.68/81.94 % set(auto_setup) -> set(predicate_elim).
% 81.68/81.94 % set(auto_setup) -> assign(eq_defs, unfold).
% 81.68/81.94 % set(auto) -> set(auto_limits).
% 81.68/81.94 % set(auto_limits) -> assign(max_weight, "100.000").
% 81.68/81.94 % set(auto_limits) -> assign(sos_limit, 20000).
% 81.68/81.94 % set(auto) -> set(auto_denials).
% 81.68/81.94 % set(auto) -> set(auto_process).
% 81.68/81.94 % set(auto2) -> assign(new_constants, 1).
% 81.68/81.94 % set(auto2) -> assign(fold_denial_max, 3).
% 81.68/81.94 % set(auto2) -> assign(max_weight, "200.000").
% 81.68/81.94 % set(auto2) -> assign(max_hours, 1).
% 81.68/81.94 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 81.68/81.94 % set(auto2) -> assign(max_seconds, 0).
% 81.68/81.94 % set(auto2) -> assign(max_minutes, 5).
% 81.68/81.94 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 81.68/81.94 % set(auto2) -> set(sort_initial_sos).
% 81.68/81.94 % set(auto2) -> assign(sos_limit, -1).
% 81.68/81.94 % set(auto2) -> assign(lrs_ticks, 3000).
% 81.68/81.94 % set(auto2) -> assign(max_megs, 400).
% 81.68/81.94 % set(auto2) -> assign(stats, some).
% 81.68/81.94 % set(auto2) -> clear(echo_input).
% 81.68/81.94 % set(auto2) -> set(quiet).
% 81.68/81.94 % set(auto2) -> clear(print_initial_clauses).
% 81.68/81.94 % set(auto2) -> clear(print_given).
% 81.68/81.94 assign(lrs_ticks,-1).
% 81.68/81.94 assign(sos_limit,10000).
% 81.68/81.94 assign(order,kbo).
% 81.68/81.94 set(lex_order_vars).
% 81.68/81.94 clear(print_given).
% 81.68/81.94
% 81.68/81.94 % formulas(sos). % not echoed (11 formulas)
% 81.68/81.94
% 81.68/81.94 ============================== end of input ==========================
% 81.68/81.94
% 81.68/81.94 % From the command line: assign(max_seconds, 300).
% 81.68/81.94
% 81.68/81.94 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 81.68/81.94
% 81.68/81.94 % Formulas that are not ordinary clauses:
% 81.68/81.94
% 81.68/81.94 ============================== end of process non-clausal formulas ===
% 81.68/81.94
% 81.68/81.94 ============================== PROCESS INITIAL CLAUSES ===============
% 81.68/81.94
% 81.68/81.94 ============================== PREDICATE ELIMINATION =================
% 81.68/81.94
% 81.68/81.94 ============================== end predicate elimination =============
% 81.68/81.94
% 81.68/81.94 Auto_denials:
% 81.68/81.94 % copying label prove_this to answer in negative clause
% 81.68/81.94
% 81.68/81.94 Term ordering decisions:
% 81.68/81.94 Function symbol KB weights: true=1. p=1. q=1. r=1. or=1. implies=1. and=1. axiom=1. not=1. theorem=1. ifeq=1.
% 81.68/81.94
% 81.68/81.94 ============================== end of process initial clauses ========
% 81.68/81.94
% 81.68/81.94 ============================== CLAUSES FOR SEARCH ====================
% 81.68/81.94
% 81.68/81.94 ============================== end of clauses for search =============
% 81.68/81.94
% 81.68/81.94 ============================== SEARCH ================================
% 81.68/81.94
% 81.68/81.94 % Starting search at 0.01 seconds.
% 81.68/81.94
% 81.68/81.94 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 5102 (0.00 of 0.64 sec).
% 81.68/81.94
% 81.68/81.94 Low Water (keep): wt=29.000, iters=3337
% 81.68/81.94
% 81.68/81.94 Low Water (keep): wt=27.000, iters=3353
% 81.68/81.94
% 81.68/81.94 Low Water (keep): wt=25.000, iters=3402
% 81.68/81.94
% 81.68/81.94 Low Water (keep): wt=23.000, iters=3511
% 81.68/81.94
% 81.68/81.94 Low Water (keep): wt=21.000, iters=3374
% 81.68/81.94
% 81.68/81.94 Low Water (keep): wt=19.000, iters=3401
% 81.68/81.94
% 81.68/81.94 Low Water (keep): wt=17.000, iters=3340
% 81.68/81.94
% 81.68/81.94 Low Water (displace): id=5588, wt=65.000
% 81.68/81.94
% 81.68/81.94 Low Water (displace): id=3342, wt=63.000
% 81.68/81.94
% 81.68/81.94 Low Water (displace): id=5413, wt=49.000
% 81.68/81.94
% 81.68/81.94 Low Water (displace): id=12083, wt=15.000
% 81.68/81.94
% 81.68/81.94 Low Water (displace): id=12423, wt=13.000
% 81.68/81.94
% 81.68/81.94 ============================== PROOF =================================
% 81.68/81.94 % SZS status Unsatisfiable
% 81.68/81.94 % SZS output start Refutation
% 81.68/81.94
% 81.68/81.94 % Proof 1 at 75.64 (+ 5.25) seconds: prove_this.
% 81.68/81.94 % Length of proof is 48.
% 81.68/81.94 % Level of proof is 14.
% 81.68/81.94 % Maximum clause weight is 19.000.
% 81.68/81.94 % Given clauses 7919.
% 81.68/81.94
% 81.68/81.94 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 81.68/81.94 2 axiom(implies(or(A,A),A)) = true # label(axiom_1_2) # label(axiom). [assumption].
% 81.68/81.94 3 axiom(implies(A,or(B,A))) = true # label(axiom_1_3) # label(axiom). [assumption].
% 81.68/81.94 4 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 81.68/81.94 5 ifeq(axiom(A),true,theorem(A),true) = true # label(rule_1) # label(axiom). [assumption].
% 81.68/81.94 6 axiom(implies(or(A,B),or(B,A))) = true # label(axiom_1_4) # label(axiom). [assumption].
% 81.68/81.94 7 axiom(or(not(or(A,B)),or(B,A))) = true. [copy(6),rewrite([4(3)])].
% 81.68/81.94 8 and(A,B) = not(or(not(A),not(B))) # label(and_defn) # label(axiom). [assumption].
% 81.68/81.94 9 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true # label(axiom_1_5) # label(axiom). [assumption].
% 81.68/81.94 10 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true. [copy(9),rewrite([4(5)])].
% 81.68/81.94 11 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true # label(axiom_1_6) # label(axiom). [assumption].
% 81.68/81.94 12 axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true. [copy(11),rewrite([4(1),4(5),4(7)])].
% 81.68/81.94 13 ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true # label(rule_2) # label(axiom). [assumption].
% 81.68/81.94 14 ifeq(theorem(or(not(A),B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true. [copy(13),rewrite([4(1)])].
% 81.68/81.94 15 theorem(implies(implies(q,r),implies(and(p,q),r))) != true # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 81.68/81.94 16 theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))) != true # answer(prove_this). [copy(15),rewrite([4(3),8(7),4(12),4(14)])].
% 81.68/81.94 17 axiom(or(not(A),or(B,A))) = true. [back_rewrite(3),rewrite([4(2)])].
% 81.68/81.94 18 axiom(or(not(or(A,A)),A)) = true. [back_rewrite(2),rewrite([4(2)])].
% 81.68/81.94 19 theorem(or(not(or(A,B)),or(B,A))) = true. [para(7(a,1),5(a,1,1)),rewrite([1(9)])].
% 81.68/81.94 20 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true. [para(10(a,1),5(a,1,1)),rewrite([1(11)])].
% 81.68/81.94 21 theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true. [para(12(a,1),5(a,1,1)),rewrite([1(13)])].
% 81.68/81.94 22 theorem(or(not(A),or(B,A))) = true. [para(17(a,1),5(a,1,1)),rewrite([1(8)])].
% 81.68/81.94 23 theorem(or(not(or(A,A)),A)) = true. [para(18(a,1),5(a,1,1)),rewrite([1(8)])].
% 81.68/81.94 24 ifeq(theorem(or(A,B)),true,theorem(or(B,A)),true) = true. [para(19(a,1),14(a,1,1)),rewrite([1(11)])].
% 81.68/81.94 25 ifeq(theorem(or(not(or(not(or(A,B)),or(B,A))),C)),true,theorem(C),true) = true. [para(19(a,1),14(a,1,3,1)),rewrite([1(13)])].
% 81.68/81.94 27 ifeq(theorem(A),true,theorem(or(B,A)),true) = true. [para(22(a,1),14(a,1,1)),rewrite([1(10)])].
% 81.68/81.94 28 ifeq(theorem(or(not(or(not(A),or(B,A))),C)),true,theorem(C),true) = true. [para(22(a,1),14(a,1,3,1)),rewrite([1(12)])].
% 81.68/81.94 30 ifeq(theorem(or(A,A)),true,theorem(A),true) = true. [para(23(a,1),14(a,1,1)),rewrite([1(10)])].
% 81.68/81.94 38 ifeq(theorem(or(A,or(B,C))),true,theorem(or(B,or(A,C))),true) = true. [para(20(a,1),14(a,1,1)),rewrite([1(13)])].
% 81.68/81.94 53 ifeq(theorem(or(not(A),B)),true,theorem(or(not(or(C,A)),or(C,B))),true) = true. [para(21(a,1),14(a,1,1)),rewrite([1(15)])].
% 81.68/81.94 70 theorem(or(A,or(not(or(B,A)),B))) = true. [para(20(a,1),25(a,1,1)),rewrite([1(9)])].
% 81.68/81.94 88 theorem(or(or(not(or(A,B)),A),B)) = true. [para(70(a,1),24(a,1,1)),rewrite([1(9)])].
% 81.68/81.94 90 theorem(or(A,or(not(B),B))) = true. [para(20(a,1),28(a,1,1)),rewrite([1(8)])].
% 81.68/81.94 98 theorem(or(not(A),A)) = true. [para(90(a,1),30(a,1,1)),rewrite([1(7)])].
% 81.68/81.94 103 theorem(or(A,not(A))) = true. [para(98(a,1),24(a,1,1)),rewrite([1(7)])].
% 81.68/81.94 136 ifeq(theorem(or(not(or(or(not(or(A,B)),A),B)),C)),true,theorem(C),true) = true. [para(88(a,1),14(a,1,3,1)),rewrite([1(13)])].
% 81.68/81.94 148 theorem(or(A,or(not(or(A,B)),B))) = true. [para(98(a,1),38(a,1,1)),rewrite([1(9)])].
% 81.68/81.94 268 theorem(or(or(not(or(A,B)),B),A)) = true. [para(148(a,1),24(a,1,1)),rewrite([1(9)])].
% 81.68/81.94 385 theorem(or(A,or(or(not(or(B,C)),C),B))) = true. [para(268(a,1),27(a,1,1)),rewrite([1(10)])].
% 81.68/81.94 395 theorem(or(not(or(A,B)),or(A,not(not(B))))) = true. [para(103(a,1),53(a,1,1)),rewrite([1(11)])].
% 81.68/81.94 2109 theorem(or(or(not(or(A,B)),B),or(C,A))) = true. [para(385(a,1),38(a,1,1)),rewrite([1(10)])].
% 81.68/81.94 2407 theorem(or(or(not(or(A,B)),A),not(not(B)))) = true. [para(395(a,1),136(a,1,1)),rewrite([1(11)])].
% 81.68/81.94 7923 theorem(or(not(not(A)),or(not(or(B,A)),B))) = true. [para(2407(a,1),24(a,1,1)),rewrite([1(11)])].
% 81.68/81.94 8919 theorem(or(not(or(A,B)),or(not(not(B)),A))) = true. [para(7923(a,1),38(a,1,1)),rewrite([1(11)])].
% 81.68/81.94 9111 ifeq(theorem(or(A,B)),true,theorem(or(not(not(B)),A)),true) = true. [para(8919(a,1),14(a,1,1)),rewrite([1(13)])].
% 81.68/81.94 13415 theorem(or(not(not(or(A,B))),or(not(or(B,C)),C))) = true. [para(2109(a,1),9111(a,1,1)),rewrite([1(12)])].
% 81.68/81.94 15492 theorem(or(not(or(A,B)),or(not(not(or(C,A))),B))) = true. [para(13415(a,1),38(a,1,1)),rewrite([1(12)])].
% 81.68/81.94 15493 $F # answer(prove_this). [resolve(15492,a,16,a)].
% 81.68/81.94
% 81.68/81.94 % SZS output end Refutation
% 81.68/81.94 ============================== end of proof ==========================
% 81.68/81.94
% 81.68/81.94 ============================== STATISTICS ============================
% 81.68/81.94
% 81.68/81.94 Given=7919. Generated=10812586. Kept=15487. proofs=1.
% 81.68/81.94 Usable=7919. Sos=6956. Demods=14874. Limbo=0, Disabled=622. Hints=0.
% 81.68/81.94 Megabytes=14.99.
% 81.68/81.94 User_CPU=75.64, System_CPU=5.25, Wall_clock=80.
% 81.68/81.94
% 81.68/81.94 ============================== end of statistics =====================
% 81.68/81.94
% 81.68/81.94 ============================== end of search =========================
% 81.68/81.94
% 81.68/81.94 THEOREM PROVED
% 81.68/81.94 % SZS status Unsatisfiable
% 81.68/81.94
% 81.68/81.94 Exiting with 1 proof.
% 81.68/81.94
% 81.68/81.94 Process 18568 exit (max_proofs) Sun Jul 3 02:11:06 2022
% 81.68/81.94 Prover9 interrupted
%------------------------------------------------------------------------------