TSTP Solution File: SEU275+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU275+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:21 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU275+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12 % Command : sos-script %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 03:13:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n020.cluster.edu,
% 0.12/0.36 Sun Jun 19 03:13:18 2022
% 0.12/0.36 The command was "./sos". The process ID is 4906.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=7.
% 0.12/0.36
% 0.12/0.36 This is a Horn set without equality. The strategy will
% 0.12/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.36 in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 12
% 0.19/0.39 number of clauses initially in problem: 20
% 0.19/0.39 percentage of clauses intially in UL: 60
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 92
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 13
% 0.19/0.39 distinct predicate count: 10
% 0.19/0.39 distinct function count: 1
% 0.19/0.39 distinct constant count: 2
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.19/0.50
% 0.19/0.50 -------- PROOF --------
% 0.19/0.50 % SZS status Theorem
% 0.19/0.50 % SZS output start Refutation
% 0.19/0.50
% 0.19/0.50 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.50
% 0.19/0.50 Stopped by limit on number of solutions
% 0.19/0.50
% 0.19/0.50 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.50
% 0.19/0.50 Stopped by limit on number of solutions
% 0.19/0.50
% 0.19/0.50 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.50
% 0.19/0.50 Stopped by limit on number of solutions
% 0.19/0.50
% 0.19/0.50 Stopped by limit on insertions
% 0.19/0.50
% 0.19/0.50 Model 6 [ 1 1 116 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.50
% 0.19/0.50 ----> UNIT CONFLICT at 0.12 sec ----> 28 [binary,27.1,12.1] {-} $F.
% 0.19/0.50
% 0.19/0.50 Length of proof is 3. Level of proof is 2.
% 0.19/0.50
% 0.19/0.50 ---------------- PROOF ----------------
% 0.19/0.50 % SZS status Theorem
% 0.19/0.50 % SZS output start Refutation
% 0.19/0.50
% 0.19/0.50 9 [] {+} -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 0.19/0.50 10 [] {+} -ordinal(A)|connected(inclusion_relation(A)).
% 0.19/0.50 11 [] {+} -ordinal(A)|well_founded_relation(inclusion_relation(A)).
% 0.19/0.50 12 [] {+} -well_ordering(inclusion_relation($c2)).
% 0.19/0.50 13 [] {+} relation(inclusion_relation(A)).
% 0.19/0.50 17 [] {+} reflexive(inclusion_relation(A)).
% 0.19/0.50 18 [] {+} transitive(inclusion_relation(A)).
% 0.19/0.50 19 [] {+} antisymmetric(inclusion_relation(A)).
% 0.19/0.50 20 [] {+} ordinal($c2).
% 0.19/0.50 21 [hyper,20,11] {+} well_founded_relation(inclusion_relation($c2)).
% 0.19/0.50 22 [hyper,20,10] {+} connected(inclusion_relation($c2)).
% 0.19/0.50 27 [hyper,22,9,13,17,18,19,21] {-} well_ordering(inclusion_relation($c2)).
% 0.19/0.50 28 [binary,27.1,12.1] {-} $F.
% 0.19/0.50
% 0.19/0.50 % SZS output end Refutation
% 0.19/0.50 ------------ end of proof -------------
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Search stopped by max_proofs option.
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Search stopped by max_proofs option.
% 0.19/0.50
% 0.19/0.50 ============ end of search ============
% 0.19/0.50
% 0.19/0.50 ----------- soft-scott stats ----------
% 0.19/0.50
% 0.19/0.50 true clauses given 7 (58.3%)
% 0.19/0.50 false clauses given 5
% 0.19/0.50
% 0.19/0.50 FALSE TRUE
% 0.19/0.50 3 0 2
% 0.19/0.50 tot: 0 2 (100.0% true)
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Model 6 [ 1 1 116 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.50
% 0.19/0.50 That finishes the proof of the theorem.
% 0.19/0.50
% 0.19/0.50 Process 4906 finished Sun Jun 19 03:13:18 2022
%------------------------------------------------------------------------------