TSTP Solution File: NUM848+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM848+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:22:38 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM848+2 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Wed Jul 6 14:43:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35
% 0.12/0.35 -------- PROOF --------
% 0.12/0.35 % SZS status Unsatisfiable
% 0.12/0.35 % SZS output start Refutation
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n010.cluster.edu,
% 0.12/0.35 Wed Jul 6 14:43:47 2022
% 0.12/0.35 The command was "./sos". The process ID is 15984.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 26 during input processing: 0 [demod,32] {-} vplus(A,v1)=vplus(v1,A).
% 0.12/0.35 23 back subsumes 21.
% 0.12/0.35 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] {-} vplus(A,B)=vplus(B,A).
% 0.12/0.35
% 0.12/0.35 ----> UNIT CONFLICT at 0.00 sec ----> 47 [binary,46.1,39.1] {-} $F.
% 0.12/0.35
% 0.12/0.35 Length of proof is 7. Level of proof is 4.
% 0.12/0.35
% 0.12/0.35 ---------------- PROOF ----------------
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % SZS output start Refutation
% 0.12/0.35
% 0.12/0.35 1 [] {-} vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))!=vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))).
% 0.12/0.35 2 [copy,1,flip.1] {-} vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439)))!=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)).
% 0.12/0.35 5,4 [] {-} vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)).
% 0.12/0.35 6 [] {-} vplus(vmul(vd436,vplus(vd437,vd439)),vd436)=vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436).
% 0.12/0.35 8,7 [copy,6,demod,5] {-} vplus(vmul(vd436,vplus(vd437,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)).
% 0.12/0.35 9 [] {-} vmul(vd436,vsucc(vplus(vd437,vd439)))=vplus(vmul(vd436,vplus(vd437,vd439)),vd436).
% 0.12/0.35 10 [copy,9,demod,8] {-} vmul(vd436,vsucc(vplus(vd437,vd439)))=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)).
% 0.12/0.35 23 [] {-} vmul(A,vsucc(B))=vplus(vmul(A,B),A).
% 0.12/0.35 30 [] {-} vplus(v1,A)=vsucc(A).
% 0.12/0.35 32,31 [copy,30,flip.1] {-} vsucc(A)=vplus(v1,A).
% 0.12/0.35 39 [] {-} A=A.
% 0.12/0.35 41,40 [copy,23,flip.1,demod,32] {-} vplus(vmul(A,B),A)=vmul(A,vplus(v1,B)).
% 0.12/0.35 43,42 [back_demod,10,demod,32,41,flip.1] {-} vplus(vmul(vd436,vd437),vmul(vd436,vplus(v1,vd439)))=vmul(vd436,vplus(v1,vplus(vd437,vd439))).
% 0.12/0.35 46 [back_demod,2,demod,32,43,41,43] {-} vmul(vd436,vplus(v1,vplus(vd437,vd439)))!=vmul(vd436,vplus(v1,vplus(vd437,vd439))).
% 0.12/0.35 47 [binary,46.1,39.1] {-} $F.
% 0.12/0.35
% 0.12/0.35 % SZS output end Refutation
% 0.12/0.35 ------------ end of proof -------------
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 Search stopped by max_proofs option.
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 Search stopped by max_proofs option.
% 0.12/0.35
% 0.12/0.35 ============ end of search ============
% 0.12/0.35
% 0.12/0.35 That finishes the proof of the theorem.
% 0.12/0.35
% 0.12/0.35 Process 15984 finished Wed Jul 6 14:43:47 2022
%------------------------------------------------------------------------------