TSTP Solution File: LCL249-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL249-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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 16.90s 17.22s
% Output : Refutation 16.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL249-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 2 16:05:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 29514 was started by sandbox on n012.cluster.edu,
% 0.43/0.99 Sat Jul 2 16:05:17 2022
% 0.43/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29360_n012.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_29360_n012.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (9 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 0.43/0.99 2 axiom(or(not(or(A,A)),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 0.43/0.99 3 axiom(or(not(A),or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 0.43/0.99 4 axiom(or(not(or(A,B)),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 0.43/0.99 5 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 0.43/0.99 6 axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 0.43/0.99 Derived: theorem(or(not(or(A,A)),A)). [resolve(1,b,2,a)].
% 0.43/0.99 Derived: theorem(or(not(A),or(B,A))). [resolve(1,b,3,a)].
% 0.43/0.99 Derived: theorem(or(not(or(A,B)),or(B,A))). [resolve(1,b,4,a)].
% 0.43/0.99 Derived: theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 0.43/0.99 Derived: theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))). [resolve(1,b,6,a)].
% 0.43/0.99 7 theorem(A) | -axiom(or(not(B),A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 0.43/0.99 Derived: theorem(A) | -theorem(or(A,A)). [resolve(7,b,2,a)].
% 0.43/0.99 Derived: theorem(or(A,B)) | -theorem(B). [resolve(7,b,3,a)].
% 0.43/0.99 Derived: theorem(or(A,B)) | -theorem(or(B,A)). [resolve(7,b,4,a)].
% 0.43/0.99 Derived: theorem(or(A,or(B,C))) | -theorem(or(B,or(A,C))). [resolve(7,b,5,a)].
% 0.43/0.99 Derived: theorem(or(not(or(A,B)),or(A,C))) | -theorem(or(not(B),C)). [resolve(7,b,6,a)].
% 0.43/0.99 8 theorem(or(not(A),B)) | -axiom(or(not(A),C)) | -theorem(or(not(C),B)) # label(rule_3) # label(axiom). [assumption].
% 0.43/0.99 Derived: theorem(or(not(or(A,A)),B)) | -theorem(or(not(A),B)). [resolve(8,b,2,a)].
% 0.43/0.99 Derived: theorem(or(not(A),B)) | -theorem(or(not(or(C,A)),B)). [resolve(8,b,3,a)].
% 0.43/0.99 Derived: theorem(or(not(or(A,B)),C)) | -theorem(or(not(or(B,A)),C)). [resolve(8,b,4,a)].
% 0.43/0.99 Derived: theorem(or(not(or(A,or(B,C))),D)) | -theorem(or(not(or(B,or(A,C))),D)). [resolve(8,b,5,a)].
% 16.90/17.22 Derived: theorem(or(not(or(not(A),B)),C)) | -theorem(or(not(or(not(or(D,A)),or(D,B))),C)). [resolve(8,b,6,a)].
% 16.90/17.22
% 16.90/17.22 ============================== end predicate elimination =============
% 16.90/17.22
% 16.90/17.22 Auto_denials:
% 16.90/17.22 % copying label prove_this to answer in negative clause
% 16.90/17.22
% 16.90/17.22 Term ordering decisions:
% 16.90/17.22
% 16.90/17.22 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 16.90/17.22 Function symbol KB weights: p=1. q=1. r=1. or=1. not=0.
% 16.90/17.22
% 16.90/17.22 ============================== end of process initial clauses ========
% 16.90/17.22
% 16.90/17.22 ============================== CLAUSES FOR SEARCH ====================
% 16.90/17.22
% 16.90/17.22 ============================== end of clauses for search =============
% 16.90/17.22
% 16.90/17.22 ============================== SEARCH ================================
% 16.90/17.22
% 16.90/17.22 % Starting search at 0.01 seconds.
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=35.000, iters=3380
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=34.000, iters=3407
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=30.000, iters=3358
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=28.000, iters=3363
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=25.000, iters=3349
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=24.000, iters=3355
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=23.000, iters=3333
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=21.000, iters=3336
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=20.000, iters=3337
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=19.000, iters=3335
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=18.000, iters=3368
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=17.000, iters=3334
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=16.000, iters=3333
% 16.90/17.22
% 16.90/17.22 Low Water (keep): wt=15.000, iters=3333
% 16.90/17.22
% 16.90/17.22 ============================== PROOF =================================
% 16.90/17.22 % SZS status Unsatisfiable
% 16.90/17.22 % SZS output start Refutation
% 16.90/17.22
% 16.90/17.22 % Proof 1 at 16.10 (+ 0.14) seconds: prove_this.
% 16.90/17.22 % Length of proof is 31.
% 16.90/17.22 % Level of proof is 10.
% 16.90/17.22 % Maximum clause weight is 32.000.
% 16.90/17.22 % Given clauses 29384.
% 16.90/17.22
% 16.90/17.22 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 16.90/17.22 2 axiom(or(not(or(A,A)),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 16.90/17.22 3 axiom(or(not(A),or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 16.90/17.22 4 axiom(or(not(or(A,B)),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 16.90/17.22 5 axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 16.90/17.22 6 axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 16.90/17.22 7 theorem(A) | -axiom(or(not(B),A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 16.90/17.22 8 theorem(or(not(A),B)) | -axiom(or(not(A),C)) | -theorem(or(not(C),B)) # label(rule_3) # label(axiom). [assumption].
% 16.90/17.22 9 -theorem(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 16.90/17.22 12 theorem(or(not(or(A,B)),or(B,A))). [resolve(1,b,4,a)].
% 16.90/17.22 15 theorem(A) | -theorem(or(A,A)). [resolve(7,b,2,a)].
% 16.90/17.22 16 theorem(or(A,B)) | -theorem(B). [resolve(7,b,3,a)].
% 16.90/17.22 17 theorem(or(A,B)) | -theorem(or(B,A)). [resolve(7,b,4,a)].
% 16.90/17.22 18 theorem(or(A,or(B,C))) | -theorem(or(B,or(A,C))). [resolve(7,b,5,a)].
% 16.90/17.22 19 theorem(or(not(or(A,B)),or(A,C))) | -theorem(or(not(B),C)). [resolve(7,b,6,a)].
% 16.90/17.22 21 theorem(or(not(A),B)) | -theorem(or(not(or(C,A)),B)). [resolve(8,b,3,a)].
% 16.90/17.22 22 theorem(or(not(or(A,B)),C)) | -theorem(or(not(or(B,A)),C)). [resolve(8,b,4,a)].
% 16.90/17.22 25 -theorem(or(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r)))) # answer(prove_this). [resolve(15,a,9,a)].
% 16.90/17.22 56 theorem(or(not(A),or(A,B))). [ur(21,b,12,a)].
% 16.90/17.22 72 -theorem(or(not(or(not(p),r)),or(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r)),or(not(not(or(not(p),not(q)))),r)))) # answer(prove_this). [resolve(25,a,18,a)].
% 16.90/17.22 118 theorem(or(A,or(not(A),B))). [ur(18,b,56,a)].
% 16.90/17.22 141 theorem(or(not(or(A,B)),or(not(not(or(B,A))),C))). [ur(22,b,118,a)].
% 16.90/17.22 1099 -theorem(or(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r)),or(not(not(or(not(p),not(q)))),r))) # answer(prove_this). [resolve(72,a,16,a)].
% 16.90/17.22 1937 theorem(or(not(A),or(not(not(or(A,B))),C))). [ur(21,b,141,a)].
% 16.90/17.22 2712 theorem(or(not(or(A,B)),or(A,or(not(not(or(B,C))),D)))). [ur(19,b,1937,a)].
% 16.90/17.22 10794 -theorem(or(not(not(or(not(p),not(q)))),or(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r)),r))) # answer(prove_this). [resolve(1099,a,18,a)].
% 16.90/17.22 15233 theorem(or(not(or(A,B)),or(B,or(not(not(or(A,C))),D)))). [ur(22,b,2712,a)].
% 16.90/17.22 24032 theorem(or(A,or(not(or(B,A)),or(not(not(or(B,C))),D)))). [ur(18,b,15233,a)].
% 16.90/17.22 31054 theorem(or(or(not(or(A,B)),or(not(not(or(A,C))),D)),B)). [ur(17,b,24032,a)].
% 16.90/17.22 40427 -theorem(or(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r)),r)) # answer(prove_this). [resolve(10794,a,16,a)].
% 16.90/17.22 40428 $F # answer(prove_this). [resolve(40427,a,31054,a)].
% 16.90/17.22
% 16.90/17.22 % SZS output end Refutation
% 16.90/17.22 ============================== end of proof ==========================
% 16.90/17.22
% 16.90/17.22 ============================== STATISTICS ============================
% 16.90/17.22
% 16.90/17.22 Given=29384. Generated=224051. Kept=40419. proofs=1.
% 16.90/17.22 Usable=28171. Sos=7774. Demods=0. Limbo=0, Disabled=4497. Hints=0.
% 16.90/17.22 Megabytes=30.85.
% 16.90/17.22 User_CPU=16.10, System_CPU=0.14, Wall_clock=17.
% 16.90/17.22
% 16.90/17.22 ============================== end of statistics =====================
% 16.90/17.22
% 16.90/17.22 ============================== end of search =========================
% 16.90/17.22
% 16.90/17.22 THEOREM PROVED
% 16.90/17.22 % SZS status Unsatisfiable
% 16.90/17.22
% 16.90/17.22 Exiting with 1 proof.
% 16.90/17.22
% 16.90/17.22 Process 29514 exit (max_proofs) Sat Jul 2 16:05:34 2022
% 16.90/17.22 Prover9 interrupted
%------------------------------------------------------------------------------