TSTP Solution File: LCL389-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL389-1 : 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:46:19 EDT 2022
% Result : Unsatisfiable 4.19s 4.48s
% Output : Refutation 4.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL389-1 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jul 3 22:26:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 4.19/4.48 ============================== Prover9 ===============================
% 4.19/4.48 Prover9 (32) version 2009-11A, November 2009.
% 4.19/4.48 Process 9368 was started by sandbox on n025.cluster.edu,
% 4.19/4.48 Sun Jul 3 22:26:26 2022
% 4.19/4.48 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9214_n025.cluster.edu".
% 4.19/4.48 ============================== end of head ===========================
% 4.19/4.48
% 4.19/4.48 ============================== INPUT =================================
% 4.19/4.48
% 4.19/4.48 % Reading from file /tmp/Prover9_9214_n025.cluster.edu
% 4.19/4.48
% 4.19/4.48 set(prolog_style_variables).
% 4.19/4.48 set(auto2).
% 4.19/4.48 % set(auto2) -> set(auto).
% 4.19/4.48 % set(auto) -> set(auto_inference).
% 4.19/4.48 % set(auto) -> set(auto_setup).
% 4.19/4.48 % set(auto_setup) -> set(predicate_elim).
% 4.19/4.48 % set(auto_setup) -> assign(eq_defs, unfold).
% 4.19/4.48 % set(auto) -> set(auto_limits).
% 4.19/4.48 % set(auto_limits) -> assign(max_weight, "100.000").
% 4.19/4.48 % set(auto_limits) -> assign(sos_limit, 20000).
% 4.19/4.48 % set(auto) -> set(auto_denials).
% 4.19/4.48 % set(auto) -> set(auto_process).
% 4.19/4.48 % set(auto2) -> assign(new_constants, 1).
% 4.19/4.48 % set(auto2) -> assign(fold_denial_max, 3).
% 4.19/4.48 % set(auto2) -> assign(max_weight, "200.000").
% 4.19/4.48 % set(auto2) -> assign(max_hours, 1).
% 4.19/4.48 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 4.19/4.48 % set(auto2) -> assign(max_seconds, 0).
% 4.19/4.48 % set(auto2) -> assign(max_minutes, 5).
% 4.19/4.48 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 4.19/4.48 % set(auto2) -> set(sort_initial_sos).
% 4.19/4.48 % set(auto2) -> assign(sos_limit, -1).
% 4.19/4.48 % set(auto2) -> assign(lrs_ticks, 3000).
% 4.19/4.48 % set(auto2) -> assign(max_megs, 400).
% 4.19/4.48 % set(auto2) -> assign(stats, some).
% 4.19/4.48 % set(auto2) -> clear(echo_input).
% 4.19/4.48 % set(auto2) -> set(quiet).
% 4.19/4.48 % set(auto2) -> clear(print_initial_clauses).
% 4.19/4.48 % set(auto2) -> clear(print_given).
% 4.19/4.48 assign(lrs_ticks,-1).
% 4.19/4.48 assign(sos_limit,10000).
% 4.19/4.48 assign(order,kbo).
% 4.19/4.48 set(lex_order_vars).
% 4.19/4.48 clear(print_given).
% 4.19/4.48
% 4.19/4.48 % formulas(sos). % not echoed (5 formulas)
% 4.19/4.48
% 4.19/4.48 ============================== end of input ==========================
% 4.19/4.48
% 4.19/4.48 % From the command line: assign(max_seconds, 300).
% 4.19/4.48
% 4.19/4.48 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 4.19/4.48
% 4.19/4.48 % Formulas that are not ordinary clauses:
% 4.19/4.48
% 4.19/4.48 ============================== end of process non-clausal formulas ===
% 4.19/4.48
% 4.19/4.48 ============================== PROCESS INITIAL CLAUSES ===============
% 4.19/4.48
% 4.19/4.48 ============================== PREDICATE ELIMINATION =================
% 4.19/4.48
% 4.19/4.48 ============================== end predicate elimination =============
% 4.19/4.48
% 4.19/4.48 Auto_denials:
% 4.19/4.48 % copying label prove_cn_52 to answer in negative clause
% 4.19/4.48
% 4.19/4.48 Term ordering decisions:
% 4.19/4.48
% 4.19/4.48 % Assigning unary symbol not kb_weight 0 and highest precedence (6).
% 4.19/4.48 Function symbol KB weights: x=1. y=1. z=1. implies=1. not=0.
% 4.19/4.48
% 4.19/4.48 ============================== end of process initial clauses ========
% 4.19/4.48
% 4.19/4.48 ============================== CLAUSES FOR SEARCH ====================
% 4.19/4.48
% 4.19/4.48 ============================== end of clauses for search =============
% 4.19/4.48
% 4.19/4.48 ============================== SEARCH ================================
% 4.19/4.48
% 4.19/4.48 % Starting search at 0.01 seconds.
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=35.000, iters=3372
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=33.000, iters=3366
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=31.000, iters=3353
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=27.000, iters=3394
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=26.000, iters=3433
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=25.000, iters=3383
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=23.000, iters=3333
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=22.000, iters=3344
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=21.000, iters=3366
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=20.000, iters=3356
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=19.000, iters=3380
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=18.000, iters=3435
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=17.000, iters=3344
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=4352, wt=63.000
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=1375, wt=59.000
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=4355, wt=57.000
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=2941, wt=49.000
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=4228, wt=47.000
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=10627, wt=14.000
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=10634, wt=13.000
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=10741, wt=11.000
% 4.19/4.48
% 4.19/4.48 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 42 (0.00 of 0.94 sec).
% 4.19/4.48
% 4.19/4.48 Low Water (displace): id=14561, wt=10.000
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=16.000, iters=3338
% 4.19/4.48
% 4.19/4.48 Low Water (keep): wt=15.000, iters=3333
% 4.19/4.48
% 4.19/4.48 ============================== PROOF =================================
% 4.19/4.48 % SZS status Unsatisfiable
% 4.19/4.48 % SZS output start Refutation
% 4.19/4.48
% 4.19/4.48 % Proof 1 at 3.12 (+ 0.37) seconds: prove_cn_52.
% 4.19/4.48 % Length of proof is 45.
% 4.19/4.48 % Level of proof is 26.
% 4.19/4.48 % Maximum clause weight is 27.000.
% 4.19/4.48 % Given clauses 1405.
% 4.19/4.48
% 4.19/4.48 1 is_a_theorem(implies(implies(not(A),A),A)) # label(cn_2) # label(axiom). [assumption].
% 4.19/4.48 2 is_a_theorem(implies(A,implies(not(A),B))) # label(cn_3) # label(axiom). [assumption].
% 4.19/4.48 3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(cn_1) # label(axiom). [assumption].
% 4.19/4.48 4 -is_a_theorem(implies(implies(x,implies(y,not(z))),implies(x,implies(z,not(y))))) # label(prove_cn_52) # label(negated_conjecture) # answer(prove_cn_52). [assumption].
% 4.19/4.48 5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 4.19/4.48 6 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))). [hyper(5,a,3,a,b,3,a)].
% 4.19/4.48 7 is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))). [hyper(5,a,3,a,b,2,a)].
% 4.19/4.48 8 is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))). [hyper(5,a,3,a,b,1,a)].
% 4.19/4.48 12 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))). [hyper(5,a,6,a,b,6,a)].
% 4.19/4.48 21 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))). [hyper(5,a,6,a,b,7,a)].
% 4.19/4.48 26 is_a_theorem(implies(A,A)). [hyper(5,a,7,a,b,1,a)].
% 4.19/4.48 27 is_a_theorem(implies(not(implies(A,A)),B)). [hyper(5,a,2,a,b,26,a)].
% 4.19/4.48 31 is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))). [hyper(5,a,3,a,b,8,a)].
% 4.19/4.48 36 is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))). [hyper(5,a,8,a,b,6,a)].
% 4.19/4.48 37 is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))). [hyper(5,a,8,a,b,3,a)].
% 4.19/4.48 68 is_a_theorem(implies(A,implies(B,implies(not(A),C)))). [hyper(5,a,7,a,b,21,a)].
% 4.19/4.48 69 is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))). [hyper(5,a,3,a,b,21,a)].
% 4.19/4.48 72 is_a_theorem(implies(A,implies(not(implies(B,B)),C))). [hyper(5,a,21,a,b,27,a)].
% 4.19/4.48 81 is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))). [hyper(5,a,3,a,b,68,a)].
% 4.19/4.48 95 is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))). [hyper(5,a,3,a,b,72,a)].
% 4.19/4.48 460 is_a_theorem(implies(A,implies(B,B))). [hyper(5,a,95,a,b,1,a)].
% 4.19/4.48 469 is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))). [hyper(5,a,12,a,b,460,a)].
% 4.19/4.48 550 is_a_theorem(implies(A,implies(implies(not(B),B),B))). [hyper(5,a,469,a,b,1,a)].
% 4.19/4.48 588 is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))). [hyper(5,a,12,a,b,550,a)].
% 4.19/4.48 1506 is_a_theorem(implies(A,implies(B,implies(C,A)))). [hyper(5,a,81,a,b,588,a)].
% 4.19/4.48 1534 is_a_theorem(implies(A,implies(B,implies(C,B)))). [hyper(5,a,588,a,b,1506,a)].
% 4.19/4.48 1622 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [hyper(5,a,37,a,b,1534,a)].
% 4.19/4.48 5016 is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))). [hyper(5,a,69,a,b,588,a)].
% 4.19/4.48 5106 is_a_theorem(implies(not(A),implies(B,implies(A,C)))). [hyper(5,a,1622,a,b,5016,a)].
% 4.19/4.48 5143 is_a_theorem(implies(A,implies(not(B),implies(B,C)))). [hyper(5,a,588,a,b,5106,a)].
% 4.19/4.48 5187 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))). [hyper(5,a,37,a,b,5143,a)].
% 4.19/4.48 10677 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))). [hyper(5,a,588,a,b,5187,a)].
% 4.19/4.48 10977 is_a_theorem(implies(implies(implies(A,B),A),A)). [hyper(5,a,10677,a,b,10677,a)].
% 4.19/4.48 11005 is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))). [hyper(5,a,36,a,b,10677,a)].
% 4.19/4.48 11122 is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))). [hyper(5,a,11005,a,b,588,a)].
% 4.19/4.48 13882 is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))). [hyper(5,a,6,a,b,11122,a)].
% 4.19/4.48 14424 is_a_theorem(implies(A,implies(implies(A,B),B))). [hyper(5,a,1622,a,b,13882,a)].
% 4.19/4.48 14686 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))). [hyper(5,a,12,a,b,14424,a)].
% 4.19/4.48 14733 is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)). [hyper(5,a,14424,a,b,10977,a)].
% 4.19/4.48 21076 is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))). [hyper(5,a,14686,a,b,3,a)].
% 4.19/4.48 23688 is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))). [hyper(5,a,6,a,b,14733,a)].
% 4.19/4.48 25661 is_a_theorem(implies(implies(implies(A,B),not(C)),implies(C,A))). [hyper(5,a,69,a,b,23688,a)].
% 4.19/4.48 25715 is_a_theorem(implies(implies(A,not(B)),implies(B,not(A)))). [hyper(5,a,31,a,b,25661,a)].
% 4.19/4.48 25736 is_a_theorem(implies(implies(A,implies(B,not(C))),implies(A,implies(C,not(B))))). [hyper(5,a,21076,a,b,25715,a)].
% 4.19/4.48 25737 $F # answer(prove_cn_52). [resolve(25736,a,4,a)].
% 4.19/4.48
% 4.19/4.48 % SZS output end Refutation
% 4.19/4.48 ============================== end of proof ==========================
% 4.19/4.48
% 4.19/4.48 ============================== STATISTICS ============================
% 4.19/4.48
% 4.19/4.48 Given=1405. Generated=797824. Kept=25736. proofs=1.
% 4.19/4.48 Usable=1394. Sos=9999. Demods=0. Limbo=1, Disabled=14346. Hints=0.
% 4.19/4.48 Megabytes=15.61.
% 4.19/4.48 User_CPU=3.12, System_CPU=0.37, Wall_clock=4.
% 4.19/4.48
% 4.19/4.48 ============================== end of statistics =====================
% 4.19/4.48
% 4.19/4.48 ============================== end of search =========================
% 4.19/4.48
% 4.19/4.48 THEOREM PROVED
% 4.19/4.48 % SZS status Unsatisfiable
% 4.19/4.48
% 4.19/4.48 Exiting with 1 proof.
% 4.19/4.48
% 4.19/4.48 Process 9368 exit (max_proofs) Sun Jul 3 22:26:30 2022
% 4.19/4.48 Prover9 interrupted
%------------------------------------------------------------------------------