TSTP Solution File: ITP019+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ITP019+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 00:35:42 EDT 2022
% Result : Theorem 1.64s 1.88s
% Output : Refutation 1.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : ITP019+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.00/0.10 % Command : sos-script %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Fri Jun 3 11:17:46 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.09/0.31 ----- Otter 3.2, August 2001 -----
% 0.09/0.31 The process was started by sandbox2 on n032.cluster.edu,
% 0.09/0.31 Fri Jun 3 11:17:46 2022
% 0.09/0.31 The command was "./sos". The process ID is 6663.
% 0.09/0.31
% 0.09/0.31 set(prolog_style_variables).
% 0.09/0.31 set(auto).
% 0.09/0.31 dependent: set(auto1).
% 0.09/0.31 dependent: set(process_input).
% 0.09/0.31 dependent: clear(print_kept).
% 0.09/0.31 dependent: clear(print_new_demod).
% 0.09/0.31 dependent: clear(print_back_demod).
% 0.09/0.31 dependent: clear(print_back_sub).
% 0.09/0.31 dependent: set(control_memory).
% 0.09/0.31 dependent: assign(max_mem, 12000).
% 0.09/0.31 dependent: assign(pick_given_ratio, 4).
% 0.09/0.31 dependent: assign(stats_level, 1).
% 0.09/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.09/0.31 dependent: assign(sos_limit, 5000).
% 0.09/0.31 dependent: assign(max_weight, 60).
% 0.09/0.31 clear(print_given).
% 0.09/0.31
% 0.09/0.31 formula_list(usable).
% 0.09/0.31
% 0.09/0.31 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.09/0.31
% 0.09/0.31 This ia a non-Horn set with equality. The strategy will be
% 0.09/0.31 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.09/0.31 unit deletion, with positive clauses in sos and nonpositive
% 0.09/0.31 clauses in usable.
% 0.09/0.31
% 0.09/0.31 dependent: set(knuth_bendix).
% 0.09/0.31 dependent: set(para_from).
% 0.09/0.31 dependent: set(para_into).
% 0.09/0.31 dependent: clear(para_from_right).
% 0.09/0.31 dependent: clear(para_into_right).
% 0.09/0.31 dependent: set(para_from_vars).
% 0.09/0.31 dependent: set(eq_units_both_ways).
% 0.09/0.31 dependent: set(dynamic_demod_all).
% 0.09/0.31 dependent: set(dynamic_demod).
% 0.09/0.31 dependent: set(order_eq).
% 0.09/0.31 dependent: set(back_demod).
% 0.09/0.31 dependent: set(lrpo).
% 0.09/0.31 dependent: set(hyper_res).
% 0.09/0.31 dependent: set(unit_deletion).
% 0.09/0.31 dependent: set(factor).
% 0.09/0.31
% 0.09/0.31 ------------> process usable:
% 0.09/0.31
% 0.09/0.31 ------------> process sos:
% 0.09/0.31 Following clause subsumed by 60 during input processing: 0 [copy,60,flip.1] {-} A=A.
% 0.09/0.31 60 back subsumes 41.
% 0.09/0.31 60 back subsumes 35.
% 0.09/0.31 60 back subsumes 34.
% 0.09/0.31 60 back subsumes 33.
% 0.09/0.31 60 back subsumes 32.
% 0.09/0.31
% 0.09/0.31 ======= end of input processing =======
% 0.13/0.35
% 0.13/0.35 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.35
% 0.13/0.35 Stopped by limit on number of solutions
% 0.13/0.35
% 0.13/0.35
% 0.13/0.35 -------------- Softie stats --------------
% 0.13/0.35
% 0.13/0.35 UPDATE_STOP: 300
% 0.13/0.35 SFINDER_TIME_LIMIT: 2
% 0.13/0.35 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.35 number of clauses in intial UL: 33
% 0.13/0.35 number of clauses initially in problem: 53
% 0.13/0.35 percentage of clauses intially in UL: 62
% 0.13/0.35 percentage of distinct symbols occuring in initial UL: 70
% 0.13/0.35 percent of all initial clauses that are short: 100
% 0.13/0.35 absolute distinct symbol count: 27
% 0.13/0.35 distinct predicate count: 4
% 0.13/0.35 distinct function count: 10
% 0.13/0.35 distinct constant count: 13
% 0.13/0.35
% 0.13/0.35 ---------- no more Softie stats ----------
% 0.13/0.35
% 0.13/0.35
% 0.13/0.35
% 0.13/0.35 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.35
% 0.13/0.35 Stopped by limit on number of solutions
% 0.13/0.35
% 0.13/0.35 =========== start of search ===========
% 1.64/1.88
% 1.64/1.88 -------- PROOF --------
% 1.64/1.88 % SZS status Theorem
% 1.64/1.88 % SZS output start Refutation
% 1.64/1.88
% 1.64/1.88 Model 3 (0.00 seconds, 0 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on number of solutions
% 1.64/1.88
% 1.64/1.88 Model 4 (0.00 seconds, 0 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on number of solutions
% 1.64/1.88
% 1.64/1.88 Model 5 (0.00 seconds, 0 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on number of solutions
% 1.64/1.88
% 1.64/1.88 Model 6 [ 3 11 77614 ] (0.00 seconds, 112080 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on insertions
% 1.64/1.88
% 1.64/1.88 Stopped by limit on insertions
% 1.64/1.88
% 1.64/1.88 Model 7 [ 2 1 1095 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on insertions
% 1.64/1.88
% 1.64/1.88 Model 8 [ 5 1 1051 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on insertions
% 1.64/1.88
% 1.64/1.88 Model 9 [ 2 1 2374 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on insertions
% 1.64/1.88
% 1.64/1.88 Model 10 [ 2 1 1157 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on insertions
% 1.64/1.88
% 1.64/1.88 Model 11 [ 2 1 6190 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on insertions
% 1.64/1.88
% 1.64/1.88 Model 12 [ 2 1 12150 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.88
% 1.64/1.88 Stopped by limit on insertions
% 1.64/1.88
% 1.64/1.88 Model 13 [ 2 1 2085 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.88
% 1.64/1.88 ----> UNIT CONFLICT at 1.55 sec ----> 1348 [binary,1346.1,61.1] {-} $F.
% 1.64/1.88
% 1.64/1.88 Length of proof is 5. Level of proof is 3.
% 1.64/1.88
% 1.64/1.88 ---------------- PROOF ----------------
% 1.64/1.88 % SZS status Theorem
% 1.64/1.88 % SZS output start Refutation
% 1.64/1.88
% 1.64/1.88 27 [] {-} -mem(A,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))|ap(c_2Ecomplex_2Ecomplex__inv,A)!=ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)|A=ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0).
% 1.64/1.88 29 [] {-} $c1!=ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0).
% 1.64/1.88 30 [copy,29,flip.1] {-} ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)!=$c1.
% 1.64/1.88 56 [] {+} mem($c1,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)).
% 1.64/1.88 57 [] {-} ap(c_2Ecomplex_2Ecomplex__inv,$c1)=ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0).
% 1.64/1.88 59,58 [copy,57,flip.1] {-} ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)=ap(c_2Ecomplex_2Ecomplex__inv,$c1).
% 1.64/1.88 60 [] {+} A=A.
% 1.64/1.88 61 [back_demod,30,demod,59] {+} ap(c_2Ecomplex_2Ecomplex__inv,$c1)!=$c1.
% 1.64/1.88 63 [back_demod,27,demod,59,59] {-} -mem(A,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))|ap(c_2Ecomplex_2Ecomplex__inv,A)!=ap(c_2Ecomplex_2Ecomplex__inv,$c1)|A=ap(c_2Ecomplex_2Ecomplex__inv,$c1).
% 1.64/1.88 1346 [hyper,63,56,60,flip.1] {-} ap(c_2Ecomplex_2Ecomplex__inv,$c1)=$c1.
% 1.64/1.88 1348 [binary,1346.1,61.1] {-} $F.
% 1.64/1.88
% 1.64/1.88 % SZS output end Refutation
% 1.64/1.88 ------------ end of proof -------------
% 1.64/1.88
% 1.64/1.88
% 1.64/1.88 Search stopped by max_proofs option.
% 1.64/1.88
% 1.64/1.88
% 1.64/1.88 Search stopped by max_proofs option.
% 1.64/1.88
% 1.64/1.88 ============ end of search ============
% 1.64/1.88
% 1.64/1.88 ----------- soft-scott stats ----------
% 1.64/1.88
% 1.64/1.88 true clauses given 11 (26.8%)
% 1.64/1.88 false clauses given 30
% 1.64/1.88
% 1.64/1.88 FALSE TRUE
% 1.64/1.88 4 0 26
% 1.64/1.88 5 0 4
% 1.64/1.88 6 0 103
% 1.64/1.88 7 0 8
% 1.64/1.88 8 0 84
% 1.64/1.88 9 5 18
% 1.64/1.88 10 3 16
% 1.64/1.88 11 14 30
% 1.64/1.88 12 12 23
% 1.64/1.88 13 5 17
% 1.64/1.88 14 9 42
% 1.64/1.88 15 5 40
% 1.64/1.88 16 0 21
% 1.64/1.88 17 23 67
% 1.64/1.88 18 4 14
% 1.64/1.88 19 16 80
% 1.64/1.88 20 6 25
% 1.64/1.88 21 6 32
% 1.64/1.88 22 37 41
% 1.64/1.88 23 1 13
% 1.64/1.88 24 56 34
% 1.64/1.88 25 1 2
% 1.64/1.88 26 29 23
% 1.64/1.88 27 0 11
% 1.64/1.88 28 12 13
% 1.64/1.88 29 0 19
% 1.64/1.88 30 9 11
% 1.64/1.88 31 0 3
% 1.64/1.88 32 37 19
% 1.64/1.88 34 15 6
% 1.64/1.88 35 0 12
% 1.64/1.88 36 2 5
% 1.64/1.88 38 8 9
% 1.64/1.88 40 7 0
% 1.64/1.88 41 0 2
% 1.64/1.88 42 0 4
% 1.64/1.88 44 2 6
% 1.64/1.88 46 2 0
% 1.64/1.88 48 0 2
% 1.64/1.88 52 1 0
% 1.64/1.88 57 0 2
% 1.64/1.88 tot: 327 887 (73.1% true)
% 1.64/1.88
% 1.64/1.88
% 1.64/1.88 Model 13 [ 2 1 2085 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.88
% 1.64/1.88 That finishes the proof of the theorem.
% 1.64/1.88
% 1.64/1.88 Process 6663 finished Fri Jun 3 11:17:48 2022
%------------------------------------------------------------------------------