TSTP Solution File: LCL211-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL211-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:58 EDT 2022
% Result : Unsatisfiable 1.66s 1.95s
% Output : Refutation 1.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL211-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n008.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 2 21:15:38 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.66/1.95 ============================== Prover9 ===============================
% 1.66/1.95 Prover9 (32) version 2009-11A, November 2009.
% 1.66/1.95 Process 30883 was started by sandbox on n008.cluster.edu,
% 1.66/1.95 Sat Jul 2 21:15:38 2022
% 1.66/1.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30730_n008.cluster.edu".
% 1.66/1.95 ============================== end of head ===========================
% 1.66/1.95
% 1.66/1.95 ============================== INPUT =================================
% 1.66/1.95
% 1.66/1.95 % Reading from file /tmp/Prover9_30730_n008.cluster.edu
% 1.66/1.95
% 1.66/1.95 set(prolog_style_variables).
% 1.66/1.95 set(auto2).
% 1.66/1.95 % set(auto2) -> set(auto).
% 1.66/1.95 % set(auto) -> set(auto_inference).
% 1.66/1.95 % set(auto) -> set(auto_setup).
% 1.66/1.95 % set(auto_setup) -> set(predicate_elim).
% 1.66/1.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.66/1.95 % set(auto) -> set(auto_limits).
% 1.66/1.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.66/1.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.66/1.95 % set(auto) -> set(auto_denials).
% 1.66/1.95 % set(auto) -> set(auto_process).
% 1.66/1.95 % set(auto2) -> assign(new_constants, 1).
% 1.66/1.95 % set(auto2) -> assign(fold_denial_max, 3).
% 1.66/1.95 % set(auto2) -> assign(max_weight, "200.000").
% 1.66/1.95 % set(auto2) -> assign(max_hours, 1).
% 1.66/1.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.66/1.95 % set(auto2) -> assign(max_seconds, 0).
% 1.66/1.95 % set(auto2) -> assign(max_minutes, 5).
% 1.66/1.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.66/1.95 % set(auto2) -> set(sort_initial_sos).
% 1.66/1.95 % set(auto2) -> assign(sos_limit, -1).
% 1.66/1.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.66/1.95 % set(auto2) -> assign(max_megs, 400).
% 1.66/1.95 % set(auto2) -> assign(stats, some).
% 1.66/1.95 % set(auto2) -> clear(echo_input).
% 1.66/1.95 % set(auto2) -> set(quiet).
% 1.66/1.95 % set(auto2) -> clear(print_initial_clauses).
% 1.66/1.95 % set(auto2) -> clear(print_given).
% 1.66/1.95 assign(lrs_ticks,-1).
% 1.66/1.95 assign(sos_limit,10000).
% 1.66/1.95 assign(order,kbo).
% 1.66/1.95 set(lex_order_vars).
% 1.66/1.95 clear(print_given).
% 1.66/1.95
% 1.66/1.95 % formulas(sos). % not echoed (10 formulas)
% 1.66/1.95
% 1.66/1.95 ============================== end of input ==========================
% 1.66/1.95
% 1.66/1.95 % From the command line: assign(max_seconds, 300).
% 1.66/1.95
% 1.66/1.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.66/1.95
% 1.66/1.95 % Formulas that are not ordinary clauses:
% 1.66/1.95
% 1.66/1.95 ============================== end of process non-clausal formulas ===
% 1.66/1.95
% 1.66/1.95 ============================== PROCESS INITIAL CLAUSES ===============
% 1.66/1.95
% 1.66/1.95 ============================== PREDICATE ELIMINATION =================
% 1.66/1.95
% 1.66/1.95 ============================== end predicate elimination =============
% 1.66/1.95
% 1.66/1.95 Auto_denials:
% 1.66/1.95 % copying label prove_this to answer in negative clause
% 1.66/1.95
% 1.66/1.95 Term ordering decisions:
% 1.66/1.95 Function symbol KB weights: true=1. p=1. q=1. or=1. implies=1. axiom=1. theorem=1. not=1. ifeq=1.
% 1.66/1.95
% 1.66/1.95 ============================== end of process initial clauses ========
% 1.66/1.95
% 1.66/1.95 ============================== CLAUSES FOR SEARCH ====================
% 1.66/1.95
% 1.66/1.95 ============================== end of clauses for search =============
% 1.66/1.95
% 1.66/1.95 ============================== SEARCH ================================
% 1.66/1.95
% 1.66/1.95 % Starting search at 0.01 seconds.
% 1.66/1.95
% 1.66/1.95 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 5111 (0.00 of 0.65 sec).
% 1.66/1.95
% 1.66/1.95 Low Water (keep): wt=29.000, iters=3337
% 1.66/1.95
% 1.66/1.95 Low Water (keep): wt=27.000, iters=3353
% 1.66/1.95
% 1.66/1.95 Low Water (keep): wt=25.000, iters=3402
% 1.66/1.95
% 1.66/1.95 Low Water (keep): wt=23.000, iters=3511
% 1.66/1.95
% 1.66/1.95 Low Water (keep): wt=21.000, iters=3374
% 1.66/1.95
% 1.66/1.95 Low Water (keep): wt=19.000, iters=3401
% 1.66/1.95
% 1.66/1.95 ============================== PROOF =================================
% 1.66/1.95 % SZS status Unsatisfiable
% 1.66/1.95 % SZS output start Refutation
% 1.66/1.95
% 1.66/1.95 % Proof 1 at 0.89 (+ 0.06) seconds: prove_this.
% 1.66/1.95 % Length of proof is 37.
% 1.66/1.95 % Level of proof is 10.
% 1.66/1.95 % Maximum clause weight is 19.000.
% 1.66/1.95 % Given clauses 620.
% 1.66/1.95
% 1.66/1.95 1 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 1.66/1.95 2 axiom(implies(or(A,A),A)) = true # label(axiom_1_2) # label(axiom). [assumption].
% 1.66/1.95 3 axiom(implies(A,or(B,A))) = true # label(axiom_1_3) # label(axiom). [assumption].
% 1.66/1.95 4 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 1.66/1.95 5 ifeq(axiom(A),true,theorem(A),true) = true # label(rule_1) # label(axiom). [assumption].
% 1.66/1.95 6 axiom(implies(or(A,B),or(B,A))) = true # label(axiom_1_4) # label(axiom). [assumption].
% 1.66/1.95 7 axiom(or(not(or(A,B)),or(B,A))) = true. [copy(6),rewrite([4(3)])].
% 1.66/1.95 8 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true # label(axiom_1_5) # label(axiom). [assumption].
% 1.66/1.95 9 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true. [copy(8),rewrite([4(5)])].
% 1.66/1.95 10 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true # label(axiom_1_6) # label(axiom). [assumption].
% 1.66/1.95 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)])].
% 1.66/1.95 12 ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true # label(rule_2) # label(axiom). [assumption].
% 1.66/1.95 13 ifeq(theorem(or(not(A),B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true. [copy(12),rewrite([4(1)])].
% 1.66/1.95 14 theorem(implies(not(q),implies(or(p,q),p))) != true # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.66/1.95 15 theorem(or(not(not(q)),or(not(or(p,q)),p))) != true # answer(prove_this). [copy(14),rewrite([4(7),4(9)])].
% 1.66/1.95 16 axiom(or(not(A),or(B,A))) = true. [back_rewrite(3),rewrite([4(2)])].
% 1.66/1.95 17 axiom(or(not(or(A,A)),A)) = true. [back_rewrite(2),rewrite([4(2)])].
% 1.66/1.95 18 theorem(or(not(or(A,B)),or(B,A))) = true. [para(7(a,1),5(a,1,1)),rewrite([1(9)])].
% 1.66/1.95 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)])].
% 1.66/1.95 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)])].
% 1.66/1.95 21 theorem(or(not(A),or(B,A))) = true. [para(16(a,1),5(a,1,1)),rewrite([1(8)])].
% 1.66/1.95 22 theorem(or(not(or(A,A)),A)) = true. [para(17(a,1),5(a,1,1)),rewrite([1(8)])].
% 1.66/1.95 23 ifeq(theorem(or(A,B)),true,theorem(or(B,A)),true) = true. [para(18(a,1),13(a,1,1)),rewrite([1(11)])].
% 1.66/1.95 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)])].
% 1.66/1.95 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)])].
% 1.66/1.95 29 ifeq(theorem(or(A,A)),true,theorem(A),true) = true. [para(22(a,1),13(a,1,1)),rewrite([1(10)])].
% 1.66/1.95 52 ifeq(theorem(or(not(A),B)),true,theorem(or(not(or(C,A)),or(C,B))),true) = true. [para(20(a,1),13(a,1,1)),rewrite([1(15)])].
% 1.66/1.95 69 theorem(or(A,or(not(or(B,A)),B))) = true. [para(19(a,1),24(a,1,1)),rewrite([1(9)])].
% 1.66/1.95 87 theorem(or(or(not(or(A,B)),A),B)) = true. [para(69(a,1),23(a,1,1)),rewrite([1(9)])].
% 1.66/1.95 89 theorem(or(A,or(not(B),B))) = true. [para(19(a,1),27(a,1,1)),rewrite([1(8)])].
% 1.66/1.95 97 theorem(or(not(A),A)) = true. [para(89(a,1),29(a,1,1)),rewrite([1(7)])].
% 1.66/1.95 102 theorem(or(A,not(A))) = true. [para(97(a,1),23(a,1,1)),rewrite([1(7)])].
% 1.66/1.95 135 ifeq(theorem(or(not(or(or(not(or(A,B)),A),B)),C)),true,theorem(C),true) = true. [para(87(a,1),13(a,1,3,1)),rewrite([1(13)])].
% 1.66/1.95 394 theorem(or(not(or(A,B)),or(A,not(not(B))))) = true. [para(102(a,1),52(a,1,1)),rewrite([1(11)])].
% 1.66/1.95 2406 theorem(or(or(not(or(A,B)),A),not(not(B)))) = true. [para(394(a,1),135(a,1,1)),rewrite([1(11)])].
% 1.66/1.95 7922 theorem(or(not(not(A)),or(not(or(B,A)),B))) = true. [para(2406(a,1),23(a,1,1)),rewrite([1(11)])].
% 1.66/1.95 7923 $F # answer(prove_this). [resolve(7922,a,15,a)].
% 1.66/1.95
% 1.66/1.95 % SZS output end Refutation
% 1.66/1.95 ============================== end of proof ==========================
% 1.66/1.95
% 1.66/1.95 ============================== STATISTICS ============================
% 1.66/1.95
% 1.66/1.95 Given=620. Generated=87307. Kept=7917. proofs=1.
% 1.66/1.95 Usable=620. Sos=7285. Demods=7906. Limbo=2, Disabled=19. Hints=0.
% 1.66/1.95 Megabytes=9.60.
% 1.66/1.95 User_CPU=0.89, System_CPU=0.06, Wall_clock=1.
% 1.66/1.95
% 1.66/1.95 ============================== end of statistics =====================
% 1.66/1.95
% 1.66/1.95 ============================== end of search =========================
% 1.66/1.95
% 1.66/1.95 THEOREM PROVED
% 1.66/1.95 % SZS status Unsatisfiable
% 1.66/1.95
% 1.66/1.95 Exiting with 1 proof.
% 1.66/1.95
% 1.66/1.95 Process 30883 exit (max_proofs) Sat Jul 2 21:15:39 2022
% 1.66/1.95 Prover9 interrupted
%------------------------------------------------------------------------------