TSTP Solution File: SET766+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET766+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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 : Tue Jul 19 05:20:31 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET766+4 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n018.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 : Sun Jul 10 08:00:12 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 sandbox on n018.cluster.edu,
% 0.13/0.36 Sun Jul 10 08:00:12 2022
% 0.13/0.36 The command was "./sos". The process ID is 23647.
% 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=7.
% 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 147 during input processing: 0 [copy,147,flip.1] {-} A=A.
% 0.13/0.36 147 back subsumes 113.
% 0.13/0.36 147 back subsumes 108.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Failed to model usable list: disabling FINDER
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 -------------- Softie stats --------------
% 0.20/0.45
% 0.20/0.45 UPDATE_STOP: 300
% 0.20/0.45 SFINDER_TIME_LIMIT: 2
% 0.20/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.45 number of clauses in intial UL: 106
% 0.20/0.45 number of clauses initially in problem: 139
% 0.20/0.45 percentage of clauses intially in UL: 76
% 0.20/0.45 percentage of distinct symbols occuring in initial UL: 90
% 0.20/0.45 percent of all initial clauses that are short: 100
% 0.20/0.45 absolute distinct symbol count: 42
% 0.20/0.45 distinct predicate count: 9
% 0.20/0.45 distinct function count: 29
% 0.20/0.45 distinct constant count: 4
% 0.20/0.45
% 0.20/0.45 ---------- no more Softie stats ----------
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 =========== start of search ===========
% 0.20/0.49
% 0.20/0.49 -------- PROOF --------
% 0.20/0.49 % SZS status Theorem
% 0.20/0.49 % SZS output start Refutation
% 0.20/0.49
% 0.20/0.49 ----> UNIT CONFLICT at 0.10 sec ----> 517 [binary,516.1,148.1] {-} $F.
% 0.20/0.49
% 0.20/0.49 Length of proof is 5. Level of proof is 4.
% 0.20/0.49
% 0.20/0.49 ---------------- PROOF ----------------
% 0.20/0.49 % SZS status Theorem
% 0.20/0.49 % SZS output start Refutation
% 0.20/0.49
% 0.20/0.49 53 [] {+} -equivalence(A,B)| -member(C,B)|apply(A,C,C).
% 0.20/0.49 91 [] {+} member(A,equivalence_class(B,C,D))| -member(A,C)| -apply(D,B,A).
% 0.20/0.49 101 [] {-} -member($c1,equivalence_class($c1,$c3,$c2)).
% 0.20/0.49 142 [] {-} equivalence($c2,$c3).
% 0.20/0.49 144,143 [copy,142,flip.1] {-} equivalence($c3,$c2).
% 0.20/0.49 145 [] {-} member($c1,$c3).
% 0.20/0.49 146 [copy,145,demod,144] {-} member($c1,$c2).
% 0.20/0.49 148 [back_demod,101,demod,144] {-} -member($c1,equivalence_class($c1,$c2,$c2)).
% 0.20/0.49 244 [hyper,146,53,143,demod,144] {-} apply($c2,$c1,$c1).
% 0.20/0.49 516 [hyper,244,91,146] {-} member($c1,equivalence_class($c1,$c2,$c2)).
% 0.20/0.49 517 [binary,516.1,148.1] {-} $F.
% 0.20/0.49
% 0.20/0.49 % SZS output end Refutation
% 0.20/0.49 ------------ end of proof -------------
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Search stopped by max_proofs option.
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Search stopped by max_proofs option.
% 0.20/0.49
% 0.20/0.49 ============ end of search ============
% 0.20/0.49
% 0.20/0.49 That finishes the proof of the theorem.
% 0.20/0.49
% 0.20/0.49 Process 23647 finished Sun Jul 10 08:00:12 2022
%------------------------------------------------------------------------------