TSTP Solution File: KRS088+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS088+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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 : Sun Jul 17 03:29:44 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS088+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n027.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 : Tue Jun 7 19:51:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n027.cluster.edu,
% 0.12/0.35 Tue Jun 7 19:51:26 2022
% 0.12/0.35 The command was "./sos". The process ID is 2418.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 15 back subsumes 2.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 30 back subsumes 3.
% 0.12/0.35 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] {-} A=A.
% 0.12/0.35 33 back subsumes 29.
% 0.12/0.35
% 0.12/0.35 ======= 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: 26
% 0.19/0.39 number of clauses initially in problem: 30
% 0.19/0.39 percentage of clauses intially in UL: 86
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 86
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 15
% 0.19/0.39 distinct predicate count: 11
% 0.19/0.39 distinct function count: 3
% 0.19/0.39 distinct constant count: 1
% 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 [ 1 1 887 ] (0.00 seconds, 1346 Inserts)
% 0.19/0.50
% 0.19/0.50 Model 4 [ 1 1 1442 ] (0.00 seconds, 1899 Inserts)
% 0.19/0.50
% 0.19/0.50 Model 5 [ 1 1 1621 ] (0.00 seconds, 2142 Inserts)
% 0.19/0.50
% 0.19/0.50 Stopped by limit on insertions
% 0.19/0.50
% 0.19/0.50 Model 6 [ 1 2 50347 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.50
% 0.19/0.50 -----> EMPTY CLAUSE at 0.12 sec ----> 67 [hyper,65,48,56] {-} $F.
% 0.19/0.50
% 0.19/0.50 Length of proof is 8. Level of proof is 5.
% 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 17 [] {+} -cUnsatisfiable(A)|rf(A,$f2(A)).
% 0.19/0.50 18 [] {+} -cUnsatisfiable(A)| -rinvF($f2(A),B)|rf(B,$f1(A,B)).
% 0.19/0.50 19 [] {+} -cUnsatisfiable(A)| -rinvF($f2(A),B)| -cp1($f1(A,B)).
% 0.19/0.50 20 [] {+} -cUnsatisfiable(A)|cp1($f2(A)).
% 0.19/0.50 23 [] {+} -rf(A,B)| -rf(A,C)|B=C.
% 0.19/0.50 25 [] {+} rinvF(A,B)| -rf(B,A).
% 0.19/0.50 32 [] {-} cUnsatisfiable(i2003_11_14_17_19_49673).
% 0.19/0.50 34 [hyper,32,20] {+} cp1($f2(i2003_11_14_17_19_49673)).
% 0.19/0.50 35 [hyper,32,17] {+} rf(i2003_11_14_17_19_49673,$f2(i2003_11_14_17_19_49673)).
% 0.19/0.50 40 [hyper,35,25] {+} rinvF($f2(i2003_11_14_17_19_49673),i2003_11_14_17_19_49673).
% 0.19/0.50 44 [hyper,40,18,32] {+} rf(i2003_11_14_17_19_49673,$f1(i2003_11_14_17_19_49673,i2003_11_14_17_19_49673)).
% 0.19/0.50 48 [hyper,44,25] {+} rinvF($f1(i2003_11_14_17_19_49673,i2003_11_14_17_19_49673),i2003_11_14_17_19_49673).
% 0.19/0.50 50,49 [hyper,44,23,35] {+} $f2(i2003_11_14_17_19_49673)=$f1(i2003_11_14_17_19_49673,i2003_11_14_17_19_49673).
% 0.19/0.50 56 [back_demod,34,demod,50] {+} cp1($f1(i2003_11_14_17_19_49673,i2003_11_14_17_19_49673)).
% 0.19/0.50 65 [para_from,49.1.1,19.2.1,unit_del,32] {-} -rinvF($f1(i2003_11_14_17_19_49673,i2003_11_14_17_19_49673),A)| -cp1($f1(i2003_11_14_17_19_49673,A)).
% 0.19/0.50 67 [hyper,65,48,56] {-} $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 (50.0%)
% 0.19/0.50 false clauses given 7
% 0.19/0.50
% 0.19/0.50 FALSE TRUE
% 0.19/0.50 9 0 2
% 0.19/0.50 10 0 10
% 0.19/0.50 11 0 8
% 0.19/0.50 12 0 1
% 0.19/0.50 20 0 1
% 0.19/0.50 tot: 0 22 (100.0% true)
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Model 6 [ 1 2 50347 ] (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 2418 finished Tue Jun 7 19:51:26 2022
%------------------------------------------------------------------------------