TSTP Solution File: MSC008-2.002 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MSC008-2.002 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 22:59:15 EDT 2022
% Result : Unsatisfiable 1.51s 1.72s
% Output : Refutation 1.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MSC008-2.002 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 1 16:22:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n026.cluster.edu,
% 0.14/0.36 Fri Jul 1 16:22:34 2022
% 0.14/0.36 The command was "./sos". The process ID is 24351.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=6.
% 0.14/0.36
% 0.14/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36 clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36
% 0.14/0.36 There is a clause for symmetry of equality, so it is
% 0.14/0.36 assumed that equality is fully axiomatized; therefore,
% 0.14/0.36 paramodulation is disabled.
% 0.14/0.36
% 0.14/0.36 dependent: clear(para_from).
% 0.14/0.36 dependent: clear(para_into).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} eq(A,A).
% 0.14/0.36 18 back subsumes 16.
% 0.14/0.36 18 back subsumes 15.
% 0.14/0.36 18 back subsumes 14.
% 0.14/0.36 18 back subsumes 13.
% 0.14/0.36 18 back subsumes 12.
% 0.14/0.36 18 back subsumes 11.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.21/0.40
% 0.21/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.40
% 0.21/0.40 Stopped by limit on number of solutions
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40 -------------- Softie stats --------------
% 0.21/0.40
% 0.21/0.40 UPDATE_STOP: 300
% 0.21/0.40 SFINDER_TIME_LIMIT: 2
% 0.21/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.40 number of clauses in intial UL: 10
% 0.21/0.40 number of clauses initially in problem: 17
% 0.21/0.40 percentage of clauses intially in UL: 58
% 0.21/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.40 percent of all initial clauses that are short: 100
% 0.21/0.40 absolute distinct symbol count: 5
% 0.21/0.40 distinct predicate count: 3
% 0.21/0.40 distinct function count: 0
% 0.21/0.40 distinct constant count: 2
% 0.21/0.40
% 0.21/0.40 ---------- no more Softie stats ----------
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.40
% 0.21/0.40 Stopped by limit on number of solutions
% 0.21/0.40
% 0.21/0.40 =========== start of search ===========
% 1.51/1.72
% 1.51/1.72 -------- PROOF --------
% 1.51/1.72 % SZS status Unsatisfiable
% 1.51/1.72 % SZS output start Refutation
% 1.51/1.72
% 1.51/1.72 Model 3 (0.00 seconds, 0 Inserts)
% 1.51/1.72
% 1.51/1.72 Stopped by limit on number of solutions
% 1.51/1.72
% 1.51/1.72 Stopped by limit on insertions
% 1.51/1.72
% 1.51/1.72 Model 4 [ 2 1 523 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.72
% 1.51/1.72 Stopped by limit on insertions
% 1.51/1.72
% 1.51/1.72 Model 5 [ 4 1 311 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.72
% 1.51/1.72 Stopped by limit on insertions
% 1.51/1.72
% 1.51/1.72 Model 6 [ 12 25 203733 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.72
% 1.51/1.72 Stopped by limit on insertions
% 1.51/1.72
% 1.51/1.72 Model 7 [ 9 23 183006 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.72
% 1.51/1.72 Stopped by limit on insertions
% 1.51/1.72
% 1.51/1.72 Model 8 [ 9 9 137353 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.72
% 1.51/1.72 ----> UNIT CONFLICT at 1.33 sec ----> 985 [binary,984.1,2.1] {-} $F.
% 1.51/1.72
% 1.51/1.72 Length of proof is 6. Level of proof is 5.
% 1.51/1.72
% 1.51/1.72 ---------------- PROOF ----------------
% 1.51/1.72 % SZS status Unsatisfiable
% 1.51/1.72 % SZS output start Refutation
% 1.51/1.72
% 1.51/1.72 1 [] {-} -eq(p1,p2).
% 1.51/1.72 2 [copy,1,flip.1] {+} -eq(p2,p1).
% 1.51/1.72 4 [] {+} -latin(A,B,C)| -latin(A,B,D)|eq(D,C).
% 1.51/1.72 7 [] {+} -greek(A,B,C)| -greek(A,B,D)|eq(D,C).
% 1.51/1.72 10 [] {+} -greek(A,B,C)| -latin(A,B,D)| -greek(E,F,C)| -latin(E,F,D)|eq(F,B)|eq(E,A).
% 1.51/1.72 17 [factor,10.5.6] {+} -greek(A,A,B)| -latin(A,A,C)| -greek(D,D,B)| -latin(D,D,C)|eq(D,A).
% 1.51/1.72 20 [] {+} latin(A,p1,B)|latin(A,p2,B).
% 1.51/1.72 21 [] {+} latin(p1,A,B)|latin(p2,A,B).
% 1.51/1.72 23 [] {+} greek(A,p1,B)|greek(A,p2,B).
% 1.51/1.72 24 [] {+} greek(p1,A,B)|greek(p2,A,B).
% 1.51/1.72 506 [hyper,24,17,23,21,20,unit_del,2,factor_simp,factor_simp] {-} greek(p2,p1,A)|latin(p1,p2,B).
% 1.51/1.72 874 [hyper,506,4,506,factor_simp] {-} greek(p2,p1,A)|eq(B,C).
% 1.51/1.72 875 [hyper,874,2] {-} greek(p2,p1,A).
% 1.51/1.72 984 [hyper,875,7,875] {-} eq(A,B).
% 1.51/1.72 985 [binary,984.1,2.1] {-} $F.
% 1.51/1.72
% 1.51/1.72 % SZS output end Refutation
% 1.51/1.72 ------------ end of proof -------------
% 1.51/1.72
% 1.51/1.72
% 1.51/1.72 Search stopped by max_proofs option.
% 1.51/1.72
% 1.51/1.72
% 1.51/1.72 Search stopped by max_proofs option.
% 1.51/1.72
% 1.51/1.72 ============ end of search ============
% 1.51/1.72
% 1.51/1.72 ----------- soft-scott stats ----------
% 1.51/1.72
% 1.51/1.72 true clauses given 0 (0.0%)
% 1.51/1.72 false clauses given 10
% 1.51/1.72
% 1.51/1.72 FALSE TRUE
% 1.51/1.72 8 6 0
% 1.51/1.72 11 60 78
% 1.51/1.72 12 5 5
% 1.51/1.72 19 77 43
% 1.51/1.72 22 138 130
% 1.51/1.72 tot: 286 256 (47.2% true)
% 1.51/1.72
% 1.51/1.72
% 1.51/1.72 Model 8 [ 9 -21 137353 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.72
% 1.51/1.72 That finishes the proof of the theorem.
% 1.51/1.72
% 1.51/1.72 Process 24351 finished Fri Jul 1 16:22:36 2022
%------------------------------------------------------------------------------