TSTP Solution File: LAT385+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT385+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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 06:48:22 EDT 2022
% Result : Theorem 0.75s 1.00s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT385+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n008.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 : Wed Jun 29 17:38:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 ----- Otter 3.2, August 2001 -----
% 0.18/0.36 The process was started by sandbox on n008.cluster.edu,
% 0.18/0.36 Wed Jun 29 17:38:23 2022
% 0.18/0.36 The command was "./sos". The process ID is 13357.
% 0.18/0.36
% 0.18/0.36 set(prolog_style_variables).
% 0.18/0.36 set(auto).
% 0.18/0.36 dependent: set(auto1).
% 0.18/0.36 dependent: set(process_input).
% 0.18/0.36 dependent: clear(print_kept).
% 0.18/0.36 dependent: clear(print_new_demod).
% 0.18/0.36 dependent: clear(print_back_demod).
% 0.18/0.36 dependent: clear(print_back_sub).
% 0.18/0.36 dependent: set(control_memory).
% 0.18/0.36 dependent: assign(max_mem, 12000).
% 0.18/0.36 dependent: assign(pick_given_ratio, 4).
% 0.18/0.36 dependent: assign(stats_level, 1).
% 0.18/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.36 dependent: assign(sos_limit, 5000).
% 0.18/0.36 dependent: assign(max_weight, 60).
% 0.18/0.36 clear(print_given).
% 0.18/0.36
% 0.18/0.36 formula_list(usable).
% 0.18/0.36
% 0.18/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.18/0.36
% 0.18/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.36 clauses in usable.
% 0.18/0.36
% 0.18/0.36 dependent: set(knuth_bendix).
% 0.18/0.36 dependent: set(para_from).
% 0.18/0.36 dependent: set(para_into).
% 0.18/0.36 dependent: clear(para_from_right).
% 0.18/0.36 dependent: clear(para_into_right).
% 0.18/0.36 dependent: set(para_from_vars).
% 0.18/0.36 dependent: set(eq_units_both_ways).
% 0.18/0.36 dependent: set(dynamic_demod_all).
% 0.18/0.36 dependent: set(dynamic_demod).
% 0.18/0.36 dependent: set(order_eq).
% 0.18/0.36 dependent: set(back_demod).
% 0.18/0.36 dependent: set(lrpo).
% 0.18/0.36 dependent: set(hyper_res).
% 0.18/0.36 dependent: set(unit_deletion).
% 0.18/0.36 dependent: set(factor).
% 0.18/0.36
% 0.18/0.36 ------------> process usable:
% 0.18/0.36
% 0.18/0.36 ------------> process sos:
% 0.18/0.36 Following clause subsumed by 156 during input processing: 0 [copy,156,flip.1] {-} A=A.
% 0.18/0.36 156 back subsumes 125.
% 0.18/0.36 156 back subsumes 124.
% 0.18/0.36 156 back subsumes 123.
% 0.18/0.36
% 0.18/0.36 ======= end of input processing =======
% 0.75/0.99
% 0.75/0.99 Stopped by limit on insertions
% 0.75/0.99
% 0.75/0.99
% 0.75/0.99 Failed to model usable list: disabling FINDER
% 0.75/0.99
% 0.75/0.99
% 0.75/0.99
% 0.75/0.99 -------------- Softie stats --------------
% 0.75/0.99
% 0.75/0.99 UPDATE_STOP: 300
% 0.75/0.99 SFINDER_TIME_LIMIT: 2
% 0.75/0.99 SHORT_CLAUSE_CUTOFF: 4
% 0.75/0.99 number of clauses in intial UL: 125
% 0.75/0.99 number of clauses initially in problem: 147
% 0.75/0.99 percentage of clauses intially in UL: 85
% 0.75/0.99 percentage of distinct symbols occuring in initial UL: 95
% 0.75/0.99 percent of all initial clauses that are short: 100
% 0.75/0.99 absolute distinct symbol count: 45
% 0.75/0.99 distinct predicate count: 16
% 0.75/0.99 distinct function count: 24
% 0.75/0.99 distinct constant count: 5
% 0.75/0.99
% 0.75/0.99 ---------- no more Softie stats ----------
% 0.75/0.99
% 0.75/0.99
% 0.75/0.99
% 0.75/0.99 =========== start of search ===========
% 0.75/1.00
% 0.75/1.00 -------- PROOF --------
% 0.75/1.00 % SZS status Theorem
% 0.75/1.00 % SZS output start Refutation
% 0.75/1.00
% 0.75/1.00 ----> UNIT CONFLICT at 0.62 sec ----> 293 [binary,292.1,120.1] {-} $F.
% 0.75/1.00
% 0.75/1.00 Length of proof is 3. Level of proof is 3.
% 0.75/1.00
% 0.75/1.00 ---------------- PROOF ----------------
% 0.75/1.00 % SZS status Theorem
% 0.75/1.00 % SZS output start Refutation
% 0.75/1.00
% 0.75/1.00 58 [] {+} -aSet0(A)|aElementOf0($f12(A),A)|aInfimumOfIn0($f16(A),A,xU).
% 0.75/1.00 72 [] {+} -aSet0(A)| -aElementOf0($f12(A),xU)|aInfimumOfIn0($f16(A),A,xU).
% 0.75/1.00 101 [] {+} -aElementOf0(A,xP)|aElementOf0(A,xU).
% 0.75/1.00 120 [] {+} -aInfimumOfIn0(A,xP,xU).
% 0.75/1.00 152 [] {-} aSet0(xP).
% 0.75/1.00 222 [hyper,152,58,unit_del,120] {-} aElementOf0($f12(xP),xP).
% 0.75/1.00 257 [hyper,222,101] {-} aElementOf0($f12(xP),xU).
% 0.75/1.00 292 [hyper,257,72,152] {-} aInfimumOfIn0($f16(xP),xP,xU).
% 0.75/1.00 293 [binary,292.1,120.1] {-} $F.
% 0.75/1.00
% 0.75/1.00 % SZS output end Refutation
% 0.75/1.00 ------------ end of proof -------------
% 0.75/1.00
% 0.75/1.00
% 0.75/1.00 Search stopped by max_proofs option.
% 0.75/1.00
% 0.75/1.00
% 0.75/1.00 Search stopped by max_proofs option.
% 0.75/1.00
% 0.75/1.00 ============ end of search ============
% 0.75/1.00
% 0.75/1.00 That finishes the proof of the theorem.
% 0.75/1.00
% 0.75/1.00 Process 13357 finished Wed Jun 29 17:38:23 2022
%------------------------------------------------------------------------------