TSTP Solution File: LCL249-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL249-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:27 EDT 2022
% Result : Unsatisfiable 1.85s 2.17s
% Output : Refutation 1.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL249-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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 : Sun Jul 3 19:28:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.13/1.42 ============================== Prover9 ===============================
% 1.13/1.42 Prover9 (32) version 2009-11A, November 2009.
% 1.13/1.42 Process 28908 was started by sandbox on n017.cluster.edu,
% 1.13/1.42 Sun Jul 3 19:28:12 2022
% 1.13/1.42 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28754_n017.cluster.edu".
% 1.13/1.42 ============================== end of head ===========================
% 1.13/1.42
% 1.13/1.42 ============================== INPUT =================================
% 1.13/1.42
% 1.13/1.42 % Reading from file /tmp/Prover9_28754_n017.cluster.edu
% 1.13/1.42
% 1.13/1.42 set(prolog_style_variables).
% 1.13/1.42 set(auto2).
% 1.13/1.42 % set(auto2) -> set(auto).
% 1.13/1.42 % set(auto) -> set(auto_inference).
% 1.13/1.42 % set(auto) -> set(auto_setup).
% 1.13/1.42 % set(auto_setup) -> set(predicate_elim).
% 1.13/1.42 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.13/1.42 % set(auto) -> set(auto_limits).
% 1.13/1.42 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.13/1.42 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.13/1.42 % set(auto) -> set(auto_denials).
% 1.13/1.42 % set(auto) -> set(auto_process).
% 1.13/1.42 % set(auto2) -> assign(new_constants, 1).
% 1.13/1.42 % set(auto2) -> assign(fold_denial_max, 3).
% 1.13/1.42 % set(auto2) -> assign(max_weight, "200.000").
% 1.13/1.42 % set(auto2) -> assign(max_hours, 1).
% 1.13/1.42 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.13/1.42 % set(auto2) -> assign(max_seconds, 0).
% 1.13/1.42 % set(auto2) -> assign(max_minutes, 5).
% 1.13/1.42 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.13/1.42 % set(auto2) -> set(sort_initial_sos).
% 1.13/1.42 % set(auto2) -> assign(sos_limit, -1).
% 1.13/1.42 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.13/1.42 % set(auto2) -> assign(max_megs, 400).
% 1.13/1.42 % set(auto2) -> assign(stats, some).
% 1.13/1.42 % set(auto2) -> clear(echo_input).
% 1.13/1.42 % set(auto2) -> set(quiet).
% 1.13/1.42 % set(auto2) -> clear(print_initial_clauses).
% 1.13/1.42 % set(auto2) -> clear(print_given).
% 1.13/1.42 assign(lrs_ticks,-1).
% 1.13/1.42 assign(sos_limit,10000).
% 1.13/1.42 assign(order,kbo).
% 1.13/1.42 set(lex_order_vars).
% 1.13/1.42 clear(print_given).
% 1.13/1.42
% 1.13/1.42 % formulas(sos). % not echoed (10 formulas)
% 1.13/1.42
% 1.13/1.42 ============================== end of input ==========================
% 1.13/1.42
% 1.13/1.42 % From the command line: assign(max_seconds, 300).
% 1.13/1.42
% 1.13/1.42 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.13/1.42
% 1.13/1.42 % Formulas that are not ordinary clauses:
% 1.13/1.42
% 1.13/1.42 ============================== end of process non-clausal formulas ===
% 1.13/1.42
% 1.13/1.42 ============================== PROCESS INITIAL CLAUSES ===============
% 1.13/1.42
% 1.13/1.42 ============================== PREDICATE ELIMINATION =================
% 1.13/1.42 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.13/1.42 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.13/1.42 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.13/1.42 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.13/1.42 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.13/1.42 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.13/1.42 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.13/1.42 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.13/1.42 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.13/1.42 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.13/1.42 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.13/1.42
% 1.13/1.42 ============================== end predicate elimination =============
% 1.13/1.42
% 1.13/1.42 Auto_denials:
% 1.13/1.42 % copying label prove_this to answer in negative clause
% 1.13/1.42
% 1.13/1.42 Term ordering decisions:
% 1.13/1.42
% 1.13/1.42 % Assigning unary symbol not kb_weight 0 and highest precedence (9).
% 1.13/1.42 Function symbol KB weights: p=1. q=1. r=1. or=1. implies=1. and=1. not=0.
% 1.13/1.42
% 1.13/1.42 ============================== end of process initial clauses ========
% 1.13/1.42
% 1.13/1.42 ============================== CLAUSES FOR SEARCH ====================
% 1.13/1.42
% 1.13/1.42 ============================== end of clauses for search =============
% 1.13/1.42
% 1.13/1.42 ============================== SEARCH ================================
% 1.13/1.42
% 1.13/1.42 % Starting search at 0.01 seconds.
% 1.13/1.42
% 1.13/1.42 Low Water (keep): wt=36.000, iters=3369
% 1.13/1.42
% 1.13/1.42 Low Water (keep): wt=34.000, iters=3386
% 1.13/1.42
% 1.13/1.42 Low Water (keep): wt=26.000, iters=3352
% 1.13/1.42
% 1.13/1.42 Low Water (keep): wt=24.000, iters=3333
% 1.13/1.42
% 1.13/1.42 Low Water (keep): wt=20.000, iters=3379
% 1.13/1.42
% 1.13/1.42 Low Water (keep): wt=19.000, iters=3354
% 1.85/2.17
% 1.85/2.17 Low Water (keep): wt=18.000, iters=3351
% 1.85/2.17
% 1.85/2.17 Low Water (keep): wt=17.000, iters=3415
% 1.85/2.17
% 1.85/2.17 Low Water (keep): wt=16.000, iters=3384
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=6162, wt=61.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=7249, wt=55.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=6175, wt=49.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=4941, wt=47.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=7941, wt=43.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=4944, wt=41.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=7251, wt=39.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=7265, wt=37.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=10284, wt=35.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=5964, wt=33.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=10310, wt=14.000
% 1.85/2.17
% 1.85/2.17 Low Water (displace): id=10312, wt=11.000
% 1.85/2.17
% 1.85/2.17 ============================== PROOF =================================
% 1.85/2.17 % SZS status Unsatisfiable
% 1.85/2.17 % SZS output start Refutation
% 1.85/2.17
% 1.85/2.17 % Proof 1 at 1.17 (+ 0.03) seconds: prove_this.
% 1.85/2.17 % Length of proof is 32.
% 1.85/2.17 % Level of proof is 11.
% 1.85/2.17 % Maximum clause weight is 16.000.
% 1.85/2.17 % Given clauses 234.
% 1.85/2.17
% 1.85/2.17 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.85/2.17 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.85/2.17 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.85/2.17 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.85/2.17 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.85/2.17 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 1.85/2.17 8 and(A,B) = not(or(not(A),not(B))) # label(and_defn) # label(axiom). [assumption].
% 1.85/2.17 9 -theorem(implies(implies(p,r),implies(and(p,q),r))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.85/2.17 10 -theorem(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r))) # answer(prove_this). [copy(9),rewrite([7(3),8(7),7(12),7(14)])].
% 1.85/2.17 11 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 1.85/2.17 12 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(11),rewrite([7(2)])].
% 1.85/2.17 15 theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.85/2.17 16 theorem(or(not(A),or(B,A))). [copy(15),rewrite([7(2)])].
% 1.85/2.17 17 theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.85/2.17 18 theorem(or(not(or(A,B)),or(B,A))). [copy(17),rewrite([7(3)])].
% 1.85/2.17 19 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.85/2.17 20 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(19),rewrite([7(5)])].
% 1.85/2.17 21 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.85/2.17 22 theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))). [copy(21),rewrite([7(1),7(5),7(7)])].
% 1.85/2.17 39 theorem(or(A,or(not(B),B))). [hyper(12,b,20,a,c,16,a)].
% 1.85/2.17 44 theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))). [hyper(12,b,20,a,c,22,a)].
% 1.85/2.17 48 theorem(or(not(or(A,or(B,C))),or(A,or(C,B)))). [hyper(12,b,22,a,c,18,a)].
% 1.85/2.17 109 theorem(or(not(A),A)). [hyper(12,b,39,a,c,39,a)].
% 1.85/2.17 122 theorem(or(A,not(A))). [hyper(12,b,18,a,c,109,a)].
% 1.85/2.17 186 theorem(or(not(or(A,B)),or(A,not(not(B))))). [hyper(12,b,22,a,c,122,a)].
% 1.85/2.17 187 theorem(or(A,or(B,not(B)))). [hyper(12,b,16,a,c,122,a)].
% 1.85/2.17 239 theorem(or(A,or(B,not(A)))). [hyper(12,b,20,a,c,187,a)].
% 1.85/2.17 5483 -theorem(or(not(not(or(not(p),not(q)))),p)) # answer(prove_this). [ur(12,a,10,a,b,44,a)].
% 1.85/2.17 7976 theorem(or(A,or(not(A),B))). [hyper(12,b,48,a,c,239,a)].
% 1.85/2.17 8152 theorem(or(A,not(not(or(not(A),B))))). [hyper(12,b,186,a,c,7976,a)].
% 1.85/2.17 10968 theorem(or(not(not(or(not(A),B))),A)). [hyper(12,b,18,a,c,8152,a)].
% 1.85/2.17 10969 $F # answer(prove_this). [resolve(10968,a,5483,a)].
% 1.85/2.17
% 1.85/2.17 % SZS output end Refutation
% 1.85/2.17 ============================== end of proof ==========================
% 1.85/2.17
% 1.85/2.17 ============================== STATISTICS ============================
% 1.85/2.17
% 1.85/2.17 Given=234. Generated=21626. Kept=10955. proofs=1.
% 1.85/2.17 Usable=234. Sos=9999. Demods=2. Limbo=30, Disabled=706. Hints=0.
% 1.85/2.17 Megabytes=8.89.
% 1.85/2.17 User_CPU=1.17, System_CPU=0.03, Wall_clock=1.
% 1.85/2.17
% 1.85/2.17 ============================== end of statistics =====================
% 1.85/2.17
% 1.85/2.17 ============================== end of search =========================
% 1.85/2.17
% 1.85/2.17 THEOREM PROVED
% 1.85/2.17 % SZS status Unsatisfiable
% 1.85/2.17
% 1.85/2.17 Exiting with 1 proof.
% 1.85/2.17
% 1.85/2.17 Process 28908 exit (max_proofs) Sun Jul 3 19:28:13 2022
% 1.85/2.17 Prover9 interrupted
%------------------------------------------------------------------------------