TSTP Solution File: LCL271-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL271-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:37 EDT 2022
% Result : Unsatisfiable 2.37s 2.67s
% Output : Refutation 2.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : LCL271-3 : TPTP v8.1.0. Released v2.3.0.
% 0.05/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.28 % Computer : n025.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sat Jul 2 18:26:55 EDT 2022
% 0.09/0.28 % CPUTime :
% 1.05/1.35 ============================== Prover9 ===============================
% 1.05/1.35 Prover9 (32) version 2009-11A, November 2009.
% 1.05/1.35 Process 9673 was started by sandbox on n025.cluster.edu,
% 1.05/1.35 Sat Jul 2 18:26:55 2022
% 1.05/1.35 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9520_n025.cluster.edu".
% 1.05/1.35 ============================== end of head ===========================
% 1.05/1.35
% 1.05/1.35 ============================== INPUT =================================
% 1.05/1.35
% 1.05/1.35 % Reading from file /tmp/Prover9_9520_n025.cluster.edu
% 1.05/1.35
% 1.05/1.35 set(prolog_style_variables).
% 1.05/1.35 set(auto2).
% 1.05/1.35 % set(auto2) -> set(auto).
% 1.05/1.35 % set(auto) -> set(auto_inference).
% 1.05/1.35 % set(auto) -> set(auto_setup).
% 1.05/1.35 % set(auto_setup) -> set(predicate_elim).
% 1.05/1.35 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.05/1.35 % set(auto) -> set(auto_limits).
% 1.05/1.35 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.05/1.35 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.05/1.35 % set(auto) -> set(auto_denials).
% 1.05/1.35 % set(auto) -> set(auto_process).
% 1.05/1.35 % set(auto2) -> assign(new_constants, 1).
% 1.05/1.35 % set(auto2) -> assign(fold_denial_max, 3).
% 1.05/1.35 % set(auto2) -> assign(max_weight, "200.000").
% 1.05/1.35 % set(auto2) -> assign(max_hours, 1).
% 1.05/1.35 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.05/1.35 % set(auto2) -> assign(max_seconds, 0).
% 1.05/1.35 % set(auto2) -> assign(max_minutes, 5).
% 1.05/1.35 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.05/1.35 % set(auto2) -> set(sort_initial_sos).
% 1.05/1.35 % set(auto2) -> assign(sos_limit, -1).
% 1.05/1.35 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.05/1.35 % set(auto2) -> assign(max_megs, 400).
% 1.05/1.35 % set(auto2) -> assign(stats, some).
% 1.05/1.35 % set(auto2) -> clear(echo_input).
% 1.05/1.35 % set(auto2) -> set(quiet).
% 1.05/1.35 % set(auto2) -> clear(print_initial_clauses).
% 1.05/1.35 % set(auto2) -> clear(print_given).
% 1.05/1.35 assign(lrs_ticks,-1).
% 1.05/1.35 assign(sos_limit,10000).
% 1.05/1.35 assign(order,kbo).
% 1.05/1.35 set(lex_order_vars).
% 1.05/1.35 clear(print_given).
% 1.05/1.35
% 1.05/1.35 % formulas(sos). % not echoed (11 formulas)
% 1.05/1.35
% 1.05/1.35 ============================== end of input ==========================
% 1.05/1.35
% 1.05/1.35 % From the command line: assign(max_seconds, 300).
% 1.05/1.35
% 1.05/1.35 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.05/1.35
% 1.05/1.35 % Formulas that are not ordinary clauses:
% 1.05/1.35
% 1.05/1.35 ============================== end of process non-clausal formulas ===
% 1.05/1.35
% 1.05/1.35 ============================== PROCESS INITIAL CLAUSES ===============
% 1.05/1.35
% 1.05/1.35 ============================== PREDICATE ELIMINATION =================
% 1.05/1.35 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 1.05/1.35 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 1.05/1.35 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 1.05/1.35 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 1.05/1.35 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 1.05/1.35 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 1.05/1.35 Derived: theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 1.05/1.35 Derived: theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 1.05/1.35 Derived: theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 1.05/1.35 Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 1.05/1.35 Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 1.05/1.35
% 1.05/1.35 ============================== end predicate elimination =============
% 1.05/1.35
% 1.05/1.35 Auto_denials:
% 1.05/1.35 % copying label prove_this to answer in negative clause
% 1.05/1.35
% 1.05/1.35 Term ordering decisions:
% 1.05/1.35
% 1.05/1.35 % Assigning unary symbol not kb_weight 0 and highest precedence (8).
% 1.05/1.35 Function symbol KB weights: p=1. or=1. implies=1. and=1. equivalent=1. not=0.
% 1.05/1.35
% 1.05/1.35 ============================== end of process initial clauses ========
% 1.05/1.35
% 1.05/1.35 ============================== CLAUSES FOR SEARCH ====================
% 1.05/1.35
% 1.05/1.35 ============================== end of clauses for search =============
% 1.05/1.35
% 1.05/1.35 ============================== SEARCH ================================
% 1.05/1.35
% 1.05/1.35 % Starting search at 0.01 seconds.
% 1.05/1.35
% 1.05/1.35 Low Water (keep): wt=56.000, iters=3399
% 1.05/1.35
% 1.05/1.35 Low Water (keep): wt=47.000, iters=3388
% 1.05/1.35
% 1.05/1.35 Low Water (keep): wt=43.000, iters=3366
% 1.05/1.35
% 1.05/1.35 Low Water (keep): wt=41.000, iters=3373
% 1.05/1.35
% 1.05/1.35 Low Water (keep): wt=34.000, iters=3414
% 1.05/1.35
% 1.05/1.35 Low Water (keep): wt=30.000, iters=3380
% 2.37/2.67
% 2.37/2.67 Low Water (keep): wt=28.000, iters=3550
% 2.37/2.67
% 2.37/2.67 Low Water (keep): wt=26.000, iters=3340
% 2.37/2.67
% 2.37/2.67 Low Water (keep): wt=24.000, iters=3358
% 2.37/2.67
% 2.37/2.67 Low Water (keep): wt=22.000, iters=3418
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=6442, wt=61.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=6439, wt=55.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=6455, wt=49.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=3388, wt=47.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=6733, wt=43.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=3391, wt=41.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=6730, wt=39.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=9410, wt=37.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=6746, wt=35.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=4596, wt=33.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=10366, wt=18.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=10369, wt=16.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=10617, wt=13.000
% 2.37/2.67
% 2.37/2.67 Low Water (displace): id=10624, wt=11.000
% 2.37/2.67
% 2.37/2.67 Low Water (keep): wt=20.000, iters=3353
% 2.37/2.67
% 2.37/2.67 Low Water (keep): wt=19.000, iters=3387
% 2.37/2.67
% 2.37/2.67 ============================== PROOF =================================
% 2.37/2.67 % SZS status Unsatisfiable
% 2.37/2.67 % SZS output start Refutation
% 2.37/2.67
% 2.37/2.67 % Proof 1 at 1.81 (+ 0.03) seconds: prove_this.
% 2.37/2.67 % Length of proof is 40.
% 2.37/2.67 % Level of proof is 12.
% 2.37/2.67 % Maximum clause weight is 31.000.
% 2.37/2.67 % Given clauses 306.
% 2.37/2.67
% 2.37/2.67 1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom). [assumption].
% 2.37/2.67 2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom). [assumption].
% 2.37/2.67 3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom). [assumption].
% 2.37/2.67 4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom). [assumption].
% 2.37/2.67 5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom). [assumption].
% 2.37/2.67 6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom). [assumption].
% 2.37/2.67 7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom). [assumption].
% 2.37/2.67 8 and(A,B) = not(or(not(A),not(B))) # label(and_defn) # label(axiom). [assumption].
% 2.37/2.67 9 equivalent(A,B) = and(implies(A,B),implies(B,A)) # label(equivalent_defn) # label(axiom). [assumption].
% 2.37/2.67 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)])].
% 2.37/2.67 11 -theorem(equivalent(p,and(p,p))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 2.37/2.67 12 -theorem(not(or(not(or(not(p),not(or(not(p),not(p))))),not(or(not(not(or(not(p),not(p)))),p))))) # answer(prove_this). [copy(11),rewrite([8(4),10(8)])].
% 2.37/2.67 13 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom). [assumption].
% 2.37/2.67 14 theorem(A) | -theorem(or(not(B),A)) | -theorem(B). [copy(13),rewrite([7(2)])].
% 2.37/2.67 15 theorem(implies(or(A,A),A)). [resolve(1,b,2,a)].
% 2.37/2.67 16 theorem(or(not(or(A,A)),A)). [copy(15),rewrite([7(2)])].
% 2.37/2.67 17 theorem(implies(A,or(B,A))). [resolve(1,b,3,a)].
% 2.37/2.67 18 theorem(or(not(A),or(B,A))). [copy(17),rewrite([7(2)])].
% 2.37/2.67 19 theorem(implies(or(A,B),or(B,A))). [resolve(1,b,4,a)].
% 2.37/2.67 20 theorem(or(not(or(A,B)),or(B,A))). [copy(19),rewrite([7(3)])].
% 2.37/2.67 21 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))). [resolve(1,b,5,a)].
% 2.37/2.67 22 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))). [copy(21),rewrite([7(5)])].
% 2.37/2.67 23 theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))). [resolve(1,b,6,a)].
% 2.37/2.67 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)])].
% 2.37/2.67 33 theorem(or(A,not(or(A,A)))). [hyper(14,b,20,a,c,16,a)].
% 2.37/2.67 38 theorem(or(A,or(not(or(B,A)),B))). [hyper(14,b,22,a,c,20,a)].
% 2.37/2.67 39 theorem(or(A,or(not(B),B))). [hyper(14,b,22,a,c,18,a)].
% 2.37/2.67 47 theorem(or(not(or(A,or(B,C))),or(A,or(C,B)))). [hyper(14,b,24,a,c,20,a)].
% 2.37/2.67 105 -theorem(or(not(or(A,not(or(A,A)))),not(or(not(or(not(p),not(or(not(p),not(p))))),not(or(not(not(or(not(p),not(p)))),p)))))) # answer(prove_this). [ur(14,a,12,a,c,33,a)].
% 2.37/2.67 106 theorem(or(not(A),A)). [hyper(14,b,39,a,c,39,a)].
% 2.37/2.67 119 theorem(or(A,not(A))). [hyper(14,b,20,a,c,106,a)].
% 2.37/2.67 178 theorem(or(not(or(A,B)),or(A,not(not(B))))). [hyper(14,b,24,a,c,119,a)].
% 2.37/2.67 179 theorem(or(A,or(B,not(B)))). [hyper(14,b,18,a,c,119,a)].
% 2.37/2.67 231 theorem(or(A,or(B,not(A)))). [hyper(14,b,22,a,c,179,a)].
% 2.37/2.67 5495 theorem(or(A,or(not(A),B))). [hyper(14,b,47,a,c,231,a)].
% 2.37/2.67 5503 theorem(or(A,or(B,not(or(B,A))))). [hyper(14,b,47,a,c,38,a)].
% 2.37/2.67 9449 theorem(or(A,not(not(or(not(A),B))))). [hyper(14,b,178,a,c,5495,a)].
% 2.37/2.67 10642 theorem(or(not(not(or(not(A),B))),A)). [hyper(14,b,20,a,c,9449,a)].
% 2.37/2.67 12802 theorem(or(A,not(or(A,not(or(not(not(or(not(B),C))),B)))))). [hyper(14,b,5503,a,c,10642,a)].
% 2.37/2.67 12803 $F # answer(prove_this). [resolve(12802,a,105,a)].
% 2.37/2.67
% 2.37/2.67 % SZS output end Refutation
% 2.37/2.67 ============================== end of proof ==========================
% 2.37/2.67
% 2.37/2.67 ============================== STATISTICS ============================
% 2.37/2.67
% 2.37/2.67 Given=306. Generated=34467. Kept=12788. proofs=1.
% 2.37/2.67 Usable=306. Sos=9999. Demods=3. Limbo=12, Disabled=2486. Hints=0.
% 2.37/2.67 Megabytes=10.57.
% 2.37/2.67 User_CPU=1.81, System_CPU=0.03, Wall_clock=2.
% 2.37/2.67
% 2.37/2.67 ============================== end of statistics =====================
% 2.37/2.67
% 2.37/2.67 ============================== end of search =========================
% 2.37/2.67
% 2.37/2.67 THEOREM PROVED
% 2.37/2.67 % SZS status Unsatisfiable
% 2.37/2.67
% 2.37/2.67 Exiting with 1 proof.
% 2.37/2.67
% 2.37/2.67 Process 9673 exit (max_proofs) Sat Jul 2 18:26:57 2022
% 2.37/2.67 Prover9 interrupted
%------------------------------------------------------------------------------