TSTP Solution File: KLE072+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KLE072+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %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 : Sun Jul 17 02:27:26 EDT 2022
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE072+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n018.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 : Thu Jun 16 09:07:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36
% 0.12/0.36 -------- PROOF --------
% 0.12/0.36 % SZS status Unsatisfiable
% 0.12/0.36 % SZS output start Refutation
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n018.cluster.edu,
% 0.12/0.36 Thu Jun 16 09:07:00 2022
% 0.12/0.36 The command was "./sos". The process ID is 15128.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.12/0.36
% 0.12/0.36 This is a Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36 sos and nonpositive clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} addition(A,B)=addition(B,A).
% 0.12/0.36
% 0.12/0.36 ----> UNIT CONFLICT at 0.00 sec ----> 40 [binary,39.1,38.1] {-} $F.
% 0.12/0.36
% 0.12/0.36 Length of proof is 2. Level of proof is 2.
% 0.12/0.36
% 0.12/0.36 ---------------- PROOF ----------------
% 0.12/0.36 % SZS status Theorem
% 0.12/0.36 % SZS output start Refutation
% 0.12/0.36
% 0.12/0.36 3 [] {-} domain(multiplication(addition($c3,$c2),domain($c1)))!=addition(domain(multiplication($c3,domain($c1))),domain(multiplication($c2,domain($c1)))).
% 0.12/0.36 22,21 [] {-} multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 0.12/0.36 29 [] {-} domain(multiplication(A,B))=domain(multiplication(A,domain(B))).
% 0.12/0.36 31,30 [copy,29,flip.1] {-} domain(multiplication(A,domain(B)))=domain(multiplication(A,B)).
% 0.12/0.36 37,36 [] {-} domain(addition(A,B))=addition(domain(A),domain(B)).
% 0.12/0.36 38 [] {-} A=A.
% 0.12/0.36 39 [back_demod,3,demod,22,37,31,31,31,31] {-} addition(domain(multiplication($c3,$c1)),domain(multiplication($c2,$c1)))!=addition(domain(multiplication($c3,$c1)),domain(multiplication($c2,$c1))).
% 0.12/0.36 40 [binary,39.1,38.1] {-} $F.
% 0.12/0.36
% 0.12/0.36 % SZS output end Refutation
% 0.12/0.36 ------------ end of proof -------------
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Search stopped by max_proofs option.
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Search stopped by max_proofs option.
% 0.12/0.36
% 0.12/0.36 ============ end of search ============
% 0.12/0.36
% 0.12/0.36 That finishes the proof of the theorem.
% 0.12/0.36
% 0.12/0.36 Process 15128 finished Thu Jun 16 09:07:00 2022
%------------------------------------------------------------------------------