TSTP Solution File: LDA007-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LDA007-1 : TPTP v8.1.0. Bugfixed v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 16:45:52 EDT 2022
% Result : Unsatisfiable 0.40s 0.62s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LDA007-1 : TPTP v8.1.0. Bugfixed v2.6.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n024.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 : Mon May 30 03:34:36 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 n024.cluster.edu,
% 0.12/0.35 Mon May 30 03:34:36 2022
% 0.12/0.35 The command was "./sos". The process ID is 7883.
% 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 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 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.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35 Following clause subsumed by 47 during input processing: 0 [copy,47,flip.1] {-} A=A.
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.37
% 0.18/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37
% 0.18/0.37 Stopped by limit on number of solutions
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 -------------- Softie stats --------------
% 0.18/0.37
% 0.18/0.37 UPDATE_STOP: 300
% 0.18/0.37 SFINDER_TIME_LIMIT: 2
% 0.18/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37 number of clauses in intial UL: 5
% 0.18/0.37 number of clauses initially in problem: 34
% 0.18/0.37 percentage of clauses intially in UL: 14
% 0.18/0.37 percentage of distinct symbols occuring in initial UL: 52
% 0.18/0.37 percent of all initial clauses that are short: 100
% 0.18/0.37 absolute distinct symbol count: 17
% 0.18/0.37 distinct predicate count: 2
% 0.18/0.37 distinct function count: 3
% 0.18/0.37 distinct constant count: 12
% 0.18/0.37
% 0.18/0.37 ---------- no more Softie stats ----------
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 =========== start of search ===========
% 0.40/0.62
% 0.40/0.62 -------- PROOF --------
% 0.40/0.62 % SZS status Unsatisfiable
% 0.40/0.62 % SZS output start Refutation
% 0.40/0.62
% 0.40/0.62 Model 2 (0.00 seconds, 0 Inserts)
% 0.40/0.62
% 0.40/0.62 Stopped by limit on number of solutions
% 0.40/0.62
% 0.40/0.62 Stopped by limit on insertions
% 0.40/0.62
% 0.40/0.62 ----> UNIT CONFLICT at 0.25 sec ----> 853 [binary,851.1,6.1] {-} $F.
% 0.40/0.62
% 0.40/0.62 Length of proof is 11. Level of proof is 4.
% 0.40/0.62
% 0.40/0.62 ---------------- PROOF ----------------
% 0.40/0.62 % SZS status Unsatisfiable
% 0.40/0.62 % SZS output start Refutation
% 0.40/0.62
% 0.40/0.62 5 [] {-} f(t,tsk)!=f(tt_ts,tk).
% 0.40/0.62 6 [copy,5,flip.1] {+} f(tt_ts,tk)!=f(t,tsk).
% 0.40/0.62 7 [] {-} f(A,f(B,C))=f(f(A,B),f(A,C)).
% 0.40/0.62 8 [copy,7,flip.1] {-} f(f(A,B),f(A,C))=f(A,f(B,C)).
% 0.40/0.62 17 [] {-} tt=f(t,t).
% 0.40/0.62 18 [copy,17,flip.1] {+} f(t,t)=tt.
% 0.40/0.62 23 [] {-} ts=f(t,s).
% 0.40/0.62 25,24 [copy,23,flip.1] {+} f(t,s)=ts.
% 0.40/0.62 26 [] {-} tt_ts=f(tt,ts).
% 0.40/0.62 28,27 [copy,26,flip.1] {+} f(tt,ts)=tt_ts.
% 0.40/0.62 35 [] {-} tk=f(t,k).
% 0.40/0.62 36 [copy,35,flip.1] {-} f(t,k)=tk.
% 0.40/0.62 41 [] {-} tsk=f(ts,k).
% 0.40/0.62 43,42 [copy,41,flip.1] {-} f(ts,k)=tsk.
% 0.40/0.62 54 [para_from,18.1.1,8.1.1.1] {-} f(tt,f(t,A))=f(t,f(t,A)).
% 0.40/0.62 78 [para_from,36.1.1,8.1.1.2] {-} f(f(t,A),tk)=f(t,f(A,k)).
% 0.40/0.62 646 [para_into,54.1.1.2,24.1.1,demod,28,25,flip.1] {-} f(t,ts)=tt_ts.
% 0.40/0.62 851 [para_into,78.1.1.1,646.1.1,demod,43] {-} f(tt_ts,tk)=f(t,tsk).
% 0.40/0.62 853 [binary,851.1,6.1] {-} $F.
% 0.40/0.62
% 0.40/0.62 % SZS output end Refutation
% 0.40/0.62 ------------ end of proof -------------
% 0.40/0.62
% 0.40/0.62
% 0.40/0.62 Search stopped by max_proofs option.
% 0.40/0.62
% 0.40/0.62
% 0.40/0.62 Search stopped by max_proofs option.
% 0.40/0.62
% 0.40/0.62 ============ end of search ============
% 0.40/0.62
% 0.40/0.62 ----------- soft-scott stats ----------
% 0.40/0.62
% 0.40/0.62 true clauses given 10 (20.8%)
% 0.40/0.62 false clauses given 38
% 0.40/0.62
% 0.40/0.62 FALSE TRUE
% 0.40/0.62 7 0 5
% 0.40/0.62 8 0 2
% 0.40/0.62 9 0 3
% 0.40/0.62 10 0 4
% 0.40/0.62 11 35 31
% 0.40/0.62 12 7 3
% 0.40/0.62 13 31 22
% 0.40/0.62 14 19 6
% 0.40/0.62 15 32 12
% 0.40/0.62 16 30 15
% 0.40/0.62 17 67 28
% 0.40/0.62 18 37 8
% 0.40/0.62 19 57 12
% 0.40/0.62 20 11 0
% 0.40/0.62 21 23 9
% 0.40/0.62 23 8 0
% 0.40/0.62 25 8 4
% 0.40/0.62 27 8 1
% 0.40/0.62 29 11 1
% 0.40/0.62 31 6 1
% 0.40/0.62 33 2 0
% 0.40/0.62 37 2 0
% 0.40/0.62 39 6 0
% 0.40/0.62 45 4 0
% 0.40/0.62 tot: 404 167 (29.2% true)
% 0.40/0.62
% 0.40/0.62
% 0.40/0.62 Model 2 (0.00 seconds, 0 Inserts)
% 0.40/0.62
% 0.40/0.62 That finishes the proof of the theorem.
% 0.40/0.62
% 0.40/0.62 Process 7883 finished Mon May 30 03:34:36 2022
%------------------------------------------------------------------------------