TSTP Solution File: REL008-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL008-3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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 : Mon Jul 18 19:53:31 EDT 2022
% Result : Unsatisfiable 1.50s 1.81s
% Output : Refutation 1.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : REL008-3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n018.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 : Fri Jul 8 10:45:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.50/1.81 ============================== Prover9 ===============================
% 1.50/1.81 Prover9 (32) version 2009-11A, November 2009.
% 1.50/1.81 Process 9714 was started by sandbox on n018.cluster.edu,
% 1.50/1.81 Fri Jul 8 10:45:11 2022
% 1.50/1.81 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9561_n018.cluster.edu".
% 1.50/1.81 ============================== end of head ===========================
% 1.50/1.81
% 1.50/1.81 ============================== INPUT =================================
% 1.50/1.81
% 1.50/1.81 % Reading from file /tmp/Prover9_9561_n018.cluster.edu
% 1.50/1.81
% 1.50/1.81 set(prolog_style_variables).
% 1.50/1.81 set(auto2).
% 1.50/1.81 % set(auto2) -> set(auto).
% 1.50/1.81 % set(auto) -> set(auto_inference).
% 1.50/1.81 % set(auto) -> set(auto_setup).
% 1.50/1.81 % set(auto_setup) -> set(predicate_elim).
% 1.50/1.81 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.50/1.81 % set(auto) -> set(auto_limits).
% 1.50/1.81 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.50/1.81 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.50/1.81 % set(auto) -> set(auto_denials).
% 1.50/1.81 % set(auto) -> set(auto_process).
% 1.50/1.81 % set(auto2) -> assign(new_constants, 1).
% 1.50/1.81 % set(auto2) -> assign(fold_denial_max, 3).
% 1.50/1.81 % set(auto2) -> assign(max_weight, "200.000").
% 1.50/1.81 % set(auto2) -> assign(max_hours, 1).
% 1.50/1.81 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.50/1.81 % set(auto2) -> assign(max_seconds, 0).
% 1.50/1.81 % set(auto2) -> assign(max_minutes, 5).
% 1.50/1.81 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.50/1.81 % set(auto2) -> set(sort_initial_sos).
% 1.50/1.81 % set(auto2) -> assign(sos_limit, -1).
% 1.50/1.81 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.50/1.81 % set(auto2) -> assign(max_megs, 400).
% 1.50/1.81 % set(auto2) -> assign(stats, some).
% 1.50/1.81 % set(auto2) -> clear(echo_input).
% 1.50/1.81 % set(auto2) -> set(quiet).
% 1.50/1.81 % set(auto2) -> clear(print_initial_clauses).
% 1.50/1.81 % set(auto2) -> clear(print_given).
% 1.50/1.81 assign(lrs_ticks,-1).
% 1.50/1.81 assign(sos_limit,10000).
% 1.50/1.81 assign(order,kbo).
% 1.50/1.81 set(lex_order_vars).
% 1.50/1.81 clear(print_given).
% 1.50/1.81
% 1.50/1.81 % formulas(sos). % not echoed (17 formulas)
% 1.50/1.81
% 1.50/1.81 ============================== end of input ==========================
% 1.50/1.81
% 1.50/1.81 % From the command line: assign(max_seconds, 300).
% 1.50/1.81
% 1.50/1.81 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.50/1.81
% 1.50/1.81 % Formulas that are not ordinary clauses:
% 1.50/1.81
% 1.50/1.81 ============================== end of process non-clausal formulas ===
% 1.50/1.81
% 1.50/1.81 ============================== PROCESS INITIAL CLAUSES ===============
% 1.50/1.81
% 1.50/1.81 ============================== PREDICATE ELIMINATION =================
% 1.50/1.81
% 1.50/1.81 ============================== end predicate elimination =============
% 1.50/1.81
% 1.50/1.81 Auto_denials:
% 1.50/1.81 % copying label goals_17 to answer in negative clause
% 1.50/1.81
% 1.50/1.81 Term ordering decisions:
% 1.50/1.81 Function symbol KB weights: one=1. top=1. zero=1. sk1=1. sk2=1. sk3=1. composition=1. join=1. meet=1. converse=1. complement=1.
% 1.50/1.81
% 1.50/1.81 ============================== end of process initial clauses ========
% 1.50/1.81
% 1.50/1.81 ============================== CLAUSES FOR SEARCH ====================
% 1.50/1.81
% 1.50/1.81 ============================== end of clauses for search =============
% 1.50/1.81
% 1.50/1.81 ============================== SEARCH ================================
% 1.50/1.81
% 1.50/1.81 % Starting search at 0.01 seconds.
% 1.50/1.81
% 1.50/1.81 ============================== PROOF =================================
% 1.50/1.81 % SZS status Unsatisfiable
% 1.50/1.81 % SZS output start Refutation
% 1.50/1.81
% 1.50/1.81 % Proof 1 at 0.78 (+ 0.02) seconds: goals_17.
% 1.50/1.81 % Length of proof is 15.
% 1.50/1.81 % Level of proof is 5.
% 1.50/1.81 % Maximum clause weight is 17.000.
% 1.50/1.81 % Given clauses 248.
% 1.50/1.81
% 1.50/1.81 2 converse(converse(A)) = A # label(converse_idempotence_8) # label(axiom). [assumption].
% 1.50/1.81 7 join(A,B) = join(B,A) # label(maddux1_join_commutativity_1) # label(axiom). [assumption].
% 1.50/1.81 9 converse(join(A,B)) = join(converse(A),converse(B)) # label(converse_additivity_9) # label(axiom). [assumption].
% 1.50/1.81 10 join(converse(A),converse(B)) = converse(join(A,B)). [copy(9),flip(a)].
% 1.50/1.81 11 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity_10) # label(axiom). [assumption].
% 1.50/1.81 12 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(11),flip(a)].
% 1.50/1.81 17 composition(join(A,B),C) = join(composition(A,C),composition(B,C)) # label(composition_distributivity_7) # label(axiom). [assumption].
% 1.50/1.81 18 join(composition(A,B),composition(C,B)) = composition(join(A,C),B). [copy(17),flip(a)].
% 1.50/1.81 29 composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)) # label(goals_17) # label(negated_conjecture) # answer(goals_17). [assumption].
% 1.50/1.81 30 join(composition(sk1,sk2),composition(sk1,sk3)) != composition(sk1,join(sk2,sk3)) # answer(goals_17). [copy(29),flip(a)].
% 1.50/1.81 34 converse(composition(converse(A),B)) = composition(converse(B),A). [para(2(a,1),12(a,1,2)),flip(a)].
% 1.50/1.81 38 join(converse(composition(A,B)),composition(C,converse(A))) = composition(join(C,converse(B)),converse(A)). [para(12(a,1),18(a,1,1)),rewrite([7(7)])].
% 1.50/1.81 113 converse(join(A,composition(converse(B),C))) = join(composition(converse(C),B),converse(A)). [para(34(a,1),10(a,1,1)),rewrite([7(7)]),flip(a)].
% 1.50/1.81 3442 join(composition(A,B),composition(A,C)) = composition(A,join(B,C)). [para(38(a,1),113(a,1,1)),rewrite([10(3),12(4),2(4),2(4),2(6)]),flip(a)].
% 1.50/1.81 3443 $F # answer(goals_17). [resolve(3442,a,30,a)].
% 1.50/1.81
% 1.50/1.81 % SZS output end Refutation
% 1.50/1.81 ============================== end of proof ==========================
% 1.50/1.81
% 1.50/1.81 ============================== STATISTICS ============================
% 1.50/1.81
% 1.50/1.81 Given=248. Generated=20623. Kept=3429. proofs=1.
% 1.50/1.81 Usable=209. Sos=2873. Demods=3053. Limbo=5, Disabled=358. Hints=0.
% 1.50/1.81 Megabytes=8.14.
% 1.50/1.81 User_CPU=0.78, System_CPU=0.02, Wall_clock=0.
% 1.50/1.81
% 1.50/1.81 ============================== end of statistics =====================
% 1.50/1.81
% 1.50/1.81 ============================== end of search =========================
% 1.50/1.81
% 1.50/1.81 THEOREM PROVED
% 1.50/1.81 % SZS status Unsatisfiable
% 1.50/1.81
% 1.50/1.81 Exiting with 1 proof.
% 1.50/1.81
% 1.50/1.81 Process 9714 exit (max_proofs) Fri Jul 8 10:45:11 2022
% 1.50/1.81 Prover9 interrupted
%------------------------------------------------------------------------------