TSTP Solution File: SET080-7 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET080-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:28 EDT 2022
% Result : Unsatisfiable 2.20s 2.39s
% Output : Refutation 2.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET080-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n023.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 : Sat Jul 9 23:05:10 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n023.cluster.edu,
% 0.13/0.36 Sat Jul 9 23:05:10 2022
% 0.13/0.36 The command was "./sos". The process ID is 25089.
% 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 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 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 92 during input processing: 0 [demod,95] {-} member(unordered_pair(A,A),universal_class).
% 0.13/0.36 Following clause subsumed by 161 during input processing: 0 [copy,161,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [copy,173,flip.1] {-} A=A.
% 0.13/0.36 173 back subsumes 88.
% 0.13/0.36 173 back subsumes 80.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.60/0.78
% 0.60/0.78 Model 1 (0.00 seconds, 0 Inserts)
% 0.60/0.78
% 0.60/0.78 Stopped by limit on number of solutions
% 0.60/0.78
% 0.60/0.78
% 0.60/0.78 -------------- Softie stats --------------
% 0.60/0.78
% 0.60/0.78 UPDATE_STOP: 300
% 0.60/0.78 SFINDER_TIME_LIMIT: 2
% 0.60/0.78 SHORT_CLAUSE_CUTOFF: 4
% 0.60/0.78 number of clauses in intial UL: 66
% 0.60/0.78 number of clauses initially in problem: 150
% 0.60/0.78 percentage of clauses intially in UL: 44
% 0.60/0.78 percentage of distinct symbols occuring in initial UL: 62
% 0.60/0.78 percent of all initial clauses that are short: 100
% 0.60/0.78 absolute distinct symbol count: 48
% 0.60/0.78 distinct predicate count: 10
% 0.60/0.78 distinct function count: 30
% 0.60/0.78 distinct constant count: 8
% 0.60/0.78
% 0.60/0.78 ---------- no more Softie stats ----------
% 0.60/0.78
% 0.60/0.78
% 0.60/0.78
% 0.60/0.78 Stopped by limit on insertions
% 0.60/0.78
% 0.60/0.78 =========== start of search ===========
% 2.20/2.39
% 2.20/2.39 -------- PROOF --------
% 2.20/2.39 % SZS status Unsatisfiable
% 2.20/2.39 % SZS output start Refutation
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Model 2 [ 6 3 35666 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 ----> UNIT CONFLICT at 2.02 sec ----> 313 [binary,312.1,174.1] {+} $F.
% 2.20/2.39
% 2.20/2.39 Length of proof is 3. Level of proof is 2.
% 2.20/2.39
% 2.20/2.39 ---------------- PROOF ----------------
% 2.20/2.39 % SZS status Unsatisfiable
% 2.20/2.39 % SZS output start Refutation
% 2.20/2.39
% 2.20/2.39 8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 2.20/2.39 79 [] {-} -member(null_class,singleton(null_class)).
% 2.20/2.39 93 [] {-} unordered_pair(A,A)=singleton(A).
% 2.20/2.39 95,94 [copy,93,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 2.20/2.39 160 [] {-} member(null_class,universal_class).
% 2.20/2.39 174 [back_demod,79,demod,95] {+} -member(null_class,unordered_pair(null_class,null_class)).
% 2.20/2.39 312 [hyper,160,8] {-} member(null_class,unordered_pair(A,null_class)).
% 2.20/2.39 313 [binary,312.1,174.1] {+} $F.
% 2.20/2.39
% 2.20/2.39 % SZS output end Refutation
% 2.20/2.39 ------------ end of proof -------------
% 2.20/2.39
% 2.20/2.39
% 2.20/2.39 Search stopped by max_proofs option.
% 2.20/2.39
% 2.20/2.39
% 2.20/2.39 Search stopped by max_proofs option.
% 2.20/2.39
% 2.20/2.39 ============ end of search ============
% 2.20/2.39
% 2.20/2.39 ----------- soft-scott stats ----------
% 2.20/2.39
% 2.20/2.39 true clauses given 0 (0.0%)
% 2.20/2.39 false clauses given 8
% 2.20/2.39
% 2.20/2.39 FALSE TRUE
% 2.20/2.39 3 1 3
% 2.20/2.39 5 0 11
% 2.20/2.39 6 1 3
% 2.20/2.39 7 3 9
% 2.20/2.39 8 8 17
% 2.20/2.39 9 7 1
% 2.20/2.39 10 8 8
% 2.20/2.39 11 4 11
% 2.20/2.39 12 2 8
% 2.20/2.39 13 6 10
% 2.20/2.39 14 3 2
% 2.20/2.39 15 0 5
% 2.20/2.39 16 3 4
% 2.20/2.39 17 1 7
% 2.20/2.39 18 0 2
% 2.20/2.39 19 0 4
% 2.20/2.39 20 0 2
% 2.20/2.39 21 0 1
% 2.20/2.39 22 1 1
% 2.20/2.39 23 1 0
% 2.20/2.39 24 1 3
% 2.20/2.39 tot: 50 112 (69.1% true)
% 2.20/2.39
% 2.20/2.39
% 2.20/2.39 Model 2 [ 6 -17 35666 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.39
% 2.20/2.39 That finishes the proof of the theorem.
% 2.20/2.39
% 2.20/2.39 Process 25089 finished Sat Jul 9 23:05:12 2022
%------------------------------------------------------------------------------