TSTP Solution File: SET062+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET062+3 : TPTP v8.1.0. Released v2.2.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 : Tue Jul 19 05:15:07 EDT 2022
% Result : Theorem 0.18s 0.39s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET062+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 12:30:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n026.cluster.edu,
% 0.12/0.34 Sun Jul 10 12:30:41 2022
% 0.12/0.34 The command was "./sos". The process ID is 19360.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 formula_list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This is a non-Horn set without equality. The strategy
% 0.12/0.34 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.34 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: set(factor).
% 0.12/0.34 dependent: set(unit_deletion).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 5
% 0.18/0.39 number of clauses initially in problem: 8
% 0.18/0.39 percentage of clauses intially in UL: 62
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 85
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 7
% 0.18/0.39 distinct predicate count: 3
% 0.18/0.39 distinct function count: 2
% 0.18/0.39 distinct constant count: 2
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 0.18/0.39
% 0.18/0.39 -------- PROOF --------
% 0.18/0.39 % SZS status Theorem
% 0.18/0.39 % SZS output start Refutation
% 0.18/0.39
% 0.18/0.39 ----> UNIT CONFLICT at 0.01 sec ----> 10 [binary,9.1,1.1] {-} $F.
% 0.18/0.39
% 0.18/0.39 Length of proof is 1. Level of proof is 1.
% 0.18/0.39
% 0.18/0.39 ---------------- PROOF ----------------
% 0.18/0.39 % SZS status Theorem
% 0.18/0.39 % SZS output start Refutation
% 0.18/0.39
% 0.18/0.39 1 [] {+} -member(A,empty_set).
% 0.18/0.39 5 [] {+} -subset(empty_set,$c1).
% 0.18/0.39 6 [] {-} subset(A,B)|member($f1(A,B),A).
% 0.18/0.39 9 [hyper,6,5] {-} member($f1(empty_set,$c1),empty_set).
% 0.18/0.39 10 [binary,9.1,1.1] {-} $F.
% 0.18/0.39
% 0.18/0.39 % SZS output end Refutation
% 0.18/0.39 ------------ end of proof -------------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Search stopped by max_proofs option.
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Search stopped by max_proofs option.
% 0.18/0.39
% 0.18/0.39 ============ end of search ============
% 0.18/0.39
% 0.18/0.39 ----------- soft-scott stats ----------
% 0.18/0.39
% 0.18/0.39 true clauses given 0 (0.0%)
% 0.18/0.39 false clauses given 1
% 0.18/0.39
% 0.18/0.39 FALSE TRUE
% 0.18/0.39 3 1 0
% 0.18/0.39 6 1 0
% 0.18/0.39 tot: 2 0 (0.0% true)
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 That finishes the proof of the theorem.
% 0.18/0.39
% 0.18/0.39 Process 19360 finished Sun Jul 10 12:30:41 2022
%------------------------------------------------------------------------------