TSTP Solution File: SEU150+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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 14:27:10 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 11:54:00 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n028.cluster.edu,
% 0.13/0.35 Sun Jun 19 11:54:00 2022
% 0.13/0.35 The command was "./sos". The process ID is 28778.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.13/0.35
% 0.13/0.35 This is a Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35 sos and nonpositive clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.13/0.35 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 2
% 0.20/0.38 number of clauses initially in problem: 6
% 0.20/0.38 percentage of clauses intially in UL: 33
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 83
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 6
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 2
% 0.20/0.38 distinct constant count: 3
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 0.20/0.38
% 0.20/0.38 -------- PROOF --------
% 0.20/0.38 % SZS status Theorem
% 0.20/0.38 % SZS output start Refutation
% 0.20/0.38
% 0.20/0.38 ----> UNIT CONFLICT at 0.00 sec ----> 17 [binary,15.1,2.1] {+} $F.
% 0.20/0.38
% 0.20/0.38 Length of proof is 3. Level of proof is 3.
% 0.20/0.38
% 0.20/0.38 ---------------- PROOF ----------------
% 0.20/0.38 % SZS status Theorem
% 0.20/0.38 % SZS output start Refutation
% 0.20/0.38
% 0.20/0.38 1 [] {+} singleton(A)!=unordered_pair(B,C)|A=B.
% 0.20/0.38 2 [] {+} $c2!=$c1.
% 0.20/0.38 3 [] {+} unordered_pair(A,B)=unordered_pair(B,A).
% 0.20/0.38 4 [] {-} singleton($c3)=unordered_pair($c2,$c1).
% 0.20/0.38 9,8 [hyper,4,1] {+} $c3=$c2.
% 0.20/0.38 12 [para_from,4.1.1,1.1.1,demod,9] {-} unordered_pair($c2,$c1)!=unordered_pair(A,B)|$c2=A.
% 0.20/0.38 15 [hyper,12,3] {-} $c2=$c1.
% 0.20/0.38 17 [binary,15.1,2.1] {+} $F.
% 0.20/0.38
% 0.20/0.38 % SZS output end Refutation
% 0.20/0.38 ------------ end of proof -------------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 Search stopped by max_proofs option.
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 Search stopped by max_proofs option.
% 0.20/0.38
% 0.20/0.38 ============ end of search ============
% 0.20/0.38
% 0.20/0.38 ----------- soft-scott stats ----------
% 0.20/0.38
% 0.20/0.38 true clauses given 1 (25.0%)
% 0.20/0.38 false clauses given 3
% 0.20/0.38
% 0.20/0.38 FALSE TRUE
% 0.20/0.38 3 0 2
% 0.20/0.38 13 1 2
% 0.20/0.38 tot: 1 4 (80.0% true)
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 That finishes the proof of the theorem.
% 0.20/0.38
% 0.20/0.38 Process 28778 finished Sun Jun 19 11:54:00 2022
%------------------------------------------------------------------------------