TSTP Solution File: NUM533+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM533+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:13 EDT 2022
% Result : Theorem 0.90s 1.11s
% Output : Refutation 0.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM533+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n020.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 : Wed Jul 6 03:25:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n020.cluster.edu,
% 0.13/0.37 Wed Jul 6 03:25:59 2022
% 0.13/0.37 The command was "./sos". The process ID is 8962.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] {-} A=A.
% 0.13/0.37 26 back subsumes 18.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.41
% 0.13/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.41
% 0.13/0.41 Stopped by limit on number of solutions
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 -------------- Softie stats --------------
% 0.13/0.41
% 0.13/0.41 UPDATE_STOP: 300
% 0.13/0.41 SFINDER_TIME_LIMIT: 2
% 0.13/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.41 number of clauses in intial UL: 17
% 0.13/0.41 number of clauses initially in problem: 25
% 0.13/0.41 percentage of clauses intially in UL: 68
% 0.13/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.41 percent of all initial clauses that are short: 100
% 0.13/0.41 absolute distinct symbol count: 14
% 0.13/0.41 distinct predicate count: 7
% 0.13/0.41 distinct function count: 2
% 0.13/0.41 distinct constant count: 5
% 0.13/0.41
% 0.13/0.41 ---------- no more Softie stats ----------
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.41
% 0.13/0.41 Stopped by limit on number of solutions
% 0.13/0.41
% 0.13/0.41 =========== start of search ===========
% 0.90/1.11
% 0.90/1.11 -------- PROOF --------
% 0.90/1.11 % SZS status Theorem
% 0.90/1.11 % SZS output start Refutation
% 0.90/1.11
% 0.90/1.11 Model 3 (0.00 seconds, 0 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on number of solutions
% 0.90/1.11
% 0.90/1.11 Model 4 (0.00 seconds, 0 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on number of solutions
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 Model 5 [ 1 0 245 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 Model 6 [ 1 0 67 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 Model 7 [ 3 1 70 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 Model 8 [ 6 0 66 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 Model 9 [ 3 0 65 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 Model 10 [ 3 1 127 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 Model 11 [ 4 0 65 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 ----> UNIT CONFLICT at 0.71 sec ----> 72 [binary,71.1,16.1] {-} $F.
% 0.90/1.11
% 0.90/1.11 Length of proof is 2. Level of proof is 2.
% 0.90/1.11
% 0.90/1.11 ---------------- PROOF ----------------
% 0.90/1.11 % SZS status Theorem
% 0.90/1.11 % SZS output start Refutation
% 0.90/1.11
% 0.90/1.11 14 [] {+} -aElementOf0(A,xA)|aElementOf0(A,xB).
% 0.90/1.11 15 [] {+} -aElementOf0(A,xB)|aElementOf0(A,xC).
% 0.90/1.11 16 [] {+} -aElementOf0($c1,xC).
% 0.90/1.11 25 [] {-} aElementOf0($c1,xA).
% 0.90/1.11 49 [hyper,25,14] {-} aElementOf0($c1,xB).
% 0.90/1.11 71 [hyper,49,15] {-} aElementOf0($c1,xC).
% 0.90/1.11 72 [binary,71.1,16.1] {-} $F.
% 0.90/1.11
% 0.90/1.11 % SZS output end Refutation
% 0.90/1.11 ------------ end of proof -------------
% 0.90/1.11
% 0.90/1.11
% 0.90/1.11 Search stopped by max_proofs option.
% 0.90/1.11
% 0.90/1.11
% 0.90/1.11 Search stopped by max_proofs option.
% 0.90/1.11
% 0.90/1.11 ============ end of search ============
% 0.90/1.11
% 0.90/1.11 ----------- soft-scott stats ----------
% 0.90/1.11
% 0.90/1.11 true clauses given 2 (14.3%)
% 0.90/1.11 false clauses given 12
% 0.90/1.11
% 0.90/1.11 FALSE TRUE
% 0.90/1.11 3 0 1
% 0.90/1.11 5 1 0
% 0.90/1.11 7 5 9
% 0.90/1.11 8 4 6
% 0.90/1.11 9 1 0
% 0.90/1.11 11 2 3
% 0.90/1.11 12 0 2
% 0.90/1.11 13 1 0
% 0.90/1.11 tot: 14 21 (60.0% true)
% 0.90/1.11
% 0.90/1.11
% 0.90/1.11 Model 11 [ 4 -6 65 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.11
% 0.90/1.11 That finishes the proof of the theorem.
% 0.90/1.11
% 0.90/1.11 Process 8962 finished Wed Jul 6 03:26:00 2022
%------------------------------------------------------------------------------