TSTP Solution File: SWV385+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV385+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:17 EDT 2022
% Result : Theorem 0.36s 0.59s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV385+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n022.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 : Tue Jun 14 18:54:48 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 n022.cluster.edu,
% 0.13/0.35 Tue Jun 14 18:54:48 2022
% 0.13/0.35 The command was "./sos". The process ID is 18250.
% 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=0, equality=1, symmetry=0, max_lits=4.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 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: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 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 66 during input processing: 0 [copy,66,flip.1] {-} A=A.
% 0.13/0.35 Following clause subsumed by 52 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.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.36/0.59
% 0.36/0.59 Stopped by limit on insertions
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59 Failed to model usable list: disabling FINDER
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59 -------------- Softie stats --------------
% 0.36/0.59
% 0.36/0.59 UPDATE_STOP: 300
% 0.36/0.59 SFINDER_TIME_LIMIT: 2
% 0.36/0.59 SHORT_CLAUSE_CUTOFF: 4
% 0.36/0.59 number of clauses in intial UL: 35
% 0.36/0.59 number of clauses initially in problem: 65
% 0.36/0.59 percentage of clauses intially in UL: 53
% 0.36/0.59 percentage of distinct symbols occuring in initial UL: 84
% 0.36/0.59 percent of all initial clauses that are short: 100
% 0.36/0.59 absolute distinct symbol count: 32
% 0.36/0.59 distinct predicate count: 10
% 0.36/0.59 distinct function count: 16
% 0.36/0.59 distinct constant count: 6
% 0.36/0.59
% 0.36/0.59 ---------- no more Softie stats ----------
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59 =========== start of search ===========
% 0.36/0.59
% 0.36/0.59 -------- PROOF --------
% 0.36/0.59 % SZS status Theorem
% 0.36/0.59 % SZS output start Refutation
% 0.36/0.59
% 0.36/0.59 -----> EMPTY CLAUSE at 0.20 sec ----> 322 [hyper,257,37,256] {-} $F.
% 0.36/0.59
% 0.36/0.59 Length of proof is 2. Level of proof is 1.
% 0.36/0.59
% 0.36/0.59 ---------------- PROOF ----------------
% 0.36/0.59 % SZS status Theorem
% 0.36/0.59 % SZS output start Refutation
% 0.36/0.59
% 0.36/0.59 35 [] {+} ok(triple(A,B,C))| -ok(im_succ_cpq(triple(A,B,C))).
% 0.36/0.59 36 [] {+} check_cpq(triple(A,B,C))| -check_cpq(im_succ_cpq(triple(A,B,C)))| -ok(im_succ_cpq(triple(A,B,C))).
% 0.36/0.59 37 [] {+} -check_cpq(triple($c3,$c2,$c1))| -ok(triple($c3,$c2,$c1)).
% 0.36/0.59 64 [] {-} check_cpq(im_succ_cpq(triple($c3,$c2,$c1))).
% 0.36/0.59 65 [] {-} ok(im_succ_cpq(triple($c3,$c2,$c1))).
% 0.36/0.59 256 [hyper,65,36,64] {-} check_cpq(triple($c3,$c2,$c1)).
% 0.36/0.59 257 [hyper,65,35] {-} ok(triple($c3,$c2,$c1)).
% 0.36/0.59 322 [hyper,257,37,256] {-} $F.
% 0.36/0.59
% 0.36/0.59 % SZS output end Refutation
% 0.36/0.59 ------------ end of proof -------------
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59 Search stopped by max_proofs option.
% 0.36/0.59
% 0.36/0.59
% 0.36/0.59 Search stopped by max_proofs option.
% 0.36/0.59
% 0.36/0.59 ============ end of search ============
% 0.36/0.59
% 0.36/0.59 That finishes the proof of the theorem.
% 0.36/0.59
% 0.36/0.59 Process 18250 finished Tue Jun 14 18:54:48 2022
%------------------------------------------------------------------------------