TSTP Solution File: LCL181-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL181-3 : TPTP v8.1.0. Released v2.3.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:38 EDT 2022
% Result : Unsatisfiable 30.45s 30.81s
% Output : Refutation 30.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL181-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 2 19:26:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.31/1.64 ============================== Prover9 ===============================
% 1.31/1.64 Prover9 (32) version 2009-11A, November 2009.
% 1.31/1.64 Process 27830 was started by sandbox on n008.cluster.edu,
% 1.31/1.64 Sat Jul 2 19:26:39 2022
% 1.31/1.64 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27486_n008.cluster.edu".
% 1.31/1.64 ============================== end of head ===========================
% 1.31/1.64
% 1.31/1.64 ============================== INPUT =================================
% 1.31/1.64
% 1.31/1.64 % Reading from file /tmp/Prover9_27486_n008.cluster.edu
% 1.31/1.64
% 1.31/1.64 set(prolog_style_variables).
% 1.31/1.64 set(auto2).
% 1.31/1.64 % set(auto2) -> set(auto).
% 1.31/1.64 % set(auto) -> set(auto_inference).
% 1.31/1.64 % set(auto) -> set(auto_setup).
% 1.31/1.64 % set(auto_setup) -> set(predicate_elim).
% 1.31/1.64 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.31/1.64 % set(auto) -> set(auto_limits).
% 1.31/1.64 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.31/1.64 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.31/1.64 % set(auto) -> set(auto_denials).
% 1.31/1.64 % set(auto) -> set(auto_process).
% 1.31/1.64 % set(auto2) -> assign(new_constants, 1).
% 1.31/1.64 % set(auto2) -> assign(fold_denial_max, 3).
% 1.31/1.64 % set(auto2) -> assign(max_weight, "200.000").
% 1.31/1.64 % set(auto2) -> assign(max_hours, 1).
% 1.31/1.64 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.31/1.64 % set(auto2) -> assign(max_seconds, 0).
% 1.31/1.64 % set(auto2) -> assign(max_minutes, 5).
% 1.31/1.64 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.31/1.64 % set(auto2) -> set(sort_initial_sos).
% 1.31/1.64 % set(auto2) -> assign(sos_limit, -1).
% 1.31/1.64 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.31/1.64 % set(auto2) -> assign(max_megs, 400).
% 1.31/1.64 % set(auto2) -> assign(stats, some).
% 1.31/1.64 % set(auto2) -> clear(echo_input).
% 1.31/1.64 % set(auto2) -> set(quiet).
% 1.31/1.64 % set(auto2) -> clear(print_initial_clauses).
% 1.31/1.64 % set(auto2) -> clear(print_given).
% 1.31/1.64 assign(lrs_ticks,-1).
% 1.31/1.64 assign(sos_limit,10000).
% 1.31/1.64 assign(order,kbo).
% 1.31/1.64 set(lex_order_vars).
% 1.31/1.64 clear(print_given).
% 1.31/1.64
% 1.31/1.64 % formulas(sos). % not echoed (9 formulas)
% 1.31/1.64
% 1.31/1.64 ============================== end of input ==========================
% 1.31/1.64
% 1.31/1.64 % From the command line: assign(max_seconds, 300).
% 1.31/1.64
% 1.31/1.64 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.31/1.64
% 1.31/1.64 % Formulas that are not ordinary clauses:
% 1.31/1.64
% 1.31/1.64 ============================== end of process non-clausal formulas ===
% 1.31/1.64
% 1.31/1.64 ============================== PROCESS INITIAL CLAUSES ===============
% 1.31/1.64
% 1.31/1.64 ============================== PREDICATE ELIMINATION =================
% 1.31/1.64 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.31/1.64 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.31/1.64 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.31/1.64 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.31/1.64 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.31/1.64 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.31/1.64 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.31/1.64 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.31/1.64 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.31/1.64 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.31/1.64 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.31/1.64
% 1.31/1.64 ============================== end predicate elimination =============
% 1.31/1.64
% 1.31/1.64 Auto_denials:
% 1.31/1.64 % copying label prove_this to answer in negative clause
% 1.31/1.64
% 1.31/1.64 Term ordering decisions:
% 1.31/1.64
% 1.31/1.64 % Assigning unary symbol not kb_weight 0 and highest precedence (7).
% 1.31/1.64 Function symbol KB weights: p=1. q=1. or=1. implies=1. not=0.
% 1.31/1.64
% 1.31/1.64 ============================== end of process initial clauses ========
% 1.31/1.64
% 1.31/1.64 ============================== CLAUSES FOR SEARCH ====================
% 1.31/1.64
% 1.31/1.64 ============================== end of clauses for search =============
% 1.31/1.64
% 1.31/1.64 ============================== SEARCH ================================
% 1.31/1.64
% 1.31/1.64 % Starting search at 0.01 seconds.
% 1.31/1.64
% 1.31/1.64 Low Water (keep): wt=33.000, iters=3372
% 1.31/1.64
% 1.31/1.64 Low Water (keep): wt=31.000, iters=3387
% 1.31/1.64
% 1.31/1.64 Low Water (keep): wt=26.000, iters=3414
% 1.31/1.64
% 1.31/1.64 Low Water (keep): wt=24.000, iters=3375
% 1.31/1.64
% 1.31/1.64 Low Water (keep): wt=22.000, iters=3366
% 1.31/1.64
% 1.31/1.64 Low Water (keep): wt=20.000, iters=3337
% 1.31/1.64
% 1.31/1.64 Low Water (keep): wt=19.000, iters=3342
% 30.45/30.81
% 30.45/30.81 Low Water (keep): wt=18.000, iters=3345
% 30.45/30.81
% 30.45/30.81 Low Water (keep): wt=17.000, iters=3411
% 30.45/30.81
% 30.45/30.81 Low Water (keep): wt=16.000, iters=3367
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=5767, wt=61.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=6831, wt=55.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=5780, wt=49.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=4807, wt=47.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=9543, wt=43.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=4810, wt=41.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=9540, wt=39.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=6847, wt=37.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=9556, wt=35.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=5563, wt=33.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=10325, wt=15.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=10328, wt=13.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=10421, wt=12.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=10457, wt=11.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=11664, wt=10.000
% 30.45/30.81
% 30.45/30.81 Low Water (displace): id=14656, wt=8.000
% 30.45/30.81
% 30.45/30.81 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 823 (0.00 of 2.20 sec).
% 30.45/30.81
% 30.45/30.81 Low Water (keep): wt=14.000, iters=3424
% 30.45/30.81
% 30.45/30.81 ============================== PROOF =================================
% 30.45/30.81 % SZS status Unsatisfiable
% 30.45/30.81 % SZS output start Refutation
% 30.45/30.81
% 30.45/30.81 % Proof 1 at 29.13 (+ 0.68) seconds: prove_this.
% 30.45/30.81 % Length of proof is 32.
% 30.45/30.81 % Level of proof is 10.
% 30.45/30.81 % Maximum clause weight is 15.000.
% 30.45/30.81 % Given clauses 1922.
% 30.45/30.81
% 30.45/30.81 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 30.45/30.81 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 30.45/30.81 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 30.45/30.81 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 30.45/30.81 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 30.45/30.81 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 30.45/30.81 8 -theorem(implies(implies(not(p),q),implies(not(q),p))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 30.45/30.81 9 -theorem(or(not(or(not(not(p)),q)),or(not(not(q)),p))) # answer(prove_this). [copy(8),rewrite([7(4),7(9),7(11)])].
% 30.45/30.81 10 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 30.45/30.81 11 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(10),rewrite([7(2)])].
% 30.45/30.81 14 theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 30.45/30.81 15 theorem(or(not(A),or(B,A))). [copy(14),rewrite([7(2)])].
% 30.45/30.81 16 theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 30.45/30.81 17 theorem(or(not(or(A,B)),or(B,A))). [copy(16),rewrite([7(3)])].
% 30.45/30.81 18 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 30.45/30.81 19 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(18),rewrite([7(5)])].
% 30.45/30.81 20 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 30.45/30.81 21 theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))). [copy(20),rewrite([7(1),7(5),7(7)])].
% 30.45/30.81 38 theorem(or(A,or(not(B),B))). [hyper(11,b,19,a,c,15,a)].
% 30.45/30.81 41 -theorem(or(not(not(q)),or(not(or(not(not(p)),q)),p))) # answer(prove_this). [ur(11,a,9,a,b,19,a)].
% 30.45/30.81 43 theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))). [hyper(11,b,19,a,c,21,a)].
% 30.45/30.81 47 theorem(or(not(or(A,or(B,C))),or(A,or(C,B)))). [hyper(11,b,21,a,c,17,a)].
% 30.45/30.81 108 theorem(or(not(A),A)). [hyper(11,b,38,a,c,38,a)].
% 30.45/30.81 121 theorem(or(A,not(A))). [hyper(11,b,17,a,c,108,a)].
% 30.45/30.81 183 theorem(or(not(or(A,B)),or(A,not(not(B))))). [hyper(11,b,21,a,c,121,a)].
% 30.45/30.81 5226 theorem(or(not(or(not(not(A)),B)),or(A,B))). [hyper(11,b,43,a,c,121,a)].
% 30.45/30.81 7558 theorem(or(not(or(A,B)),or(not(not(B)),A))). [hyper(11,b,47,a,c,183,a)].
% 30.45/30.81 17049 theorem(or(not(or(not(not(A)),B)),or(B,A))). [hyper(11,b,47,a,c,5226,a)].
% 30.45/30.81 32549 -theorem(or(or(not(or(not(not(p)),q)),p),q)) # answer(prove_this). [ur(11,a,41,a,b,7558,a)].
% 30.45/30.81 68919 theorem(or(A,or(not(or(not(not(B)),A)),B))). [hyper(11,b,19,a,c,17049,a)].
% 30.45/30.81 146161 theorem(or(or(not(or(not(not(A)),B)),A),B)). [hyper(11,b,17,a,c,68919,a)].
% 30.45/30.81 146162 $F # answer(prove_this). [resolve(146161,a,32549,a)].
% 30.45/30.81
% 30.45/30.81 % SZS output end Refutation
% 30.45/30.81 ============================== end of proof ==========================
% 30.45/30.81
% 30.45/30.81 ============================== STATISTICS ============================
% 30.45/30.81
% 30.45/30.81 Given=1922. Generated=1295914. Kept=146148. proofs=1.
% 30.45/30.81 Usable=1922. Sos=9999. Demods=1. Limbo=164, Disabled=134076. Hints=0.
% 30.45/30.81 Megabytes=99.60.
% 30.45/30.81 User_CPU=29.13, System_CPU=0.68, Wall_clock=29.
% 30.45/30.81
% 30.45/30.81 ============================== end of statistics =====================
% 30.45/30.81
% 30.45/30.81 ============================== end of search =========================
% 30.45/30.81
% 30.45/30.81 THEOREM PROVED
% 30.45/30.81 % SZS status Unsatisfiable
% 30.45/30.81
% 30.45/30.81 Exiting with 1 proof.
% 30.45/30.81
% 30.45/30.81 Process 27830 exit (max_proofs) Sat Jul 2 19:27:08 2022
% 30.45/30.81 Prover9 interrupted
%------------------------------------------------------------------------------