TSTP Solution File: NUM557+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM557+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 14:19:30 EDT 2022
% Result : Theorem 0.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM557+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 06:57:44 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36
% 0.13/0.36 -------- PROOF --------
% 0.13/0.36 % SZS status Unsatisfiable
% 0.13/0.36 % SZS output start Refutation
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n024.cluster.edu,
% 0.13/0.36 Thu Jul 7 06:57:44 2022
% 0.13/0.36 The command was "./sos". The process ID is 10708.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.37 ------------> process usable:
% 0.13/0.37 Following clause subsumed by 103 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|aSet0(A).
% 0.13/0.37 Following clause subsumed by 104 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))| -aElementOf0(B,A)|aElementOf0(B,xS).
% 0.13/0.37 Following clause subsumed by 105 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|aSubsetOf0(A,xS).
% 0.13/0.37 Following clause subsumed by 106 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|sbrdtbr0(A)=xk.
% 0.13/0.37 Following clause subsumed by 109 during input processing: 0 [] {-} -aSubsetOf0(A,xS)|sbrdtbr0(A)!=xk|aElementOf0(A,slbdtsldtrb0(xS,xk)).
% 0.13/0.37 Following clause subsumed by 122 during input processing: 0 [] {-} -aElementOf0(xx,xQ).
% 0.13/0.37 Following clause subsumed by 123 during input processing: 0 [] {-} -aElementOf0(A,sdtmndt0(xQ,xy))|aElement0(A).
% 0.13/0.37 Following clause subsumed by 124 during input processing: 0 [] {-} -aElementOf0(A,sdtmndt0(xQ,xy))|aElementOf0(A,xQ).
% 0.13/0.37 Following clause subsumed by 125 during input processing: 0 [] {-} -aElementOf0(A,sdtmndt0(xQ,xy))|A!=xy.
% 0.13/0.37 Following clause subsumed by 126 during input processing: 0 [] {-} aElementOf0(A,sdtmndt0(xQ,xy))| -aElement0(A)| -aElementOf0(A,xQ)|A=xy.
% 0.13/0.37 145 back subsumes 144.
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 180 during input processing: 0 [] {-} aSet0(xQ).
% 0.13/0.37 Following clause subsumed by 190 during input processing: 0 [] {-} aSet0(sdtmndt0(xQ,xy)).
% 0.13/0.37 Following clause subsumed by 198 during input processing: 0 [copy,187,flip.1] {-} xk=xk.
% 0.13/0.37
% 0.13/0.37 -----> EMPTY CLAUSE at 0.01 sec ----> 199 [back_demod,135,demod,197,unit_del,195,198] {-} $F.
% 0.13/0.37
% 0.13/0.37 Length of proof is 0. Level of proof is 0.
% 0.13/0.37
% 0.13/0.37 ---------------- PROOF ----------------
% 0.13/0.37 % SZS status Theorem
% 0.13/0.37 % SZS output start Refutation
% 0.13/0.37
% 0.13/0.37 135 [] {-} -aSubsetOf0(xP,xS)|sbrdtbr0(xP)!=xk.
% 0.13/0.37 195 [] {-} aSubsetOf0(xP,xS).
% 0.13/0.37 197,196 [] {-} sbrdtbr0(xP)=xk.
% 0.13/0.37 198 [] {-} A=A.
% 0.13/0.37 199 [back_demod,135,demod,197,unit_del,195,198] {-} $F.
% 0.13/0.37
% 0.13/0.37 % SZS output end Refutation
% 0.13/0.37 ------------ end of proof -------------
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 Search stopped by max_proofs option.
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 Search stopped by max_proofs option.
% 0.13/0.37
% 0.13/0.37 ============ end of search ============
% 0.13/0.37
% 0.13/0.37 That finishes the proof of the theorem.
% 0.13/0.37
% 0.13/0.37 Process 10708 finished Thu Jul 7 06:57:44 2022
%------------------------------------------------------------------------------