TSTP Solution File: LCL100-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL100-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:44:00 EDT 2022
% Result : Unsatisfiable 192.32s 192.66s
% Output : Refutation 192.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL100-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 5 01:39:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 192.32/192.66 ============================== Prover9 ===============================
% 192.32/192.66 Prover9 (32) version 2009-11A, November 2009.
% 192.32/192.66 Process 17694 was started by sandbox on n016.cluster.edu,
% 192.32/192.66 Tue Jul 5 01:39:03 2022
% 192.32/192.66 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17541_n016.cluster.edu".
% 192.32/192.66 ============================== end of head ===========================
% 192.32/192.66
% 192.32/192.66 ============================== INPUT =================================
% 192.32/192.66
% 192.32/192.66 % Reading from file /tmp/Prover9_17541_n016.cluster.edu
% 192.32/192.66
% 192.32/192.66 set(prolog_style_variables).
% 192.32/192.66 set(auto2).
% 192.32/192.66 % set(auto2) -> set(auto).
% 192.32/192.66 % set(auto) -> set(auto_inference).
% 192.32/192.66 % set(auto) -> set(auto_setup).
% 192.32/192.66 % set(auto_setup) -> set(predicate_elim).
% 192.32/192.66 % set(auto_setup) -> assign(eq_defs, unfold).
% 192.32/192.66 % set(auto) -> set(auto_limits).
% 192.32/192.66 % set(auto_limits) -> assign(max_weight, "100.000").
% 192.32/192.66 % set(auto_limits) -> assign(sos_limit, 20000).
% 192.32/192.66 % set(auto) -> set(auto_denials).
% 192.32/192.66 % set(auto) -> set(auto_process).
% 192.32/192.66 % set(auto2) -> assign(new_constants, 1).
% 192.32/192.66 % set(auto2) -> assign(fold_denial_max, 3).
% 192.32/192.66 % set(auto2) -> assign(max_weight, "200.000").
% 192.32/192.66 % set(auto2) -> assign(max_hours, 1).
% 192.32/192.66 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 192.32/192.66 % set(auto2) -> assign(max_seconds, 0).
% 192.32/192.66 % set(auto2) -> assign(max_minutes, 5).
% 192.32/192.66 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 192.32/192.66 % set(auto2) -> set(sort_initial_sos).
% 192.32/192.66 % set(auto2) -> assign(sos_limit, -1).
% 192.32/192.66 % set(auto2) -> assign(lrs_ticks, 3000).
% 192.32/192.66 % set(auto2) -> assign(max_megs, 400).
% 192.32/192.66 % set(auto2) -> assign(stats, some).
% 192.32/192.66 % set(auto2) -> clear(echo_input).
% 192.32/192.66 % set(auto2) -> set(quiet).
% 192.32/192.66 % set(auto2) -> clear(print_initial_clauses).
% 192.32/192.66 % set(auto2) -> clear(print_given).
% 192.32/192.66 assign(lrs_ticks,-1).
% 192.32/192.66 assign(sos_limit,10000).
% 192.32/192.66 assign(order,kbo).
% 192.32/192.66 set(lex_order_vars).
% 192.32/192.66 clear(print_given).
% 192.32/192.66
% 192.32/192.66 % formulas(sos). % not echoed (4 formulas)
% 192.32/192.66
% 192.32/192.66 ============================== end of input ==========================
% 192.32/192.66
% 192.32/192.66 % From the command line: assign(max_seconds, 300).
% 192.32/192.66
% 192.32/192.66 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 192.32/192.66
% 192.32/192.66 % Formulas that are not ordinary clauses:
% 192.32/192.66
% 192.32/192.66 ============================== end of process non-clausal formulas ===
% 192.32/192.66
% 192.32/192.66 ============================== PROCESS INITIAL CLAUSES ===============
% 192.32/192.66
% 192.32/192.66 ============================== PREDICATE ELIMINATION =================
% 192.32/192.66
% 192.32/192.66 ============================== end predicate elimination =============
% 192.32/192.66
% 192.32/192.66 Auto_denials:
% 192.32/192.66 % copying label prove_lg_3 to answer in negative clause
% 192.32/192.66
% 192.32/192.66 Term ordering decisions:
% 192.32/192.66 Function symbol KB weights: a=1. b=1. c=1. e=1. falsehood=1. equivalent=1.
% 192.32/192.66
% 192.32/192.66 ============================== end of process initial clauses ========
% 192.32/192.66
% 192.32/192.66 ============================== CLAUSES FOR SEARCH ====================
% 192.32/192.66
% 192.32/192.66 ============================== end of clauses for search =============
% 192.32/192.66
% 192.32/192.66 ============================== SEARCH ================================
% 192.32/192.66
% 192.32/192.66 % Starting search at 0.01 seconds.
% 192.32/192.66
% 192.32/192.66 Low Water (keep): wt=40.000, iters=3395
% 192.32/192.66
% 192.32/192.66 Low Water (keep): wt=36.000, iters=3398
% 192.32/192.66
% 192.32/192.66 Low Water (keep): wt=32.000, iters=3334
% 192.32/192.66
% 192.32/192.66 Low Water (keep): wt=28.000, iters=3363
% 192.32/192.66
% 192.32/192.66 Low Water (keep): wt=24.000, iters=3348
% 192.32/192.66
% 192.32/192.66 Low Water (displace): id=5611, wt=48.000
% 192.32/192.66
% 192.32/192.66 Low Water (displace): id=10412, wt=20.000
% 192.32/192.66
% 192.32/192.66 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 3948 (0.00 of 2.20 sec).
% 192.32/192.66
% 192.32/192.66 ============================== PROOF =================================
% 192.32/192.66 % SZS status Unsatisfiable
% 192.32/192.66 % SZS output start Refutation
% 192.32/192.66
% 192.32/192.66 % Proof 1 at 170.23 (+ 21.47) seconds: prove_lg_3.
% 192.32/192.66 % Length of proof is 31.
% 192.32/192.66 % Level of proof is 12.
% 192.32/192.66 % Maximum clause weight is 24.000.
% 192.32/192.66 % Given clauses 8297.
% 192.32/192.66
% 192.32/192.66 1 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D),D)) # label(lg_2) # label(axiom). [assumption].
% 192.32/192.66 2 is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),equivalent(equivalent(A,D),C)))) # label(p_1) # label(axiom). [assumption].
% 192.32/192.66 3 -is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),e),equivalent(equivalent(b,c),e)),falsehood),falsehood)) # label(prove_lg_3) # label(negated_conjecture) # answer(prove_lg_3). [assumption].
% 192.32/192.66 4 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 192.32/192.66 5 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(C,D),A),equivalent(equivalent(E,D),equivalent(equivalent(C,E),B))))). [hyper(4,a,2,a,b,2,a)].
% 192.32/192.66 7 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(equivalent(B,D),A),equivalent(D,C)))). [hyper(4,a,1,a,b,2,a)].
% 192.32/192.66 13 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(C,equivalent(A,E))),equivalent(D,equivalent(B,E)))). [hyper(4,a,7,a,b,7,a)].
% 192.32/192.66 16 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,D))),equivalent(B,D))). [hyper(4,a,1,a,b,7,a)].
% 192.32/192.66 18 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),E)),equivalent(C,equivalent(equivalent(D,A),E)))). [hyper(4,a,7,a,b,2,a)].
% 192.32/192.66 19 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(equivalent(C,D),equivalent(C,E)),equivalent(D,E)),equivalent(A,F))),equivalent(B,F))). [hyper(4,a,7,a,b,1,a)].
% 192.32/192.67 23 is_a_theorem(equivalent(A,equivalent(equivalent(B,B),A))). [hyper(4,a,16,a,b,5,a)].
% 192.32/192.67 26 is_a_theorem(equivalent(A,A)). [hyper(4,a,16,a,b,23,a)].
% 192.32/192.67 27 is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,A),B),C),equivalent(B,C))). [hyper(4,a,7,a,b,23,a)].
% 192.32/192.67 38 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))). [hyper(4,a,2,a,b,26,a)].
% 192.32/192.67 70 is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),A)))). [hyper(4,a,27,a,b,2,a)].
% 192.32/192.67 90 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(equivalent(D,B),equivalent(D,C))))). [hyper(4,a,38,a,b,38,a)].
% 192.32/192.67 689 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(B,D))),equivalent(C,D))). [hyper(4,a,13,a,b,16,a)].
% 192.32/192.67 690 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,A),D)),equivalent(equivalent(C,B),D))). [hyper(4,a,13,a,b,1,a)].
% 192.32/192.67 1413 is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(D,B),equivalent(equivalent(C,D),A))))). [hyper(4,a,18,a,b,70,a)].
% 192.32/192.67 1598 is_a_theorem(equivalent(equivalent(equivalent(A,A),B),B)). [hyper(4,a,19,a,b,7,a)].
% 192.32/192.67 1618 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),equivalent(A,C))). [hyper(4,a,38,a,b,1598,a)].
% 192.32/192.67 7645 is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(B,D))),equivalent(equivalent(E,C),equivalent(E,D)))). [hyper(4,a,90,a,b,689,a)].
% 192.32/192.67 7658 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,A),C)),C)). [hyper(4,a,1618,a,b,690,a)].
% 192.32/192.67 7761 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,equivalent(B,A)),equivalent(C,D))),D)). [hyper(4,a,16,a,b,7658,a)].
% 192.32/192.67 7764 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(equivalent(D,C),equivalent(A,E)))),equivalent(B,E))). [hyper(4,a,7,a,b,7658,a)].
% 192.32/192.67 8322 is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(equivalent(equivalent(D,E),B),equivalent(E,C)),A))))). [hyper(4,a,13,a,b,1413,a)].
% 192.32/192.67 15041 is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(B,equivalent(D,C)),E)))),equivalent(A,E))). [hyper(4,a,7645,a,b,7761,a)].
% 192.32/192.67 15531 is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),equivalent(B,D)),equivalent(C,D)),A))). [hyper(4,a,7764,a,b,8322,a)].
% 192.32/192.67 15568 is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),equivalent(B,D)),E),equivalent(equivalent(E,equivalent(C,D)),A)))). [hyper(4,a,18,a,b,15531,a)].
% 192.32/192.67 18384 is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),D),equivalent(equivalent(B,C),D)),E),E)). [hyper(4,a,15041,a,b,15568,a)].
% 192.32/192.67 18385 $F # answer(prove_lg_3). [resolve(18384,a,3,a)].
% 192.32/192.67
% 192.32/192.67 % SZS output end Refutation
% 192.32/192.67 ============================== end of proof ==========================
% 192.32/192.67
% 192.32/192.67 ============================== STATISTICS ============================
% 192.32/192.67
% 192.32/192.67 Given=8297. Generated=44967795. Kept=18384. proofs=1.
% 192.32/192.67 Usable=8297. Sos=6932. Demods=0. Limbo=0, Disabled=3158. Hints=0.
% 192.32/192.67 Megabytes=14.59.
% 192.32/192.67 User_CPU=170.23, System_CPU=21.47, Wall_clock=192.
% 192.32/192.67
% 192.32/192.67 ============================== end of statistics =====================
% 192.32/192.67
% 192.32/192.67 ============================== end of search =========================
% 192.32/192.67
% 192.32/192.67 THEOREM PROVED
% 192.32/192.67 % SZS status Unsatisfiable
% 192.32/192.67
% 192.32/192.67 Exiting with 1 proof.
% 192.32/192.67
% 192.32/192.67 Process 17694 exit (max_proofs) Tue Jul 5 01:42:15 2022
% 192.32/192.67 Prover9 interrupted
%------------------------------------------------------------------------------