TSTP Solution File: LCL326-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL326-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:56 EDT 2022
% Result : Unsatisfiable 3.79s 4.08s
% Output : Refutation 3.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL326-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n006.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 19:17:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.30/1.61 ============================== Prover9 ===============================
% 1.30/1.61 Prover9 (32) version 2009-11A, November 2009.
% 1.30/1.61 Process 6172 was started by sandbox on n006.cluster.edu,
% 1.30/1.61 Mon Jul 4 19:17:07 2022
% 1.30/1.61 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6019_n006.cluster.edu".
% 1.30/1.61 ============================== end of head ===========================
% 1.30/1.61
% 1.30/1.61 ============================== INPUT =================================
% 1.30/1.61
% 1.30/1.61 % Reading from file /tmp/Prover9_6019_n006.cluster.edu
% 1.30/1.61
% 1.30/1.61 set(prolog_style_variables).
% 1.30/1.61 set(auto2).
% 1.30/1.61 % set(auto2) -> set(auto).
% 1.30/1.61 % set(auto) -> set(auto_inference).
% 1.30/1.61 % set(auto) -> set(auto_setup).
% 1.30/1.61 % set(auto_setup) -> set(predicate_elim).
% 1.30/1.61 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.30/1.61 % set(auto) -> set(auto_limits).
% 1.30/1.61 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.30/1.61 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.30/1.61 % set(auto) -> set(auto_denials).
% 1.30/1.61 % set(auto) -> set(auto_process).
% 1.30/1.61 % set(auto2) -> assign(new_constants, 1).
% 1.30/1.61 % set(auto2) -> assign(fold_denial_max, 3).
% 1.30/1.61 % set(auto2) -> assign(max_weight, "200.000").
% 1.30/1.61 % set(auto2) -> assign(max_hours, 1).
% 1.30/1.61 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.30/1.61 % set(auto2) -> assign(max_seconds, 0).
% 1.30/1.61 % set(auto2) -> assign(max_minutes, 5).
% 1.30/1.61 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.30/1.61 % set(auto2) -> set(sort_initial_sos).
% 1.30/1.61 % set(auto2) -> assign(sos_limit, -1).
% 1.30/1.61 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.30/1.61 % set(auto2) -> assign(max_megs, 400).
% 1.30/1.61 % set(auto2) -> assign(stats, some).
% 1.30/1.61 % set(auto2) -> clear(echo_input).
% 1.30/1.61 % set(auto2) -> set(quiet).
% 1.30/1.61 % set(auto2) -> clear(print_initial_clauses).
% 1.30/1.61 % set(auto2) -> clear(print_given).
% 1.30/1.61 assign(lrs_ticks,-1).
% 1.30/1.61 assign(sos_limit,10000).
% 1.30/1.61 assign(order,kbo).
% 1.30/1.61 set(lex_order_vars).
% 1.30/1.61 clear(print_given).
% 1.30/1.61
% 1.30/1.61 % formulas(sos). % not echoed (11 formulas)
% 1.30/1.61
% 1.30/1.61 ============================== end of input ==========================
% 1.30/1.61
% 1.30/1.61 % From the command line: assign(max_seconds, 300).
% 1.30/1.61
% 1.30/1.61 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.30/1.61
% 1.30/1.61 % Formulas that are not ordinary clauses:
% 1.30/1.61
% 1.30/1.61 ============================== end of process non-clausal formulas ===
% 1.30/1.61
% 1.30/1.61 ============================== PROCESS INITIAL CLAUSES ===============
% 1.30/1.61
% 1.30/1.61 ============================== PREDICATE ELIMINATION =================
% 1.30/1.61 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.30/1.61 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.30/1.61 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.30/1.61 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.30/1.61 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.30/1.61 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.30/1.61 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.30/1.61 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.30/1.61 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.30/1.61 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.30/1.61 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.30/1.61
% 1.30/1.61 ============================== end predicate elimination =============
% 1.30/1.61
% 1.30/1.61 Auto_denials:
% 1.30/1.61 % copying label prove_this to answer in negative clause
% 1.30/1.61
% 1.30/1.61 Term ordering decisions:
% 1.30/1.61
% 1.30/1.61 % Assigning unary symbol not kb_weight 0 and highest precedence (8).
% 1.30/1.61 Function symbol KB weights: p=1. or=1. implies=1. and=1. equivalent=1. not=0.
% 1.30/1.61
% 1.30/1.61 ============================== end of process initial clauses ========
% 1.30/1.61
% 1.30/1.61 ============================== CLAUSES FOR SEARCH ====================
% 1.30/1.61
% 1.30/1.61 ============================== end of clauses for search =============
% 1.30/1.61
% 1.30/1.61 ============================== SEARCH ================================
% 1.30/1.61
% 1.30/1.61 % Starting search at 0.01 seconds.
% 1.30/1.61
% 1.30/1.61 Low Water (keep): wt=40.000, iters=3359
% 1.30/1.61
% 1.30/1.61 Low Water (keep): wt=36.000, iters=3379
% 1.30/1.61
% 1.30/1.61 Low Water (keep): wt=34.000, iters=3386
% 1.30/1.61
% 1.30/1.61 Low Water (keep): wt=30.000, iters=3390
% 1.30/1.61
% 1.30/1.61 Low Water (keep): wt=26.000, iters=3348
% 1.30/1.61
% 1.30/1.61 Low Water (keep): wt=24.000, iters=3400
% 3.79/4.08
% 3.79/4.08 Low Water (keep): wt=22.000, iters=3404
% 3.79/4.08
% 3.79/4.08 Low Water (keep): wt=20.000, iters=3413
% 3.79/4.08
% 3.79/4.08 Low Water (keep): wt=18.000, iters=3348
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=7270, wt=61.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=7267, wt=55.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=7283, wt=49.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=3399, wt=47.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=7588, wt=43.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=3402, wt=41.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=7585, wt=39.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=7279, wt=37.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=7601, wt=35.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=4610, wt=33.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=10325, wt=15.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=10327, wt=13.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=10401, wt=11.000
% 3.79/4.08
% 3.79/4.08 Low Water (displace): id=14651, wt=10.000
% 3.79/4.08
% 3.79/4.08 ============================== PROOF =================================
% 3.79/4.08 % SZS status Unsatisfiable
% 3.79/4.08 % SZS output start Refutation
% 3.79/4.08
% 3.79/4.08 % Proof 1 at 3.04 (+ 0.06) seconds: prove_this.
% 3.79/4.08 % Length of proof is 37.
% 3.79/4.08 % Level of proof is 10.
% 3.79/4.08 % Maximum clause weight is 16.000.
% 3.79/4.08 % Given clauses 498.
% 3.79/4.08
% 3.79/4.08 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 3.79/4.08 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 3.79/4.08 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 3.79/4.08 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 3.79/4.08 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 3.79/4.08 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 3.79/4.08 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 3.79/4.08 8 and(A,B) = not(or(not(A),not(B))) # label(and_defn) # label(axiom). [assumption].
% 3.79/4.08 9 equivalent(A,B) = and(implies(A,B),implies(B,A)) # label(equivalent_defn) # label(axiom). [assumption].
% 3.79/4.08 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)])].
% 3.79/4.08 11 -theorem(not(equivalent(p,not(p)))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 3.79/4.08 12 -theorem(not(not(or(not(or(not(p),not(p))),not(or(not(not(p)),p)))))) # answer(prove_this). [copy(11),rewrite([10(4)])].
% 3.79/4.08 13 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 3.79/4.08 14 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(13),rewrite([7(2)])].
% 3.79/4.08 15 theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 3.79/4.08 16 theorem(or(not(or(A,A)),A)). [copy(15),rewrite([7(2)])].
% 3.79/4.08 17 theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 3.79/4.08 18 theorem(or(not(A),or(B,A))). [copy(17),rewrite([7(2)])].
% 3.79/4.08 19 theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 3.79/4.08 20 theorem(or(not(or(A,B)),or(B,A))). [copy(19),rewrite([7(3)])].
% 3.79/4.08 21 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 3.79/4.08 22 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(21),rewrite([7(5)])].
% 3.79/4.08 23 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 3.79/4.08 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)])].
% 3.79/4.08 33 theorem(or(A,not(or(A,A)))). [hyper(14,b,20,a,c,16,a)].
% 3.79/4.08 39 theorem(or(A,or(not(B),B))). [hyper(14,b,22,a,c,18,a)].
% 3.79/4.08 43 theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))). [hyper(14,b,22,a,c,24,a)].
% 3.79/4.08 49 theorem(or(not(or(A,or(B,B))),or(A,B))). [hyper(14,b,24,a,c,16,a)].
% 3.79/4.08 92 theorem(or(not(or(A,B)),or(A,not(or(not(B),not(B)))))). [hyper(14,b,24,a,c,33,a)].
% 3.79/4.08 106 theorem(or(not(A),A)). [hyper(14,b,39,a,c,39,a)].
% 3.79/4.08 119 theorem(or(A,not(A))). [hyper(14,b,20,a,c,106,a)].
% 3.79/4.08 200 -theorem(or(not(or(not(p),not(p))),not(or(not(not(p)),p)))) # answer(prove_this). [ur(14,a,12,a,b,119,a)].
% 3.79/4.08 719 -theorem(or(not(or(not(not(p)),p)),not(or(not(p),not(p))))) # answer(prove_this). [ur(14,a,200,a,b,20,a)].
% 3.79/4.08 4036 theorem(or(not(or(not(not(A)),B)),or(A,B))). [hyper(14,b,43,a,c,119,a)].
% 3.79/4.08 18880 -theorem(or(not(or(not(not(p)),p)),p)) # answer(prove_this). [ur(14,a,719,a,b,92,a)].
% 3.79/4.08 18908 -theorem(or(not(or(not(not(p)),p)),or(p,p))) # answer(prove_this). [ur(14,a,18880,a,b,49,a)].
% 3.79/4.08 18909 $F # answer(prove_this). [resolve(18908,a,4036,a)].
% 3.79/4.08
% 3.79/4.08 % SZS output end Refutation
% 3.79/4.08 ============================== end of proof ==========================
% 3.79/4.08
% 3.79/4.08 ============================== STATISTICS ============================
% 3.79/4.08
% 3.79/4.08 Given=498. Generated=91083. Kept=18894. proofs=1.
% 3.79/4.08 Usable=496. Sos=9999. Demods=3. Limbo=27, Disabled=8387. Hints=0.
% 3.79/4.08 Megabytes=13.93.
% 3.79/4.08 User_CPU=3.04, System_CPU=0.06, Wall_clock=4.
% 3.79/4.08
% 3.79/4.08 ============================== end of statistics =====================
% 3.79/4.08
% 3.79/4.08 ============================== end of search =========================
% 3.79/4.08
% 3.79/4.08 THEOREM PROVED
% 3.79/4.08 % SZS status Unsatisfiable
% 3.79/4.08
% 3.79/4.08 Exiting with 1 proof.
% 3.79/4.08
% 3.79/4.08 Process 6172 exit (max_proofs) Mon Jul 4 19:17:11 2022
% 3.79/4.08 Prover9 interrupted
%------------------------------------------------------------------------------