TSTP Solution File: LCL231-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL231-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:15 EDT 2022
% Result : Unsatisfiable 62.13s 62.42s
% Output : Refutation 62.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL231-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n010.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 : Mon Jul 4 07:09:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.28/1.54 ============================== Prover9 ===============================
% 1.28/1.54 Prover9 (32) version 2009-11A, November 2009.
% 1.28/1.54 Process 29654 was started by sandbox on n010.cluster.edu,
% 1.28/1.54 Mon Jul 4 07:09:18 2022
% 1.28/1.54 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29500_n010.cluster.edu".
% 1.28/1.54 ============================== end of head ===========================
% 1.28/1.54
% 1.28/1.54 ============================== INPUT =================================
% 1.28/1.54
% 1.28/1.54 % Reading from file /tmp/Prover9_29500_n010.cluster.edu
% 1.28/1.54
% 1.28/1.54 set(prolog_style_variables).
% 1.28/1.54 set(auto2).
% 1.28/1.54 % set(auto2) -> set(auto).
% 1.28/1.54 % set(auto) -> set(auto_inference).
% 1.28/1.54 % set(auto) -> set(auto_setup).
% 1.28/1.54 % set(auto_setup) -> set(predicate_elim).
% 1.28/1.54 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.28/1.54 % set(auto) -> set(auto_limits).
% 1.28/1.54 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.28/1.54 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.28/1.54 % set(auto) -> set(auto_denials).
% 1.28/1.54 % set(auto) -> set(auto_process).
% 1.28/1.54 % set(auto2) -> assign(new_constants, 1).
% 1.28/1.54 % set(auto2) -> assign(fold_denial_max, 3).
% 1.28/1.54 % set(auto2) -> assign(max_weight, "200.000").
% 1.28/1.54 % set(auto2) -> assign(max_hours, 1).
% 1.28/1.54 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.28/1.54 % set(auto2) -> assign(max_seconds, 0).
% 1.28/1.54 % set(auto2) -> assign(max_minutes, 5).
% 1.28/1.54 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.28/1.54 % set(auto2) -> set(sort_initial_sos).
% 1.28/1.54 % set(auto2) -> assign(sos_limit, -1).
% 1.28/1.54 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.28/1.54 % set(auto2) -> assign(max_megs, 400).
% 1.28/1.54 % set(auto2) -> assign(stats, some).
% 1.28/1.54 % set(auto2) -> clear(echo_input).
% 1.28/1.54 % set(auto2) -> set(quiet).
% 1.28/1.54 % set(auto2) -> clear(print_initial_clauses).
% 1.28/1.54 % set(auto2) -> clear(print_given).
% 1.28/1.54 assign(lrs_ticks,-1).
% 1.28/1.54 assign(sos_limit,10000).
% 1.28/1.54 assign(order,kbo).
% 1.28/1.54 set(lex_order_vars).
% 1.28/1.54 clear(print_given).
% 1.28/1.54
% 1.28/1.54 % formulas(sos). % not echoed (9 formulas)
% 1.28/1.54
% 1.28/1.54 ============================== end of input ==========================
% 1.28/1.54
% 1.28/1.54 % From the command line: assign(max_seconds, 300).
% 1.28/1.54
% 1.28/1.54 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.28/1.54
% 1.28/1.54 % Formulas that are not ordinary clauses:
% 1.28/1.54
% 1.28/1.54 ============================== end of process non-clausal formulas ===
% 1.28/1.54
% 1.28/1.54 ============================== PROCESS INITIAL CLAUSES ===============
% 1.28/1.54
% 1.28/1.54 ============================== PREDICATE ELIMINATION =================
% 1.28/1.54 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.28/1.54 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.28/1.54 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.28/1.54 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.28/1.54 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.28/1.54 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.28/1.54 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.28/1.54 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.28/1.54 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.28/1.54 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.28/1.54 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.28/1.54
% 1.28/1.54 ============================== end predicate elimination =============
% 1.28/1.54
% 1.28/1.54 Auto_denials:
% 1.28/1.54 % copying label prove_this to answer in negative clause
% 1.28/1.54
% 1.28/1.54 Term ordering decisions:
% 1.28/1.54
% 1.28/1.54 % Assigning unary symbol not kb_weight 0 and highest precedence (8).
% 1.28/1.54 Function symbol KB weights: p=1. q=1. r=1. or=1. implies=1. not=0.
% 1.28/1.54
% 1.28/1.54 ============================== end of process initial clauses ========
% 1.28/1.54
% 1.28/1.54 ============================== CLAUSES FOR SEARCH ====================
% 1.28/1.54
% 1.28/1.54 ============================== end of clauses for search =============
% 1.28/1.54
% 1.28/1.54 ============================== SEARCH ================================
% 1.28/1.54
% 1.28/1.54 % Starting search at 0.01 seconds.
% 1.28/1.54
% 1.28/1.54 Low Water (keep): wt=40.000, iters=3371
% 1.28/1.54
% 1.28/1.54 Low Water (keep): wt=38.000, iters=3386
% 1.28/1.54
% 1.28/1.54 Low Water (keep): wt=30.000, iters=3354
% 1.28/1.54
% 1.28/1.54 Low Water (keep): wt=26.000, iters=3361
% 1.28/1.54
% 1.28/1.54 Low Water (keep): wt=24.000, iters=3378
% 1.28/1.54
% 1.28/1.54 Low Water (keep): wt=20.000, iters=3389
% 1.28/1.54
% 1.28/1.54 Low Water (keep): wt=19.000, iters=3359
% 62.13/62.42
% 62.13/62.42 Low Water (keep): wt=18.000, iters=3571
% 62.13/62.42
% 62.13/62.42 Low Water (keep): wt=17.000, iters=3411
% 62.13/62.42
% 62.13/62.42 Low Water (keep): wt=16.000, iters=3372
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=6082, wt=61.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=7185, wt=55.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=6095, wt=49.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=4763, wt=47.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=10043, wt=43.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=4766, wt=41.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=10040, wt=39.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=7201, wt=37.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=10056, wt=35.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=5725, wt=33.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=10318, wt=23.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=10319, wt=15.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=10323, wt=13.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=10332, wt=11.000
% 62.13/62.42
% 62.13/62.42 Low Water (displace): id=11517, wt=10.000
% 62.13/62.42
% 62.13/62.42 Low Water (keep): wt=15.000, iters=3335
% 62.13/62.42
% 62.13/62.42 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 789 (0.00 of 2.52 sec).
% 62.13/62.42
% 62.13/62.42 Low Water (keep): wt=14.000, iters=3334
% 62.13/62.42
% 62.13/62.42 ============================== PROOF =================================
% 62.13/62.42 % SZS status Unsatisfiable
% 62.13/62.42 % SZS output start Refutation
% 62.13/62.42
% 62.13/62.42 % Proof 1 at 60.03 (+ 1.42) seconds: prove_this.
% 62.13/62.42 % Length of proof is 20.
% 62.13/62.42 % Level of proof is 6.
% 62.13/62.42 % Maximum clause weight is 20.000.
% 62.13/62.42 % Given clauses 2643.
% 62.13/62.42
% 62.13/62.42 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 62.13/62.42 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 62.13/62.42 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 62.13/62.42 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 62.13/62.42 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 62.13/62.42 8 -theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r)))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 62.13/62.42 9 -theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))) # answer(prove_this). [copy(8),rewrite([7(3),7(7),7(9),7(14),7(16),7(18)])].
% 62.13/62.42 10 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 62.13/62.42 11 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(10),rewrite([7(2)])].
% 62.13/62.42 14 theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 62.13/62.42 15 theorem(or(not(A),or(B,A))). [copy(14),rewrite([7(2)])].
% 62.13/62.42 18 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 62.13/62.42 19 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(18),rewrite([7(5)])].
% 62.13/62.42 20 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 62.13/62.42 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)])].
% 62.13/62.42 43 theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))). [hyper(11,b,19,a,c,21,a)].
% 62.13/62.42 46 theorem(or(not(or(A,or(B,or(C,D)))),or(A,or(C,or(B,D))))). [hyper(11,b,21,a,c,19,a)].
% 62.13/62.42 5307 theorem(or(not(or(not(or(A,B)),C)),or(not(B),C))). [hyper(11,b,43,a,c,15,a)].
% 62.13/62.42 257322 theorem(or(not(or(not(or(A,B)),or(C,D))),or(C,or(not(B),D)))). [hyper(11,b,46,a,c,5307,a)].
% 62.13/62.42 257323 $F # answer(prove_this). [resolve(257322,a,9,a)].
% 62.13/62.42
% 62.13/62.42 % SZS output end Refutation
% 62.13/62.42 ============================== end of proof ==========================
% 62.13/62.42
% 62.13/62.42 ============================== STATISTICS ============================
% 62.13/62.42
% 62.13/62.42 Given=2643. Generated=2499368. Kept=257309. proofs=1.
% 62.13/62.42 Usable=2643. Sos=9999. Demods=1. Limbo=198, Disabled=244482. Hints=0.
% 62.13/62.42 Megabytes=179.76.
% 62.13/62.42 User_CPU=60.03, System_CPU=1.42, Wall_clock=61.
% 62.13/62.42
% 62.13/62.42 ============================== end of statistics =====================
% 62.13/62.42
% 62.13/62.42 ============================== end of search =========================
% 62.13/62.42
% 62.13/62.42 THEOREM PROVED
% 62.13/62.42 % SZS status Unsatisfiable
% 62.13/62.42
% 62.13/62.42 Exiting with 1 proof.
% 62.13/62.42
% 62.13/62.42 Process 29654 exit (max_proofs) Mon Jul 4 07:10:19 2022
% 62.13/62.42 Prover9 interrupted
%------------------------------------------------------------------------------