TSTP Solution File: SWV411+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:22 EDT 2022
% Result : Theorem 0.86s 1.04s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.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 23:34:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.36 Wed Jun 15 23:34:37 2022
% 0.13/0.36 The command was "./sos". The process ID is 5015.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.79/1.03
% 0.79/1.03 Stopped by limit on insertions
% 0.79/1.03
% 0.79/1.03
% 0.79/1.03 Failed to model usable list: disabling FINDER
% 0.79/1.03
% 0.79/1.03
% 0.79/1.03
% 0.79/1.03 -------------- Softie stats --------------
% 0.79/1.03
% 0.79/1.03 UPDATE_STOP: 300
% 0.79/1.03 SFINDER_TIME_LIMIT: 2
% 0.79/1.03 SHORT_CLAUSE_CUTOFF: 4
% 0.79/1.03 number of clauses in intial UL: 21
% 0.79/1.03 number of clauses initially in problem: 33
% 0.79/1.03 percentage of clauses intially in UL: 63
% 0.79/1.03 percentage of distinct symbols occuring in initial UL: 94
% 0.79/1.03 percent of all initial clauses that are short: 100
% 0.79/1.03 absolute distinct symbol count: 18
% 0.79/1.03 distinct predicate count: 6
% 0.79/1.03 distinct function count: 6
% 0.79/1.03 distinct constant count: 6
% 0.79/1.03
% 0.79/1.03 ---------- no more Softie stats ----------
% 0.79/1.03
% 0.79/1.03
% 0.79/1.03
% 0.79/1.03 =========== start of search ===========
% 0.86/1.04
% 0.86/1.04 -------- PROOF --------
% 0.86/1.04 % SZS status Theorem
% 0.86/1.04 % SZS output start Refutation
% 0.86/1.04
% 0.86/1.04 ----> UNIT CONFLICT at 0.65 sec ----> 355 [binary,354.1,20.1] {-} $F.
% 0.86/1.04
% 0.86/1.04 Length of proof is 6. Level of proof is 5.
% 0.86/1.04
% 0.86/1.04 ---------------- PROOF ----------------
% 0.86/1.04 % SZS status Theorem
% 0.86/1.04 % SZS output start Refutation
% 0.86/1.04
% 0.86/1.04 7 [] {+} -contains_slb(insert_slb(A,pair(B,C)),D)|contains_slb(A,D)|B=D.
% 0.86/1.04 13 [] {+} pair_in_list(insert_slb(A,pair(B,C)),D,E)| -pair_in_list(A,D,E).
% 0.86/1.04 14 [] {+} pair_in_list(insert_slb(A,pair(B,C)),D,E)|B!=D|C!=E.
% 0.86/1.04 19 [] {+} -contains_slb($c4,A)|pair_in_list($c4,A,$f1(A)).
% 0.86/1.04 20 [] {+} -pair_in_list(insert_slb($c4,pair($c2,$c1)),$c3,A).
% 0.86/1.04 32 [] {-} contains_slb(insert_slb($c4,pair($c2,$c1)),$c3).
% 0.86/1.04 33 [] {-} A=A.
% 0.86/1.04 47 [hyper,33,14,33] {-} pair_in_list(insert_slb(A,pair(B,C)),B,C).
% 0.86/1.04 73 [hyper,32,7,flip.2] {-} contains_slb($c4,$c3)|$c3=$c2.
% 0.86/1.04 130 [para_from,73.2.1,20.1.2] {-} -pair_in_list(insert_slb($c4,pair($c2,$c1)),$c2,A)|contains_slb($c4,$c3).
% 0.86/1.04 327 [hyper,130,47] {-} contains_slb($c4,$c3).
% 0.86/1.04 328 [hyper,327,19] {-} pair_in_list($c4,$c3,$f1($c3)).
% 0.86/1.04 354 [hyper,328,13] {-} pair_in_list(insert_slb($c4,pair(A,B)),$c3,$f1($c3)).
% 0.86/1.04 355 [binary,354.1,20.1] {-} $F.
% 0.86/1.04
% 0.86/1.04 % SZS output end Refutation
% 0.86/1.04 ------------ end of proof -------------
% 0.86/1.04
% 0.86/1.04
% 0.86/1.04 Search stopped by max_proofs option.
% 0.86/1.04
% 0.86/1.04
% 0.86/1.04 Search stopped by max_proofs option.
% 0.86/1.04
% 0.86/1.04 ============ end of search ============
% 0.86/1.04
% 0.86/1.04 That finishes the proof of the theorem.
% 0.86/1.04
% 0.86/1.04 Process 5015 finished Wed Jun 15 23:34:38 2022
%------------------------------------------------------------------------------