TSTP Solution File: SEU264+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU264+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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 14:28:16 EDT 2022
% Result : Theorem 1.68s 1.92s
% Output : Refutation 1.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU264+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 17:06:14 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n015.cluster.edu,
% 0.14/0.38 Sun Jun 19 17:06:14 2022
% 0.14/0.38 The command was "./sos". The process ID is 11453.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 formula_list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.38
% 0.14/0.38 This is a Horn set without equality. The strategy will
% 0.14/0.38 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.38 in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: clear(order_hyper).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.21/0.42
% 0.21/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 -------------- Softie stats --------------
% 0.21/0.42
% 0.21/0.42 UPDATE_STOP: 300
% 0.21/0.42 SFINDER_TIME_LIMIT: 2
% 0.21/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.42 number of clauses in intial UL: 11
% 0.21/0.42 number of clauses initially in problem: 17
% 0.21/0.42 percentage of clauses intially in UL: 64
% 0.21/0.42 percentage of distinct symbols occuring in initial UL: 75
% 0.21/0.42 percent of all initial clauses that are short: 100
% 0.21/0.42 absolute distinct symbol count: 16
% 0.21/0.42 distinct predicate count: 5
% 0.21/0.42 distinct function count: 7
% 0.21/0.42 distinct constant count: 4
% 0.21/0.42
% 0.21/0.42 ---------- no more Softie stats ----------
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42 =========== start of search ===========
% 1.68/1.92
% 1.68/1.92 -------- PROOF --------
% 1.68/1.92 % SZS status Theorem
% 1.68/1.92 % SZS output start Refutation
% 1.68/1.92
% 1.68/1.92 Model 3 (0.00 seconds, 0 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on number of solutions
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 4 [ 1 5 11938 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Model 5 (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on number of solutions
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 6 [ 5 1 546 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 7 [ 1 1 1099 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 8 [ 16 0 1621 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 9 [ 7 1 659 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 10 [ 16 1 9199 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 11 [ 15 1 2419 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 12 [ 6 3 26380 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 13 [ 24 1 553 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 14 [ 26 1 500 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 15 [ 17 1 950 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 16 [ 23 0 396 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 Stopped by limit on insertions
% 1.68/1.92
% 1.68/1.92 Model 17 [ 3 1 531 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 ----> UNIT CONFLICT at 1.52 sec ----> 50 [binary,49.1,8.1] {+} $F.
% 1.68/1.92
% 1.68/1.92 Length of proof is 4. Level of proof is 3.
% 1.68/1.92
% 1.68/1.92 ---------------- PROOF ----------------
% 1.68/1.92 % SZS status Theorem
% 1.68/1.92 % SZS output start Refutation
% 1.68/1.92
% 1.68/1.92 6 [] {+} -relation_of2_as_subset(A,B,C)|subset(relation_rng(A),C).
% 1.68/1.92 7 [] {+} -relation_of2_as_subset(A,B,C)| -subset(relation_rng(A),D)|relation_of2_as_subset(A,B,D).
% 1.68/1.92 8 [] {+} -relation_of2_as_subset($c1,$c2,$c3).
% 1.68/1.92 9 [] {+} -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.68/1.92 15 [] {+} subset(A,A).
% 1.68/1.92 16 [] {+} relation_of2_as_subset($c1,$c2,$c4).
% 1.68/1.92 17 [] {+} subset($c4,$c3).
% 1.68/1.92 22 [hyper,16,7,15] {+} relation_of2_as_subset($c1,$c2,relation_rng($c1)).
% 1.68/1.92 23 [hyper,16,6] {+} subset(relation_rng($c1),$c4).
% 1.68/1.92 34 [hyper,23,9,17] {+} subset(relation_rng($c1),$c3).
% 1.68/1.92 49 [hyper,34,7,22] {-} relation_of2_as_subset($c1,$c2,$c3).
% 1.68/1.92 50 [binary,49.1,8.1] {+} $F.
% 1.68/1.92
% 1.68/1.92 % SZS output end Refutation
% 1.68/1.92 ------------ end of proof -------------
% 1.68/1.92
% 1.68/1.92
% 1.68/1.92 Search stopped by max_proofs option.
% 1.68/1.92
% 1.68/1.92
% 1.68/1.92 Search stopped by max_proofs option.
% 1.68/1.92
% 1.68/1.92 ============ end of search ============
% 1.68/1.92
% 1.68/1.92 ----------- soft-scott stats ----------
% 1.68/1.92
% 1.68/1.92 true clauses given 1 (5.9%)
% 1.68/1.92 false clauses given 16
% 1.68/1.92
% 1.68/1.92 FALSE TRUE
% 1.68/1.92 5 1 3
% 1.68/1.92 6 0 8
% 1.68/1.92 7 0 2
% 1.68/1.92 8 0 2
% 1.68/1.92 9 0 2
% 1.68/1.92 tot: 1 17 (94.4% true)
% 1.68/1.92
% 1.68/1.92
% 1.68/1.92 Model 17 [ 3 1 531 ] (0.00 seconds, 250000 Inserts)
% 1.68/1.92
% 1.68/1.92 That finishes the proof of the theorem.
% 1.68/1.92
% 1.68/1.92 Process 11453 finished Sun Jun 19 17:06:16 2022
%------------------------------------------------------------------------------