TSTP Solution File: SWV366+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV366+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:13 EDT 2022
% Result : Theorem 0.45s 0.68s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV366+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 04:50:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n017.cluster.edu,
% 0.13/0.37 Wed Jun 15 04:50:54 2022
% 0.13/0.37 The command was "./sos". The process ID is 16976.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 74 during input processing: 0 [copy,74,flip.1] {-} insert_pq(insert_pq(A,B),C)=insert_pq(insert_pq(A,C),B).
% 0.13/0.37 Following clause subsumed by 101 during input processing: 0 [copy,101,flip.1] {-} i(triple(A,$c7,B))=i(triple(C,$c7,D)).
% 0.13/0.37 Following clause subsumed by 102 during input processing: 0 [copy,102,flip.1] {-} A=A.
% 0.13/0.37 Following clause subsumed by 85 during input processing: 0 [copy,103,flip.1] {-} insert_cpq(triple(A,B,C),D)=triple(insert_pqp(A,D),insert_slb(B,pair(D,bottom)),C).
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Failed to model usable list: disabling FINDER
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 -------------- Softie stats --------------
% 0.19/0.45
% 0.19/0.45 UPDATE_STOP: 300
% 0.19/0.45 SFINDER_TIME_LIMIT: 2
% 0.19/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.45 number of clauses in intial UL: 62
% 0.19/0.45 number of clauses initially in problem: 101
% 0.19/0.45 percentage of clauses intially in UL: 61
% 0.19/0.45 percentage of distinct symbols occuring in initial UL: 80
% 0.19/0.45 percent of all initial clauses that are short: 100
% 0.19/0.45 absolute distinct symbol count: 56
% 0.19/0.45 distinct predicate count: 20
% 0.19/0.45 distinct function count: 26
% 0.19/0.45 distinct constant count: 10
% 0.19/0.45
% 0.19/0.45 ---------- no more Softie stats ----------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 =========== start of search ===========
% 0.45/0.68
% 0.45/0.68 -------- PROOF --------
% 0.45/0.68 % SZS status Theorem
% 0.45/0.68 % SZS output start Refutation
% 0.45/0.68
% 0.45/0.68 ----> UNIT CONFLICT at 0.29 sec ----> 3377 [binary,3376.1,102.1] {-} $F.
% 0.45/0.68
% 0.45/0.68 Length of proof is 2. Level of proof is 2.
% 0.45/0.68
% 0.45/0.68 ---------------- PROOF ----------------
% 0.45/0.68 % SZS status Theorem
% 0.45/0.68 % SZS output start Refutation
% 0.45/0.68
% 0.45/0.68 65 [] {-} i(triple($c6,insert_slb($c7,pair($c2,$c1)),$c4))!=i(triple($c5,insert_slb($c7,pair($c2,$c1)),$c3)).
% 0.45/0.68 100,99 [] {-} i(triple(A,insert_slb(B,pair(C,D)),E))=insert_pq(i(triple(A,B,E)),C).
% 0.45/0.68 101 [] {-} i(triple(A,$c7,B))=i(triple(C,$c7,D)).
% 0.45/0.68 102 [] {-} A=A.
% 0.45/0.68 105 [back_demod,65,demod,100,100] {-} insert_pq(i(triple($c6,$c7,$c4)),$c2)!=insert_pq(i(triple($c5,$c7,$c3)),$c2).
% 0.45/0.68 3376 [para_into,105.1.1.1,101.1.1] {-} insert_pq(i(triple(A,$c7,B)),$c2)!=insert_pq(i(triple($c5,$c7,$c3)),$c2).
% 0.45/0.68 3377 [binary,3376.1,102.1] {-} $F.
% 0.45/0.68
% 0.45/0.68 % SZS output end Refutation
% 0.45/0.68 ------------ end of proof -------------
% 0.45/0.68
% 0.45/0.68
% 0.45/0.68 Search stopped by max_proofs option.
% 0.45/0.68
% 0.45/0.68
% 0.45/0.68 Search stopped by max_proofs option.
% 0.45/0.68
% 0.45/0.68 ============ end of search ============
% 0.45/0.68
% 0.45/0.68 That finishes the proof of the theorem.
% 0.45/0.68
% 0.45/0.68 Process 16976 finished Wed Jun 15 04:50:55 2022
%------------------------------------------------------------------------------