TSTP Solution File: SWV388+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV388+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV388+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n006.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 : Tue Jun 14 19:59:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n006.cluster.edu,
% 0.13/0.37 Tue Jun 14 19:59:56 2022
% 0.13/0.37 The command was "./sos". The process ID is 24801.
% 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 65 during input processing: 0 [copy,65,flip.1] {-} A=A.
% 0.13/0.37 Following clause subsumed by 51 during input processing: 0 [copy,66,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.20/0.49
% 0.20/0.49
% 0.20/0.49 Failed to model usable list: disabling FINDER
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 -------------- Softie stats --------------
% 0.20/0.49
% 0.20/0.49 UPDATE_STOP: 300
% 0.20/0.49 SFINDER_TIME_LIMIT: 2
% 0.20/0.49 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.49 number of clauses in intial UL: 34
% 0.20/0.49 number of clauses initially in problem: 64
% 0.20/0.49 percentage of clauses intially in UL: 53
% 0.20/0.49 percentage of distinct symbols occuring in initial UL: 83
% 0.20/0.49 percent of all initial clauses that are short: 100
% 0.20/0.49 absolute distinct symbol count: 31
% 0.20/0.49 distinct predicate count: 10
% 0.20/0.49 distinct function count: 15
% 0.20/0.49 distinct constant count: 6
% 0.20/0.49
% 0.20/0.49 ---------- no more Softie stats ----------
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 =========== start of search ===========
% 0.20/0.50
% 0.20/0.50 -------- PROOF --------
% 0.20/0.50 % SZS status Theorem
% 0.20/0.50 % SZS output start Refutation
% 0.20/0.50
% 0.20/0.50 ----> UNIT CONFLICT at 0.11 sec ----> 205 [binary,204.1,36.1] {-} $F.
% 0.20/0.50
% 0.20/0.50 Length of proof is 1. Level of proof is 1.
% 0.20/0.50
% 0.20/0.50 ---------------- PROOF ----------------
% 0.20/0.50 % SZS status Theorem
% 0.20/0.50 % SZS output start Refutation
% 0.20/0.50
% 0.20/0.50 35 [] {+} check_cpq(triple(A,B,C))| -check_cpq(findmin_cpq_eff(triple(A,B,C))).
% 0.20/0.50 36 [] {+} -check_cpq(triple($c3,$c2,$c1)).
% 0.20/0.50 63 [] {-} check_cpq(findmin_cpq_eff(triple($c3,$c2,$c1))).
% 0.20/0.50 204 [hyper,63,35] {-} check_cpq(triple($c3,$c2,$c1)).
% 0.20/0.50 205 [binary,204.1,36.1] {-} $F.
% 0.20/0.50
% 0.20/0.50 % SZS output end Refutation
% 0.20/0.50 ------------ end of proof -------------
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 Search stopped by max_proofs option.
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 Search stopped by max_proofs option.
% 0.20/0.50
% 0.20/0.50 ============ end of search ============
% 0.20/0.50
% 0.20/0.50 That finishes the proof of the theorem.
% 0.20/0.50
% 0.20/0.50 Process 24801 finished Tue Jun 14 19:59:56 2022
%------------------------------------------------------------------------------