TSTP Solution File: LCL022-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL022-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:43:27 EDT 2022
% Result : Unsatisfiable 0.47s 1.06s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 15:39:59 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.47/1.06 ============================== Prover9 ===============================
% 0.47/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.06 Process 22021 was started by sandbox2 on n020.cluster.edu,
% 0.47/1.06 Mon Jul 4 15:40:00 2022
% 0.47/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21868_n020.cluster.edu".
% 0.47/1.06 ============================== end of head ===========================
% 0.47/1.06
% 0.47/1.06 ============================== INPUT =================================
% 0.47/1.06
% 0.47/1.06 % Reading from file /tmp/Prover9_21868_n020.cluster.edu
% 0.47/1.06
% 0.47/1.06 set(prolog_style_variables).
% 0.47/1.06 set(auto2).
% 0.47/1.06 % set(auto2) -> set(auto).
% 0.47/1.06 % set(auto) -> set(auto_inference).
% 0.47/1.06 % set(auto) -> set(auto_setup).
% 0.47/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.06 % set(auto) -> set(auto_limits).
% 0.47/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.06 % set(auto) -> set(auto_denials).
% 0.47/1.06 % set(auto) -> set(auto_process).
% 0.47/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.06 % set(auto2) -> assign(stats, some).
% 0.47/1.06 % set(auto2) -> clear(echo_input).
% 0.47/1.06 % set(auto2) -> set(quiet).
% 0.47/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.06 % set(auto2) -> clear(print_given).
% 0.47/1.06 assign(lrs_ticks,-1).
% 0.47/1.06 assign(sos_limit,10000).
% 0.47/1.06 assign(order,kbo).
% 0.47/1.06 set(lex_order_vars).
% 0.47/1.06 clear(print_given).
% 0.47/1.06
% 0.47/1.06 % formulas(sos). % not echoed (3 formulas)
% 0.47/1.06
% 0.47/1.06 ============================== end of input ==========================
% 0.47/1.06
% 0.47/1.06 % From the command line: assign(max_seconds, 300).
% 0.47/1.06
% 0.47/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.06
% 0.47/1.06 % Formulas that are not ordinary clauses:
% 0.47/1.06
% 0.47/1.06 ============================== end of process non-clausal formulas ===
% 0.47/1.06
% 0.47/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.06
% 0.47/1.06 ============================== PREDICATE ELIMINATION =================
% 0.47/1.06
% 0.47/1.06 ============================== end predicate elimination =============
% 0.47/1.06
% 0.47/1.06 Auto_denials:
% 0.47/1.06 % copying label prove_ec_1 to answer in negative clause
% 0.47/1.06
% 0.47/1.06 Term ordering decisions:
% 0.47/1.06 Function symbol KB weights: a=1. b=1. c=1. equivalent=1.
% 0.47/1.06
% 0.47/1.06 ============================== end of process initial clauses ========
% 0.47/1.06
% 0.47/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.06
% 0.47/1.06 ============================== end of clauses for search =============
% 0.47/1.06
% 0.47/1.06 ============================== SEARCH ================================
% 0.47/1.06
% 0.47/1.06 % Starting search at 0.01 seconds.
% 0.47/1.06
% 0.47/1.06 ============================== PROOF =================================
% 0.47/1.06 % SZS status Unsatisfiable
% 0.47/1.06 % SZS output start Refutation
% 0.47/1.06
% 0.47/1.06 % Proof 1 at 0.03 (+ 0.00) seconds: prove_ec_1.
% 0.47/1.06 % Length of proof is 14.
% 0.47/1.06 % Level of proof is 9.
% 0.47/1.06 % Maximum clause weight is 16.000.
% 0.47/1.06 % Given clauses 33.
% 0.47/1.06
% 0.47/1.06 1 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(A,C)))) # label(yql) # label(axiom). [assumption].
% 0.47/1.06 2 -is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))) # label(prove_ec_1) # label(negated_conjecture) # answer(prove_ec_1). [assumption].
% 0.47/1.06 3 -is_a_theorem(equivalent(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom). [assumption].
% 0.47/1.06 4 is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,B))),equivalent(equivalent(D,C),A))). [hyper(3,a,1,a,b,1,a)].
% 0.47/1.06 5 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(equivalent(D,B),equivalent(C,D))))). [hyper(3,a,4,a,b,4,a)].
% 0.47/1.06 7 is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))). [hyper(3,a,4,a,b,1,a)].
% 0.47/1.06 8 is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(B,C),A))). [hyper(3,a,1,a,b,7,a)].
% 0.47/1.06 10 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(C,B)))). [hyper(3,a,4,a,b,8,a)].
% 0.47/1.06 17 is_a_theorem(equivalent(equivalent(A,A),equivalent(B,B))). [hyper(3,a,4,a,b,10,a)].
% 0.47/1.06 33 is_a_theorem(equivalent(A,A)). [hyper(3,a,17,a,b,17,a)].
% 0.47/1.06 37 is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))). [hyper(3,a,10,a,b,33,a)].
% 0.47/1.06 38 is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(B,C)))). [hyper(3,a,5,a,b,33,a)].
% 0.47/1.06 371 is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,A)),equivalent(B,C))). [hyper(3,a,37,a,b,38,a)].
% 0.47/1.06 372 $F # answer(prove_ec_1). [resolve(371,a,2,a)].
% 0.47/1.06
% 0.47/1.06 % SZS output end Refutation
% 0.47/1.06 ============================== end of proof ==========================
% 0.47/1.06
% 0.47/1.06 ============================== STATISTICS ============================
% 0.47/1.06
% 0.47/1.06 Given=33. Generated=679. Kept=371. proofs=1.
% 0.47/1.06 Usable=30. Sos=324. Demods=0. Limbo=6, Disabled=13. Hints=0.
% 0.47/1.06 Megabytes=0.29.
% 0.47/1.06 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.47/1.06
% 0.47/1.06 ============================== end of statistics =====================
% 0.47/1.06
% 0.47/1.06 ============================== end of search =========================
% 0.47/1.06
% 0.47/1.06 THEOREM PROVED
% 0.47/1.06 % SZS status Unsatisfiable
% 0.47/1.06
% 0.47/1.06 Exiting with 1 proof.
% 0.47/1.06
% 0.47/1.06 Process 22021 exit (max_proofs) Mon Jul 4 15:40:00 2022
% 0.47/1.06 Prover9 interrupted
%------------------------------------------------------------------------------