TSTP Solution File: LCL337-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL337-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:46:00 EDT 2022
% Result : Unsatisfiable 1.57s 1.91s
% Output : Refutation 1.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL337-3 : TPTP v8.1.0. Released v2.3.0.
% 0.02/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.30 % Computer : n019.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Sun Jul 3 09:15:38 EDT 2022
% 0.11/0.30 % CPUTime :
% 1.04/1.32 ============================== Prover9 ===============================
% 1.04/1.32 Prover9 (32) version 2009-11A, November 2009.
% 1.04/1.32 Process 29476 was started by sandbox on n019.cluster.edu,
% 1.04/1.32 Sun Jul 3 09:15:39 2022
% 1.04/1.32 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29321_n019.cluster.edu".
% 1.04/1.32 ============================== end of head ===========================
% 1.04/1.32
% 1.04/1.32 ============================== INPUT =================================
% 1.04/1.32
% 1.04/1.32 % Reading from file /tmp/Prover9_29321_n019.cluster.edu
% 1.04/1.32
% 1.04/1.32 set(prolog_style_variables).
% 1.04/1.32 set(auto2).
% 1.04/1.32 % set(auto2) -> set(auto).
% 1.04/1.32 % set(auto) -> set(auto_inference).
% 1.04/1.32 % set(auto) -> set(auto_setup).
% 1.04/1.32 % set(auto_setup) -> set(predicate_elim).
% 1.04/1.32 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.04/1.32 % set(auto) -> set(auto_limits).
% 1.04/1.32 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.04/1.32 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.04/1.32 % set(auto) -> set(auto_denials).
% 1.04/1.32 % set(auto) -> set(auto_process).
% 1.04/1.32 % set(auto2) -> assign(new_constants, 1).
% 1.04/1.32 % set(auto2) -> assign(fold_denial_max, 3).
% 1.04/1.32 % set(auto2) -> assign(max_weight, "200.000").
% 1.04/1.32 % set(auto2) -> assign(max_hours, 1).
% 1.04/1.32 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.04/1.32 % set(auto2) -> assign(max_seconds, 0).
% 1.04/1.32 % set(auto2) -> assign(max_minutes, 5).
% 1.04/1.32 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.04/1.32 % set(auto2) -> set(sort_initial_sos).
% 1.04/1.32 % set(auto2) -> assign(sos_limit, -1).
% 1.04/1.32 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.04/1.32 % set(auto2) -> assign(max_megs, 400).
% 1.04/1.32 % set(auto2) -> assign(stats, some).
% 1.04/1.32 % set(auto2) -> clear(echo_input).
% 1.04/1.32 % set(auto2) -> set(quiet).
% 1.04/1.32 % set(auto2) -> clear(print_initial_clauses).
% 1.04/1.32 % set(auto2) -> clear(print_given).
% 1.04/1.32 assign(lrs_ticks,-1).
% 1.04/1.32 assign(sos_limit,10000).
% 1.04/1.32 assign(order,kbo).
% 1.04/1.32 set(lex_order_vars).
% 1.04/1.32 clear(print_given).
% 1.04/1.32
% 1.04/1.32 % formulas(sos). % not echoed (11 formulas)
% 1.04/1.32
% 1.04/1.32 ============================== end of input ==========================
% 1.04/1.32
% 1.04/1.32 % From the command line: assign(max_seconds, 300).
% 1.04/1.32
% 1.04/1.32 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.04/1.32
% 1.04/1.32 % Formulas that are not ordinary clauses:
% 1.04/1.32
% 1.04/1.32 ============================== end of process non-clausal formulas ===
% 1.04/1.32
% 1.04/1.32 ============================== PROCESS INITIAL CLAUSES ===============
% 1.04/1.32
% 1.04/1.32 ============================== PREDICATE ELIMINATION =================
% 1.04/1.32 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.04/1.32 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.04/1.32 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.04/1.32 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.04/1.32 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.04/1.32 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.04/1.32 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.04/1.32 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.04/1.32 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.04/1.32 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.04/1.32 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.04/1.32
% 1.04/1.32 ============================== end predicate elimination =============
% 1.04/1.32
% 1.04/1.32 Auto_denials:
% 1.04/1.32 % copying label prove_this to answer in negative clause
% 1.04/1.32
% 1.04/1.32 Term ordering decisions:
% 1.04/1.32
% 1.04/1.32 % Assigning unary symbol not kb_weight 0 and highest precedence (9).
% 1.04/1.32 Function symbol KB weights: p=1. q=1. or=1. implies=1. and=1. equivalent=1. not=0.
% 1.04/1.32
% 1.04/1.32 ============================== end of process initial clauses ========
% 1.04/1.32
% 1.04/1.32 ============================== CLAUSES FOR SEARCH ====================
% 1.04/1.32
% 1.04/1.32 ============================== end of clauses for search =============
% 1.04/1.32
% 1.04/1.32 ============================== SEARCH ================================
% 1.04/1.32
% 1.04/1.32 % Starting search at 0.01 seconds.
% 1.04/1.32
% 1.04/1.32 Low Water (keep): wt=72.000, iters=3400
% 1.04/1.32
% 1.04/1.32 Low Water (keep): wt=55.000, iters=3388
% 1.04/1.32
% 1.04/1.32 Low Water (keep): wt=51.000, iters=3366
% 1.04/1.32
% 1.04/1.32 Low Water (keep): wt=49.000, iters=3373
% 1.04/1.32
% 1.04/1.32 Low Water (keep): wt=34.000, iters=3355
% 1.04/1.32
% 1.04/1.32 Low Water (keep): wt=30.000, iters=3378
% 1.57/1.91
% 1.57/1.91 Low Water (keep): wt=28.000, iters=3550
% 1.57/1.91
% 1.57/1.91 Low Water (keep): wt=26.000, iters=3340
% 1.57/1.91
% 1.57/1.91 Low Water (keep): wt=24.000, iters=3358
% 1.57/1.91
% 1.57/1.91 Low Water (keep): wt=22.000, iters=3420
% 1.57/1.91
% 1.57/1.91 ============================== PROOF =================================
% 1.57/1.91 % SZS status Unsatisfiable
% 1.57/1.91 % SZS output start Refutation
% 1.57/1.91
% 1.57/1.91 % Proof 1 at 0.97 (+ 0.02) seconds: prove_this.
% 1.57/1.91 % Length of proof is 41.
% 1.57/1.91 % Level of proof is 11.
% 1.57/1.91 % Maximum clause weight is 39.000.
% 1.57/1.91 % Given clauses 204.
% 1.57/1.91
% 1.57/1.91 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.57/1.91 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.57/1.91 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.57/1.91 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.57/1.91 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.57/1.91 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.57/1.91 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 1.57/1.91 8 and(A,B) = not(or(not(A),not(B))) # label(and_defn) # label(axiom). [assumption].
% 1.57/1.91 9 equivalent(A,B) = and(implies(A,B),implies(B,A)) # label(equivalent_defn) # label(axiom). [assumption].
% 1.57/1.91 10 equivalent(A,B) = not(or(not(or(not(A),B)),not(or(not(B),A)))). [copy(9),rewrite([7(2),7(4),8(6)])].
% 1.57/1.91 11 -theorem(equivalent(implies(p,implies(p,q)),implies(p,q))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.57/1.91 12 -theorem(not(or(not(or(not(or(not(p),or(not(p),q))),or(not(p),q))),not(or(not(or(not(p),q)),or(not(p),or(not(p),q))))))) # answer(prove_this). [copy(11),rewrite([7(4),7(6),7(10),10(12)])].
% 1.57/1.91 13 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 1.57/1.91 14 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(13),rewrite([7(2)])].
% 1.57/1.91 15 theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.57/1.91 16 theorem(or(not(or(A,A)),A)). [copy(15),rewrite([7(2)])].
% 1.57/1.91 17 theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.57/1.91 18 theorem(or(not(A),or(B,A))). [copy(17),rewrite([7(2)])].
% 1.57/1.91 19 theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.57/1.91 20 theorem(or(not(or(A,B)),or(B,A))). [copy(19),rewrite([7(3)])].
% 1.57/1.91 21 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.57/1.91 22 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(21),rewrite([7(5)])].
% 1.57/1.91 23 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.57/1.91 24 theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))). [copy(23),rewrite([7(1),7(5),7(7)])].
% 1.57/1.91 29 -theorem(or(not(or(not(A),or(B,A))),not(or(not(or(not(or(not(p),or(not(p),q))),or(not(p),q))),not(or(not(or(not(p),q)),or(not(p),or(not(p),q)))))))) # answer(prove_this). [ur(14,a,12,a,c,18,a)].
% 1.57/1.91 39 theorem(or(A,or(not(B),B))). [hyper(14,b,22,a,c,18,a)].
% 1.57/1.91 43 theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))). [hyper(14,b,22,a,c,24,a)].
% 1.57/1.91 47 theorem(or(not(or(A,or(B,C))),or(A,or(C,B)))). [hyper(14,b,24,a,c,20,a)].
% 1.57/1.91 49 theorem(or(not(or(A,or(B,B))),or(A,B))). [hyper(14,b,24,a,c,16,a)].
% 1.57/1.91 106 theorem(or(not(A),A)). [hyper(14,b,39,a,c,39,a)].
% 1.57/1.91 118 theorem(or(A,or(not(or(A,B)),B))). [hyper(14,b,22,a,c,106,a)].
% 1.57/1.91 119 theorem(or(A,not(A))). [hyper(14,b,20,a,c,106,a)].
% 1.57/1.91 179 theorem(or(A,or(B,not(B)))). [hyper(14,b,18,a,c,119,a)].
% 1.57/1.91 231 theorem(or(A,or(B,not(A)))). [hyper(14,b,22,a,c,179,a)].
% 1.57/1.91 5495 theorem(or(A,or(not(A),B))). [hyper(14,b,47,a,c,231,a)].
% 1.57/1.91 5496 theorem(or(A,or(B,not(or(A,B))))). [hyper(14,b,47,a,c,118,a)].
% 1.57/1.91 5714 theorem(or(or(not(A),B),A)). [hyper(14,b,20,a,c,5495,a)].
% 1.57/1.91 6012 theorem(or(not(or(not(A),B)),or(or(not(A),C),B))). [hyper(14,b,43,a,c,5714,a)].
% 1.57/1.91 7233 -theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))) # answer(prove_this). [ur(14,a,29,a,b,5496,a)].
% 1.57/1.91 8097 -theorem(or(not(or(not(p),or(not(p),q))),or(or(not(p),q),or(not(p),q)))) # answer(prove_this). [ur(14,a,7233,a,b,49,a)].
% 1.57/1.91 8098 $F # answer(prove_this). [resolve(8097,a,6012,a)].
% 1.57/1.91
% 1.57/1.91 % SZS output end Refutation
% 1.57/1.91 ============================== end of proof ==========================
% 1.57/1.91
% 1.57/1.91 ============================== STATISTICS ============================
% 1.57/1.91
% 1.57/1.91 Given=204. Generated=16097. Kept=8083. proofs=1.
% 1.57/1.91 Usable=204. Sos=7834. Demods=3. Limbo=8, Disabled=52. Hints=0.
% 1.57/1.91 Megabytes=7.83.
% 1.57/1.91 User_CPU=0.97, System_CPU=0.02, Wall_clock=1.
% 1.57/1.91
% 1.57/1.91 ============================== end of statistics =====================
% 1.57/1.91
% 1.57/1.91 ============================== end of search =========================
% 1.57/1.91
% 1.57/1.91 THEOREM PROVED
% 1.57/1.91 % SZS status Unsatisfiable
% 1.57/1.91
% 1.57/1.91 Exiting with 1 proof.
% 1.57/1.91
% 1.57/1.91 Process 29476 exit (max_proofs) Sun Jul 3 09:15:40 2022
% 1.57/1.91 Prover9 interrupted
%------------------------------------------------------------------------------