TSTP Solution File: SET055-7 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET055-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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 : Tue Jul 19 05:14:59 EDT 2022
% Result : Unsatisfiable 2.73s 2.91s
% Output : Refutation 2.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET055-7 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n005.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 19:53:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 ----- Otter 3.2, August 2001 -----
% 0.12/0.37 The process was started by sandbox on n005.cluster.edu,
% 0.12/0.37 Sat Jul 9 19:53:22 2022
% 0.12/0.37 The command was "./sos". The process ID is 14279.
% 0.12/0.37
% 0.12/0.37 set(prolog_style_variables).
% 0.12/0.37 set(auto).
% 0.12/0.37 dependent: set(auto1).
% 0.12/0.37 dependent: set(process_input).
% 0.12/0.37 dependent: clear(print_kept).
% 0.12/0.37 dependent: clear(print_new_demod).
% 0.12/0.37 dependent: clear(print_back_demod).
% 0.12/0.37 dependent: clear(print_back_sub).
% 0.12/0.37 dependent: set(control_memory).
% 0.12/0.37 dependent: assign(max_mem, 12000).
% 0.12/0.37 dependent: assign(pick_given_ratio, 4).
% 0.12/0.37 dependent: assign(stats_level, 1).
% 0.12/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.37 dependent: assign(sos_limit, 5000).
% 0.12/0.37 dependent: assign(max_weight, 60).
% 0.12/0.37 clear(print_given).
% 0.12/0.37
% 0.12/0.37 list(usable).
% 0.12/0.37
% 0.12/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=5.
% 0.12/0.37
% 0.12/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.37 clauses in usable.
% 0.12/0.37
% 0.12/0.37 dependent: set(knuth_bendix).
% 0.12/0.37 dependent: set(para_from).
% 0.12/0.37 dependent: set(para_into).
% 0.12/0.37 dependent: clear(para_from_right).
% 0.12/0.37 dependent: clear(para_into_right).
% 0.12/0.37 dependent: set(para_from_vars).
% 0.12/0.37 dependent: set(eq_units_both_ways).
% 0.12/0.37 dependent: set(dynamic_demod_all).
% 0.12/0.37 dependent: set(dynamic_demod).
% 0.12/0.37 dependent: set(order_eq).
% 0.12/0.37 dependent: set(back_demod).
% 0.12/0.37 dependent: set(lrpo).
% 0.12/0.37 dependent: set(hyper_res).
% 0.12/0.37 dependent: set(unit_deletion).
% 0.12/0.37 dependent: set(factor).
% 0.12/0.37
% 0.12/0.37 There is a clause for symmetry of equality, so it is
% 0.12/0.37 assumed that equality is fully axiomatized; therefore,
% 0.12/0.37 paramodulation is disabled.
% 0.12/0.37
% 0.12/0.37 dependent: clear(para_from).
% 0.12/0.37 dependent: clear(para_into).
% 0.12/0.37
% 0.12/0.37 ------------> process usable:
% 0.12/0.37 Following clause subsumed by 132 during input processing: 0 [copy,132,flip.1] {-} -equalish(x,x).
% 0.12/0.37
% 0.12/0.37 ------------> process sos:
% 0.12/0.37
% 0.12/0.37 ======= end of input processing =======
% 0.75/1.01
% 0.75/1.01 Model 1 (0.00 seconds, 0 Inserts)
% 0.75/1.01
% 0.75/1.01 Stopped by limit on number of solutions
% 0.75/1.01
% 0.75/1.01
% 0.75/1.01 -------------- Softie stats --------------
% 0.75/1.01
% 0.75/1.01 UPDATE_STOP: 300
% 0.75/1.01 SFINDER_TIME_LIMIT: 2
% 0.75/1.01 SHORT_CLAUSE_CUTOFF: 4
% 0.75/1.01 number of clauses in intial UL: 116
% 0.75/1.01 number of clauses initially in problem: 192
% 0.75/1.01 percentage of clauses intially in UL: 60
% 0.75/1.01 percentage of distinct symbols occuring in initial UL: 9
% 0.75/1.01 percent of all initial clauses that are short: 100
% 0.75/1.01 absolute distinct symbol count: 450
% 0.75/1.01 distinct predicate count: 202
% 0.75/1.01 distinct function count: 88
% 0.75/1.01 distinct constant count: 160
% 0.75/1.01
% 0.75/1.01 ---------- no more Softie stats ----------
% 0.75/1.01
% 0.75/1.01
% 0.75/1.01
% 0.75/1.01 Stopped by limit on insertions
% 0.75/1.01
% 0.75/1.01 =========== start of search ===========
% 2.73/2.91
% 2.73/2.91 -------- PROOF --------
% 2.73/2.91 % SZS status Unsatisfiable
% 2.73/2.91 % SZS output start Refutation
% 2.73/2.91
% 2.73/2.91 Stopped by limit on insertions
% 2.73/2.91
% 2.73/2.91 Model 2 [ 2 2 5175 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91
% 2.73/2.91 Stopped by limit on insertions
% 2.73/2.91
% 2.73/2.91 Stopped by limit on insertions
% 2.73/2.91
% 2.73/2.91 Stopped by limit on insertions
% 2.73/2.91
% 2.73/2.91 ----> UNIT CONFLICT at 2.52 sec ----> 262 [binary,261.1,132.1] {-} $F.
% 2.73/2.91
% 2.73/2.91 Length of proof is 2. Level of proof is 2.
% 2.73/2.91
% 2.73/2.91 ---------------- PROOF ----------------
% 2.73/2.91 % SZS status Unsatisfiable
% 2.73/2.91 % SZS output start Refutation
% 2.73/2.91
% 2.73/2.91 72 [] {+} -subclass(A,B)| -subclass(B,A)|equalish(A,B).
% 2.73/2.91 132 [] {+} -equalish(x,x).
% 2.73/2.91 133 [factor,72.1.2] {+} -subclass(A,A)|equalish(A,A).
% 2.73/2.91 207 [] {-} subclass(A,A).
% 2.73/2.91 261 [hyper,207,133] {-} equalish(A,A).
% 2.73/2.91 262 [binary,261.1,132.1] {-} $F.
% 2.73/2.91
% 2.73/2.91 % SZS output end Refutation
% 2.73/2.91 ------------ end of proof -------------
% 2.73/2.91
% 2.73/2.91
% 2.73/2.91 Search stopped by max_proofs option.
% 2.73/2.91
% 2.73/2.91
% 2.73/2.91 Search stopped by max_proofs option.
% 2.73/2.91
% 2.73/2.91 ============ end of search ============
% 2.73/2.91
% 2.73/2.91 ----------- soft-scott stats ----------
% 2.73/2.91
% 2.73/2.91 true clauses given 1 (14.3%)
% 2.73/2.91 false clauses given 6
% 2.73/2.91
% 2.73/2.91 FALSE TRUE
% 2.73/2.91 3 1 1
% 2.73/2.91 5 3 5
% 2.73/2.91 6 1 0
% 2.73/2.91 7 3 3
% 2.73/2.91 8 11 3
% 2.73/2.91 9 5 2
% 2.73/2.91 10 4 4
% 2.73/2.91 11 3 2
% 2.73/2.91 12 2 2
% 2.73/2.91 13 5 0
% 2.73/2.91 14 3 6
% 2.73/2.91 15 1 0
% 2.73/2.91 16 2 1
% 2.73/2.91 17 0 1
% 2.73/2.91 19 0 1
% 2.73/2.91 22 1 0
% 2.73/2.91 23 1 0
% 2.73/2.91 24 1 0
% 2.73/2.91 tot: 47 31 (39.7% true)
% 2.73/2.91
% 2.73/2.91
% 2.73/2.91 Model 2 [ 2 -186 5175 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91
% 2.73/2.91 That finishes the proof of the theorem.
% 2.73/2.91
% 2.73/2.91 Process 14279 finished Sat Jul 9 19:53:24 2022
%------------------------------------------------------------------------------