TSTP Solution File: GRP146-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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 : Sat Jul 16 11:41:55 EDT 2022
% Result : Unsatisfiable 0.16s 0.34s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.02/0.11 % Command : sos-script %s
% 0.12/0.30 % Computer : n027.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Mon Jun 13 21:04:17 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.16/0.34
% 0.16/0.34 -------- PROOF --------
% 0.16/0.34 % SZS status Unsatisfiable
% 0.16/0.34 % SZS output start Refutation
% 0.16/0.34 ----- Otter 3.2, August 2001 -----
% 0.16/0.34 The process was started by sandbox2 on n027.cluster.edu,
% 0.16/0.34 Mon Jun 13 21:04:17 2022
% 0.16/0.34 The command was "./sos". The process ID is 22596.
% 0.16/0.34
% 0.16/0.34 set(prolog_style_variables).
% 0.16/0.34 set(auto).
% 0.16/0.34 dependent: set(auto1).
% 0.16/0.34 dependent: set(process_input).
% 0.16/0.34 dependent: clear(print_kept).
% 0.16/0.34 dependent: clear(print_new_demod).
% 0.16/0.34 dependent: clear(print_back_demod).
% 0.16/0.34 dependent: clear(print_back_sub).
% 0.16/0.34 dependent: set(control_memory).
% 0.16/0.34 dependent: assign(max_mem, 12000).
% 0.16/0.34 dependent: assign(pick_given_ratio, 4).
% 0.16/0.34 dependent: assign(stats_level, 1).
% 0.16/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.34 dependent: assign(sos_limit, 5000).
% 0.16/0.34 dependent: assign(max_weight, 60).
% 0.16/0.34 clear(print_given).
% 0.16/0.34
% 0.16/0.34 list(usable).
% 0.16/0.34
% 0.16/0.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.16/0.34
% 0.16/0.34 All clauses are units, and equality is present; the
% 0.16/0.34 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.16/0.34
% 0.16/0.34 dependent: set(knuth_bendix).
% 0.16/0.34 dependent: set(para_from).
% 0.16/0.34 dependent: set(para_into).
% 0.16/0.34 dependent: clear(para_from_right).
% 0.16/0.34 dependent: clear(para_into_right).
% 0.16/0.34 dependent: set(para_from_vars).
% 0.16/0.34 dependent: set(eq_units_both_ways).
% 0.16/0.34 dependent: set(dynamic_demod_all).
% 0.16/0.34 dependent: set(dynamic_demod).
% 0.16/0.34 dependent: set(order_eq).
% 0.16/0.34 dependent: set(back_demod).
% 0.16/0.34 dependent: set(lrpo).
% 0.16/0.34
% 0.16/0.34 ------------> process usable:
% 0.16/0.34
% 0.16/0.34 ------------> process sos:
% 0.16/0.34 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.16/0.34 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.16/0.34
% 0.16/0.34 ----> UNIT CONFLICT at 0.00 sec ----> 38 [binary,37.1,36.1] {-} $F.
% 0.16/0.34
% 0.16/0.34 Length of proof is 2. Level of proof is 2.
% 0.16/0.34
% 0.16/0.34 ---------------- PROOF ----------------
% 0.16/0.34 % SZS status Unsatisfiable
% 0.16/0.34 % SZS output start Refutation
% 0.16/0.34
% 0.16/0.34 1 [] {-} least_upper_bound(least_upper_bound(a,b),c)!=c.
% 0.16/0.34 13 [] {-} least_upper_bound(A,least_upper_bound(B,C))=least_upper_bound(least_upper_bound(A,B),C).
% 0.16/0.34 15,14 [copy,13,flip.1] {-} least_upper_bound(least_upper_bound(A,B),C)=least_upper_bound(A,least_upper_bound(B,C)).
% 0.16/0.34 33,32 [] {-} least_upper_bound(a,c)=c.
% 0.16/0.34 35,34 [] {-} least_upper_bound(b,c)=c.
% 0.16/0.34 36 [] {-} A=A.
% 0.16/0.34 37 [back_demod,1,demod,15,35,33] {-} c!=c.
% 0.16/0.34 38 [binary,37.1,36.1] {-} $F.
% 0.16/0.34
% 0.16/0.34 % SZS output end Refutation
% 0.16/0.34 ------------ end of proof -------------
% 0.16/0.34
% 0.16/0.34
% 0.16/0.34 Search stopped by max_proofs option.
% 0.16/0.34
% 0.16/0.34
% 0.16/0.34 Search stopped by max_proofs option.
% 0.16/0.34
% 0.16/0.34 ============ end of search ============
% 0.16/0.34
% 0.16/0.34 That finishes the proof of the theorem.
% 0.16/0.34
% 0.16/0.34 Process 22596 finished Mon Jun 13 21:04:17 2022
%------------------------------------------------------------------------------