TSTP Solution File: SWV373+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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 : Wed Jul 20 21:38:14 EDT 2022
% Result : Theorem 0.45s 0.64s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 10:08:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox2 on n017.cluster.edu,
% 0.19/0.36 Wed Jun 15 10:08:40 2022
% 0.19/0.36 The command was "./sos". The process ID is 29054.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.19/0.36
% 0.19/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36 clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 66 during input processing: 0 [copy,66,flip.1] {-} A=A.
% 0.19/0.36 Following clause subsumed by 53 during input processing: 0 [copy,67,flip.1] {-} insert_cpq(triple(A,B,C),D)=triple(insert_pqp(A,D),insert_slb(B,pair(D,bottom)),C).
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 Failed to model usable list: disabling FINDER
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 -------------- Softie stats --------------
% 0.19/0.49
% 0.19/0.49 UPDATE_STOP: 300
% 0.19/0.49 SFINDER_TIME_LIMIT: 2
% 0.19/0.49 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.49 number of clauses in intial UL: 36
% 0.19/0.49 number of clauses initially in problem: 65
% 0.19/0.49 percentage of clauses intially in UL: 55
% 0.19/0.49 percentage of distinct symbols occuring in initial UL: 87
% 0.19/0.49 percent of all initial clauses that are short: 100
% 0.19/0.49 absolute distinct symbol count: 31
% 0.19/0.49 distinct predicate count: 10
% 0.19/0.49 distinct function count: 15
% 0.19/0.49 distinct constant count: 6
% 0.19/0.49
% 0.19/0.49 ---------- no more Softie stats ----------
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 =========== start of search ===========
% 0.45/0.64
% 0.45/0.64 -------- PROOF --------
% 0.45/0.64 % SZS status Theorem
% 0.45/0.64 % SZS output start Refutation
% 0.45/0.64
% 0.45/0.64 ----> UNIT CONFLICT at 0.25 sec ----> 2083 [binary,2082.1,206.1] {-} $F.
% 0.45/0.64
% 0.45/0.64 Length of proof is 4. Level of proof is 4.
% 0.45/0.64
% 0.45/0.64 ---------------- PROOF ----------------
% 0.45/0.64 % SZS status Theorem
% 0.45/0.64 % SZS output start Refutation
% 0.45/0.64
% 0.45/0.64 6 [] {+} -contains_slb(create_slb,A).
% 0.45/0.64 28 [] {+} contains_cpq(triple(A,B,C),D)| -contains_slb(B,D).
% 0.45/0.64 36 [] {+} -ok(findmin_cpq_eff(triple(A,B,C)))|contains_slb(B,findmin_pqp_res(A)).
% 0.45/0.64 38 [] {+} -contains_cpq(triple($c3,$c2,$c1),findmin_cpq_res(triple($c3,$c2,$c1))).
% 0.45/0.64 60 [] {-} A=create_slb|findmin_cpq_res(triple(B,A,C))=findmin_pqp_res(B).
% 0.45/0.64 65 [] {-} ok(findmin_cpq_eff(triple($c3,$c2,$c1))).
% 0.45/0.64 206 [hyper,65,36] {-} contains_slb($c2,findmin_pqp_res($c3)).
% 0.45/0.64 263 [hyper,206,28] {-} contains_cpq(triple(A,$c2,B),findmin_pqp_res($c3)).
% 0.45/0.64 1429,1428 [para_from,60.2.1,38.1.2,unit_del,263,flip.1] {-} create_slb=$c2.
% 0.45/0.64 2082 [back_demod,6,demod,1429] {-} -contains_slb($c2,A).
% 0.45/0.64 2083 [binary,2082.1,206.1] {-} $F.
% 0.45/0.64
% 0.45/0.64 % SZS output end Refutation
% 0.45/0.64 ------------ end of proof -------------
% 0.45/0.64
% 0.45/0.64
% 0.45/0.64 Search stopped by max_proofs option.
% 0.45/0.64
% 0.45/0.64
% 0.45/0.64 Search stopped by max_proofs option.
% 0.45/0.64
% 0.45/0.64 ============ end of search ============
% 0.45/0.64
% 0.45/0.64 That finishes the proof of the theorem.
% 0.45/0.64
% 0.45/0.64 Process 29054 finished Wed Jun 15 10:08:40 2022
%------------------------------------------------------------------------------